• 一个极大无圈

    G is a maximal acyclic graph.

    youdao

  • Dryad job是个生成器可以合成任意方向的无圈

    A Dryad job is a graph generator which can synthesize any directed acyclic graph.

    youdao

  • 摘要拓扑排序重要运算线性算法得到有向无圈图的一个趋于合理的拓扑序列

    The topological sort is an important operation of directed graphs. Th is paper presents a linear algorithm to obtain a more reasonable topological sorting in...

    youdao

  • 一个去掉某些顶点得到导出子无圈图,则所去那些顶点组成的集合就是反馈

    A subset of the vertex set of a graph is a feedback vertex set of the graph if the resulting graph is acyclic after removing the vertex subset from the graph.

    youdao

  • 如果一个去掉某些顶点得到导出子无圈图,则所去那些顶点组成的集合就是反馈

    A subset of the vertex set of a graph is a feedback vertex set of the graph if the resulting graph is a forest after removing the vertex subset from the graph.

    youdao

  • 如果一个去掉某些顶点得到导出子无圈图,则所去那些顶点组成的集合就是反馈

    A subset of the vertex set of a graph is a feedback vertex set of the graph if the resulting graph is a forest after removing the vertex subset from the graph.

    youdao

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

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

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