• The strongly connected components form the subtrees of the search tree, the roots of which are the roots of the strongly connected components.

    强连通分量形成了搜索树,他们的根就是强连通分量的根。

    youdao

  • The algorithm takes a directed graph as input, and produces a partition of the graph's vertices into the graph's strongly connected components.

    算法的输入是一个有向图,产生一个图的强连通分量顶点划分。

    youdao

  • The algorithm takes a directed graph as input, and produces a partition of the graph's vertices into the graph's strongly connected components.

    算法的输入是一个有向图,产生一个图的强连通分量顶点划分。

    youdao

$firstVoiceSent
- 来自原声例句
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定
小调查
请问您想要如何调整此模块?

感谢您的反馈,我们会尽快进行适当修改!
进来说说原因吧 确定