Path Finding¶

import grafeo

db = grafeo.GrafeoDB()
algs = db.algorithms

# (distance, path), or None when 100 is unreachable from 1.
# Without a weight, the distance is the number of hops.
found = algs.dijkstra(1, target=100)
if found is None:
    print("No path")
else:
    distance, path = found
    print(f"Distance: {distance}")
    for node_id in path:
        print(f"  -> {node_id}")

algs = db.algorithms
found = algs.dijkstra(source=1, target=100, weight="cost")

algs = db.algorithms

# BFS from a starting node
visited = algs.bfs(start=1)

# BFS with distance layers
layers = algs.bfs_layers(start=1)
for distance, nodes in enumerate(layers):
    print(f"Distance {distance}: {len(nodes)} nodes")

algs = db.algorithms

# DFS from a starting node
visited = algs.dfs(start=1)

# DFS visiting all nodes
all_visited = algs.dfs_all()

algs = db.algorithms
distances = algs.floyd_warshall()

algs = db.algorithms
results = algs.sssp(source="Alix", weight_attr="cost")
for node_id, distance in results.items():
    print(f"Node {node_id}: distance {distance}")