Deep Dive Into Graph Traversals
Sachin Malhotra,
freecodecamp,
Dec 13, 2017
A few months ago I looked at the viualization of different search algorithms (bubble, cocktail shaker, insertion, shell, comb, etc.). This post talks about a different kind of search called 'graph traversals'. It's a way of finding the shortest path between yourself and some other entity in a network. This article is math-oriented (no nice animations, sorry) but gives us a sense of the mathematics and examples of underlying code. And it's not actually a deep dive - it's a nice surface crawl most people will follow with ease, espeecially if you just skip over the code.
Today: 3 Total: 92 [Direct link] [Share]
