Highlight the leaves of a virtual tree (Flood).
[gl] = NARVAL_G_FloodLeaves(g,s,cm,pred,sc,sb,sd,ac,ab,ad,lc,lb,ld,ec,ew)
network graph.
sink.
congestion map.
vector composed by the predecessor of each node in order to reach the sink.
sink color.
sink border.
sink diameter.
aggregator color.
aggregator border.
aggregator diameter.
leaf color.
leaf border.
leaf diameter.
tree edge color.
tree edge width.
output graph.
NARVAL_G_FloodLeaves highlights the leaves of a virtual tree (Flood) extracted from the graph g. The congestion map cm gives information about the number of shortest paths from all the graph nodes towards the sink that cross each node. The predecessor vector pred gives the direction that each node needs to follow in order to reach the sink. The visualization highlights tree components, e.g. the sinks (color: sc, border: sb, diameter: sd), the aggregators (color: ac, border: ab, diameter: ad) and the leaves (color: lc, border: lb, diameter: ld). The edges of the tree are also displayed with the color ec and the width ew. The output graph is stored in gl.
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