This page cannot be shown here. You can still read it on the original site — the toolbar below keeps your place in the directory.
Introduction I am currently working through Stanford’s algorithms course as part of “learning my fundamentals”, and one difficult and interesting topic that I’ve encountered is computing strongly connected components of a directed acyclic graph. A graph is said to be strongly connected if every vertex is reachable from every other vertex. In the image below, you will notice…
Read on /2017/12/09/computing-strongly-connected-components/ ↗
Comments
Nothing yet. Say the first thing.
Sign in to join the conversation.