NARVAL_D_RecDijkstra — Discover a topology in respect with successive routes extracted from a single source by the Dijkstra's algorithm.
NARVAL_D_RecDijkstraA — Discover a topology in respect with successive routes extracted from a single source by the Dijkstra's algorithm. Nodes with a degree greater than 1 are considered as a part of the topology.
NARVAL_D_RecDijkstraMM — Discover a topology in respect with successive routes extracted from multiple sources by the Dijkstra's algorithm. Nodes with a degree greater than 1 are considered as a part of the topology. The node degree is used in the normalization process.
NARVAL_D_RecDijkstraMS — Discover a topology in respect with successive routes extracted from multiple sources by the Dijkstra's algorithm. Nodes with a degree greater than 1 are considered as a part of the topology. The quantity of nodes is used in the normalization process.
NARVAL_D_RecDijkstraNS — Discover a topology in respect with successive routes extracted from multiple sources by the Dijkstra's algorithm. Nodes with a degree greater than 1 are considered as a part of the topology.
NARVAL_F_AleaInitFin — Generate a random integer value between 1 and a defined threshold (different from a defined value).
NARVAL_F_AleaNombre — Generate a random integer value between 1 and a defined threshold.
NARVAL_F_AleaVec — Extract randomly a component of a vector (without replacement).
NARVAL_M_NeighborhoodN — Perform the 1-hop neighborhood of a network node with extended outputs.
NARVAL_M_NodeRWP — Generate the displacement of a node towards a Point of Interest.
NARVAL_M_NodeRWPoint — Generate the displacement of a node to a Point of Interest for a VANET around a rectangle.
NARVAL_M_Random_i_j_nf — Generate two distinct random integer values between (nf+1) and (nf+n).
NARVAL_M_XYExtraction — Extract the coordinates of network nodes from a graphic window when n moving nodes are defined after nf fixed nodes.
NARVAL_M_XYExtractionB — Extract the coordinates of network nodes from a graphic window when n moving nodes are defined after nf fixed nodes for a VANET.
NARVAL_R_BFS — Perform the Breadth First Search algorithm from a source node on a topology in respect the node index metric.
NARVAL_R_BFSW — Perform the Breadth First Search algorithm from a source node on a topology in respect the node degree metric.
NARVAL_R_BFSWD — Perform the Breadth First Search algorithm from a source node on a topology in respect the node index metric (without display).
NARVAL_R_BellmanFord — Perform the Bellman-Ford algorithm from a source node on a topology.
NARVAL_R_CongestionMap — Perform the normalized congestion map of a network topology described by a routing table.
NARVAL_R_ConnNeighbor — Perform the neighborhood of the shortest path between two network nodes of a graph in respect with a routing table.
NARVAL_R_DFS — Perform the Depth First Search algorithm from a source node on a topology in respect the node index metric.
NARVAL_R_DFSW — Perform the Depth First Search algorithm from a source node on a topology in respect the node degree metric.
NARVAL_R_Dijkstra — Perform the Dijktra's algorithm from a source on a topology.
NARVAL_R_Dijkstra_i_j — Perform the shortest path between two network nodes in respect with the Dijkstra's algorithm.
NARVAL_R_FloodIteration — Perform the topology discovery propagation of the Flood algorithm.
NARVAL_R_FloydWarshall — Perform all shortest paths between all pairs of vertices of a graph in respect with the Floyd-Warshall algorithm.
NARVAL_R_FloydWarshallP — Extract the shortest path between two network nodes in respect with the Floyd-Warshall algorithm performance.
NARVAL_R_MPathDijkstra — Perform five alternative routing tables of a network from successive applications of the Dijkstra's algorithm on a changing topology.
NARVAL_R_MPathERT — Extract 5 alternative connection paths between two network nodes from given enhanced routing tables.
NARVAL_R_NodeInPaths — Perform the indexes of all shortest paths where a node is present.
NARVAL_R_PathERT — Extract the connection path between two network nodes from an enhanced routing table.
NARVAL_R_PathRT — Extract the connection path between two network nodes from a routing table.
NARVAL_R_PathWeightMod — Modify the weight of links belonging to a path inside a network graph.
NARVAL_R_PredRoute — Perform the shortest path between two network nodes in respect with the predecessor vector generated by the Bellman-Ford algorithm, the Dijkstra's algorithm, BFS, DFS or the Prim's algorithm.
NARVAL_R_Prim — Perform the Prim's algorithm from a source node on a topology.
NARVAL_R_RTPathPresence — Perform the presence vector of paths stored inside a routing table.
NARVAL_R_SearchDistance — Update the vector of candidates where to propagate the topology discovery tree from a current node in respect with the minimal distance.
NARVAL_R_SearchEnd — Update the vector of candidates where to propagate the topology discovery tree from a current node in respect with the node index (End).
NARVAL_R_SearchEndW — Update the vector of candidates where to propagate the topology discovery tree from a current node in respect with the node degree (End).
NARVAL_R_SearchStart — Update the vector of candidates where to propagate the topology discovery tree from a current node in respect with the node index (Start).
NARVAL_R_SearchStartW — Update the vector of candidates where to propagate the topology discovery tree from a current node in respect with the node index (Start).