Graph Algorithms in Go

This repository contains implementations of various graph algorithms written in Go. I’ve written them to learn about these algorithms.

Implemented

• Data structues
  • Graph and Digraph
  • Flow network
  • Set
• Spanning tree algorithms
  • Kruskal’s algorithm
  • Prim’s algorithm
• Shortest path algorithms
  • Dijkstra’s algorithm
  • Bellman–Ford algorithm
  • Floyd–Warshall algorithm
• Search algorithms
  • Breadth-first search
  • Depth-first search
• Connected components algorithms
  • Tarjan’s strongly connected components algorithm
• Network algorithms
  • Residual network

Todo

• Topological sorting