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
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."
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
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
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!
@@kawaljitsingh3520 That one confuse me also, in websites like geeksforgeeks and many more says edges repeats, But in books like Narsingh deo, they say edge not repeat.
path mean neither vertex nor edges are repeated... then you say cycle satisfied path condition with closed... but i have a doubt of this site... cycle have not vertex repeated bt how can you say cycle satisfied path
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
These are seriously very helpful, better than any of the lessons in my online class.
We have the same feelings! Thanks for this lecture!
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
Thank you sir.....
Very easy and understable....
Do upload complex algorithms with simple examples..🙏
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)
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
Simple and straight to the point, as all things should be. Thanks so much for making this video!
best broyee
you are best and talented teacher keep it up
but in cycle one one is repetead why?
tqsm sir U saved me
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.
Thank you sir. Very useful
thnx sir bht easy method sy consept clear krwaya
That makes is SO much clearer. Thank you!
Thank you so much sir ! Very helpful
Legends are watching one day before exam 😂
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
Very good teaching sir thank you...
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?
This video helped me a lot thank you! Amazing job done at explaining all of these terms and how they relate with each other.
Thank you so much for the videos
It's very helpful
thank you so much sir! you made the concept very easy to learn and remember 😊
Nice classs,its really working
Super clear, thank you!
thanky you very much Sir!
Sir your teachings are good and easy understandable. Sir guide me on my project on labelling graph and it's types
Thank you 🙏
Excellent video Sir...Sir, plz make a video regarding genus of a graph
Thank you sir
Im able to understand your graph theory Sir please sendwhat is labellig, pair sum of labelling
sir do video for graph isomorphism and incident ,adjacency matrix
very profesional sir
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
Great explanation you are better than our teacher i am from saudi
I didn't understand anything from my class pdf, this video helped me very well. Thanks..
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 is there any rule that a path should traverse all vertices in a graph ??
Very fantastic explanation ❤️❤️❤️
Thanks
Really useful!!! Tkanks
No edges should be repeated in Walk
what you are talking about happens in a particular kind of walk which is called a 'trail'. In general, Walks can have repetitive edges and vertices
@@kawaljitsingh3520 That one confuse me also, in websites like geeksforgeeks and many more says edges repeats,
But in books like Narsingh deo, they say edge not repeat.
@@manasupadhyay266 yeah may be books and other online sources are not synchronized on this subject. im not sure what might be the source of truth
I Love that
Nice explanation Please create a playlist topic wise that would be most helpful for us to study through your channel
So all cycles are circuits ?
no because the repetition is not allowed in cycles
Swiching circute
Very useful sir digraph vedios koduga sir
Superb explanation ,it was very clear tq so much sir
Thank you so much for your hard work and your time
bestttt
path mean neither vertex nor edges are repeated... then you say cycle satisfied path condition with closed... but i have a doubt of this site... cycle have not vertex repeated bt how can you say cycle satisfied path
I’m trying to understand why 2’s path is always avoided in all of these examples.
Sir, since cycle is path why vertex is repeated in cycle as you mentioned??
Nice...
. thank you so much, sir! you made the concept very easy to learn and remember .
I don’t understand what you mean by closed? Very helpful vid tho!
😂😂walk ki definition hi glt smjha di tmne to...
sahi hai sab
definition sahi hai
sahi to hai
Sir if you really think so.. You should upload another video.. Why are you Saying in jxt comments.. Tell us the right way
@@funology4691 konsa school ha app(mere favorite ha oo)
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
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 ??
Sir can we call cycle to the cyclic graph??
Best explanation of those definitions please make more video on other topics of graph theory as Well as various subjects of mathematics!
In path vertex is not repeated but how can path gets closed to form cycle ?
Sir I watch ur lectures it's super,fantastic,mindblowing,awesome sir
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
Tqqq soo much sir
Sir cycle repeat a vertex while traversing how it called a path ??
Please explain the application of it and make a video about the explanation. I have subscribed your channel
Thank u it's very useful for my exams
Thank you dude, helped a lot.
Easy ya understand panna mudeuthu thanks bro
Thank you are better than my Professor
welcome back
Then what is the length of path in this diagram Sir?
Sir we need bipartite graph to explain
The trail in the example can be a circuit also!
Thanks my confusions got clear here totally !! 🙏🙏
Thanku
Subgraph problem explain sir please
Baga chepparu sir♥️
Thank you
sir please make a video on lattice properties
tq, explanation for basic definition of graph theory is clearly understand
awesome!
In circuit graph what about 4 - 5
Cycle is not a path, cycle is a circuit
شكرا لقد استفدت كثيرا
Thanks man!
Love from Pakistan sir❤
Bhut bhut dhnyvaad sirjii 🙏🙏
What for starting and ending point
Walk cannot have more than one edge
Doing the lord's work 🙏
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..
Thank You! Sir @Vivekanand - Algorithm Every Day . Your explanation is crystal clear. Big help for me!
Thank you friend!
thank you sir! you are special for all others.
Wonderful explanation
Sir l am Pakistani Sir trial and circuit man deferant ky ha
thanks
You are really amazing 🤩
Youre better than my teacher
Great teach sir g
Where ur house in us or china