| 词汇 | pseudoforest |
| 释义 | BETA Examples of pseudoforestpseudoforest isn’t in the Cambridge Dictionary yet. You can help! A directed pseudoforest is a directed graph in which each vertex has at most one outgoing edge; that is, it has outdegree at most one. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. A pseudoforest is an undirected graph in which each connected component contains at most one cycle. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. Alternatively, omitting the self-loops produces a non-maximal pseudoforest. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. Almost every sufficiently sparse random graph is pseudoforest. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. Thus, a graph is a pseudoforest if and only if it does not have the butterfly or the diamond as a minor. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. A pseudotree is a connected pseudoforest. From Wikipedia This example is from Wikipedia and may be reused under a CC BY-SA license. |
反思网英语在线翻译词典收录了377474条英语词汇在线翻译词条，基本涵盖了全部常用英语词汇的中英文双语翻译及用法，是英语学习的有利工具。