QuikGraph
QuikGraph copied to clipboard
KeRNeLith
Generic Graph Data Structures and Algorithms for .NET
I'm trying to use the `ToSvg()` method to render a graph but it seems that it uses rise4fun.com in the background to do this. After some digging, I found out...
**Describe the bug** When a vertex is added multiple times `AdjacencyGraph.Vertices` returns the first declaration whereas `AdjacencyGraph.TryGetOutEdges` returns the last one; see the next example. **To Reproduce** ``` class Person...
I was wondering if there is any plan to provide an implementation for the resource constrained shortest path. As inspiration, one might look at how boost graph is doing: https://www.boost.org/doc/libs/1_77_0/libs/graph/doc/r_c_shortest_paths.html
**Describe the bug** Serializing a graph to GraphML, discards TaggedEdge data. **To Reproduce** Steps to reproduce the behavior: 1. Make a graph (I tested with BidirectionalGraph) 2. Use TaggedEdge 3....
Considering the following graph  For this graph we would like to know all possible paths between two nodes. So for the example below the resulting paths between nodes 0...
Implement loading of graph from a graph described in [Dot language](https://www.graphviz.org/doc/info/lang.html). The library had a minimal API definition for this, here are the basis: ```csharp using System; using System.Collections.Generic; using...
As discussed in #13 all algorithm objects currently are leaking implementation details by making the dictionaries public properties. To be able to depreciate the direct access to the dictionaries in...
As described in #13 the instantiation of all shortest path algorithms include adding all vertices to the distance and vertex color dictionaries. There are two possible issues with this: 1....
Implement the Lengauer Tarjan Dominator algorithm and unit test it. The library had a not finished implementation for this algorithm, here is the basis ```csharp using System; using System.Collections.Generic; using...
Implement the Bron Kerbosh Maximum Clique algorithm and unit test it. The library had a draft of implementation for this algorithm, here is the basis: ```csharp using System.Collections.Generic; using JetBrains.Annotations;...