Exam-style question
Try this first
Which statement describes a directed graph?.
- A.Every edge must have a numerical weight
- B.Edges show a direction from one vertex to another
- C.Every vertex must be connected to every other vertex
- D.Edges can never connect two vertices
Model answer
What a good answer should say
- Edges show a direction from one vertex to another
Explanation
Why this works
A directed graph has edges or arcs with a direction, so a connection from one vertex to another is not automatically a connection in the reverse direction.
Common mistake
No common mistake is linked to this question yet.