Table of contents

• Overview

• Graph Theory Reminder

• Concepts

  • Graph Concepts
    • Traversal Concepts
    • Mutation Concepts
  • Algorithm Concepts
  • Observer Concepts

• Representations

  • Edges
  • Mutable Graphs
    • AdjacencyGraph
    • BidirectionalGraph
    • BidirectionalMatrixGraph
    • UndirectedGraph
  • Immutable Graphs
    • ArrayAdjacencyGraph
    • ArrayBidirectionalGraph
    • CompressedSparseRowGraph
  • Delegate Graphs
    • DelegateImplicitGraph
    • DelegateIncidenceGraph
    • DelegateVertexAndEdgeListGraph
    • DelegateImplicitUndirectedGraph
    • DelegateUndirectedGraph
  • Adapters
    • BidirectionalGraphAdapter
    • UndirectedBidirectionalGraph

• Using Quikgraph

  • Creating Graphs
  • Walking Graphs
  • Mutating Graphs

• Algorithms

  • Depth First Search Example
  • Dijkstra Shortest Distance Example
  • Problems And Algorithms
    • Topological Sort
    • Strongly 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 Bipartite Matching
    • Maximum Flow
    • Minimum Spanning Tree Prim's and Kruskal's algorithms.
    • Tarjan Offline Least Common Ancestor
    • Condensation Graph

• Specialized Graphs

  • DataSetGraph

• Serialization

  • .NET Serialization
  • GraphML Serialization
  • Xml Serialization

• Visualization

  • Visualization Using GraphShape
  • Visualization Using Graphviz
  • Visualization Using MSAGL

• Integrations

  • Unity 3D

• Developer Manual