In graph theory, a **path cover** in a directed graph is a set of vertex-disjoint paths that collectively include every vertex of the graph. In other words, a path cover partitions the vertices of the graph into paths, meaning that each vertex belongs to exactly one path, and there are no overlapping vertices between different paths.
New to topics? Read the docs here!