QuikGraph

QuikGraph copied to clipboard

Hello, it looks like in the case below the extension returns only one path. All weights are equal to 1. ``` A / \ B C \ / D ```...

eosfor

It would be cool if we could change ```cs where TGraph : BidirectionalGraph ``` constraint in `TSP.cs` to just interface ```cs where TGraph : IBidirectionalGraph ``` Because I have my...

Kemsekov

Longest path length per vertex?

5

I'd like to record the longest path length per vertex in my graph. Using the original package I could call `EdgeDepthFirstSearchAlgorithm.Visit`, to re-visit edges when I came across a longer...

Bouke

Shortest Path Early Termination and Edge Filtering

3

**Is your feature request related to a problem? Please describe.** I'm creating a Unity game as a hobby, and am looking to use this library for pathfinding. 1. For very...

BenBohannon

Would be good to have min cost flow algorithms here Here is an [example of implementation from networkx](https://github.com/networkx/networkx/blob/ead0e65bda59862e329f2e6f1da47919c6b07ca9/networkx/algorithms/flow/mincost.py) I believe it is possible to port in here

Kemsekov

Properly implement the Centrality Approximation algorithm

1

Implement the Centrality Approximation algorithm and unit test it. The library had a draft of implementation for this algorithm, here is the basis: ```csharp using System; using System.Collections.Generic; using System.Linq;...

KeRNeLith

Graph isomorphism check

2

I am looking for a graph library in C# that can perform isomorphism checks but can't find anything. I also couldn't find an implementation in QuikGraph. Did I miss something...

maruker

Using ReversedBidirectionalGraph in Search

1

Hi, I am a little confused with building and using the ReversedBidirectionalGraph. I came on to that through #46 . **What i have:** A directed graph with loops and parallel...

thempen

[BUG] Multigraph bug?

1

**Describe the bug** I am trying to reproduce this strategy from the article below. https://anilpai.medium.com/currency-arbitrage-using-bellman-ford-algorithm-8938dcea56ea Then I generated the following grap  ```csharp var tryGetPath = graph.ShortestPathsBellmanFord(e => e.Weight, "USD",...

johna1203

Add to edges with no node check

4

**Is your feature request related to a problem? Please describe.** Running some profiling on our application, it seems that adding edges to a bidirectional graph is quite expensive, and in...

andrea-cassioli-maersk