如何找到母亲顶点有向图中的O（N + M）？ [英] How to find mother vertex in a directed graph in O(n+m)?

问题描述

一个母亲顶点有向图G =（V，E）是一个顶点v的所有其他 顶点g的由V A向路径到达 举一个O（N + M）算法来检测图G是否包含一个母亲的顶点。

A mother vertex in a directed graph G = (V,E) is a vertex v such that all other vertices G can be reached by a directed path from v Give an O(n+m) algorithm to test whether graph G contains a mother vertex.

（三）从Skiena手动

(c) from Skiena manual

发现只有O（N（N + M））的方式

Found only O(n(n+m)) way

推荐答案

在谷歌上搜索我居然找到了答案的此处。如果这是家庭作业，你应该窥视之前三思而后行：）

When googling I actually found the answer here. If this is homework, you should think twice before peeking :)

这篇关于如何找到母亲顶点有向图中的O（N + M）？的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！