## About Graph Theory Course:

In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices also called nodes or points which are connected by edges also called links or lines. A distinction is made between undirected graphs, where edges link two vertices symmetrically and directed graphs, where edges link two vertices asymmetrically; see Graph discrete mathematics for more detailed definitions and for other variations in the types of graph that are commonly considered. Graphs are one of the prime objects of study in discrete mathematics.

### Course Timings:

1. 0:00 Graph theory vocabulary

2. 04:53 Drawing a street network graph

3. 07:08 Drawing a graph for bridges

4. 10:19 Dijkstra's algorithm

5. 14:34 Dijkstra's algorithm on a table

6. 19:20 Euler Paths

7. 21:20 Euler Circuits

8. 22:25 Determine if a graph has a Euler circuit

9. 26:13 Bridges graph - looking for a Euler circuit

10. 27:59 Fleury's algorithm

11. 30:29 Eulerization

12. 34:52 Hamiltonian circuits

13. 37:30 TSP by brute force

14. 41:23 Number of circuits in a complete graph

15. 46:12 Nearest Neighbor ex1

16. 48:26 Nearest Neighbor ex2

17. 50:15 Nearest Neighbor from a table

18. 55:06 Repeated Nearest Neighbor

19. 58:59 Sorted Edges ex 1

20. 1:03:15 Sorted Edges ex 2

21. 1:05:24 Sorted Edges from a table

22. 1:09:59 Kruskal's ex 1

23. 1:12:59 Kruskal's from a table

2. 04:53 Drawing a street network graph

3. 07:08 Drawing a graph for bridges

4. 10:19 Dijkstra's algorithm

5. 14:34 Dijkstra's algorithm on a table

6. 19:20 Euler Paths

7. 21:20 Euler Circuits

8. 22:25 Determine if a graph has a Euler circuit

9. 26:13 Bridges graph - looking for a Euler circuit

10. 27:59 Fleury's algorithm

11. 30:29 Eulerization

12. 34:52 Hamiltonian circuits

13. 37:30 TSP by brute force

14. 41:23 Number of circuits in a complete graph

15. 46:12 Nearest Neighbor ex1

16. 48:26 Nearest Neighbor ex2

17. 50:15 Nearest Neighbor from a table

18. 55:06 Repeated Nearest Neighbor

19. 58:59 Sorted Edges ex 1

20. 1:03:15 Sorted Edges ex 2

21. 1:05:24 Sorted Edges from a table

22. 1:09:59 Kruskal's ex 1

23. 1:12:59 Kruskal's from a table

Copyright: Academic Lesson

Enroll Udemy All Paid Courses for free: Click here

Learn Time Series Analysis Didactic Course in online: Click here

## Post a comment