拓扑
iyangdi
这个作者很懒,什么都没留下…
展开
-
LeetCode Graph:M210. 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 course 0 you have to first take course 1, which is expressed as a原创 2017-08-05 09:07:46 · 205 阅读 · 0 评论 -
LeetCode Graph:M310. Minimum Height Trees
For a undirected graph with tree characteristics, we can choose any node as the root. The result graph is then a rooted tree. Among all possible rooted trees, those with minimum height are called mini原创 2017-08-05 10:36:09 · 240 阅读 · 0 评论 -
LeetCode Graph:M207_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 0 you have to first take course 1, which is expressed as原创 2017-08-04 22:27:34 · 193 阅读 · 0 评论 -
LeetCode Graph:M133_Clone_Graph
Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors. OJ's undirected graph serialization: Nodes are labeled uniquely. We use # as a separator for each原创 2017-08-04 22:38:53 · 188 阅读 · 0 评论