-
A
A graph in which every node is connected to every other node
-
B
A graph in which every edge has a direction associated with it
-
C
A graph in which every node has at most one outgoing edge
-
D
A graph in which every node has at most one incoming edge
- Share this MCQ
B
Answer:
B
Explanation:
A graph in which every edge has a direction associated with it
Related Topic:
Share Above MCQ