Scilab functions
circleplace - Connect a central network around a node
conneighborhood - Provide the neighborhood of a path
delpath - Delete the shortest path between 2 nodes of a network
diffvectors - Boolean difference between 2 vectors
dijkstra - Perform the shortest path between 2 nodes
disjoint - Disctinction coefficient between 2 routes
distance - Euclidian distance between 2 network nodes
emphasizeroute - Emphasize a connection route with colors
fivedroutingtable - Perform 5 distinct routing tables for a network graph
gnetwork - Perform a graph defined by its nodes coordinates and links
graphdegdist - Perform the degree distribution of network nodes
layerplacement - Place a hierarchical network layer
modifypathweight - Link weight modification
mpath - Multiple path discovery based on a flood method
mpshow - Show multiple paths of a connection
multipit - Multiple path discovery propagation based on a flood method
multip - Multiple path discovery initialization based on a flood method
ncongestionmap - Perform the normalized congestion map of a network
ntg_circle_dist - Generate hierachical networks with backbone=wax layers=central users=central
ntg_locality - Generate networks according to the Locality method
ntg_waxman_connex_dist - Generate hierachical networks based on distributions backbone=connexwax layers=wax users=central
ntg_waxman_connex - Generate hierachical networks backbone=connexwax layers=wax users=central
ntg_waxman_dist - Generate Hierachical networks backbone=wax layers=wax users=central
ntg_waxman - Generate networks according to the Waxman method
ntg - Generate hierarchical networks
randdist - Generate a random variable in respect with a discrete distribution
random_i_j - Generate 2 distinct positive integers
random - Generate a positive integer
randwtrepl - Pick a value without replacement
routes - Provides multiple routes for a connection
route - Extraction of shortest path between nodes i and j in respect with a routing table
routingdijkstra - Perform the routing table in respect with the Dijkstra's algorithm
routing_flood_topo - Perform 5 routing tables with the flood method
routing_n_dijkstra - Perform 5 routing tables with the n-modified Dijkstra's algorithm
rtable - Delete the empty part of a routing table
rvector - Reverse a vector
ucoordinates - Random placement of network nodes
uniongraph - Union of 2 graphs
waxmanconnex - Generation of a connex topology based on the Waxman method
wcircleplace - Connect a Waxman network around a node
weightgraph - Transform a graph into a weighted one