Pseudoforest
= Pseudoforest
{wiki}
A <pseudoforest> is an <undirected graph> in which every <connected component of a graph> contains at most one <cycle in a graph>. Thus each component is a <tree> or a <unicyclic component>. A finite tree component has one fewer edge than vertices; a finite unicyclic component has equally many edges and vertices.