CODEWITHSUNDEEP
algorithmdata-structuresgraph
TankLi Calgary Alberta
TankLi Calgary Alberta

Reputation: 53

Is this specific case a two-edge-connected graph?

I am doing some training, there is a test case I can not pass, I think it is a false case for two-edge-connected Graphy, but the answer says it is true

  "adjacentlists": [
    [1, 2, 3, 5],
    [0, 2],
    [0, 1],
    [0, 4, 5],
    [3, 5],
    [3, 4, 0]
  ]

if I remove edges[0], the graph will be split into 2 parts 1-2 and 3-4-5. So it is not two - edge - connected

By definition: a graph is connected if for every one of its edges, the edge's removal from the graph does not cause the graph to be disconnected. If removal of any single edge disconnects the graph, then it is not a two-edge-connected.

A graph is connected if, for every pair of vertices in the graph, there is a path of one or more edges connecting the given vertices. A graph that isn't connected is said to be disconnected.

Any thought helps!

Upvotes: 2

Views: 250

Answers (1)

RaffleBuffle
RaffleBuffle

Reputation: 5455

Yes, based on your adjacency list it's 2-connected. No single edge can be removed that will cause the graph to become unconnected.

enter image description here

Upvotes: 4

Related Questions