I have got a question, sir. For a cycle to be closed, the starting node and ending node must be the same. But since a cycle is a path and in a path, vertices can not be repeated, would the below sentence be more correct?? "Cycle is a closed path in which only starting and ending nodes are the same."
you are nice bro...................really you can explain the the whole concept thank you..................my lovely lecturer i get in my life nice!!!!!!!!!!!!!!!!!!!! please make lecture 1 .Data structure and algorithms 2. computer organization 3.computer graphics and java programming language
Could you please post about linear programming. I'm a first year university student from Sri Lanka. Your ascend is easy to understand than native english speakers. So thank you very much. I also subscribed you
Very useful. Thanks for your efforts. Can you upload the videos on below topics: - AVL and RB trees, rotations with algorithm. - B and B+ trees with algorithm, and its complexities?
Thanks for the explaination sir but for the cycle, u said that cycles has all the properties of path like no vertices nor edges are repeated but in cycle the ending vertex and the starting vertex is same na sir?(I.E vertex 1)...plz explain sir!
Thank you so much for posting these videos. You are of great help!! I am trying to figure out about multigraphs, can you explain how they work in a video as well? Also, can you prove the handshake lemma by induction?
Sir you say in path we cannot repeat edges or vertices. Then you say cycle is path whose starting and ending points are same.but in this way vertices will repeat. Why
These are seriously very helpful, better than any of the lessons in my online class.
We have the same feelings! Thanks for this lecture!
Simple and straight to the point, as all things should be. Thanks so much for making this video!
I'm watching this from Oye-Ekiti, Ekiti, Nigeria in June 2024, thank you & God bless you
😂see this boy your lecturer is coming for u
This video helped me a lot thank you! Amazing job done at explaining all of these terms and how they relate with each other.
I didn't understand anything from my class pdf, this video helped me very well. Thanks..
That makes is SO much clearer. Thank you!
thank you so much sir! you made the concept very easy to learn and remember 😊
. thank you so much, sir! you made the concept very easy to learn and remember .
Great explanation you are better than our teacher i am from saudi
Thank you sir.....
Very easy and understable....
Do upload complex algorithms with simple examples..🙏
Best explanation of those definitions please make more video on other topics of graph theory as Well as various subjects of mathematics!
Thank You! Sir @Vivekanand - Algorithm Every Day . Your explanation is crystal clear. Big help for me!
Thank you so much for your hard work and your time
Sir I watch ur lectures it's super,fantastic,mindblowing,awesome sir
I have got a question, sir.
For a cycle to be closed, the starting node and ending node must be the same.
But since a cycle is a path and in a path, vertices can not be repeated, would the below sentence be more correct??
"Cycle is a closed path in which only starting and ending nodes are the same."
Cycle is a path with exception last and first edges can be same.
Superb explanation ,it was very clear tq so much sir
Thank you so much for the videos
It's very helpful
Excellent video Sir...Sir, plz make a video regarding genus of a graph
Really it's a easy and faster way to learn the topics
best broyee
you are best and talented teacher keep it up
Nice explanation Please create a playlist topic wise that would be most helpful for us to study through your channel
you are nice bro...................really you can explain the the
whole concept thank you..................my lovely lecturer i get in
my life nice!!!!!!!!!!!!!!!!!!!!
please make lecture
1 .Data structure and algorithms
2. computer organization
3.computer graphics and java programming language
Sir your teachings are good and easy understandable. Sir guide me on my project on labelling graph and it's types
thanky you very much Sir!
Very fantastic explanation ❤️❤️❤️
Thanks
Very good explanation. You make this very easy to understand!
Thanks my confusions got clear here totally !! 🙏🙏
Bhut bhut dhnyvaad sirjii 🙏🙏
Thank u it's very useful for my exams
thank you sir! you are special for all others.
Wow this was so helpful, straight forward and easy to understand
but in cycle one one is repetead why?
Wonderful explanation
Thank you are better than my Professor
Could you please post about linear programming. I'm a first year university student from Sri Lanka. Your ascend is easy to understand than native english speakers. So thank you very much. I also subscribed you
tqsm sir U saved me
tq, explanation for basic definition of graph theory is clearly understand
Thank you sir. Very useful
Thank you so much sir
Excellent teaching
very Good Explanation God Bless You.
شكرا لقد استفدت كثيرا
you are the best sir
Nice...
Thanks for nice explanation God bless you
Thank you your explanation is very clear 🙏
Really useful!!! Tkanks
Great teach sir g
Baga chepparu sir♥️
if cycle is a path , the vertices should not repeat, but in cycle the starting vertex and ending vertex are same 🥴
But no possibilty
Cycle is not a path, cycle is a closed path. (Understand the difference)
Exactly
Just a correction:
A cycle is not a path
(But a circuit is a trail)
This is incredibly clear.
Very useful. Thanks for your efforts.
Can you upload the videos on below topics:
- AVL and RB trees, rotations with algorithm.
- B and B+ trees with algorithm, and its complexities?
Easy ya understand panna mudeuthu thanks bro
Thanks for the explaination sir but for the cycle, u said that cycles has all the properties of path like no vertices nor edges are repeated but in cycle the ending vertex and the starting vertex is same na sir?(I.E vertex 1)...plz explain sir!
Sir, since cycle is path why vertex is repeated in cycle as you mentioned??
thnx sir bht easy method sy consept clear krwaya
sir do video for graph isomorphism and incident ,adjacency matrix
Well explained. Keep up the simplicity !
Im able to understand your graph theory Sir please sendwhat is labellig, pair sum of labelling
Very good teaching sir thank you...
Thank you friend!
Thank you so much sir ! Very helpful
THANKS A LOT SIR!!
Thank you so much for posting these videos. You are of great help!! I am trying to figure out about multigraphs, can you explain how they work in a video as well? Also, can you prove the handshake lemma by induction?
Very useful sir digraph vedios koduga sir
Clear and neat explanation.sir.
In path vertex is not repeated but how can path gets closed to form cycle ?
Nice classs,its really working
Great, thanks a lot.
Super clear, thank you!
this video is saving my life. thank you sir!
Excellent lecture.thanks a lot
Sir can we call cycle to the cyclic graph??
Sir you say in path we cannot repeat edges or vertices.
Then you say cycle is path whose starting and ending points are same.but in this way vertices will repeat.
Why
Thank you so much ❤️
Excellent
You are really amazing 🤩
Sir cycle repeat a vertex while traversing how it called a path ??
in path vertices shouldn't be repeated , but in cycle starting and end point are same. then how can we say cycle is a closed path?
Thanks So Much.
Then what is the length of path in this diagram Sir?
very profesional sir
Dast xhosh❤
Please explain the application of it and make a video about the explanation. I have subscribed your channel
In path,u said vertex should not be repeated. Bt whereas in cycle u told it is the same as path,thn hw come we repeat the vertex again
Internal pointer variable
Thank you 🙏
Awsome lecture sir !!
The trail in the example can be a circuit also!
Thank you sir
Very helpful vedio for us sir
Thanks man!
Youre better than my teacher
thats very helpful thank you 🙏
sir please make a video on lattice properties
welcome back
Here,in the cycle the vertices are repeated..how can we consider this as cycle..as the path condition states that no vertices should be repeated..
Sir is there any rule that a path should traverse all vertices in a graph ??
A path can not repeat any vertice ....but in a cycle the starting vertice and ending vertice is same....then how a cycle can be a path ??
Thank you
Great video!