Overview

QuickGraph 3.0 is a library containing generic graph data structures and algorithms for .NET.

• Generic: QuickGraph uses .NET generics which makes it very flexible and more efficient,
• Graph data structures: adjacency list and bidirectional list to represent directed graph,
• Algorithms: efficient algorithms for solving classic graph theory problems like maximum flow, topological sort, shortest path, depth first search, etc…

Classic graph examples are:

• Transportation network:
  • vertex = crossing,
  • edge = road,
• Internet:
  • vertex = computer,
  • edge = telephone line,
• Source code files:
  • vertex = file,
  • edge = dependency

Take me to the graph theory reminder...