maximum matching in bipartite graph

답변 (1개)

Abhiram
Abhiram 2025년 2월 18일

0 개 추천

Hi @kmla,
The maximum matching in a bipartite graph can be calculated using a simple depth-first search-based approach as described in the given MATLAB Answers post.
Note that the function assumes the input to be an adjacency matrix of a regular bipartite graph.

카테고리

도움말 센터File Exchange에서 Graph and Network Algorithms에 대해 자세히 알아보기

태그

질문:

2020년 1월 20일

답변:

2025년 2월 18일

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by