Тёмный

Euler Graph | Euler Circuit |Graph Theory #16 

Vivekanand Khyade - Algorithm Every Day
Подписаться 114 тыс.
Просмотров 68 тыс.
50% 1

Опубликовано:

 

2 окт 2024

Поделиться:

Ссылка:

Скачать:

Готовим ссылку...

Добавить в:

Мой плейлист
Посмотреть позже
Комментарии : 83   
@venaagustina4322
@venaagustina4322 4 года назад
i always watch ur video sir... ur explanation is so clear... love from indonesia
@dhinchakmasala602
@dhinchakmasala602 4 года назад
Seroisuly sir aap bhut achy se concept clear krty ho
@Gaurav-zh4pm
@Gaurav-zh4pm 3 года назад
just to tell about what is degree he said link in description. no. of incident edges on a vertex bol dete pur views subko chaheyea
@khanam..2530
@khanam..2530 2 года назад
Please Suggest website Name Plz i prepare myself for PreSentation ❤👈
@edelensvlog1316
@edelensvlog1316 4 года назад
I really did understand our lesson now.Thanks to you sir and God bless sir😇from Philippines.
@geethalakshmi4714
@geethalakshmi4714 3 года назад
About Ramsey no. Problem can u give videos
@sujit7292
@sujit7292 3 года назад
Watch it in 2x speed ... thank me later... 😁
@123456agupta
@123456agupta 2 года назад
Good explaination. Begiinner can understand your explaination easily
@ahmedshams2282
@ahmedshams2282 4 года назад
From egypt , You are the best real More thanks for you 💜💜💜
@vishwajeetdeshmukh9485
@vishwajeetdeshmukh9485 3 года назад
Very nice explanations
@saoussenslii
@saoussenslii 4 года назад
a graph with a vertex of degree 0 can be eular???? how? how can we connect to this vertex without an edge?
@amandeepsingh4885
@amandeepsingh4885 5 лет назад
If u found any odd degree vertex then not Euler graph
@geethalakshmi4714
@geethalakshmi4714 3 года назад
Very clear sir ur videos are.
@சுரேஷ்ராஜன்
Lovely teaching .... Nice bro..... Awesome Explanation.....
@Kodin
@Kodin 3 года назад
Thank you!
@gauriishu
@gauriishu 4 года назад
You are amazing at making complex explanations so simple and clear! Thanks Vivekanand ji!
@firstfirst3681
@firstfirst3681 3 года назад
Thank u amazing
@hossainali8421
@hossainali8421 3 года назад
Nice tutorial
@imaneimane1806
@imaneimane1806 3 года назад
Thank you 👍👍👍👍
@sree8708
@sree8708 4 года назад
Explanation for Chinese postman problem
@yasodhas5919
@yasodhas5919 3 года назад
Cristal clear explation sir. I like your teaching methodology
@turbothrottletrouble4217
@turbothrottletrouble4217 4 года назад
using this for the new IB math HL course. Thank you so much (i am doing the math application and interpretation HL course, so we have to do graph theory)
@jhonkimlaguitan4661
@jhonkimlaguitan4661 2 года назад
Plsss to answer us🥺 color the following graph according to the given colors:red,blue,green, yellow.(before coloring the graph, please read first the definition of the four color theorem)
@sihamtenho
@sihamtenho 4 месяца назад
You are incredible. Thank you so much (this is my first time complementing a teacher 😅)
@mofazzalhossain3012
@mofazzalhossain3012 2 года назад
Thank you very much sir,please take love from Bangladesh.
@ignishaelton831
@ignishaelton831 4 года назад
Excellent
@alkasharma2440
@alkasharma2440 3 года назад
Nice
@ROCK12465
@ROCK12465 2 года назад
Sir please make video on dijkstra algorithm for shortest path
@BruceLee-gh7oi
@BruceLee-gh7oi 4 года назад
Subscribed bro Your way of teaching awesome
@ramakrishnanarsingha4602
@ramakrishnanarsingha4602 4 года назад
Sir will u plz upload a video on fleurys algorithm in graph theorey
@izaliyeva338
@izaliyeva338 4 года назад
thnak you about best explanation
@ShaikhTabrezMushtaqueAhmed
@ShaikhTabrezMushtaqueAhmed Год назад
In semi - eulerian vertice 1 also have 1 degree so total three vertice has odd degree.
@sree8708
@sree8708 4 года назад
Explain konigsberg poblem
@vishalmahavratayajula9658
@vishalmahavratayajula9658 4 года назад
In the second graph, 4->5->1->2->3->4 We are starting at 4 returning to 4 without edge repeating.This is Euler graph @vivekanand khyade or are you missing to say that every edge should be covered?
@raunakmitra7868
@raunakmitra7868 4 года назад
According to the path you constructed, the edge 2-4 is yet to be visited. But, an Euler Path must include ALL the edges visited in any order. If atleast one edge is still left, then the path you just constructed is a SIMPLE path and not an EULER path. Feel free to drop more queries.
@shahidkcwkalanchvi7278
@shahidkcwkalanchvi7278 9 месяцев назад
Good topic eccentricity of the vertices i have learned 😊
@shanmugapriya7554
@shanmugapriya7554 2 года назад
Thank u ...good explanation sir
@ragamgr860
@ragamgr860 4 года назад
sir please explain planarity of gtaph
@raymondpadya7587
@raymondpadya7587 7 месяцев назад
You are very good at this sir.. thank you
@terellkantwell6876
@terellkantwell6876 4 года назад
Please be my professor, you do a fantastic job man, you just earned a subscriber!
@harshinigautam4305
@harshinigautam4305 4 года назад
Thumbnail 🤷🏻‍♀️😅👌
@drasi_Flicker
@drasi_Flicker 4 года назад
Very well explained sirr
@LakshmikanthAyyadevara
@LakshmikanthAyyadevara 4 года назад
clear explanation thank you
@kyahua7260
@kyahua7260 2 года назад
sir can you not speak in hindi
@tempregex8520
@tempregex8520 3 года назад
what about directed graphs? you have taken examples only for undirected graphs, is there any change?
@kambhampatisumanth5735
@kambhampatisumanth5735 3 года назад
Sir can the 2nd graph be sem euler when start from 1243156 and stops at vertex 6
@maximusmanoj3467
@maximusmanoj3467 2 года назад
Thank you so much bro
@nandakumarvighnesh1153
@nandakumarvighnesh1153 5 лет назад
Nice sir
@vikumravinayake1882
@vikumravinayake1882 3 года назад
Thank you very much. Nice explanation. 👌🙌👍
@mamathaav4627
@mamathaav4627 Год назад
Thank you 😊 sir
@durgeshbhanu31
@durgeshbhanu31 3 года назад
Good explanation but since u r teaching so no need to put transition unless u r using multiple cameras...
@epicclips8881
@epicclips8881 4 года назад
Lovely
@whatsmindstatus2225
@whatsmindstatus2225 3 года назад
Great explanation
@khusbusahu5881
@khusbusahu5881 3 года назад
Your videos are very helpful for us.... thank you sir... 🙏🙏😊😊
@prsnathan26
@prsnathan26 3 года назад
5-1-3-2-4-5
@prsnathan26
@prsnathan26 3 года назад
In second example..there is no edge repeating....so it s Euler graph only
@MrPerfias
@MrPerfias 2 года назад
Thank you for breaking it down, so easy to follow you
@khushboohassan4597
@khushboohassan4597 4 года назад
Thanku sir, for this wonderful lecture.....Love from Bleeding Kashmir
@miatapia151
@miatapia151 4 года назад
Very helpful, thank you!
@Dailytravelsvlogs
@Dailytravelsvlogs 5 лет назад
Excellent 👍
@getachewmuhabaw7755
@getachewmuhabaw7755 5 лет назад
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
@space_rider2446
@space_rider2446 2 года назад
nice sir
@StickMan.Animation
@StickMan.Animation 3 года назад
Thank you... you helped me a lot ❤😍😍
@akaijoe3582
@akaijoe3582 2 года назад
thanks
@karpagavigneswarib1663
@karpagavigneswarib1663 3 года назад
Please explain underlying simple graph sir
@Rajat-qo7ot
@Rajat-qo7ot 4 года назад
Please change the intro, it's too cringy
@idresidres4302
@idresidres4302 4 года назад
Hi Q) If G1 is r1-regular and G2 is r2-regular , G1+G2 is Euler circuits or not .
@Anonymoushacker36
@Anonymoushacker36 4 года назад
Thankyou sir for this wonderful lacture
@hasinthaheshan6719
@hasinthaheshan6719 3 года назад
Sir your exaplanation is so clear👍
@yazhmughiramesh4296
@yazhmughiramesh4296 2 года назад
your teaching is one of the best sir !!! Thanks a lot from the bottom of my heart sir!!!
@gdarramae3027
@gdarramae3027 3 года назад
thank you for the help sir
@janhavimahajan9037
@janhavimahajan9037 3 года назад
Good work keep it up 👏👏
@rauanrequinala6467
@rauanrequinala6467 4 года назад
thank for excellence lecture sir,, your teaching is so nice and clear. i mean do understand it well properly... thank you so much sir... From Philippines
@abhinaymeka4330
@abhinaymeka4330 4 года назад
4:15
@xo_vallee
@xo_vallee 3 года назад
Thank you for lesson
@harshinigautam4305
@harshinigautam4305 4 года назад
Can’t we draw 2-5 in second example 3:15
@ophirmassey8438
@ophirmassey8438 3 года назад
Excellent explanation!!
@zaylo9273
@zaylo9273 4 года назад
Best explanation ever TT
@karthikakkiraju7166
@karthikakkiraju7166 5 лет назад
Excellent lecture sir thank you
@algorithmimplementer415
@algorithmimplementer415 4 года назад
Corona made him come back!!! Jokes apart, please upload videos daily. :) We love your channel.
@ponmanis2667
@ponmanis2667 5 лет назад
Plan explain tamil
Далее
Hamiltonian Graph | Details|Graph Theory #17
8:38
Просмотров 47 тыс.
#慧慧很努力#家庭搞笑#生活#亲子#记录
00:11
НОВАЯ "БУХАНКА" 2024. ФИНАЛ
1:39:04
Просмотров 173 тыс.
When Goalkeepers Get Bored 🤯 #3
00:27
Просмотров 1,1 млн
Eulerian Circuits and Eulerian Graphs | Graph Theory
7:43
8. Eulerian Graph with example
17:14
Просмотров 53 тыс.
Discrete Math II - 10.5.1 Euler Paths and Circuits
17:37
Graph Theory:  Euler Paths and Euler Circuits
9:52
Просмотров 380 тыс.
#慧慧很努力#家庭搞笑#生活#亲子#记录
00:11