Re: [Neo4j] Relationship Check During Traversal

Hi, My suggestion is to look at the BestFirstSelectorFactory abstract classhttp://components.neo4j.org/neo4j-graph-algo/apidocs/org/neo4j/graphalgo/util/BestFirstSelectorFactory.html. Extend that and fill in the methods. It worked wonders for me trying to traverse a weighted graph and worked

Re: [Neo4j] Relationship Check During Traversal

Hi , I'm trying to setup a Traversal in a time dependant graph with multiple weighted connections between nodes representing minutes. I want to only traverse the first relationship with a value greater than the weight of the traversal's current position. i.e if the path.weight()=100 only traverse

[Neo4j] Relationship Check During Traversal

Hi just a quick question regarding the use of the PruneEvaluator I was wondering what would be the best way to modify the TraversalDescription in the Dijkstra algorithm in order to prune a traversal when a branch has reached a second transfer relationship. I want to avoid multiple transfers in a

Re: [Neo4j] Relationship Check During Traversal

Hi Paddy, One idea is to prune the traversal by looking at whether the path so far already has a transfer relationship or not. You would then do some kind of filtering of the resulting paths, e.g. only accepting those with correct end nodes. I don't know if the computational complexity of this is