educative.io

Minimum Spanning Tree - Coderust: Hacking the Coding Interview

The problem stated we are finding a mst in an undirected graph.
But the solution and the test actually shows a directed graph.
for example: 1->2(3, false)
if it is a undirected graph, it should have another edge 2->1(3, false)