Insert new nodes inside an edge of a graph.
[Go] = NL_G_SplitEdge(G,E,N)
Graph.
Edge index.
Quantity of new nodes.
Output graph.
NL_G_SplitEdge inserts a set of N new nodes linealy distributed between the extremal nodes of the selected edge E of the graph G. The output graph is stored in .