Given the graph Name an edge that is a bridge, if any
I reckon the one in the middle.....
is it the one in the middle
I am sort of guessing, it reminds me of Bridges of Konigsberg....... Connection between two networks....
well im going with you guess and see what happen :)
Fingers crossed.......:-)
cause i dont get this question that much
I think I am right, you delete it and you disconnect the graph.....
so i would sai it the Konigsberg of Connection
No, that is a famous graph theory problem which is only slightly related but the graph did remind me of it. I think it is a bridge if you take it out and the number of pieces (components) in the graph increases.
- - > Second dash would be a bridge (removing any other would not disconnect the graph)
now you lost me the question did say to name an edge that is a bridge
Well you just call it DC (or CD)
ok so i i say what u just said (Second dash would be a bridge (removing any other would not disconnect the graph). after that say it would be call the DC bridge
No no, that arrow thingy I drew in the box was just another example of what I was trying to say, you can forget about it. I am explaining to you that removing the edge CD in the graph of your question disconnects the graph into 2 pieces and that is why it is a bridge.
ok ok so if i discinnects F, E and A,B it will look like a bridge
from my question
It doesn't matter what it looks like. It is whether or not the graph is disconnected by removing the edge. If you remove CD the graph is in 2 pieces. If you remove any other edge it is still in 1 piece . That is why CD is called a bridge
ok get it now
Join our real-time social learning platform and learn together with your friends!