Week 10 Java

123456789
Across
  1. 1. A point or vertex in a graph
  2. 4. the name of a list or matrix used to store a graph
  3. 6. A set of nodes connected by edges
  4. 7. Containing no loops; a DAG is described this way
  5. 8. A path that starts and ends at the same vertex
  6. 9. A connected graph with no cycles
Down
  1. 2. A connection between two vertices
  2. 3. Describes a graph whose edges work in both directions, with no arrows
  3. 5. Describes a graph whose edges have a one-way arrow from one node to another