Introduction


Learning Objectives
Elements of Graph Theory- Define and use the elements of a graph to optimize paths through the graph
- Identify the number of vertices and edges on a graph
- Determine whether a graph is connected
- Define the degree of a vertex of a graph
- Determine the difference between a path and a circuit
- Use Dijkstra’s algorithm to find the shortest path between two vertices
- Given a table of driving times between cities, find the shortest path between two cities
- Define an Euler path, and an Euler circuit
- Use Fleury’s algorithm to determine whether a graph has an Euler circuit