Stupid question.. but Im probably missing something! Is it possible for the same Edge Weighted graph...
graph_tool.search.dijkstra_search(g_DirG, dist_map=temp_dist, source=g_DirG.vertex(i), weight=eprop_ang_weight) graph_tool.topology.shortest_distance(g_DirG, dist_map=temp_dist, source=g_DirG.vertex(i), weights=eprop_ang_weight) the shortest_distance run a lot faster than dijkstra... I assume sort-dist is using dijkstra with some visitor to do the job. How is that possible? T -- View this message in context: http://main-discussion-list-for-the-graph-tool-project.982480.n3.nabble.com/edge-property-for-weighted-search-with-vertex-property-for-max-dist-cutoff-tp4025139p4025147.html Sent from the Main discussion list for the graph-tool project mailing list archive at Nabble.com. _______________________________________________ graph-tool mailing list [email protected] http://lists.skewed.de/mailman/listinfo/graph-tool
