This function performs edge bundling on the given nodes and edges.
This function uses Dijkstra's algorithm and a min heap to find the shortest path between two nodes. The path is then used to generate control points for the edge bundling.
The map of nodes
The list of edges
The deroute parameter
The flight paths
This function performs edge bundling on the given nodes and edges.
This function uses Dijkstra's algorithm and a min heap to find the shortest path between two nodes. The path is then used to generate control points for the edge bundling.