Difference between Walk, Trail, Path, Circuit and Cycle with most suitable example | Graph Theory
Вставка
- Опубліковано 19 вер 2024
- #graphTheory#trail#circuit#cycle#intel
👉Subscribe to our new channel: / @varunainashots
1. Walk - A walk is a sequence of vertices and edges of a graph i.e. if we traverse a graph then we get a walk.
2. Trail - Trail is an open walk in which no edge is repeated.
3. Path - It is a trail in which neither vertices nor edges are repeated i.e. if we traverse a graph such that we do not repeat a vertex and nor we repeat an edge. As path is also a trail, thus it is also an open walk.
4. Circuit - Traversing a graph such that not an edge is repeated but vertex can be repeated and it is closed also i.e. it is a closed trail.
5. Cycle - Traversing a graph such that we do not repeat a vertex nor we repeat a edge but the starting and ending vertex must be same i.e. we can repeat starting and ending vertex only then we get a cycle.
►Graph Theory (Complete Playlist):
• Graph Theory
Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
►Design and Analysis of algorithms (DAA):
• Design and Analysis of...
►Database Management System:
• DBMS (Database Managem...
► Theory of Computation
• TOC(Theory of Computat...
►Artificial Intelligence:
• Artificial Intelligenc...
►Computer Networks (Complete Playlist):
• Computer Networks (Com...
►Operating System:
• Operating System (Comp...
►Structured Query Language (SQL):
• Structured Query Langu...
►Discrete Mathematics:
• Discrete Mathematics
►Compiler Design:
• Compiler Design (Compl...
►Number System:
• Number system
►Cloud Computing & BIG Data:
• Cloud Computing & BIG ...
►Software Engineering:
• Software Engineering
►Data Structure:
• Data Structure
►Computer Architecture :
• Computer Organization ...
►Programming in C:
• C Programming
►Digital Logic:
• Digital Logic (Complet...
---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
► Subscribe to us on UA-cam: / gatesmashers
►Subscribe to our new channel: / @varunainashots
► Like our page on Facebook: / gatesmashers
► Follow us on Instagram: / gate.smashers
► Follow us on Instagram: / varunainashots
► Follow us on Telegram: t.me/gatesmash...
► Follow us on Threads: www.threads.ne...
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:
Email us at: gatesmashers2018@gmail.com
Option C is correct i.e. 2 and 3 ( 2. A TRAIL is always a walk and 3. A PATH is always a walk. )
because WALK is superset so other two options eliminated ez
yes exactly, option C is correct
@@shubhpatkar862 no because in walk verteces and edges repetation are allowed
Q1- c
Q2-d
Thanks Sir, Your videos are very helpful for me.
correct nath
So 1(C) & 2(D)??
Also aweomse video, ik its been 4 years but its still helping so many students.
Keep up the great work sir!🔥
i think 2 (A) bcz edges and vertex are available
Self referential note:
Walk : Vertex✓, Edge ✓
Trail : Vertex✓, Edge × ; Closed Trail aka Circuit
Path : Vertex × (Except 1st and last Vertex) ; Closed Path aka Cycle
What about repeating the edges in Path ?
@@basitrahman514 edges shouldn't be repeated in path
Vertices should not repeat
@@basitrahman514 when you can't repeat a vertex, then you naturally cannot repeat a edge, if you try to repeat a edge, a vertex will get repeated
@@cartoons__for__kids_Hindi thanks..got it
Amazing!!!! you are forcing me to press Like.
Never feel forced to do anything
@@imranabbasi9535 hmm😁
I am so grateful that you've covered all my next sem subjects!
You're an amazing teacher
BCA ?
Exactly
Q1) (C) 2 and 3
2) A trail is a walk
3) A path is walk
Q2) (D) a->f->b->g->e->b->a is a circuit but not path
As b vertex is repeated.
2 (a) is not correct?
I try to learn many of my subjects from UA-cam but i'm depressed because i'm a below average student who's not able to understand so quickly but Varun Singla Sir is some next level power to teach everything in such a manner that stupid like me was understand so quickly.... ❤❤❤❤☺☺☺☺
Cleared all my doubts..thankyou sir
Your teaching method is the best ❤️
Thanks sir for the guidence for syllebus and teaching so accurately from basic so that every student can learn ♥️
Thank you sir you are the best sir 🙏🙏🙏 thanks for always making us motivated and keep our studies up-to-date.
asey desi zubaan main lecture sunnay ka mzah he kuch aur hai qasam say thankyou sir
Q1. C
Q2. D
Nice delivery👍
Simple and best explanation ❤️❤️❤️❤️
The topics which took hours for our uni lecturer to explain were explained so easily by you in the span of less than 10 mins each....forever grateful for this platform which helped me reach you sir
Hii
A 3 year old video means a lot to me!!
Tq sir for uploading this amazing video 🎉❤🎉🎉
Sir aapki samjhane ki technique bahut achi ha ekdm se concepts clear jo haate ha
Sir Hats Off 🛐🛐🛐 the way he explains makes its so easy to understand concept ekdum clear
badiya sirrrrrrrrrrrrrrrrr
हर हर महादेव जय माँ भवानी जय श्रीराम जय माँ सीता जय हनुमानजी हर हर महादेव जय माँ भवानी जय श्रीराम जय माँ सीता जय हनुमानजी 🙏🙏🙏🙏🙏🙏❤❤❤❤❤❤🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩🚩
Very nice explanation 👌
Sir is the answer 1.c and 2.d
Thank u guru ji
Q1 option c.. by using set theory Trails and paths will always be inside the Walk set
Yeah its correct.
Thank you sir ji❤
You teach really well sir Respect++
and your Punjabi accent is sweet to hear 😁
Hi this is my observation correct me if am wrong Q1: Walk is a bigger entity and trail and path are sub entities under walk. So option1 Walk is always a trail Yes!! , option2 and 3 NO!!. At last option4 Walk is always a path. So we can conclude by saying that B is the right answer.
Bahot badiya ...
Easy explanation...
Thank you...
Keep it up...
C) 2 and 3 is the right answer.
1-2 and 3 right
2-1--walk but not trail
2--trail and also close path
3--circuit and cycle both
4--its path but not circuit
1.c 2. D
Thank u sir 🙂
Option c of 1st question and d of 2nd question
Bohot ache explain kar rahe ho sir.... Awesome
Amazing 👍
Q1- c)
Q2- d) is a circuit but not path because vertex 'b' is repeated .
a to f to b and b to a are different edges?
The edge between b and a is repeating. Hence it is not a trail => not circuit
@@SatvikaVyas ma'am kaha edges repeating ho rahi hai 🤔
@@SatvikaVyasThere is a parallel edge between a and b hence the edge is not repeating
Thank you so much sir ❤️
I appreciate your efforts
Sir not only graph theory ,OS, compilers construction,DSA,DAA, software engineering, DBMS, TOC ,DISCRETE MATHS ,I learned from youu . i Have no word for thanks. And my wish is to meet with you face by face sir. i love you sir. shafqat hussain from Pakistan
THANKYOUSOOMUCH sir @
Thank you so much sir,I have learned so much from this channel
so what are you doing now?
Thanks sir,,,, am understand very easily and
It's Answers are
Q.1: c)
Q.2: d)
Thanku Sir ji
'C 2&3
Flow of teaching was amazing sir!
Sir your videos are so helpful...👍👍👍👍
Thank you so much sir for uploading this amazing video 🎉
Sir you are multi talented.I will meet you one day sir.May God bless you
As always Guru the Time and Live Saver ...😍🤗😘
Life**
I found the best 👌🏻 ❤😊teacher thank u sir 🙏🏻 😊
Excellent!!! Sir thank you for this wonderful lecture
thanks sir
very helful video for the ugc students
You are so amazing sir
Thank you very much sir
I have confused between them now it is clear for me
For Q2 option b shold be the answer as its not forming closed path also edges are not repeating so it should be trail
Superb explanation
Thanks sir, nice teaching all concept clear👍🏻.. 😇
Correct Answer: © 2 and 3
Here’s why:
Statement 2: A trail is always a walk. This is true because a trail is a type of walk where no edge is repeated.
Statement 3: A path is always a walk. This is true because a path is a type of walk where no vertex is repeated.
1. C
2. B
Thanku sir🙏
thnkss alott ji...God bless u forever...
good lectures .
que.1 c
que 2 d.
Nice explanation
Q1 C)2 and 3
yours way of teaching was awesome really
Thank you Sir 🙏🙏🙏🙏❤️❤️❤️
Very nice sir
9:14
Answer of the question is
C
Sir,can you make video related to path degree sequence and distance degree sequence
Q2: option D) is right as the vertex b is repeated twice. Correct me if i am wrong
Your learning method iss osm
homework Answer---------------
< Q1 > ans -- c (2 & 3)
< Q2 > ans -- a (is a walk and also a trail).
Sir really your method is amazing 💯
2 and 3 are correct
Bale bale shabha shabha understood sir
Superb video...very useful
Ans is c)
Trail and Path are always a walk.
But walk can't be Trail and Path since V and E are repeated.
Nice sir .good...
thanks man for this quick explanation keep up the good work😇😇😇😇 you are a big help
sir, your explanations are tooooo good..its very easy to understand by ur videos..
Sir pls confirm the answers
Question 1- C (2 and 3)
Question 2- D (circuit but not path👣)
Right 👍
Correct ans👍
How i go b to a directly
Gurujee shandhar jabardast zindabad
Sir net schedule k hisab se video start kijiye sir please
thank you sir
Very good sir g
1-c; 2-d THANK YOU SIR
In question 2 c is also correct
Option (C) 2 and 3
Q1 - c
Q2- d. Because he ( B is repeated )
wonderful speech bro thnx
Q2 = option d(true)
b vertex is repeated so path is not possible but circuit is
Awesome explanation...!
hy .walk consist only vertex or egde....?
Thank you Sir🙏🙏🙏
Sir plzz continue co...
Thanks sir💞
Thank you very much Sir
Thanks sir
1) -> option C is the ans
2) -> option D is the ans
Thank u sir😊
Love you sir. Exam mein apne bacha liya ❤❤