Examples of org.neo4j.graphalgo.impl.path.ShortestPath

org.neo4j.graphalgo.impl.path.ShortestPath
Find (all or one) simple shortest path(s) between two nodes. It starts from both ends and goes one relationship at the time, alternating side between each traversal. It does so to minimize the traversal overhead if one side has a very large amount of relationships, but the other one very few. It performs well however the graph is proportioned. Relationships are traversed in the specified directions from the start node, but in the reverse direction ( {@link Direction#reverse()} ) from theend node. This doesn't affect {@link Direction#BOTH}.

     *            to have.
     * @return an algorithm which finds shortest paths between two nodes.
     */
    public static PathFinder<Path> shortestPath( RelationshipExpander expander, int maxDepth )
    {
        return new ShortestPath( maxDepth, expander );
    }

View Full Code Here

     * paths were found.
     * @return an algorithm which finds paths of a certain length between two nodes.
     */
    public static PathFinder<Path> pathsWithLength( RelationshipExpander expander, int length )
    {
        return new ShortestPath( length, expander, true );
    }

View Full Code Here

        Node a = graph.getNode( "a" );
        Node b = graph.getNode( "b" );
        Node c = graph.getNode( "c" );
        final Set<Node> allowedNodes = new HashSet<Node>( Arrays.asList( a, b, c ) );
        
        PathFinder<Path> finder = new ShortestPath( 100, Traversal.expanderForAllTypes( Direction.OUTGOING ) )
        {
            @Override
            protected Collection<Node> filterNextLevelNodes( Collection<Node> nextNodes )
            {
                for ( Node node : nextNodes )
                {
                    if ( !allowedNodes.contains( node ) )
                    {
                        fail( "Node " + node.getProperty( KEY_ID ) + " shouldn't be expanded" );
                    }
                }
                return nextNodes;
            }
        };
        finder.findAllPaths( a, c );
    }

View Full Code Here

TOP

Related Classes of org.neo4j.graphalgo.impl.path.ShortestPath

org.neo4j.graphalgo.GraphAlgoFactory

org.neo4j.graphalgo.path.TestShortestPath

org.neo4j.graphdb.GraphDatabaseService

org.neo4j.graphdb.Node

org.neo4j.graphdb.Path

org.neo4j.graphdb.Relationship

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.