Simon Tatham • 9/9/2024

Possibly all the ways to get loop-finding in graphs wrong

Read Original

The article details the author's journey through multiple incorrect algorithms for loop detection in graphs, used in puzzle games like Net and Slant. It examines flawed approaches such as Vertex DSF, Graph Pruning, and Loop Tracing, explaining their shortcomings and the eventual search for a correct solution.

0 comments
#data structures #algorithm analysis #graph theory
Possibly all the ways to get loop-finding in graphs wrong

Comments

No comments yet

Be the first to share your thoughts!

Browser Extension

Get instant access to AllDevBlogs from your browser

Top of the Week

1
Quoting Thariq Shihipar
Simon Willison • 2 votes
2
Using Browser Apis In React Practical Guide
Jivbcoop • 2 votes
3
Top picks — 2026 January
Paweł Grzybek • 1 votes
4
In Praise of –dry-run
Henrik Warne • 1 votes
5
Deep Learning is Powerful Because It Makes Hard Things Easy - Reflections 10 Years On
Ferenc Huszár • 1 votes
6
Vibe coding your first iOS app
William Denniss • 1 votes
7
AGI, ASI, A*I – Do we have all we need to get there?
John D. Cook • 1 votes
8
Dew Drop – January 15, 2026 (#4583)
Alvin Ashcraft • 1 votes