A directed graph is one in which
a. you must follow the minimum spanning tree.
b. you must go from vertex A to vertex B to vertex C and so on.
c. you can go in only one direction from one given vertex to another.
d. you can go in only one direction on any given path.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.