constructing a bipartite graph from 0/1 matrix

55 ビュー (過去 30 日間)
R yan
R yan 2016 年 4 月 6 日
コメント済み: kalaiyarasan V 2022 年 12 月 7 日
hi,
I have a 0/1 matrix H of size m by n. I want to create a bipartite graph G such that:
G has m+n vertices. One partition of G contains m vertices (corresponding to rows). Another partition contains n vertices (corresponding to columns). There will be an edge between i(from partition 1) and j (from partition 2) if H(i,j)=1 . Please suggest some approach. thanks
  1 件のコメント
kalaiyarasan V
kalaiyarasan V 2022 年 12 月 7 日
Thank you sir

サインインしてコメントする。

採用された回答

Mike Garrity
Mike Garrity 2016 年 4 月 6 日
Perhaps something like this?
% Make a random MxN adjacency matrix
m = 3
n = 5
a = rand(m,n)>.25;
% Expand out to symmetric (M+N)x(M+N) matrix
big_a = [zeros(m,m), a;
a', zeros(n,n)];
g = graph(big_a);
% Plot
h = plot(g);
% Make it pretty
h.XData(1:m) = 1;
h.XData((m+1):end) = 2;
h.YData(1:m) = linspace(0,1,m);
h.YData((m+1):end) = linspace(0,1,n);
  3 件のコメント
Chetan Annam
Chetan Annam 2021 年 7 月 14 日
Hi,
I don't understand how this h.XData, h.YData works. Please help me.

サインインしてコメントする。

その他の回答 (0 件)

カテゴリ

Find more on Graph and Network Algorithms in Help Center and File Exchange

Community Treasure Hunt

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

Start Hunting!

Translated by