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!
String theory refers to the mathematical models which seek to find a common explanation for the four main forces seen in nature. These forces are the electromagnetic force, the strong and weak nuclear force and gravity. But this isn't a post on the String theory, but the STRING class. What do these two have in common?… Continue reading Let’s talk about STRING theory…(Not really)
Day 1 has come and gone, and now at Day 2. Building off the first day of learning more about hashes, we upped the game by learning to work with hashes after obtaining data off the web. Finally, the powers of the web combing with coding. We learned how to create a web request on… Continue reading May the API Force be with you (Flatiron – Day 2)
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)