mnrn / graph

Graph Algorithm Library written in C++11/14

Graph Algorithm Library

Overview

There is a graph algorithm program collection written in C++.
It is written for learning, self-righteous comments are conspicuous.

Update them regularly.

Contents

Includes the following algorithms.

• Elementary Graph Algorithms
  • Breadth-first-search
  • Depth-first-search
  • Topological sort
  • Strongly connected components
• Minimun Spanning Trees
  • The algorithms of Kruskal and Prim
• Single-Source Shortest Path
  • The Bellman-Ford algorithm
  • Dijkstra's algorithm
• All-Pairs Shortest Paths
  • The Floyd-Warshall algorithm
• Maxinum Flow
  • The Ford-Fulkerson method
  • The Edmonds-Kerp algoerithm

Verify

Checked the algorithm with AOJ.
The URL of the problem confirmed in submission.cpp in Verify existing in each directory is stuck.

Reference

Following site as a reference.

• spaghetti source
• libalgo

Basically, I describe the program according to the contents of Introduction to Algorithms.