Examples of org.neo4j.graphalgo.impl.shortestpath.SingleSourceShortestPathBFS

Package org.neo4j.graphalgo.impl.shortestpath

Examples of org.neo4j.graphalgo.impl.shortestpath.SingleSourceShortestPathBFS

org.neo4j.graphalgo.impl.shortestpath.SingleSourceShortestPathBFS
Breadth first search to find all shortest uniform paths from a node to all others. I.e. assume the cost 1 for all relationships. This can be done by Dijkstra with the right arguments, but this should be faster. @complexity This algorithm runs in O(m) time (not including the case when mis zero). @author Patrik Larsson

    SingleSourceShortestPathTest
{
    protected SingleSourceShortestPath<Integer> getSingleSourceAlgorithm(
        Node startNode )
    {
        SingleSourceShortestPathBFS sourceBFS = new SingleSourceShortestPathBFS(
            startNode, Direction.BOTH, MyRelTypes.R1 );
        return sourceBFS;
    }

View Full Code Here

    }


    protected SingleSourceShortestPath<Integer> getSingleSourceAlgorithm(
        Node startNode, Direction direction, RelationshipType... relTypes )
    {
        return new SingleSourceShortestPathBFS( startNode, direction, relTypes );
    }

View Full Code Here

TOP

Related Classes of org.neo4j.graphalgo.impl.shortestpath.SingleSourceShortestPathBFS

org.neo4j.graphalgo.shortestpath.SingleSourceShortestPathBFSTest

org.neo4j.graphdb.Node

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.