This course on graph theory for beginners aims to teach students the fundamental concepts and applications of graphs in mathematics. By the end of the course, learners will be able to understand graph theory vocabulary, draw various types of graphs, apply algorithms such as Dijkstra's and Fleury's, analyze Euler paths and circuits, solve Hamiltonian circuit problems, and implement strategies like TSP and Kruskal's algorithm. The course employs a combination of theoretical explanations, practical examples, and algorithmic problem-solving to cater to beginners in the field of graph theory. The intended audience for this course includes students, enthusiasts, or professionals looking to build a strong foundation in graph theory and its applications.
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
