Little Help in Bridge tree problem?

Revision en4, by humblefOOOol, 2021-04-09 14:39:23

After constructing bridge tree, we have bi-connected components as nodes and bridges as edges. Is there any possible way to print every bicomponent which is a node in bridge tree.

eg:

Graph0

Its bridge tree is

d3e57dcd3f3621f14afc8bb36c98614c604d73ee

Can we print all biconnected components from bridge tree itself?

Here in the above graph : Comp1 -> (1-2-3-4) Comp2--> (5-6-7) Comp3-->(5-9) Comp4---> (7-8)

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en4 English humblefOOOol 2021-04-09 14:39:23 526 Reverted to en2
en3 English humblefOOOol 2021-04-09 14:39:16 526 Reverted to en1
en2 English humblefOOOol 2021-04-09 14:37:08 526 (published)
en1 English humblefOOOol 2021-04-09 14:25:37 398 Initial revision (saved to drafts)