请输入您要查询的英文单词:

 

单词 Minimum path cover
释义

Minimum path cover

英语百科

Path cover

(重定向自Minimum path cover)

Given a directed graph G = (V, E), a path cover is a set of directed paths such that every vertex v  V belongs to at least one path. Note that a path cover may include paths of length 0 (a single vertex).

A path cover may also refer to a vertex-disjoint path cover, i.e., a set of paths such that every vertex v  V belongs to exactly one path.

随便看

 

英汉双解词典包含3607232条英汉词条,基本涵盖了全部常用单词的翻译及用法,是英语学习的有利工具。

 

Copyright © 2004-2022 Newdu.com All Rights Reserved
京ICP备09058993号 更新时间:2025/8/15 13:51:31