QuickGraph, Graph Data Structures And Algorithms for .NET

QuickGraph, Graph Data Structures And Algorithms for .NET

Subscribe

Overview
Graph Theory Reminder
Concepts
Representations
- Mutable Graphs
- Immutable Graphs
- Delegate Graphs
- Edges
Using Quickgraph
Algorithms
- Depth First Search Example
- Dijkstra Shortest Distance Example
- Problems And Algorithms
  - Topological Sort
  - Strongly Connected Components
  - Connected Components
  - Incremental Connected Components
  - Shortest Path, Dijkstra, A-star, etc...
    - Floyd Warshall All Path Shortest Path
  - Ranked Shortest Path (also known as k-shortest path)
  - Maximum Flow
  - Minimum Spanning Tree Prim's and Kruskal's algorithms.
  - Tarjan Offline Least Common Ancestor
  - Condensation Graph
Specialized Graphs
- DataSetGraph
Serialization
Visualization

Last edited Oct 17, 2009 at 5:09 AM by pelikhan, version 5

Comments

No comments yet.

Sign in to add a comment

System Requirements