forked from YaccConstructor/QuickGraph
-
-
Notifications
You must be signed in to change notification settings - Fork 71
Overview
Alexandre Rabérin edited this page May 12, 2020
·
2 revisions
QuikGraph is a library containing generic graph data structures and algorithms for .NET.
- Generic: QuikGraph 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...