Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which as conceived by Edsger W. Dijkstra in 1956. The original version of the algorithm found the shortest path between two nodes, but the more common version found the shortest paths between a "source" node and all other nodes of… Continue reading Why did Dijkstra cross the road? Cuz it was the shortest path!
First day of Flatiron School and no time's wasted as we dive into code, lectures, ice breakers, and more code. It's amazing how much you learn in the span of one day with 30 other passionate coders versus staying at home and trying to teach yourself code. Granted, there was a ton of pre-work to… Continue reading Pass the HashketBall (Flatiron – Day 1)
In a couple of weeks, I will be starting the February 6, 2016 cohort of The Flatiron School, which is a 12-week coding bootcamp in New York City. So thousands of dollars later and the prospect of spending many hours learning, training, and coding with other students, the end goal becoming a software developer (with… Continue reading Journey to Code: The Flatiron School