Transform a list of nodes into the corresponding list of edges.
[p]=NARVAL_G_Nodes2Path(ns,g)
list of nodes.
network graph.
list of links.
NARVAL_G_Nodes2Path transforms a list of nodes ns of the graph g. If there is a path following each successive nodes ns, then the corresponding vector of successive links p is generated. Otherwise p is empty.