http://students.ceid.upatras.gr/~papagel/project/kef5_8.htm http://community.topcoder.com/tc?module=Static&d1=tutorials&d2=complexity1 http://planetmath.org/encyclopedia/ComplexityClass.html http://www.cs.dartmouth.edu/~afra/courses/4/x10/notes/19.php http://ftp.cs.rutgers.edu/pub/allender/ALRch33.pdf http://www.cs.nott.ac.uk/~nxk/TEACHING/G53COM/G53COMLecture9.pdf http://www.cs.clemson.edu/~goddard/texts/cpsc840/part3.pdf http://www.cs.ucc.ie/~dgb/courses/toc/handout33.pdf http://datasearch.ruc.edu.cn/course/algorithm2010/slides/np.

pdf The Floyd-Warshall Algorithm is an efficient algorithm to find all-pairs shortes t paths on a weighted graph (with positive or negative edge weights). The algorithm allows negative edges, but no negative cycles (for then the shorte st path is undefined). The Floyd-Warshall Algorithm is an application of Dynamic Programming. This algorithm calculates the length of the shortest path between all nodes of a graph. Note that it doesn t actually find the paths, only their lengths. A single execution of the algorithm will find the lengths (summed weights) of th e shortest paths between all pairs of vertices though it does not return details of the paths themselves. The Floyd Warshall algorithm compares all possible paths through the graph between each pair of vertices.