70 weeks to finish TC problems?
2015.4.16 week1
week1~week8:Graph
1.DFS,BFS,Topological sort,Strongly-connected-components(tarjan)
2.minimum spanning tree(Kruskal,prim)
3.single source shortest path(bellman-ford,dijkstra)
4.all pair of vertices shortest path(Floyd-Warshall,Johnson)
5.Maximum flow(Ford-Fulkerson method)