• 若有向D任何两个顶点互相的,则称D为连通图。

    A strongly connected digraph D is one in which any vertex can be reached from any other vertex by a directed path.

    youdao

  • 若有向D任何两个顶点互相的,则称D为连通图。

    A strongly connected digraph D is one in which any vertex can be reached from any other vertex by a directed path.

    youdao

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

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

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