SP1725 IMPORT1 - The Importance
Description
Given an undirected weighted graph {_V_,_E_}. Your task to calculate the importance of each node.
The importance of a node _v_ (I(v)) can be defined as follow:
C $ _{s,t} $ is the number of different shortest paths from s to t, C $ _{s,t} $ (v) is the number of different shortest paths from s to t through v.
Input Format
Multiple test cases, the number of them is given in the very first line.
For each test case:
The first line contains two space-separated integers n(n
Output Format
For each test case:
Your Output should contains n lines, each contains one single real number, with 3 decimal places after radix point. The number in the _i_th line denotes the importance of the _i_th node.