Finding non isolated graph bridges

4 次查看（过去 30 天）
Lukas Marcinkevicius
回答： ag 2025-2-5
Hello, I could use some help on how i could find non isolated bridges in a graph, I tried searching but with no luck
n = 6; % node count
V = 1:n; % node list
U = [1 3; 6 5; 6 1; 1 5; 3 4; 1 5; 1 2];
I was told that this code has something similar with what im supposed to do, and that with a few changes it could be done
if(first == 1) % using "if" incase of program failure
first = first-1;
meetsrequirements = CnCount;
else
if(CnCount > meetsrequirements)
BridgeCount = BridgeCount+1; % Bridge count + 1
BridgEgdes(:, kiek) = Briaunos; %Bridge edges are put into a matrix
count = count +1;
end
end
The script that i have currently finds all the graph bridges which would be 1 3, 3 4, 1 2
But i need to change it, so it would search and print non isolated graph bridges(in this case it would be only 1 3)

请先登录，再回答此问题。

回答（1 个）

ag
ag 2025-2-5
Hi @Lukas Marcinkevicius,
To find the non isolated graph bridges aka Articulation points in a graph, you can utilize the "biconncomp" MATLAB function. The below code snippet demonstrates the syntax for the same:
[edgebins,iC] = biconncomp(G)
For more details, please refer to the following MathWorks documentation: https://www.mathworks.com/help/matlab/ref/graph.biconncomp.html#:~:text=%5Bedgebins%2CiC%5D%20%3D%20biconncomp(G)
Hope this helps!

类别

在 Help Center 和 File Exchange 中查找有关 Graph and Network Algorithms 的更多信息

标签

产品


版本

R2020b

Community Treasure Hunt

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

Start Hunting!

Translated by