Concept

Does the graph contain a cycle that prevents completion?

Stephen Davies, Ph.D. Version 2.2.2 Through Discrete Mathematics A Cool Brisk Walk / Chapter 1

"Allllmost. If you look very carefully, you’ll see that there is indeed a cycle: I –to– G –to– L . So if this graph were to rep- resent a recipe or project workflow, it would be impossible to complete."

Related Ideas

Does the graph contain a cycle that prevents completion? | Stephen Davies, Ph.D. Version 2.2.2 Through Discrete Mathematics A Cool Brisk Walk | Bifalgorithm | Bifalgorithm