Graph Data Structure - Basics

Which set represents the vertices of the graph?

• {1,2}, {2,3}. {2,4}, {4,5}, {4,6}

• {1, 2, 3, 4, 5, 6,}

• {1, 2, 3, 4, 5, 6, 7}

• {1,2}, {2,3}. {2,4}, {4,5}, {4,6}, {6,7}

What is the degree of vertex 4?

• 3

• 4

• 5

• 7

Which two vertices are adjacent vertices?

• 5 is adjacent to 6

• 3 is adjacent to 6

• 4 is adjacent to 1

• 3 is adjacent to 2

The graph represents the following vocabulary term.

• Cycle

• Path

• Complete Graph

• Complete Bipartite Graph

Which vertices are adjacent to E?

• B and C

• B, C, D, and A

• B

• A, B, C, D, F, G

Which is an example of a disconnected graph?

• 
• 
• 
• 
• None are disconnected graphs

Which of the following is true?

• A graph may contain no edges and many vertices

• A graph may contain many edges and no vertices

• A graph may contain no edges and no vertices

Which method of graph traversal makes use of a queue?

• Depth-First

• Breadth-First

Which order of traversal is correct using breadth-first?

• A B D E C F G

• A B C G D E F

A has been visited what happens next

• Visit B

• Visit D

• Visit E

• Visit C