Perform the congestion map and predecessor vectors between a sink and the remaining nodes of a graph.
[C,D,P] = NL_R_CongestionSinkFlood(G,S)
Graph.
Sink.
Congestion map.
Distance map.
Predecessor vector.
NL_R_CongestionSinkFlood performs the congestion map C and predecessor vectors P between the sink S and the remaining nodes of the graph G. The congestion map C gives the information about the number of shortest paths from all the graph nodes towards the sink that cross each node. The predecessor vector P provides the direction that each node needs to follow in order to reach the sink. The distance map D gives the distance between each node towards the sink.