DIY Challenge 1: Crossing every bridge once
Try to convert this city map into a connected graph.
Can you find a way to travel all the bridges exactly once?
Note: You can attach pictures in the comments when you share your response.
What students worked out20
Student 17
I tried, not able to find a way.
Student 1
I think it is impossible
Student 3
It is possible if we add 1 more bridge.
Karanteacher
Can you show a possible route?
Student 3
THIS IS A GRAPH.
Student 14
we can add a bridge, otherwise it’s too hard.
Karanteacher
Where would add a bridge, if you were allowed to add one?
Student 2
it is impossible
Student 2
without adding another bridge
Student 2
oops did this by mistake as I was trying to uplod pic
Student 2
🙂
Student 2
the graph
Karanteacher
The problem with this graph is that it contains a lot of unnecessary vertices. You can try again and post the graph in the next challenge.
Student 4
It is not possible….I treid drawing a graph and I cant connect all bridges without taking the ✏ off the paper
Karanteacher
Can you share a picture of the graph you made in the next DIY?
Student 11
It is not possible.
If we could add 1 bridge soStudent 15
sir i made a graph but its not letting me upload it
its saying that its more than 2 mbStudent 15
sir i would add a brigde in middle of 11 and 5
Student 9
Yes, it is possible if you add a bridge in between B and D.
Student 9
Yes, it is possible if you add a bridge in between B and D.
(uploading the correct picture)