1-7 of 7 < Previous Next >
4 votes

Wrong path from Dijkstra algorithm

Hi, I have downloaded the source file 15206 and tried to use the Dijkstra algorithm to get shortest route. I have created a simple program, it works great. However, I found a case where the algor...

id# 9384 | Planned Release: None | Last Updated: Jun 10 at 9:29 PM  by spdcGIS
1 vote

Abort doesn't work on Dijkstra algorithm

I have a Dijkstra graph which I want to stop running when a particular node is reached (under certain circumstances). To do this, I added a FinishVertex listener to the algorithm, in which I want t...

id# 9273 | Planned Release: None | Last Updated: Feb 1 at 9:54 PM  by mifwright
1 vote

KeyNotFoundException

Some of my graphs cause a KeyNotFoundEception when trying to transform it into a gleegraph. Here is the code: I start constructing an {{AdjacencyGraph}} followed by some lines to add vertices and ...

id# 6232 | Planned Release: None | Last Updated: Sep 9 2007 at 8:45 AM  by gemino
1 vote
closed

AlgoUtility.IsolatedVertices returns vertices with neighbours

LS, I wrote a small program to illustrate a problem that I encountered while working with QuickGraph (change set 7900, still present in 9398). The program searches for isolated vertices in a graph...

id# 5365 | Planned Release: None | Last Updated: Aug 25 2007 at 5:16 AM  by pelikhan
1 vote
closed

RemoveVertex Events missing

In BidirectionalGraph.RemoveVertex(Vertex v) when the vertex is removed, it also removes the in and out edges which connect to it. Unfortunately, the EdgeRemoved Event is not raised when these edge...

id# 477 | Planned Release: None | Last Updated: May 22 2007 at 4:19 AM  by pelikhan
2 votes
closed

Stackbased Deep first traversal algorithm?

Hello, Why did you use the recursive deep first traversal method instead a stack based algorithm? Can you provide such an algorithm or can i help you with this? If you inspect the stack based DFS...

id# 276 | Planned Release: None | Last Updated: May 14 2007 at 12:20 AM  by pelikhan
1 vote

Critical Path

It is a DAG. I build a database schema representation as a graph. Vertexes are tables, edges are foreign key constraints. I'm really illiterate on graph theory, hence why I'm asking if there is a...

id# 304 | Planned Release: None | Last Updated: May 13 2007 at 9:33 PM  by pacemkr

Configure View

Search
Sort by Id
Release
Title
Updated
Votes
1-7 of 7 < Previous 1 Next >
Updating...