Number of k-stars in an adjacency matrix
조회 수: 1 (최근 30일)
이전 댓글 표시
Hi all,
I have an nxn adjacency matrix of a graph and want to know the number of unique 2-stars, 3-stars and triangles in the graph, is there a function I can use to do this or do code my own method?
I have to code my own method any advise on how to proceed would be appreciated.
Thank you
댓글 수: 0
답변 (1개)
Gaurav Garg
2021년 1월 28일
Hi Daniel,
Even though you can find such patterns easily in 1-D arrays by converting them to strings (link1 and link2), it would be better if you can write such pattern funcitons for 2-D arrays.
for i=1:r
for j=1:c
answer = check_for_triangle(i,j);
end
end
function check_for_triangle(r, c)
is_present = false;
if A(r,c) == 1
if A(r+1,c) == 1 & A(r+1,c+1) == 1
if A(r+2,c) == 1 & A(r+2,c+1) == 1 & A(r+2,c+2) == 1
is_present = true;
end
end
end
end
The above given pseudo-code is an example of how you can write code pattern to check for a triangle in a binary adjacency matrix.
참고 항목
카테고리
Help Center 및 File Exchange에서 Graph and Network Algorithms에 대해 자세히 알아보기
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!