On 07/12/2012 01:14 PM, josubg wrote:
Hi all.
I'm trying to use the dijktstra search But I have a exception.The property that is used a int32_t and the GraphViews aren't empty. Any clue of what is my error?
This is the code:
referents_graph = GraphView(graph, vfilt= lambda v: graph.vertex_properties["type"][v]=="referent") navigable_graph = GraphView(graph, reversed=True)
referents = referents_graph.vertices() weight = navigable_graph.edge_properties["weight"]
for base_referent in referents: # Calculate the distance of all accessible referents distances, predecessors = graph_tool.search.dijkstra_search(navigable_graph,base_referent,weight)
This has been fixed now in git... As a workaround, you can also do the following: dijkstra_search(navigable_graph,base_referent,weight, infinity=1000000) Where the infinity value is a suitably large number. Cheers, Tiago -- Tiago de Paula Peixoto <tiago@skewed.de>