NARVAL — Network Analysis and Routing eVALuation Module
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_Dijkstra — Perform the Dijkstra's algorithm on a network topology from a source node (shortest path to all remaining nodes).
NARVAL_M_DijkstraMP — Perform the modified Dijkstra's algorithm on a network topology between two nodes in respect with given links weights.
NARVAL_M_DijkstraWeight — Perform the Dijkstra's algorithm on a network topology from a source node in respect with given links weights (shortest path to all remaining nodes).
NARVAL_M_DistanceNPoi — Perform the Euclidean distance between the current position of a node and its destination (Point of Interest).
NARVAL_R_FloodIteration — Perform the topology discovery propagation of the Flood algorithm.
NARVAL_R_FloydWarshall — Perform the 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.
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 path between two network nodes from an enhanced routing table.
NARVAL_R_PathRT — Extract the 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).