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 ExchangeGraph 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