/explore
|
You are here 
|
kevinkle.in | ||
| | | | |
benjamincongdon.me
Writing a solver for "Miracle Sudoku" puzzles in Prolog. |
|
| | | | | ||
| | | | |
www.jeremykun.com
This post comes in preparation for a post on decision trees (a specific type of tree used for classification in machine learning). While most mathematicians and programmers are familiar with trees, we have yet to discuss them on this blog. For completeness, well give a brief overview of the terminology and constructions associated with trees, and describe a few common algorithms on trees. We will assume the reader has read our first primer on graph theory, which is a light assumption. |
|
| | | | | ||
| | | | |
matbesancon.xyz
In various graph-related algorithms, a graph is modified through successive operations, merging, creating and deleting vertices. That's the case for the Blossom algorithm finding a best matching in a graph and using contractions of nodes. |
|
| | | | | ||
| | | | |
mathspp.com
The Pydon't Manifesto explains what |
|
| | | |||
