Menu
I wonder if you could help me with a simple implementation for detecting cycles in a directed graph in C#.
I've read about the algorithms but I'd like to find something already implemented, very simple and short.
I don't care about the performance because the data size is limited.
285
To detect a cycle in a directed graph, we can either use the Depth First Search or the Breadth First Search approach. In the DFS technique, we check if there exists a back edge in the DFS tree of the graph because the existence of the back edge indicates the presence of a cycle.
So, one famous method to find cycles is using Depth-First-Search (DFS). By traversing a graph using DFS, we get something called DFS Trees. The DFS Tree is mainly a reordering of graph vertices and edges.
Acyclic graphs don't have cycles. Directed acyclic graphs (DAGs) are specific names given to acyclic graphs. We can determine if a graph has a cycle by doing DFS and see if we re-explore a vertex that's on our current exploration path.
Check out QuickGraph - it has loads of the algorithms implemented and it's quite a nice library to use.
156
If you love us? You can donate to us via Paypal or buy me a coffee so we can maintain and grow! Thank you!
Donate Us With
