How to find all paths between two vertices using QuickGraph

Question

How to find all paths between two vertices using QuickGraph? This is my custom graph:

public class MyGraph : BidirectionalGraph<State, Event>()
{

}

In samples only shortest path. Does anybody know how to do it?

score 3 · Accepted Answer · edited Jul 19 '19 at 09:40

3

I'm trying to solve the same thing - you might want to take a look at this thread on the QuickGraph discussion boards:

Its a bit long but I think the jist of it is that you need to use Ranked shortest path

edited Jul 19 '19 at 09:40

vgru

answered Apr 14 '10 at 15:13

Justin

1 Answers1