Lecture : Discussion (Graph Theory )
Document Summary
Use fleury"s algorithm to find possible eular paths. Use fleury"s algorithm to find possible eular circuit. There are three main ways to represent a relationship in math which are using a table, a graph, or an equation. I"ll show you the same relationship with a graph. A pizza company sells a small pizza for , each topping costs . Now we can create ordered pairs from the x and y values. We can use these ordered pair to create a graph. Now you can see how the graph helps us visually see the relationship that the total cost of the pizza increases as we add more toppings. Topic ii: use fleury"s algorithm to find possible eular paths and eular circuit. An euler path is a path that uses every edge in a graph with no repeats. Being a path, it does not have to return to the starting vertex.
