Display an incremental graph (animation for data traffic).
[f] = NARVAL_G_ShowGraphIncr(g,f)
incremental network graph.
handle of the graph window.
NARVAL_G_ShowGraphIncr updates the visualization of the graph g in the window defined by its handle f. Topology must be the same, e.g. position of nodes and edges stay at the same place.
[path]=NARVAL_F_NARVALPath();//path to NARVAL module path=path+'/demos/';//folder path load(path+'RoutingTables_topo_100.dat','pt','rt1','rt2','rt3','rt4','rt5');//loading of the network routing tables load(path+'topo_100.graph','g');//loading of the network graph i1=1;//window index i2=2;//window index f1=NARVAL_G_ShowGraph(g,i1);//graph visualization: original graph f2=NARVAL_G_ShowGraph(g,i2);//graph visualization bo=20;//maximal node border bum=bo;//maximal metric level nf=length(g.node_x);//network size gl=length(g.head);//quantity of network links bu=int((bo+1)*rand(1,nf));//generation of a random buffer state pl=int((gl+1)*rand()); lfo=int((gl)*rand(pl,1))+1;//generation of packets along lfo links [go]=NARVAL_I_NetworkState(g,gl,lfo,bu,bo,bum);//modification of the network f2.pixmap='on'; [f2]=NARVAL_G_ShowGraphIncr(go,f2);//application of NARVAL_G_ShowGraphIncr show_pixmap(); f2.pixmap='off'; | ![]() | ![]() |
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