Viewing profile — gk101

[(1, 2, 3), (2, 4, 5)] would result in a graph like this: 1 - 2 - 3 \ 4 - 5 Building the (undirected) graph would take linear time, and once it is built, you can do a simple Depth …

Yes, however big O notation isn't about which programs run faster, it's about how the runtime of a program changes in response to the input size

A few comments just in case this a critical part of your program, and if running it faster would help: 1. Using a heap with Dijkstra's algorithm would speed up your program From yo…

In fact he has a course on edx for this: https://www.edx.org/course/street-fighting-math-mitx-6-sfmx

Yup it's the same dude that ripped it off

The author gave a TED talk about this here: https://www.youtube.com/watch?v=Qy5A8dVYU3k and yes, the default mode of the mind is to wander: http://en.wikipedia.org/wiki/Default_mod…