private IEnumerable <Edge> GetMinimumSpanningTreeEdgesBad(Dictionary <char, List <Edge> > g) { var h = new BinaryMinHeap <char>(); var vte = new Dictionary <char, Edge>(); // Fill Heap var isFirst = true; foreach (char key in g.Keys) { if (isFirst) { h.Add(new BinaryMinHeap <char> .Node { Id = key, Weight = 0 }); isFirst = false; } else { h.Add(new BinaryMinHeap <char> .Node { Id = key, Weight = int.MaxValue }); } } var result = new List <Edge>(); while (h.HasItem()) { var v = h.ExtractMinimum(); vte.TryGetValue(v.Id, out Edge ste); if (ste != null) { result.Add(ste); } foreach (Edge e in g[v.Id]) { char adj = e.V2; if (!h.Contains(adj)) { continue; } var node = h.GetNode(adj); if (node.Weight > e.Weight) { node.Weight = e.Weight; h.Decrease(node); if (!vte.ContainsKey(node.Id)) { vte.Add(node.Id, e); } vte[node.Id] = e; } } } return(result); }