quickgraph Wiki & Documentation Rss Feed

New Comment on "Developer Manual"

pappasa — Fri, 22 Mar 2013 09:48:01 GMT

Can you provide a better manual? This manual does not describe how to use the QuickGraph libraries. Some examples would also be nice.

New Comment on "Dijkstra Shortest Distance Example"

aphillips801 — Wed, 12 Dec 2012 06:56:38 GMT

Another typo: TryFunc<TVertex, TEdge> tryGetPaths = graph.ShortestPathDijkstra(edgeCost, root); should be: TryFunc<TVertex, TEdge> tryGetPaths = graph.ShortestPathsDijkstra(edgeCost, root); ALSO... I finally got some code to compile but when run I get a run-time error because Comparer.Compare() is being used to compare vertices. My vertices are of type PointF which does not implement IComparable. My question is why do the vertices need to be ordered? I could imagine why they would need IEquatable but why IComparable?

New Comment on "Strongly Connected Components"

KvL — Wed, 14 Nov 2012 10:54:42 GMT

The example is wrong. IDictionary<string, int> components = new Dictionary<string, int>(); //Key: vertex, Value: subgraph index, 0-based. int componentCount = graph.StronglyConnectedComponents<string, Edge<string>>(out components); if (componentCount != 1) // this graph has multiple components { Console.WriteLine("Graph is not strongly connected"); Console.WriteLine("Graph contains {0} strongly connected components", componentCount); foreach (var kv in components) { Console.WriteLine("Vertex {0} is connected to subgraph {1}", kv.Key, kv.Value); } }

New Comment on "Ranked Shortest Path"

sw_lasse — Fri, 02 Nov 2012 07:22:08 GMT

Does anybody know what the computational complexity of this implementation is? I have tried looking in the paper, but as far as I can tell, that is not stated explicitly. Thanks in advance.

New Comment on "Floyd Warshall All Path Shortest Path"

ido_ran — Tue, 04 Sep 2012 09:30:33 GMT

I think it's bad to use var on examples because it makes it hard to understand what the actual types are.

New Comment on "GraphML"

dcazzulino — Mon, 07 May 2012 10:02:16 GMT

How about Microsoft's own DGML too? ;)

New Comment on "Visualization Using Graphviz"

steven_sheu — Mon, 02 Apr 2012 08:21:23 GMT

When I use Basic graph rendering: string output = graphviz.Generate(new FileDotEngine(), "graph"); Compiler can not find FileDotEngine. Is there any way to work around? Help, please.

New Comment on "Dijkstra Shortest Distance Example"

naman — Thu, 09 Feb 2012 01:31:40 GMT

Typo: var dijkstra = new DijkstraShortestPathAlgorithm<TEdge, TEdge>... should be var dijkstra = new DijkstraShortestPathAlgorithm<TVertex, TEdge>

New Comment on "Observer Concepts"

topassi — Sat, 04 Feb 2012 18:24:23 GMT

It's easy to deduce that the VertexPredecessorRecorderObserver creates a dictionary that links vertices to their parent VERTICE, and not "edge"... Isn't it ???

New Comment on "Maximum Flow"

ARMENHOV — Sun, 20 Nov 2011 05:30:06 GMT

Maxflow of network from http://en.wikipedia.org/wiki/Edmonds%E2%80%93Karp_algorithm is 5 , but i get answer 4 from MaximumFlowEdmondsKarp

Updated Wiki: Home

pelikhan — Sat, 19 Nov 2011 15:10:14 GMT

QuickGraph 3.6: Generic Graph Data Structures and Algorithms for .NET.

QuickGraph provides generic directed/undirected graph datastructures and algorithms for .NET. QuickGraph comes with algorithms such as depth first seach, breath first search, A* search, shortest path, k-shortest path, maximum flow, minimum spanning tree, least common ancestors, etc... QuickGraph supports MSAGL, GLEE, and Graphviz to render the graphs, serialization to GraphML, etc...

QuickGraph is a portable library, i.e. supports .Net 4.0, Silverlight 4.0, Windows Phone 7, XBox 360 and Windows 8 Metro apps. QuickGraph is annotated with Code Contracts.
Other projects using QuickGraph

NuGet Instructions

PM> Install-Package QuickGraph

A simple example

This example takes a DataSet, builds the graph of table and constraints from the schema and computes the table topological sort (useful to figure order to populate a database):

DataSet ds = new MyDataSet(); // your dataset
var graph = ds.ToGraph();  // wraps the dataset into a DataSetGraph
foreach(DataTable table in graph.TopologicalSort()) // applies a topological sort to the dataset graph
    Console.WriteLine(table.TableName); // in which order should we delete the tables?

History

QuickGraph 3.6. Portable Class Library support.
QuickGraph 3.3.51106.0 available on nuget, no more support for .NET 2.0.
QuickGraph 3.3 (updated) added Code Contracts reference assemblies
QuickGraph 3.3 adds new graph data structures based on delegates
QuickGraph 3.2 (bis) supporting Silveright
QuickGraph 3.2 started using Code Contracts.
QuickGraph 3.1 brings a Fibonacci Heap and support for 2.0 is back.
QuickGraph 3.0 takes advantage of extension methods to simplify tasks.
QuickGraph 2.0 introduced support for generic graph data structures
The original QuickGraph for .net 1.0 was posted on CodeProject in 8 Dec 2003. It was time to do a refresh and make the graph generic.

The design of QuickGraph is inspired from the Boost Graph Library.

Where to go next?

Please use the discussions section to leave messages. Since there are no notifications for wiki comments, they will likely never be read

Updated Wiki: Home

pelikhan — Sat, 19 Nov 2011 15:04:41 GMT

QuickGraph 3.6: Generic Graph Data Structures and Algorithms for .NET.

QuickGraph provides generic directed/undirected graph datastructures and algorithms for .Net 4.0, Windows Phone 7, XBox 360 and Windows 8 Metro apps. QuickGraph comes with algorithms such as depth first seach, breath first search, A* search, shortest path, k-shortest path, maximum flow, minimum spanning tree, least common ancestors, etc... QuickGraph supports MSAGL, GLEE, and Graphviz to render the graphs, serialization to GraphML, etc...

QuickGraph is a portable library, i.e. supports .Net 4.0, Windows Phone 7, XBox 360 and Windows 8 Metro apps. QuickGraph is annotated with Code Contracts.
Other projects using QuickGraph

NuGet Instructions

PM> Install-Package QuickGraph

A simple example

This example takes a DataSet, builds the graph of table and constraints from the schema and computes the table topological sort (useful to figure order to populate a database):

DataSet ds = new MyDataSet(); // your dataset
var graph = ds.ToGraph();  // wraps the dataset into a DataSetGraph
foreach(DataTable table in graph.TopologicalSort()) // applies a topological sort to the dataset graph
    Console.WriteLine(table.TableName); // in which order should we delete the tables?

History

QuickGraph 3.6. Portable Class Library support.
QuickGraph 3.3.51106.0 available on nuget, no more support for .NET 2.0.
QuickGraph 3.3 (updated) added Code Contracts reference assemblies
QuickGraph 3.3 adds new graph data structures based on delegates
QuickGraph 3.2 (bis) supporting Silveright
QuickGraph 3.2 started using Code Contracts.
QuickGraph 3.1 brings a Fibonacci Heap and support for 2.0 is back.
QuickGraph 3.0 takes advantage of extension methods to simplify tasks.
QuickGraph 2.0 introduced support for generic graph data structures
The original QuickGraph for .net 1.0 was posted on CodeProject in 8 Dec 2003. It was time to do a refresh and make the graph generic.

The design of QuickGraph is inspired from the Boost Graph Library.

Where to go next?

Please use the discussions section to leave messages. Since there are no notifications for wiki comments, they will likely never be read

Updated Wiki: Home

pelikhan — Sat, 19 Nov 2011 15:04:27 GMT

QuickGraph 3.6: Generic Graph Data Structures and Algorithms for .NET.

QuickGraph is a portable library, i.e. supports .Net 4.0, Windows Phone 7, XBox 360 and Windows 8 Metro apps. QuickGraph is annotated with Code Contracts.
Other projects using QuickGraph

NuGet Instructions

*PM> Install-Package QuickGraph

A simple example

This example takes a DataSet, builds the graph of table and constraints from the schema and computes the table topological sort (useful to figure order to populate a database):

DataSet ds = new MyDataSet(); // your dataset
var graph = ds.ToGraph();  // wraps the dataset into a DataSetGraph
foreach(DataTable table in graph.TopologicalSort()) // applies a topological sort to the dataset graph
    Console.WriteLine(table.TableName); // in which order should we delete the tables?

History

QuickGraph 3.6. Portable Class Library support.
QuickGraph 3.3.51106.0 available on nuget, no more support for .NET 2.0.
QuickGraph 3.3 (updated) added Code Contracts reference assemblies
QuickGraph 3.3 adds new graph data structures based on delegates
QuickGraph 3.2 (bis) supporting Silveright
QuickGraph 3.2 started using Code Contracts.
QuickGraph 3.1 brings a Fibonacci Heap and support for 2.0 is back.
QuickGraph 3.0 takes advantage of extension methods to simplify tasks.
QuickGraph 2.0 introduced support for generic graph data structures
The original QuickGraph for .net 1.0 was posted on CodeProject in 8 Dec 2003. It was time to do a refresh and make the graph generic.

The design of QuickGraph is inspired from the Boost Graph Library.

Where to go next?

Please use the discussions section to leave messages. Since there are no notifications for wiki comments, they will likely never be read

Updated Wiki: Home

pelikhan — Sat, 19 Nov 2011 15:03:47 GMT

QuickGraph 3.6: Generic Graph Data Structures and Algorithms for .NET.

PM> Install-Package QuickGraph

QuickGraph is a portable library, i.e. supports .Net 4.0, Windows Phone 7, XBox 360 and Windows 8 Metro apps. QuickGraph is annotated with Code Contracts.
Other projects using QuickGraph

A simple example

This example takes a DataSet, builds the graph of table and constraints from the schema and computes the table topological sort (useful to figure order to populate a database):

DataSet ds = new MyDataSet(); // your dataset
var graph = ds.ToGraph();  // wraps the dataset into a DataSetGraph
foreach(DataTable table in graph.TopologicalSort()) // applies a topological sort to the dataset graph
    Console.WriteLine(table.TableName); // in which order should we delete the tables?

History

QuickGraph 3.6. Portable Class Library support.
QuickGraph 3.3.51106.0 available on nuget, no more support for .NET 2.0.
QuickGraph 3.3 (updated) added Code Contracts reference assemblies
QuickGraph 3.3 adds new graph data structures based on delegates
QuickGraph 3.2 (bis) supporting Silveright
QuickGraph 3.2 started using Code Contracts.
QuickGraph 3.1 brings a Fibonacci Heap and support for 2.0 is back.
QuickGraph 3.0 takes advantage of extension methods to simplify tasks.
QuickGraph 2.0 introduced support for generic graph data structures
The original QuickGraph for .net 1.0 was posted on CodeProject in 8 Dec 2003. It was time to do a refresh and make the graph generic.

The design of QuickGraph is inspired from the Boost Graph Library.

Where to go next?

Please use the discussions section to leave messages. Since there are no notifications for wiki comments, they will likely never be read

Updated Wiki: Home

pelikhan — Sat, 19 Nov 2011 15:03:23 GMT

QuickGraph 3.6: Generic Graph Data Structures and Algorithms for .NET.

QuickGraph is a portable library, i.e. supports .Net 4.0, Windows Phone 7, XBox 360 and Windows 8 Metro apps. QuickGraph is annotated with Code Contracts.
Other projects using QuickGraph

A simple example

This example takes a DataSet, builds the graph of table and constraints from the schema and computes the table topological sort (useful to figure order to populate a database):

DataSet ds = new MyDataSet(); // your dataset
var graph = ds.ToGraph();  // wraps the dataset into a DataSetGraph
foreach(DataTable table in graph.TopologicalSort()) // applies a topological sort to the dataset graph
    Console.WriteLine(table.TableName); // in which order should we delete the tables?

History

QuickGraph 3.6. Portable Class Library support.
QuickGraph 3.3.51106.0 available on nuget, no more support for .NET 2.0.
QuickGraph 3.3 (updated) added Code Contracts reference assemblies
QuickGraph 3.3 adds new graph data structures based on delegates
QuickGraph 3.2 (bis) supporting Silveright
QuickGraph 3.2 started using Code Contracts.
QuickGraph 3.1 brings a Fibonacci Heap and support for 2.0 is back.
QuickGraph 3.0 takes advantage of extension methods to simplify tasks.
QuickGraph 2.0 introduced support for generic graph data structures
The original QuickGraph for .net 1.0 was posted on CodeProject in 8 Dec 2003. It was time to do a refresh and make the graph generic.

The design of QuickGraph is inspired from the Boost Graph Library.

Where to go next?

Please use the discussions section to leave messages. Since there are no notifications for wiki comments, they will likely never be read

Updated Wiki: Home

pelikhan — Sat, 19 Nov 2011 13:07:03 GMT

QuickGraph 3.6: Generic Graph Data Structures and Algorithms for .NET.

QuickGraph is a portable library, i.e. supports .Net 4.0, Windows Phone 7, XBox 360 and Windows 8 Metro apps. QuickGraph is annotated with Code Contracts.
Other projects using QuickGraph

A simple example

This example takes a DataSet, builds the graph of table and constraints from the schema and computes the table topological sort (useful to figure order to populate a database):

DataSet ds = new MyDataSet(); // your dataset
var graph = ds.ToGraph();  // wraps the dataset into a DataSetGraph
foreach(DataTable table in graph.TopologicalSort()) // applies a topological sort to the dataset graph
    Console.WriteLine(table.TableName); // in which order should we delete the tables?

History

QuickGraph 3.6. Portable Class Library support.
QuickGraph 3.3.51106.0 available on nuget, no more support for .NET 2.0.
QuickGraph 3.3 (updated) added Code Contracts reference assemblies
QuickGraph 3.3 adds new graph data structures based on delegates
QuickGraph 3.2 (bis) supporting Silveright
QuickGraph 3.2 started using Code Contracts.
QuickGraph 3.1 brings a Fibonacci Heap and support for 2.0 is back.
QuickGraph 3.0 takes advantage of extension methods to simplify tasks.
QuickGraph 2.0 introduced support for generic graph data structures
The original QuickGraph for .net 1.0 was posted on CodeProject in 8 Dec 2003. It was time to do a refresh and make the graph generic.

The design of QuickGraph is inspired from the Boost Graph Library.

Where to go next?

Please use the discussions section to leave messages. Since there are no notifications for wiki comments, they will likely never be read

Updated Wiki: Home

pelikhan — Sat, 19 Nov 2011 13:06:38 GMT

QuickGraph 3.6: Generic Graph Data Structures and Algorithms for .NET.

QuickGraph provides generic directed/undirected graph datastructures and algorithms for .Net 4.0, Windows Phone 7 and Windows 8 Metro apps. QuickGraph comes with algorithms such as depth first seach, breath first search, A* search, shortest path, k-shortest path, maximum flow, minimum spanning tree, least common ancestors, etc... QuickGraph supports MSAGL, GLEE, and Graphviz to render the graphs, serialization to GraphML, etc...

QuickGraph is a portable library, i.e. supports .Net 4.0, Windows Phone 7 and Windows 8 Metro apps. QuickGraph is annotated with Code Contracts.
Other projects using QuickGraph

A simple example

This example takes a DataSet, builds the graph of table and constraints from the schema and computes the table topological sort (useful to figure order to populate a database):

DataSet ds = new MyDataSet(); // your dataset
var graph = ds.ToGraph();  // wraps the dataset into a DataSetGraph
foreach(DataTable table in graph.TopologicalSort()) // applies a topological sort to the dataset graph
    Console.WriteLine(table.TableName); // in which order should we delete the tables?

History

QuickGraph 3.6. Portable Class Library support.
QuickGraph 3.3.51106.0 available on nuget, no more support for .NET 2.0.
QuickGraph 3.3 (updated) added Code Contracts reference assemblies
QuickGraph 3.3 adds new graph data structures based on delegates
QuickGraph 3.2 (bis) supporting Silveright
QuickGraph 3.2 started using Code Contracts.
QuickGraph 3.1 brings a Fibonacci Heap and support for 2.0 is back.
QuickGraph 3.0 takes advantage of extension methods to simplify tasks.
QuickGraph 2.0 introduced support for generic graph data structures
The original QuickGraph for .net 1.0 was posted on CodeProject in 8 Dec 2003. It was time to do a refresh and make the graph generic.

The design of QuickGraph is inspired from the Boost Graph Library.

Where to go next?

Please use the discussions section to leave messages. Since there are no notifications for wiki comments, they will likely never be read

Updated Wiki: Home

pelikhan — Sat, 19 Nov 2011 13:04:06 GMT

QuickGraph 3.6: Generic Graph Data Structures and Algorithms for .NET.

QuickGraph is a portable library, i.e. supports .Net 4.0, Windows Phone 7 and Windows 8 Metro apps. QuickGraph is annotated with Code Contracts.
Other projects using QuickGraph

A simple example

This example takes a DataSet, builds the graph of table and constraints from the schema and computes the table topological sort (useful to figure order to populate a database):

DataSet ds = new MyDataSet(); // your dataset
var graph = ds.ToGraph();  // wraps the dataset into a DataSetGraph
foreach(DataTable table in graph.TopologicalSort()) // applies a topological sort to the dataset graph
    Console.WriteLine(table.TableName); // in which order should we delete the tables?

History

QuickGraph 3.3.51106.0 available on nuget, no more support for .NET 2.0.
QuickGraph 3.3 (updated) added Code Contracts reference assemblies
QuickGraph 3.3 adds new graph data structures based on delegates
QuickGraph 3.2 (bis) supporting Silveright
QuickGraph 3.2 started using Code Contracts.
QuickGraph 3.1 brings a Fibonacci Heap and support for 2.0 is back.
QuickGraph 3.0 takes advantage of extension methods to simplify tasks.
QuickGraph 2.0 introduced support for generic graph data structures
The original QuickGraph for .net 1.0 was posted on CodeProject in 8 Dec 2003. It was time to do a refresh and make the graph generic.

The design of QuickGraph is inspired from the Boost Graph Library.

Where to go next?

Please use the discussions section to leave messages. Since there are no notifications for wiki comments, they will likely never be read

Updated Wiki: Home

pelikhan — Tue, 15 Nov 2011 19:06:45 GMT

QuickGraph 3.6: Generic Graph Data Structures and Algorithms for .Net.

QuickGraph is a portable library, i.e. supports .Net 4.0, Windows Phone 7 and Windows 8 Metro apps. QuickGraph is annotated with Code Contracts.
Other projects using QuickGraph

A simple example

This example takes a DataSet, builds the graph of table and constraints from the schema and computes the table topological sort (useful to figure order to populate a database):

DataSet ds = new MyDataSet(); // your dataset
var graph = ds.ToGraph();  // wraps the dataset into a DataSetGraph
foreach(DataTable table in graph.TopologicalSort()) // applies a topological sort to the dataset graph
    Console.WriteLine(table.TableName); // in which order should we delete the tables?

History

QuickGraph 3.3.51106.0 available on nuget, no more support for .NET 2.0.
QuickGraph 3.3 (updated) added Code Contracts reference assemblies
QuickGraph 3.3 adds new graph data structures based on delegates
QuickGraph 3.2 (bis) supporting Silveright
QuickGraph 3.2 started using Code Contracts.
QuickGraph 3.1 brings a Fibonacci Heap and support for 2.0 is back.
QuickGraph 3.0 takes advantage of extension methods to simplify tasks.
QuickGraph 2.0 introduced support for generic graph data structures
The original QuickGraph for .net 1.0 was posted on CodeProject in 8 Dec 2003. It was time to do a refresh and make the graph generic.

The design of QuickGraph is inspired from the Boost Graph Library.

Where to go next?

Please use the discussions section to leave messages. Since there are no notifications for wiki comments, they will likely never be read

New Comment on "Ranked Shortest Path"

simmotech — Thu, 16 Jun 2011 12:27:44 GMT

Hoffman-Pavley is spelt incorrectly on this page.