Algorithm

ALGORITHM VIDEO TUTORIAL:http://www.youtube.com/watch?v=JPyuH4qXLZ0
http://www.youtube.com/watch?v=QMV45tHCYNI


ALGORITHMShttp://docs.linux.cz/programming/algorithms/Algorithms-Morris/ds_ToC.html
http://www.ansatt.hig.no/frodeh/algmet/animate.html

Bellman-Ford Algorithm
http://www.ibiblio.org/links/devmodules/graph_networking/compat/page17.html
http://compprog.wordpress.com/2007/11/29/one-source-shortest-path-the-bellman-ford-algorithm/
http://en.wikipedia.org/wiki/Bellman-Ford_algorithm

Dijkstra's Algorithm
http://www.ibiblio.org/links/devmodules/graph_networking/compat/page14.html
http://en.wikipedia.org/wiki/Dijkstra%27s_algorithm

Matrix Chain Multiplication
http://docs.linux.cz/programming/algorithms/Algorithms-Morris/mat_chain.html
http://en.wikipedia.org/wiki/Chain_matrix_multiplication

Ford-Fulkerson Algorithm
http://en.wikipedia.org/wiki/Ford-Fulkerson_algorithm
http://www-b2.is.tokushima-u.ac.jp/~ikeda/suuri/maxflow/MaxflowApp.shtml?demo5
http://www.cs.princeton.edu/~wayne/kleinberg-tardos/07demo-maxflow.ppt

Activity Selection (Scheduling) Problem (Algorithm)
http://www.eecs.wsu.edu/~cook/aa/lectures/l9/node8.html

15 Puzzle Problem (Algorithm)
http://en.wikipedia.org/wiki/Fifteen_puzzle

Floyd-Warshall Algorithm
Stated simply, the Shortest of all paths in a graph running through all vertices from vertex 1 to K is the shortest of all paths from 1 to K-1, plus the shortest path from K-1 to K. As a result of that insight, you can see that we can approach the task of calculating the shortest path from 1 to K by calculating all paths from 1 to 2, then 2 to 3 (so we now have all paths from 1 to 3), then 3 to 4 (and we have all paths from 1 to 4), all the way up to 1 to K. We can approach this in a "dynamic" way. This dynamic approach generates a series of 2-dimensional matrices of distances of shortest paths as we learn from the calculation of moving through the graph.

http://students.ceid.upatras.gr/~papagel/project/kef5_7_2.htm
http://www.cs.man.ac.uk/~graham/cs2022/dynamic/floydwarshall/
http://en.wikipedia.org/wiki/Floyd_Warshall
http://cs.anu.edu.au/~Alistair.Rendell/Teaching/apac_comp3600/module4/all_pairs_shortest_paths.xhtml