quickgraph Forum Rss Feed

New Post: Output from Dijkstra Algorithm

tysonblue — Fri, 17 May 2013 14:33:10 GMT

Hello, I don't know if this project is still being worked on or if these forums are still being monitored but I was wondering if anyone could assist me. I wanted to try out the example that sandrasmurf had originally posted so I could try to leanr about how to use QuickGraph in other ways, since I'm still fairly new to the QuickGraph library, but I'm getting compile errors.

One error I am getting is when she is instantiating a new DijkstraShortestPathAlgorithm variable called dijkstra. On the second half of the instantiation, I get the error "The best overloaded method match for 'QuickGraph.Algorithms.ShortestPath.DijkstraShortestPathAlgorithm<string,QuickGraph.Edge<string>>.DijkstraShortestPathAlgorithm(QuickGraph.IVertexListGraph<string,QuickGraph.Edge<string>>, System.Func<QuickGraph.Edge<string>,double>)' has some invalid arguments "

The other errors occur when she attemps to create the VertexDistanceRecorderObserver. I am thinking I might be able to substitute some of that code with the code that pelikhan is using. For right now I would just like to know the correct syntax for creating the DijkstraShortestPathAlgorithm.

Thanks in advance and thanks alot for creating the QuickGraph library. If I can get it to work I think it could save me alot of having to learn C++/CLI code.

New Post: GraphX for .NET library for graph layout rendering is out

panthernet — Thu, 16 May 2013 12:03:47 GMT

Hi there, finally i've managed to complete my own graph rendering library to the state it can be shown to the community. Based on the Graph# algorithms and Quickgraph core graphs it provides extensibility and performance to the whole processes of calculation and rendering.

Feel free to look at it on: https://graphx.codeplex.com/

New Post: Request for QuickGraph.Graphviz.dll

bugmenot2 — Sat, 11 May 2013 20:19:51 GMT

Fine, fixed it myself.

New Post: Request for QuickGraph.Graphviz.dll

bugmenot2 — Fri, 10 May 2013 17:12:41 GMT

Hi

Some time ago a patch was released to fix issues in GraphvizColor.cs (3.0\sources\Quickgraph.Graphviz\Dot\GraphvizColor.cs)

Could someone be so kind to provide me with the updated QuickGraph.Graphviz.dll file?

I tried building it myself, to no avail.

Thank you.

New Post: .NET 3.5 Installation

lorlik — Tue, 30 Apr 2013 20:57:52 GMT

Hi,

When I use Package Manager Console then I get the following error:

PM> Install-Package QuickGraph
Installing 'QuickGraph 3.6.61119.7'.
Successfully installed 'QuickGraph 3.6.61119.7'.
Adding 'QuickGraph 3.6.61119.7' to AuthorPlugIns.
Uninstalling 'QuickGraph 3.6.61119.7'.
Successfully uninstalled 'QuickGraph 3.6.61119.7'.
Install failed. Rolling back...
Install-Package : Could not install package 'QuickGraph 3.6.61119.7'. You are trying to install this pac
kage into a project that targets '.NETFramework,Version=v3.5', but the package does not contain any asse
mbly references or content files that are compatible with that framework. For more information, contact 
the package author.
At line:1 char:16
+ Install-Package <<<<  QuickGraph
    + CategoryInfo          : NotSpecified: (:) [Install-Package], InvalidOperationException
    + FullyQualifiedErrorId : NuGetCmdletUnhandledException,NuGet.PowerShell.Commands.InstallPackageCom 
   mand

I also tried adding it to .NET 2.0 using GUI and it didn't show the project as one I could add it to. I cannot upgrade to .NET 4 because I'm developing a plug-in for something that is built on .NET 3.5.

How can I install QuickGraph for .NET 3.5 project?

Thanks

New Post: How can I clear the Graph?

Dasha_K — Mon, 29 Apr 2013 07:06:08 GMT

Hello to all.

I have a question: How can I clear the Graph?

Why do I get this error, when i try to remove all vertices and edges, then clear Graph.

The actual text error: Index was outside the bounds of the array. System.Collections.ListDictionaryInternal.NodeKeyValueCollection

Thanks.

New Post: add edges into a graph gets slower and slower

mitbbser — Thu, 18 Apr 2013 21:03:22 GMT

I try to add around 200k edges (of SEdge<int> type) into a AdjacencyGraph<int, SEdge<int>>.

It quickly finishes the first 10% but gets slower after that. It takes me around 20 mins to add all those edges into the graph. Below is my code. My question is, am I do anything wrong? Are there any way to speed up my process. My graph actually is a immutable graph. But I simply use mutable graph here because it has a few working example.

        userGraph = new AdjacencyGraph<int, SEdge<int>>();
        userGraph.AddVertexRange(index.usermap.addr2uid.Values); // addr2uid is a dictionary contains all vertices
        for (int i = 0; i < index.weights.weights.Count; i++) //index.weight.weights is another dictionary contains all Edge<->weight mappings.
        {
            int source = index.weights.weights.ElementAt(i).Key.source;
            int target = index.weights.weights.ElementAt(i).Key.target;
            SEdge<int> v_edge = new SEdge<int>(source,target);
            userGraph.AddEdge(v_edge);
        }

Any suggestion is highly appreciated!

New Post: All paths in a directed graph

rp — Wed, 10 Apr 2013 12:34:36 GMT

If my (notoriously flaky) memory from 20 years ago doesn't deceive me, what you're asking isn't all that easy.

New Post: .NET Binary Serialization in 3.6

apokryfos — Wed, 10 Apr 2013 11:18:02 GMT

Wow! You're a lifesaver.

Much appreciated.

New Post: .NET Binary Serialization in 3.6

dtosato — Wed, 10 Apr 2013 07:37:46 GMT

Finally, I recompiled the project as a standard library. Here my solution.

d

New Post: .NET Binary Serialization in 3.6

apokryfos — Tue, 09 Apr 2013 10:58:09 GMT

Haven't had any update on this yet.

Compiling the source isn't the real issue, though I have to admit it takes some effort to get it to compile. The problem is compiling it not as a portable library project but as a standard .NET class library project, in order to use BinaryFormatters for binary serialization.

I'm using simple IO using BinaryReaders/Writers for now, but this means I'll need to implement additional ones in order to start using other more complex types for TVertex or TEdge (right now it's just int and Edge<int>).

I'm not sure if the project is alive either.

As a sidenote I think I had to
a) download the "portable library SDK" and "portable library tools for visual studio 10"
b) include the QuickGraph.Serialization project in the core of the solution because (for some reason) it was referenced but not included
doing this I was able to compile it as a portable library project (which is the same one that I could download from NuGet).

New Post: .NET Binary Serialization in 3.6

dtosato — Tue, 09 Apr 2013 08:19:57 GMT

Hi apokryfos, I am in the same situation. It is just impossible to compile the source code provided by the authors. Have you any update for this problem?
Moreover, I do not get if the project is still alive or not..
Can anyone reply?
Thanks in advance.
Diego

New Post: GLEE and QuickGraph

SQReder — Tue, 26 Mar 2013 22:40:30 GMT

bump

New Post: Centrality Metrics in QuickGraph

blachniet — Fri, 22 Mar 2013 19:19:13 GMT

It doesn't look like QuickGraph supports centrality metrics out of the box. I'd prefer to use tested and widely used algorithm implementations if possible. Are there any extensions or libraries that can calculate those metrics?

Duplicate of SO question: http://stackoverflow.com/q/15578039/389899.

New Post: Hello world example

pappasa — Wed, 20 Mar 2013 15:21:00 GMT

Does somebody have a hello world example in VB.NET for QuickGraph?

New Post: All paths in a directed graph

regulus26 — Thu, 14 Mar 2013 12:40:15 GMT

I am looking for an algorithm to find all paths from one given vertex to another given vertex in a directed non-acyclic graph. The paths must include cycles as well, but only once. For example, if you have a graph like this:

A->B
B->C
B->D
C->A

and your start node is A and end node is D, I want my paths to be:

A, B, D
A, B, C, A, B, D

but not

A, B, C, A, B, C, A, B, C, D

Naturally, the C node could be a whole other subgraph.
I have an algorithm based on depth-first search but it stops as soon as it visits a vertex twice so it does not find the path that includes a cycle.

I realize this is more of a graph theory question than a QuickGraph one but I hope someone can help.

New Post: Silverlight 5

jwter — Thu, 14 Mar 2013 02:13:57 GMT

how working on silverlight 5 sdk?

use Nuget, Install-Package QuickGraph error ...

i'm try Transplant http://graphsharp.codeplex.com/ to silverlight, this way is true?

New Post: .NET Binary Serialization in 3.6

apokryfos — Wed, 13 Mar 2013 11:50:18 GMT

I am unable to get .NET binary serialization this to work. I'm not that experienced with portable library projects as I have never used them before. The only significant difference I noticed is that the portable libraries don't support the .NET binary serialization. Try as I might I could not manage to compile the 3.6 project as a non-portable project.

I don't really want to use other forms of serialization since I work with very large graphs and serializing to GraphML (or similar) adds too much overhead.
I would prefer to use 3.6 since I am already using features which are not included in 3.3.

Can anyone suggest what I can do?

New Post: Nuget package missing QuickGraph.Glee

imantexas — Sat, 09 Mar 2013 18:55:38 GMT

same problem here.
there no reference for Quickgraph.Glee imported

New Post: reference to assembly 'System.Core

imantexas — Mon, 04 Mar 2013 14:17:43 GMT

hey guys,
I'm working on my project to solving my privious problem and i used this code :

UndirectedDijkstraShortestPathAlgorithm<string, Edge<string>> dijkstra = new UndirectedDijkstraShortestPathAlgorithm<string, Edge<string>>(graph, QuickGraph.Algorithms.AlgorithmExtensions.GetIndexer<Edge<string>, double>(edgeCost));

but i get this error with "UndirectedDijkstraShortestPathAlgorithm" highlighted :

Error   2   The type 'System.Func`2<T0,T1>' is defined in an assembly that is not referenced. You must add a reference to assembly 'System.Core, Version=2.0.5.0, Culture=neutral, PublicKeyToken=7cec85d7bea7798e, Retargetable=Yes'.  C:\Users\mega\documents\visual studio 2010\Projects\Getenic\Getenic\Graph.cs    131

i set my framework on .Net Framework 4.
can someone tell me how to fix this please?
tnx