Dijkstra’s Algorithm

One of the most important algorithms for graphs is Dijkstra’s Algorithm.  Melissa Yan has a nice presentation on it,  which I recommend reading before the paper itself, which is only a couple pages long.

Related Posts

Domain, Range, And Codomain

Kevin Sookocheff explains the concepts of domain, range, and codomain: That is, a function relates an input to an output. But, not all input values have to work, and not all output values. For example, you can imagine a function that only works for positive numbers, or a function that only returns natural numbers. To more […]

Read More

Running Cassandra On EC2

Prasad Alle and Provanshu Dey share some tips if you’re running Cassandra on Amazon’s EC2: Apache Cassandra is a commonly used, high performance NoSQL database. AWS customers that currently maintain Cassandra on-premises may want to take advantage of the scalability, reliability, security, and economic benefits of running Cassandra on Amazon EC2. Amazon EC2 and Amazon Elastic Block Store […]

Read More


January 2017
« Dec Feb »