Question

A graph in which each edge is assigned a non-negative number (weight) is known as _____________ tree.​

Answer 1

Answer:

Hi

Step-by-step explanation:

A graph in which each edge is assigned a non- negative number (weight) is known as Minimum Spanning Tree

Answer 2

Answer:

The answer is minimum spanning.

Step-by-step explanation:

A subset of the edges of a connected , edge - weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge is a minimum spanning tree .

                          And thus a graph in which each edge is assigned a non-negative number (weight) is known as minimum spanning tree.