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