Discussions under algorithm

  • If you have found a bug, file an issue in the issue tracker.
  • If you post a snippet of code, use the wiki formatting!
  • If you ask a question and get an answer, think about blogging about QuickGraph, it's about giving back.

AStarShortestPathAlgorithm single distance

first post: Barguast wrote: As far as I can tell, I can only use AStarShortestPathAlgorithm to ...

how to count how many separated graph in a graph?

first post: vNext2012 wrote: if a graph is a graph contain two disconnected loop, how to detec...

Calculate center of graph

first post: jabercrombie wrote: I am using this library for so many things and loving it! Is ther...

How to convert a 2D float array to a simple graph

first post: sh_mpa wrote: I stored my graph in form of a 2D float array (i.e. float[ , ] myGr...

Loop Detection In Graph

first post: ben123 wrote: Hello all, I have downloaded the QuickGraph solutions. I have to...

latest post: fstegmaier wrote: Hi all, just for clarification: I am using the latest Nuget versio...

Biconnected components

first post: atnnta wrote: Does this library include an algorithm to find all biconnected comp...

predecessorObserver.TryGetPath not delivering valid paths

first post: relix wrote: I am using predecessorObserver.TryGetPath on the categories structu...

Get adjacent vertices in directed acyclic graph

first post: mrichman wrote: Given a vertex in a DAG, how can I get it's adjacent vertices? Does...

Brilliant library. I have two questions

first post: lb_rlb_cp wrote: 1) Is there a way to force a graph data structure to be acyclical? ...

Utility network trace using Quickgraph

first post: opengis wrote: I plan to use quickgraph for Utility network(directed graph with so...