∣V∣=∣E∣であるグラフ from マトロイド pseudoforest Pseudoforest - Wikipedia undirected graph in which every connected component has at most one cycle.