Graph

Edit Answers
123456789
Across
  1. 2. to find shortest path
  2. 5. every node is connected to every other node
  3. 6. No of incoming edges
  4. 7. Data structure used in DFS
  5. 8. A path where the first and last vertices are the same
  6. 9. Algorithm to find the MST
Down
  1. 1. Data structure used in BFS
  2. 2. No of edges connected
  3. 3. graph with no cycle
  4. 4. Matrix used to represent edges between nodes.