Little Help in Bridge tree problem?
Difference between en1 and en2, changed 526 character(s)
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 as node in bridge tree. ↵
↵
eg: ↵
-↵
[Your text to link<a href="https://ibb.co/vDnD96Q"><img src="https://i.ibb.co/1bWbctd/Graph0.jpg" alt="Graph0" border="0"></a>↵
↵
↵
↵
Its bridge tree is↵
↵
<a here...](/predownloaded/ce/6c/ce6c3a3beb5c923d8a603d6b51ba7282a2eaf1ff.png)↵
↵
↵
↵
↵
Can we print all biconnected components from bridge tree itself?f="https://ibb.co/Q8YBGfL"><img src="https://i.ibb.co/SQVTpPb/d3e57dcd3f3621f14afc8bb36c98614c604d73ee.jpg" alt="d3e57dcd3f3621f14afc8bb36c98614c604d73ee" border="0"></a>↵
↵
↵
↵
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)