i think there is a mistake in the Euler's path algorithm. The vertex F is being repeated while the definition of path is, an alternating sequence of vertices and edges where a vertex is not repeated, except if it's a closed path where the first vertex can be used again at last. F is not occurring again at last, so it is not a path, it a trail and the solution is correct for an Euler's trial. Please correct me if i am wrong.
Maths isn't hard subject if there are teachers like you. Thank you for such a great explaination
Tomorrow is my presentation, and you made it so much easier for me to feel confident/prepare my slides/organize my thoughts. thanks man ❤❤
Sir u just explain all the steps very clearly, politely... Every thing got in my mind through one stuck, thnku 😊
Amazing sir
best explanation sir really
Amazung lecture sir!!
It was very nice 😊😊😊
You are really a very nice teacher 👍🏻👍🏻
very nicely explained
really amazing ❤❤❤❤
Thank You Very Much...
Thank you soo much sir 😊
Nice
Very helpful
You deserve lot of subscribers
Thankuu so much 😊. Nice explanation ❤
Shukria
😊😊
i think there is a mistake in the Euler's path algorithm. The vertex F is being repeated while the definition of path is, an alternating sequence of vertices and edges where a vertex is not repeated, except if it's a closed path where the first vertex can be used again at last. F is not occurring again at last, so it is not a path, it a trail and the solution is correct for an Euler's trial. Please correct me if i am wrong.
Thank you sir Love you
👍
❤❤❤❤❤❤❤❤❤❤❤❤❤❤❤
Hey man your content is good however the thumbnail of the video is not good you should have to work on it.
It was very nice 😊😊😊
It was very nice 😊😊😊