Path Finding¶

from grafeo.algorithms import shortest_path

path = shortest_path(db,
    source=node_a,
    target=node_b
)

print(f"Path length: {len(path.nodes) - 1}")
for node in path.nodes:
    print(f"  -> {node}")

path = shortest_path(db,
    source=node_a,
    target=node_b,
    weight_property='distance'
)

print(f"Total weight: {path.total_weight}")

from grafeo.algorithms import all_shortest_paths

paths = all_shortest_paths(db,
    source=node_a,
    target=node_b
)

print(f"Found {len(paths)} shortest paths")

from grafeo.algorithms import sssp

distances = sssp(db, source=node_a)

for node_id, distance in distances.items():
    print(f"Node {node_id}: distance {distance}")

from grafeo.algorithms import apsp

distances = apsp(db)

# Query distance between any two nodes
d = distances.get(node_a, node_b)

from grafeo.algorithms import k_shortest_paths

paths = k_shortest_paths(db,
    source=node_a,
    target=node_b,
    k=5
)