Correct Answer:
C. Complete graph
Correct answer: Complete graph. A graph where every node connects to every other node is a complete graph.
Background: With n nodes, each links to all others, giving n(n-1)/2 edges.
- Directed graph: A directed graph has directed edges, but nodes need not all connect.
- Weighted graph: A weighted graph gives each edge a value, not full connections.
- Sparse graph: A sparse graph has few edges, the opposite of complete.
Did you know? Complete graphs are written Kn, so K5 has five nodes.
Memory trick: Complete = every pair joined.
Leave a Reply
You must be logged in to post a comment.