最終更新日：2022/12/23
An edge in a graph which has a perfect matching is an unmatchable edge if no perfect matching in the graph contains that edge.
編集履歴（0）
An edge in a graph which has a perfect matching is an unmatchable edge if no perfect matching in the graph contains that edge.
DiQt（ディクト）
無料
★★★★★★★★★★
