Module graph 

Graph algorithms

This module provides implementations of classic graph algorithms:

• Dijkstra’s Algorithm (shortest path)
• A* Search Algorithm (heuristic pathfinding)
• Bellman-Ford Algorithm (shortest path with negative weights)
• Floyd-Warshall Algorithm (all-pairs shortest path)

Modules

astar

A* Search Algorithm

bellman_ford

Bellman-Ford Algorithm

dijkstra

Dijkstra’s Algorithm

floyd_warshall

Floyd-Warshall Algorithm

Structs

Graph

Represents a weighted, directed graph