- Log in to post comments
More like this
One amusing thing in graph theory is graph traversal. Many of the interesting algorithms on graph
are ultimately based on the idea of iterating through the nodes of the graph in some order that is
related to the structure of the graph.
There are two fundamental orders of graph traversal, known as…
As promised, today I'm going to talk about how to compute the strongly connected components
of a directed graph. I'm going to go through one method, called Kosaraju's algorithm, which is
the easiest to understand. It's possible to do better that Kosaraju's by a factor of 2, using
an algorithm…
The CS Detective: An Algorithmic Tale of Crime, Conspiracy, and Computation by Jeremy Kubica is the tory of disgraced ex-detective and hardboiled private eye Frank Runtime.
Frank Runtime knows REGEX and is not afraid to use it.
From the publishers:
When a robbery hits police headquarters, it's up…
Continuing with asking for your help in fixing my Blogroll:
Every couple of days or so, I will post here a list of blogs that start with a particular letter, and you add in the comments if you know of something that is missing from that list.
See so far:
Numbers and Symbols
A
B
C
Today brought to…