e/Pseudoforest

Information
has gloss	eng: In graph theory, a pseudoforest is an undirected graph in which every connected component has at most one cycle. That is, it is a system of vertices and edges connecting pairs of vertices, such that no two cycles of consecutive edges share any vertex with each other, nor can any two cycles be connected to each other by a path of consecutive edges. A pseudotree is a connected pseudoforest.
lexicalization	eng: pseudoforest
instance of	c/Graph families

Media
media:img	Butterfly and diamond graphs.svg
media:img	Functional graph.svg
media:img	Pseudoforest.svg