October 2017 M T W T F S S « Sep 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 -
### Recent Posts

- HTC Worst Warranty or Customer Service Ever September 21, 2015
- My first day at work April 10, 2014
- “Not having enough time”, really? March 30, 2014
- Triangle March 13, 2014
- Sum Root to Leaf Numbers March 13, 2014

### Categories

- Computer Science (13)
- Algorithms (3)
- LeetCode (4)
- Operating System (1)
- Project (3)

- Life (7)
- Uncategorized (1)

- Computer Science (13)
### Archives

- September 2015 (1)
- April 2014 (1)
- March 2014 (7)
- May 2013 (1)
- March 2013 (1)
- February 2013 (1)
- December 2012 (1)
- October 2012 (8)

# Tag Archives: graph

## Bellman-Ford’s Algorithm

Dijkstra’s algorithm is fast, but limited to non-negatively weighted graph. It also does not applicable for distributed system. Bellman-Ford’s algorithm is the solution for the two problems. It is asymptotically slower than Dijkstra’s algorithm as its complexity is O(EV). However, … Continue reading

Posted in Algorithms, Computer Science
Tagged bellman, dijkstra, ford, graph, shortest
Leave a comment

## Dijkstra’s Algorithm

2014/3/5: How stupid I was for not recognizing Dijkstra as a special case of A* without heuristic cost. It makes the algorithm much easier to understand and implement. We only need to consider vertices as states and put them to … Continue reading

Posted in Algorithms, Computer Science
Tagged algorithm, c++, dijkstra, graph, programming, shortest
Leave a comment