Across
- 4. There exists a path from any vertex to any other
- 6. A trail with no repeated edges or vertices
- 7. An open walk in a graph with no repeated edges
- 8. A route through a graph
- 9. Graph with few connecting edges
- 12. Edges have a direction (one way only)
- 13. Graph with many connecting edges
Down
- 1. A connection between nodes
- 2. A node in the graph
- 3. There exists an edge from any vertex to all others
- 5. Graph can be drawn so no edge crosses another edge.
- 8. A value is assigned to every edge
- 10. The vertices connected to a vertex
- 11. A closed walk with no repeating vertices