8,241 views
Presentation of a very simple algorithm to know if a directed graph contains or not a circuit (directed cycle). This question has practical applications, for example in the case where the graph represents constraints of previous tasks to be executed.