hello, some exists implementations The Floyd-Warshall algorithm in Grass Gis, for find the shortest path in all nodes and edges of network, since the command "d.path" only find one pair of the network.
thanks for any help Estudiante de ultimo semestre de ING. TOPOGRAFICA
_______________________________________________ grass-user mailing list [email protected] http://lists.osgeo.org/mailman/listinfo/grass-user
