Graph Algorithm Library

Purpose

Provides comprehensive graph algorithms for combinatorial analysis and network computations.

Capabilities

• Shortest path algorithms (Dijkstra, Bellman-Ford, Floyd-Warshall)
• Network flow algorithms
• Matching algorithms
• Graph coloring
• Planarity testing
• Graph isomorphism

Usage Guidelines