Questions tagged [quickgraph]

QuickGraph is an open source generic graph library .NET. It handles both directed and undirected graphs and has algorithms for traversing and searching the graphs.

74 questions
9
votes
2 answers

Getting connected components from a QuickGraph graph

I'm new to graph theory. I've created an adjacency graph with the QuickGraph library and ultimately, I'd like to have the connected components from the graph. open QuickGraph let tup = [(1M,1M); (2M, 18M); (3M, 3M); (4M, 5M); (5M, 24M); (24M, 6M);…
Steven
  • 3,238
  • 21
  • 50
8
votes
1 answer

Weighted Directed Graph in QuickGraph Library

Here is an example of my problem. I would like to code this in C# in such a way so that I may interrogate the structure and find information such as: Total distance from A to B. Shortest distance from A to E (keeping in mind you can't go against…
J86
  • 14,345
  • 47
  • 130
  • 228
7
votes
0 answers

QuickGraph - Ranked Shortest Path - paths missing

Bit of a long shot here as I've not found too much documentation on the HoffmanPavleyRankedShortestPathAlgorithm in QuickGraph, so I'm guessing not a lot of people use it, but I'm having a few issues returning the correct results with…
e-on
  • 1,547
  • 8
  • 32
  • 65
6
votes
3 answers

Extension method doesn't work (Quick Graph Serialization)

Error: The type arguments for method GraphMLExtensions.SerializeToGraphML(TGraph, XmlWriter) cannot be inferred from the usage. using System.Xml; using QuickGraph; using QuickGraph.Serialization; var g = new…
kptlronyttcna
  • 1,461
  • 1
  • 16
  • 22
5
votes
3 answers

QuickGraph Dijkstra example

I have an AdjacencyGraph> which I would like to run AlgorithmExtensions.ShortestPathsDijkstra on, but the QuickGraph documentation isn't the best. Does anyone have an example I can follow? Everything I found on Google used an…
Ben S
  • 68,394
  • 30
  • 171
  • 212
5
votes
3 answers

QuickGraph - is there algorithm for find all parents (up to root vertex's) of a set of vertex's

In QuickGraph - is there algorithm for find all parents (up to root vertex's) of a set of vertex's. In other words all vertex's which have somewhere under them (on the way to the leaf nodes) one or more of the vertexs input. So if the vertexs were…
Greg
  • 34,042
  • 79
  • 253
  • 454
5
votes
3 answers

Creating a undirected graph and traversing it using BFS in QuickGraph

I'm trying to figure out how to create a new instance of a undirected weighted graph using QuickGraph for C#. My goal is to create a undirected weighted graph populated with a random number of nodes and randomly generated start and finish nodes…
kingrichard2005
  • 7,179
  • 21
  • 86
  • 118
5
votes
1 answer

QuickGraph - How can I make A* to skip particular edges?

I conduct a path finding library. QuickGraph, open graph library, fits all my requirements but I have met one problem. I need the shortest path algorithms to skip edges which are impassable by the current moving agent. What I want is something like…
PanCotzky
  • 564
  • 2
  • 5
  • 12
4
votes
0 answers

QuickGraph find vertex with specific distance

In QuickGraph - is there an algorithm to find all vertices that are in a specific distance from root vertex (or any other vertex)? For example finding all vertices that their distance from root vertex is 2.
Muhamad Jafarnejad
  • 2,521
  • 4
  • 21
  • 34
4
votes
0 answers

Quickgraph / Graphsharp nodes layout from left to right

I am using quickgraph/graphsharp library and try to get such a layout in which i could have all nodes aligned left to right with no overlapping... how it would be possible. Thanks, http://quickgraph.codeplex.com http://graphsharp.codeplex.com…
Muhammad Adnan
  • 1,375
  • 6
  • 19
  • 40
4
votes
0 answers

A better way to create a custom vertex with QuickGraph?

I'm looking to make a graph that has vertices with some custom properties. For instance, have a vertex called "A" that also has x, y coordinates associated with it. I've done this by creating a class that holds its identifier a string, and two ints.…
Joe Pinsonault
  • 537
  • 7
  • 16
4
votes
1 answer

Saving a wpf layout to pdf using pdfsharp, c#

I'm new to c#, wpf and the pdfsharp library. This is my XAML Code:
AndyB
  • 391
  • 2
  • 4
  • 17
4
votes
1 answer

how can we get QuickGraph for .NET 3.5?

We would like to start using QuickGraph. Unfortunately, we are stuck on .NET 3.5 for the time being and it appears that QuickGraph is only available via NuGet and against .NET 4.0 or above. We have tried downloading the latest code, but it seems to…
Eric Liprandi
  • 5,324
  • 2
  • 49
  • 68
4
votes
0 answers

How to install & use a third party library on Mono?

I am writing c# code on mono (linux). I need to use QuickGraph library. I am not able to figure out how to download and use QuickGraph for linux.
user2464953
  • 131
  • 3
  • 12
3
votes
1 answer

How to set target vertex in QuickGraph Dijkstra or A*

I am using QuickGraph version 3.6 and I found function SetRootVertex, but no SetTagretVertex. I need this because I am searching short paths in huge graph and this would speed up program a lot. Clases in question are DijkstraShortestPathAlgorithm…
watbywbarif
  • 6,487
  • 8
  • 50
  • 64
1
2 3 4 5