60 likes | 240 Views
Shortest path. Shortest path with dijkstra algorithm A good written lecture here: http://www.cs.cornell.edu/courses/cs312/2002sp/lectures/lec20/lec20.htm
E N D
Shortest path • Shortest path with dijkstra algorithm • A good written lecture here: • http://www.cs.cornell.edu/courses/cs312/2002sp/lectures/lec20/lec20.htm • http://www.cs.cornell.edu/courses/cs312/2002sp/schedule.htm has other written lecture you might find useful (trees, string matching algorithms). • A pretty good lecture can be found here • http://www.youtube.com/watch?v=87_1K2GQFdU (50 minutes) • A more general short path algorithms can be found here as well • http://www.mcs.anl.gov/~itf/dbpp/text/node35.html
Minimum Spanning trees • A pretty good lecture (UCDavis) • http://www.youtube.com/watch?v=0pyn7aUdMdc&feature=relmfu (50 minutes) • Written lecture (only pseudo code) UC Irvine • http://www.ics.uci.edu/~eppstein/161/960206.html • No code, but very simple good explanation • http://www.people.vcu.edu/~gasmerom/MAT131/mst.html • http://www.cprogramming.com/tutorial/computersciencetheory/mst.html
Covering max flow • Since this web site has nice pictures and animation, I going show it with from here • but there is code, java, but code. • http://www-b2.is.tokushima-u.ac.jp/~ikeda/suuri/maxflow/Maxflow.shtml