A graph with integer weights or costs associated with edges is sometimes called a(n) _________________.
A) acyclic graph
B) directed graph
C) network
D) adjacency matrix
E) none of the above

Name: A graph with integer weights or costs associated with edges is sometimes called a(n) _________________. A) acyclic graph B) directed graph C) network D) adjacency matrix E) none of the above
Brand: Quizplus
Rating: 4.8 (29 reviews)

Question

Quizplus · Accepted Answer

A weighted graph is sometimes referred to as a network.

A Graph with Integer Weights or Costs Associated with Edges