Thank you so much for these videos they are helping a lot. Due to colleges being switched to online classes I am taking math right now and another video based on the topic of Euler's theorems and fluency's algorithm with Euler's circuits and Euler's path would help with examples for the viewers to complete. Also, a video based on the topic Eulerizing and semi- eulerizing graphs. Thank you again.
Great to hear! I am sorry I don't cover those in my classes and I (like most teachers) am really swamped right now, but I appreciate the suggestion for future videos. Good luck with your class!
Symphony M. MW 9:30 One thing I learned from the video that I think will be helpful on chapter 14 exam is an Euler circuit in a graph is a circuit that uses every edge of the graph exactly once.
Aisha Colatrella MGF 1107 Monday 11am Fleury's algorithm is used to find a Euler circuit in any connected graph in which each vertex has an even degree.
I'm too lazy to find information about Fleury's Algorithm in native Russian language. Now I'm on a level that I can get almost every information in English. I'm glad to speak and think this language. By the way, your work on this video is great thanks for your explanation for English learners
Angelo Deveaux MGF:1107 This video helped me further understand Fleury's Algorithm for Finding an Euler Circuit. I am terrible at anything to do with graphing but this video has helped me alot in getting through this chapter
Grace r MGF 1107 One thing I liked about this video was the examples of the Euler circuits and the explanations of how to find one. I also like the explanation of eulers theorem.
Brian Painchault MGF1107 I learned Fleury's Algorithm method to find the Euler Circuit and determine each cut edge, also a graph that has an Euler Circuit always has more than one.
Theska Moise M-W 9:30 am In this video, I learned about a cut edge in a graph. A cut edge in a graph is an edge whose removal disconnects a component of the graph
Shayla Silvano MGF 1107-Thurs-11a.m. Fleurys algorithm can be used to find a Euler circuit in any connected graph in which each vertex has an even degree.
Zavon Spates MGF1107 Thursday 11am I’ve learned more in depth in terms of “cut edge” within a graph which is an edge whose removal disconnects a component of the graph.
Arnelle Michel MGF1107 Thursday 11a.m Fleury algorithm can be used to find an Euler circuit in any connected graph in which each vertex has even degree.
Natalie Munoz MGF1107 Monday 11AM Cut edges that are connected to a point are still considered available to work on unlike a point in the open, is considered separated from the graph
Name: Nayelhi Nevarez Course: MGF1107 The video helped me understand Fleury’s Algorithm for finding a Euler Circuit exercises and each exercise helped me do my homework in MyLab. Thank you, professor!
Jorge Cereghino MGF1107 - Mon 11am FLEURY'S ALGORITHM: STEP 1: Start at any vertex. Go along any edge from this vertex to another vertex. Remove this edge from the graph. STEP 2: Choose any edge from this vertex, but not a cut edge, unless you have no other option. Remove your chosen edge from the graph. STEP 3: Repeat Step 2 until you have used all the edges and gotten back to the vertex at which you started. PS: This is FUN!!
Name: Stephanie MGF1107 I liked this video because it helps me with my labs to understand better how to follow the steps to find and Euler Circuit in Graph. Good video
Good question. A cut edge is an edge that, when removed, separates the graph into two components, two parts that are not connected by any edges. Thanks for posting! :-)
Baris Metin MGF1107 Monday 11AM Cut edges that are connected to a point are still considered available to work on unlike a point in the open, is considered separated from the graph
Brittany Knowles MGF1107 Online\ I appreciate your craft how you explain the video and not make it hard to understand the video is helpful I screenshot terms and examples for when I need help with my homework . The video also helped with understanding what a cut graph was and how to determine which ones are removed.
Gabriela Bircia MGF1107 MW9:30-10:45am " Suppose we have a connected graph . 1. if the graph has an Euler circuit, then each vertex of the graph has an even degree. 2. If each vertex of the graph has even degree, then the graph has an Euler circuit."
Jacqueline Bird MFG1107 Monday 11am... Fleury's main takeaway for me was to record the edges in the direction removed, and ensure not to create a disconnect in the process. thank you
One of the best Teaching Method ❤️ ❤️
Glad you think so!
Such a great video. Thanks for that helpful explanation🙏
Glad it was helpful!
Thank you so much for these videos they are helping a lot. Due to colleges being switched to online classes I am taking math right now and another video based on the topic of Euler's theorems and fluency's algorithm with Euler's circuits and Euler's path would help with examples for the viewers to complete. Also, a video based on the topic Eulerizing and semi- eulerizing graphs. Thank you again.
Great to hear! I am sorry I don't cover those in my classes and I (like most teachers) am really swamped right now, but I appreciate the suggestion for future videos. Good luck with your class!
I like the way you explain. so chilled 💖👌🙌
Thank you! 😃
Symphony M.
MW 9:30
One thing I learned from the video that I think will be helpful on chapter 14 exam is an Euler circuit in a graph is a circuit that uses every edge of the graph exactly once.
Aisha Colatrella
MGF 1107
Monday 11am
Fleury's algorithm is used to find a Euler circuit in any connected graph in which each vertex has an even degree.
Carolina Rodriguez
MW 9:30
The video was really helpful for identifying cut edges and was a explained clearly.
Excellent video. Thank you for uploading it and sharing your knowledge
So nice of you
Thank you for the absolutely fantastic tutorial.
Marla Johnson
MGF1107
Monday 11:00-12:15
I learned that when a edge is removed from a graph it disconnects a component. This is called a cut edge.
amazing explanation!
Thanks! I appreciate the positive feedback. ☺️👍
I'm too lazy to find information about Fleury's Algorithm in native Russian language. Now I'm on a level that I can get almost every information in English. I'm glad to speak and think this language. By the way, your work on this video is great thanks for your explanation for English learners
That's great! I am very impressed.
Alex Torres
MGF 1107
Thursday 11:00-12:15
Ive learned Fleury's Algorithm can be used to find any Eulers circuit.
thanks for the great content
😁👍I’m so happy you like it!
Angelo Deveaux MGF:1107 This video helped me further understand Fleury's Algorithm for Finding an Euler Circuit. I am terrible at anything to do with graphing but this video has helped me alot in getting through this chapter
Grace r MGF 1107
One thing I liked about this video was the examples of the Euler circuits and the explanations of how to find one. I also like the explanation of eulers theorem.
keith jinks
MW 9:30
the video was helpful in helping me understand cut edges and using fleury's algorithm
Brian Painchault
MGF1107
I learned Fleury's Algorithm method to find the Euler Circuit and determine each cut edge, also a graph that has an Euler Circuit always has more than one.
This should be taught in a level further maths
Jim Charite
MGF 1107 M-W 9:30 am
A cut edge in a graph is an edge that disconnects the whole of a graph.
Maria De.
M/W 9:30AM
any points removed that would disconnect a graph are considered cut edges.
Juan Betancur
MGF1107 MW 930-1045
a cut edge is an edge that if removed would disconnect the graph
Theska Moise
M-W 9:30 am
In this video, I learned about a cut edge in a graph.
A cut edge in a graph is an edge whose removal disconnects a component of the graph
Shayla Silvano
MGF 1107-Thurs-11a.m.
Fleurys algorithm can be used to find a Euler circuit in any connected graph in which each vertex has an even degree.
Thanks for help :)
Happy to help!
Thanks! 😊
You bet!
Charis Hewlett
MGF1107 MW 9:30
In this video I learned how to identify cut edges.
Dope video Thx!
Appreciate it!
L. Panameno
MGF1107 Th 11 am
Euler Circuit in a graph is a circuit that uses every edge of the graph exactly once
Tahij Perkins
Mgf1107 this really help with chapter 14 with Euler Circuit
Deshawn McKenzie
MGF 1107- MW 9:30 AM
I learned that a Cut Edge in a graph is an edge whose removal disconnects a component of the graph.
Taylor Slotsky
MGF1107 MW 9:30
With a connected graph, 1. If the graph has a Euler circuit, then each vertex of the graph has even degree.
Zavon Spates
MGF1107
Thursday 11am
I’ve learned more in depth in terms of “cut edge” within a graph which is an edge whose removal disconnects a component of the graph.
thanks a lot
You are most welcome!
Melissa Hooper
MGF1107 M/W 9:30
If you can remove an edge and it disconnects the graph into 2 completely different components it is called a cut edge.
Kellene Walker
MGF 1107- MW 9:30 AM
I learned that a Cut Edge in a graph is an edge whose removal disconnects a component of the graph.
Tariah Foster
MGF1107
MW 9:30
A cut edge in a graph is an edge whose removal disconnects a component of the graph.
May i know why you are registering it here? Idk why many people like you did the same! Why?
Randale rose
MGF1107
MW 9:30
An Euler circuit hits every edge once
Arnelle Michel
MGF1107 Thursday 11a.m
Fleury algorithm can be used to find an Euler circuit in any connected graph in which each vertex has even degree.
Natalie Munoz
MGF1107 Monday 11AM
Cut edges that are connected to a point are still considered available to work on unlike a point in the open, is considered separated from the graph
thanks
Very welcome!
jonathan rodriguez
MGF1107 Thursday 11 am
I learned that using cut edges we can connected two components in a disconnected graph.
Elaine Suarez
MGF1107 Thursday 11 am
I learned that using cut edges we can connected two components in a disconnected graph.
Nick Hollinger
MGF1107
Monday 11am
Fleurys Algorithm is used when trying to find a Euler circuit when there is an even number of degrees.
Name: Nayelhi Nevarez
Course: MGF1107
The video helped me understand Fleury’s Algorithm for finding a Euler Circuit exercises and each exercise helped me do my homework in MyLab. Thank you, professor!
Sophie Hough
MGF1107 Thursday 11AM
Fleurys Algorithm is used when trying to find a Euler circuit when there is an even number of degrees.
Kendra Brown
Mgf1107
Monday 11AM
A cut edge is an edge that connects a graph. Removing that edge creates a separate component.
Claire Espada-Diaz
MGF1107 M/W 9:30
I found how the algorithm is used to find the Euler Circuit.
thank you so much for helping
p.s - I wonder what was the assignment given,..why has everybody written 9.30 am?
You are so welcome! Those are my students. They put the time of their class so they can get bonus points. lol :-)
Shanice Barrett
MGF1107 T-11am
An Euler Circuit uses every edge of the graph exactly once.
Lauren Modestil
MGF1107
Mon 11am
A cut edge in a graph, makes separate components in the graph.
Melissa Seymour
MGF1107
I learned about the Euler circuit and how to each every edge once in this video.
Jorge Cereghino MGF1107 - Mon 11am
FLEURY'S ALGORITHM:
STEP 1: Start at any vertex. Go along any edge from this vertex to another vertex. Remove this edge from the graph.
STEP 2: Choose any edge from this vertex, but not a cut edge, unless you have no other option. Remove your chosen edge from the graph.
STEP 3: Repeat Step 2 until you have used all the edges and gotten back to the vertex at which you started.
PS: This is FUN!!
Jenniffer Nichols
MGF 1107 MF @9:30
Fleury's Algorithm to find a Euler Circuit
Tyree Prophet MGF1107 MW-9:30am-10:45am “A cut edge in a graph is an edge whose removal disconnects a component of the graph.”
Name: Stephanie
MGF1107
I liked this video because it helps me with my labs to understand better how to follow the steps to find and Euler Circuit in Graph. Good video
harnesh lall
MGF 1107 thurs at 11:00 am
removing a cut edge creates 2 completely distinct graphs
Milan Parris
MGF1107
The video helped me understand fleury's algorithm for finding an euler circuit
Veronica Natal
MGF1107 Thursday 11 a.m
In a circuit we start and end at the same place.
How do i determine if the removed edge is a cut edge ?
Good question. A cut edge is an edge that, when removed, separates the graph into two components, two parts that are not connected by any edges. Thanks for posting! :-)
Baris Metin
MGF1107 Monday 11AM
Cut edges that are connected to a point are still considered available to work on unlike a point in the open, is considered separated from the graph
HI! Thanks for watching! I am not teaching MGF1107 this semester though. LOL
Haha I am not even taking class 😅just figured students doing it 😆
jonathan rodriguez
MGF1107 Thursday 11 a.m
i learn that In a circuit we start and end at the same place.
Brittany Knowles
MGF1107
Online\
I appreciate your craft how you explain the video and not make it hard to understand the video is helpful I screenshot terms and examples for when I need help with my homework . The video also helped with understanding what a cut graph was and how to determine which ones are removed.
Adam Huapaya
MGF1107
This video helped really helped me understand cut edges!
Rylan buck
Prof.Beka
MAD4301graph theory
T/R 11-12:15
Idk why everyone’s putting their classes in the comments but that’s who I have
Hi Rylan! Thanks for watching. I know it looks weird. LOL They are my students. They are getting bonus points for watching. :-)
@@MzMath ohhh okay hahaha! That’s an awesome way to get ec!:) your students must be lucky haha
Andrea Luders
MGF1107
These have been such a pain I liked that there’s at least a video to help me TRY to get it
Gabriela Bircia
MGF1107 MW9:30-10:45am
" Suppose we have a connected graph .
1. if the graph has an Euler circuit, then each vertex of the graph has an even degree.
2. If each vertex of the graph has even degree, then the graph has an Euler circuit."
Weirdest comment section ive seen
LOL They are my students. They are doing an assignment. :-)
@@MzMath Oh I see
Wtf is going on in the comments
I StM I Those are comments from my students. LOL
Jacqueline Bird MFG1107 Monday 11am... Fleury's main takeaway for me was to record the edges in the direction removed, and ensure not to create a disconnect in the process. thank you