Solved

Let G Be an Undirected Graph

Question 4

Multiple Choice

Let G be an undirected graph.Let u and v be two vertices in G.Then u and v are called ____ if there is an edge from one to the other.

A) adjacent
B) weighted
C) connected
D) shortest path

Related Questions

Q1: In Prim's algorithm for the minimal spanning

Q2: The _ traversal of a graph is

Q3: A(n) _ tree T is a simple

Q5: Two well-known algorithms, Prim's algorithm and _'s

Q6: The _ of sets A and B

Q7: In a(n) _ graph, the edges are

Q8: The shortest path algorithm was developed by

Q9: The shortest path algorithm is also called

Q10: A graph is called a(n) _ graph

Q11: Let G be a weighted graph.Let u