Conversation
The newly introduced functions now return if the graph was updated. The change from _weld_edges to _remove_useless_forks also removes dead ends. Note that they require an attribute "type" to make the funtion work.
|
Hi, thanks for all the hard work updating the project! Just from a quick glance, it seems like the new |
The old approach just deleted strictly parallel lines, i.e. two nodes where connected by more than one edge without additional edges in between. The new one removes detours even if the shorter connection consists of multiple segments, like in the following example: 
Note that |
This will help to reconstruct the original paths, e.g. for plotting.
… feature/improved_welding
2 participants
The current graph pre-processing code has the problem that it keeps detours if there are forks on the shorter path. Further, the current "welding" code is slow. This PR is to tackle both, using
networkxas a vehicle for efficient graph algorithms.