Insert new nodes inside an edge of a graph.
[go]=NARVAL_G_SplitEdge(g,e,ns)
network graph.
edge index.
quantity of new nodes.
output graph.
NARVAL_G_SplitEdge inserts a set of ns new nodes linealy distributed between the extremal nodes of a selected edge e of the graph g. The output graph is stored in go.