Perform the congestion map and predecessor vectors between a sink and the remaining nodes of a graph.
[cm,dm,pred] = NARVAL_R_SinkFlood(g,s)
graph.
sink.
congestion map.
distance map.
predecessor vector.
NARVAL_R_SinkFlood performs the congestion map cm and predecessor vectors pred between the sink s and the remaining nodes of the graph g. The congestion map cm gives the information about the number of shortest paths from all the graph nodes towards the sink that cross each node. The predecessor vector pred provides the direction that each node needs to follow in order to reach the sink. The distance map dm gives the distance between each node towards the sink.
Dr. Foued Melakessou
Research Associate
Interdisciplinary Centre for Security, Reliability and Trust
Room F106
University of Luxembourg
6, rue Coudenhove Kalergi
L-1359 Luxembourg-Kirchberg
E-mail: foued.melakessou@uni.lu
Tel: (+352) 46 66 44 5346