图论
文章平均质量分 66
jmspan
这个作者很懒,什么都没留下…
展开
-
LeetCode 207. Course Schedule(课程安排)
原题网址:https://leetcode.com/problems/course-schedule/There are a total of n courses you have to take, labeled from 0 to n - 1.Some courses may have prerequisites, for example to take course原创 2016-05-04 10:03:07 · 993 阅读 · 0 评论 -
LeetCode 210. Course Schedule II(课程安排)
原题网址:https://leetcode.com/problems/course-schedule-ii/There are a total of n courses you have to take, labeled from 0 to n - 1.Some courses may have prerequisites, for example to take cour原创 2016-05-04 17:09:45 · 799 阅读 · 0 评论 -
关于图的常用算法——Dijkstra单源最短路径、Floyd多源最短路径、Prim和Kruskal最小生成树算法
Dijkstra最短路径算法是计算某一点到其它点的最短距离的算法。Floyd算法是用来计算图中所有点之间的最短距离,可参考:http://developer.51cto.com/art/201403/433874.htm最小生成树(Minimium Spanning Tree)如果要在N个城市中铺设网络,每个城市之间的网络建设成本不同,如何找到一个建设方案,使得原创 2016-06-10 15:29:52 · 5121 阅读 · 0 评论 -
LeetCode 332. Reconstruct Itinerary(重构行程)
原题网址:https://leetcode.com/problems/reconstruct-itinerary/Given a list of airline tickets represented by pairs of departure and arrival airports [from, to], reconstruct the itinerary in order.原创 2016-04-29 08:06:51 · 1617 阅读 · 0 评论 -
图论相关问题(提纲)
一、欧拉图(七桥问题)七桥问题:给定一个图,能否从某个顶点出发,不重复地遍历所有的边,并且回到起点。欧拉图:图G是欧拉图的充要条件是,G连通且没有奇定顶点。二、一笔画问题。一个图能一笔画成的充要条件是,图G连通且奇顶点数为0或2.一笔画算法参考:http://blog.csdn.net/jmspan/article/details/51279044三、哈密尔原创 2016-06-18 01:07:44 · 1244 阅读 · 0 评论