[转贴] 暴风预测：终极无聊的 《凡人修仙传 灵界篇》 从斩仙直到完本# paladin - 谈古论金，黄梁一梦
g*y
1 楼
看了一晚上精华区，发现这道题有问题啊。
5。Given a graph (any type - Directed acyclic graph or undirected graphs
with loops), find a minimal set of vertices which affect all the edges of
the graph.
An edge is affected if the edge is either originating or terminating from
that vertex.
The time should be less Q(n^2)
这个题就是最小顶点覆盖问题吧？
或者是我对最小顶点覆盖问题理解有误？或者对这题理解有误？
5。Given a graph (any type - Directed acyclic graph or undirected graphs
with loops), find a minimal set of vertices which affect all the edges of
the graph.
An edge is affected if the edge is either originating or terminating from
that vertex.
The time should be less Q(n^2)
这个题就是最小顶点覆盖问题吧？
或者是我对最小顶点覆盖问题理解有误？或者对这题理解有误？
