A simple implementation for detecting loops in a directed graph in C #

Question

I wonder if you can help me with a simple implementation for detecting loops in a directed graph in C #.

I read about algorithms , but I would like to find something already implemented, very simple and short.

I don't need performance because the data size is limited.

Answer 1

Run DFS on G and check for support.

In each node, you are expanding, just checking to see if it is already on the stream path.

Answer 2

Check out QuickGraph - it has many implemented algorithms, and it is a pretty good library to use.