Hi Mattias,
thanks for your answer...
As I'm a newbie, there would be some examples to follow?
I only tried this modification in org.neo4j.graphalgo.impl.path.Dijkstra
class, but i'm not sure that is enough..
Can you help me?
Thanks
private Traverser traverser( Node start, final Node end, boolean
forMultiplePaths )
{
// return (lastTraverser = TRAVERSAL.expand( expander, stateFactory )
// .order( new SelectorFactory( forMultiplePaths,
costEvaluator ) )
// .evaluator( Evaluators.includeWhereEndNodeIs( end )
).traverse( start ) );
return (lastTraverser = Traversal.bidirectionalTraversal()
.mirroredSides( TRAVERSAL.expand( expander )
.order( new SelectorFactory( forMultiplePaths,
costEvaluator) ) )
.traverse( start, end ) );
}
Il giorno giovedì 8 maggio 2014 17:04:32 UTC+2, Antonio Grimaldi ha scritto:
>
> Hi,
> Is there an implementation of Bidirectional Dijkstra?
>
> Thanks
> Antonio
>
--
You received this message because you are subscribed to the Google Groups
"Neo4j" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to neo4j+unsubscr...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
