QuikGraph
QuikGraph copied to clipboard
KeRNeLith
Generic Graph Data Structures and Algorithms for .NET
YenShortestPathsAlgorithm currently requires Edges to be of type EquatableTaggedEdge. The reason for this seems to be related to how weights were provided in older versions. This change will allow any...
**Is your feature request related to a problem? Please describe.** No **Describe the solution you'd like** Possibility to enable/disable some nodes or vertex without recreating again the entire graph. So...
**Describe the bug** Documentation about edgeCapacity is leading into belief that it is equivalent to vertexCapacity while it actually results in allocation of "edgeCapacity" entries for each vertex. **To Reproduce**...
**Is your feature request related to a problem? Please describe.** When wanting to clear e.g. a `FibonacciQueue` there is as far as I can see no efficient way to do...
**Is your feature request related to a problem? Please describe.** Hello ! Is there a way to do a level decomposition algorithm ? I try to solve some ordering problem...
**Is your feature request related to a problem? Please describe.** The library almost entirely uses immediate execution. This is inconvenient for use in linq-expressions, in which case most of the...
## Problem description We have a more complex scenario to find the k shortest path just based on k. k is a fixed number like in a for loop. We...
I have been using this for my path finding in general, but I think I am encountering a lot of GC allocation inside the algorithm which I can't track due...
**Describe the solution you'd like** Find simple cycles (elementary circuits) of a graph. https://networkx.org/documentation/stable/reference/algorithms/generated/networkx.algorithms.cycles.simple_cycles.html Is it possible to support simple_cycles feature in networkx?
