Dive into a comprehensive 1-hour 17-minute video course on graph theory for beginners. Explore fundamental concepts including graph vocabulary, street network and bridge graphs, Dijkstra's algorithm, Euler paths and circuits, Fleury's algorithm, Eulerization, Hamiltonian circuits, and the Traveling Salesman Problem. Learn various problem-solving techniques such as Nearest Neighbor, Sorted Edges, and Kruskal's algorithm through practical examples and table-based exercises. Based on the open textbook "Math in Society," this course provides a solid foundation in discrete mathematics and its applications in network analysis and optimization problems.
Overview
Syllabus
Graph theory vocabulary .
Drawing a street network graph.
Drawing a graph for bridges .
Dijkstra's algorithm.
Dijkstra's algorithm on a table.
Euler Paths.
Euler Circuits.
Determine if a graph has an Euler circuit.
Bridges graph - looking for an Euler circuit.
Fleury's algorithm.
Eulerization.
Hamiltonian circuits.
TSP by brute force.
Number of circuits in a complete graph.
Nearest Neighbor ex1.
Nearest Neighbor ex2.
Nearest Neighbor from a table.
Repeated Nearest Neighbor.
Sorted Edges ex 1.
Sorted Edges ex 2.
Sorted Edges from a table.
Kruskal's ex 1.
Kruskal's from a table.
Taught by
Academic Lesson
