基于HashMap-java的最小生成树

给定HashMap“mMap”中边权重升序的输出

使用：

private Map<String, Integer> mMap = new HashMap<String, Integer>();

public void addKeysAndValue(String from, int value) {    
            mMap.put(from, value);
}

for (int i = 0; i < list_from.size() - 1; i++) {
    if (list_dest.get(i + 1).equals(list_from.get(i))) {
        addKeysAndValue(list_from.get(i) + "_" + list_dest.get(i), w_arc.get(i));
    }
}

sorted_map.putAll(mMap);    
Iterator iter = sorted_map.entrySet().iterator();
while (iter.hasNext()) {

            Map.Entry me = (Map.Entry) iter.next();    
            System.out.println(me.getKey() + " : " + me.getValue());    
}

我真的很感谢你的帮助

private Map<String, Integer> mMap = new HashMap<String, Integer>();

public void addKeysAndValue(String from, int value) {    
            mMap.put(from, value);
}

for (int i = 0; i < list_from.size() - 1; i++) {
    if (list_dest.get(i + 1).equals(list_from.get(i))) {
        addKeysAndValue(list_from.get(i) + "_" + list_dest.get(i), w_arc.get(i));
    }
}

sorted_map.putAll(mMap);    
Iterator iter = sorted_map.entrySet().iterator();
while (iter.hasNext()) {

            Map.Entry me = (Map.Entry) iter.next();    
            System.out.println(me.getKey() + " : " + me.getValue());    
}

v6_v5 : 3
v5_v4 : 4
v5_v3 : 5
v4_v2 : 6
v1_v2 : 6