removeIntersectingEdges: Remove edge intersections

In huoston/shortestpath: Shortest Path Algorithm Visualization

Description

This function tries to eliminate edge intersections in a graph by removing intersected edges and re-adding new edges (that do not intersect any other edges). Newly added edges will not have any edge attributes.

Usage

removeIntersectingEdges(graph, relayout = FALSE)

Arguments

graph	The graph object.
relayout	If TRUE, the Fruchterman-Reingold layout algorithm is re-applied after removing edges. This may introduce new intersections, but generally improves the quality of the graph.

Details

This is a fuzzy algorithm, there is no guarantee that all intersections are removed. If relayout is FALSE, however, it is guaranteed that a warning will be emitted in this case.

huoston/shortestpath documentation built on May 25, 2019, 8:18 a.m.