Idk hi what’s up with y’all and josh
Answer:
Step-by-step explanation:
In the equation of a straight line (when the equation is written as "y = mx + b"), the slope is the number "m" that is multiplied on the x, and "b" is the y-intercept (that is, the point where the line crosses the vertical y-axis).
Answer:
39
Step-by-step explanation:
Kruskal's Algorithm has you add edges in order of weight, from least to greatest, excluding edges that form loops, until all nodes are connected.
__
Here, the edges have weights ...
5 -- AD, CE
6 -- DF
7 -- AB, BE
8 -- BC, EF
9 -- BD, EG
11 -- FG
15 -- DE
The edges shown in bold are ones that can be added without creating loops. Their total weight is 5×2 +6 +7×2 +9 = 39.
The weight of the minimum spanning tree is 39.
Answer:
9
Step-by-step explanation:
