atrebbi
Guest
I have a very partial cartography (cyclable tracks of milan); I would need:
- identify various disconnected subgraphs
- add fictitious connections from the nodes of the enclosure to the envelope of adjacent disconnected graphs
Do you know if there are specific algorithms for this operation? (which should be quite common)
thanks in advance
(the graph in question is freely downloadable from the site http://dati.comune.milano.it ; it is clear that a solution could be to dispose of the road graph which connects that of the cycle paths, but that the municipality did not publish it )
- identify various disconnected subgraphs
- add fictitious connections from the nodes of the enclosure to the envelope of adjacent disconnected graphs
Do you know if there are specific algorithms for this operation? (which should be quite common)
thanks in advance
(the graph in question is freely downloadable from the site http://dati.comune.milano.it ; it is clear that a solution could be to dispose of the road graph which connects that of the cycle paths, but that the municipality did not publish it )