Question 1

The ____________________ matrix uses a two-dimensional array to represent the graph.

Accepted Answer

The answer of The ____________________ matrix uses a two-dimensional array...

Question 2

The cost of a(n)  ____ is the sum of the weights of the edges.

Accepted Answer

A)   spanning tree
B)   depth-first search
C)   adjacency matrix
D)   breadth-first searchE) A) and B)
F) A) and C)

Question 3

In a breadth first search, the nodes that are lower down in the picked-up graph are visited before nodes that are higher up in the graph.

Accepted Answer

A) True 
 B)False

Question 4

Edges can be represented by an array of lists called weighted lists.

Accepted Answer

A) True 
 B)False

Question 5

The edges of a graph are ____________________ if the existence of an edge from A to B does not necessarily guarantee that there is a path in both directions.

Accepted Answer

The answer of The edges of a graph are ____________________...

Exam 10: Graphs

The ____________________ matrix uses a two-dimensional array to represent the graph.

Correct Answer
verified

The edges of a graph are ____________________ if the existence of an edge from A to B does not necessarily guarantee that there is a path in both directions.

Correct Answer
verified

Edges can be represented by an array of lists called weighted lists.

Correct Answer
verified

The cost of a(n) ____ is the sum of the weights of the edges.

Correct Answer
verified

In a breadth first search, the nodes that are lower down in the picked-up graph are visited before nodes that are higher up in the graph.

Correct Answer
verified

Exam 10: Graphs

The ____________________ matrix uses a two-dimensional array to represent the graph.

Correct AnswerverifiedShow Answer

The edges of a graph are ____________________ if the existence of an edge from A to B does not necessarily guarantee that there is a path in both directions.

Correct AnswerverifiedShow Answer

Edges can be represented by an array of lists called weighted lists.

Correct AnswerverifiedShow Answer

The cost of a(n) ____ is the sum of the weights of the edges.

Correct AnswerverifiedShow Answer

In a breadth first search, the nodes that are lower down in the picked-up graph are visited before nodes that are higher up in the graph.

Correct AnswerverifiedShow Answer

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified

Correct Answer
verified