title: Prim Algorithm optimized for known edge weights?
body: <p>How can you modify prim's algorithm in the case where you already know the minimum value of any given weight? For example if a graph consists of edge weights 0 and 1, how can you make prim's algorithm faster?</p>