Directions: Answer each of the following questions. Please ensure that your responses are at least 3 to 5 sentences in length.
1. Define a path between two vertices.
2. What is a simple path?
3. What is a cycle?
4. What is a simple cycle?
5. What is a complete graph?
6. What is a self edge?
7. What is a weighted graph?
8. What are two differences between a directed graph and an undirected graph?
9. What are the two most common implementations of a graph?
10. How does the depth-first search (DFS) strategy of graph traversal differ from the breadth-first search (BFS) strategy?
11. What is a spanning tree?
12. What is a minimum spanning tree?
13. How is the cost of a spanning tree calculated?
14. What is the shortest path between two vertices in a weighted graph?
15. What is a planar graph?