Python

MUST USE PRIORITY QUEUE

def prims(graph, start_node): """ ------------------------------------------------------- Applies Prim's Algorithm to a graph. Use: edges, total = prims(graph, node) ------------------------------------------------------- Parameters: graph - graph to evaluate (Graph) start_node - name of node to start evaluation from (str) Returns: edges - the list of the edges traversed (list of Edge) total - total distance of all edges traversed (int) -------------------------------------------------------