depth first search

“We can only see a short distance ahead, but we can see plenty there that needs to be done."

Computing All Shortest Paths in Python

A research problem I’m working on involves Isomap, a method of dimensionality reduction that requires computing all shortest paths over relatively large graphs. In interpreted languages like Matlab this is often done through the use of the Floyd-Warshall algorithm, a simple dynamic programming approach to computing all shortest paths. In the reference Isomap code this [...]

Quote of the Day

As a former database monkey, I have a lot of sympathy for Harry: If you have not delved into the thousands of e-mail messages and files hacked from the computers of British climate scientists, let me give you the closest thing to an executive summary. It is taken from a file slugged HARRY_READ_ME, which is [...]