Why is RAMBUNCTIOUSLY THERMODYNAMICS True but AB CC is not?

I assumed the Q meant each letter in a can only map to one other letter in b. E.g: A -> B or D -> Z but NOT: A -> B and Z -> B.

Cant submit

carry on repeating the operation in the description until all the numbers are equal.

I feel as if this should be 6kyu due to the fact that you have to take into account runtime complexity.

Im also confused. When you say lowest hanging, do you mean least hanging, because you said an edge of 1 is lower hanging than 5 but I assumed the edge with the greatest weight to hang the lowest down as you said it's like picking up the start node. Just wondering.

graph = {'node_0': {'node_1': 5, 'node_2': 1},
'node_1': {'node_0': 5, 'node_2': 10},
'node_2': {'node_0': 1, 'node_0': 10}}

node_2 is connected to node_0 twice. Is this a mistake?
I think it's meant to be node_1.

When I did the test cases, the function was called manhattan not manhattan_distance and I had to change the func name. Not sure if it's always the case.

TEST 2 => [9.98, 8.56, 4.62, 1.16, 0.26, 0.37, 0.32, 1.02, 1.02, 0.99, 1.41, 2.35]

                                                             0.99, 1.41, 2.35 => consecutive increase of 3

The test expects False but it should be True.

How does this actually work? Im not too sure what I did but it looks sad! It only passed 104 tests. I clicked attempt again w/o changing the code and it passed 105, then clicked attempt again and it passed all tests w/o me changing a single line. How? not sure if this even actually works or if it was a bug.