QuickGraph icon indicating copy to clipboard operation
QuickGraph copied to clipboard

Generic Graph Data Structures and Algorithms for .NET

Results 39 QuickGraph issues
Sort by recently updated
recently updated
newest added

Is there a way to find faces of a graph using QuickGraph for C#, similar to the Planar Face Traversal function in the Boost C++ Graph Library? https://www.boost.org/doc/libs/1_51_0/libs/graph/doc/planar_face_traversal.html

Is this is "official" descendant of the original QuickGraph project which was hosted on https://quickgraph.codeplex.com/ ? This project is described as a fork... which seems a little ambiguous. I'm not...

While looking through sources in file https://github.com/YaccConstructor/QuickGraph/blob/master/src/QuickGraph/CompressedSparseRowGraph.cs I've noticed that the method ```FromGraph``` seems likely not to work due to the fact that ```start``` variable isn't updated after initialization. I've...

CourseWork2

Here is an example with a small graph with 4 vertices (ABCD) and 5 edges which should produce 3 paths when going from A to D: ``` using NUnit.Framework; using...

CourseWork2

The `ToString` in `HoffmanPavleyRankedShortestPathAlgorithm` is implemented as ``` public override string ToString() { return String.Format("{0} at {1} {2}", this.Weight, this.DeviationEdge); } ``` This will obviously throw an exception as the...

CourseWork2

Is there any chance that in the future will be added unity compatibility?

CourseWork2

EdmondsKarpMaximumFlowAlgorithm works fine if TEdge is a reference type, e.g. Edge or TaggedEdge. If, however, TEdge is a value type (e.g. STaggedEdge or STaggedEquatableEdge) the algorithm fails: In ReversedEdgeAugmentorAlgorithm the...

CourseWork2

This may be me misunderstanding something....however.... There doesn't seem to be a way to set TransitionFactories in either of the classes that use them (CloneableVertexGraphExplorerAlgorithm and TransitionFactoryImplicitGraph). The constructors don't...

What's the syntax for using Dijkstra for k-shortest paths e.g. if I want to find the second or third-shortest paths to a vertex by distance? I thought I was onto...

The following test fails: ``` [TestMethod] public void UndirectednessTest() { UndirectedGraph graph = new UndirectedGraph(); graph.AddVertex("A"); graph.AddVertex("B"); var Edge = new TaggedUndirectedEdge("A", "B", 10); graph.AddEdge(Edge); Assert.IsTrue(graph.ContainsEdge("A", "B")); Assert.IsTrue(graph.ContainsEdge("B", "A")); }...