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
The Beautiful Web
Jens Oliver Meiert • 2 votes
2
When your coding agent doesn’t understand your project, you’ll get junk
Benjamin Cane • 1 votes
3
LLM Use in the Python Source Code
Miguel Grinberg • 1 votes
4
Wagon’s algorithm in Python
John D. Cook • 1 votes
5
An example conversation with Claude Code
Dumm Zeuch • 1 votes