2015年5月17日
最短路系列
摘要： 问题描述In graph theory, the shortest path problem is the problem of finding a path between two vertices in a graph such that the sum fo the weights of it... 阅读全文
posted @ 2015-05-17 20:31 Kinthon 阅读(293) 评论(0) 推荐(0)
最小生成树系列
摘要： 背景:What is the minimum spanning tree? Given a connected , undirected graph, a spnning tree without circle of that graph is a subgraph that is a tree a... 阅读全文
posted @ 2015-05-17 10:39 Kinthon 阅读(213) 评论(0) 推荐(0)