Solved

In a Graph Directed G, for Each Vertex, V, the Vertices

Question 24

Multiple Choice

In a graph directed G, for each vertex, v, the vertices adjacent to v are called ____ successors.

A) immediate
B) adjacent
C) path
D) parallel

Related Questions

Q19: The depth first traversal is similar to

Q20: Y is a(n) _ of X if

Q21: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB4785/.jpg" alt=" -A(n) _ ordering

Q22: A graph G is a pair, G

Q23: <img src="https://d2lvgg3v3hfg70.cloudfront.net/TB4785/.jpg" alt=" -A(n) _ ordering

Q25: A simple path is a path in

Q26: In a graph G, if the edges

Q27: The _ algorithm gives the shortest distance

Q28: A minimal spanning tree of G is

Q29: The _ of sets A and B