Map<Side, Graph> m = new HashMap<Side, Graph>(); Comparator<Entry<Side, Graph>> comp = new Comparator<Entry<Side, Graph>>() { @Override public int compare(Entry<Side, Graph> o1, Entry<Side, Graph> o2) { int result = 0; // compare & compare~~ return result; } }; Set<Entry<Side, Graph>> set = new TreeSet<Entry<Side, Graph>>(comp); set.addAll(m.entrySet());或许你可以考虑上面这样……
问题是:怎么在class MyComparator implements Comparator中搞出Graph的值?
Comparator<Entry<Side, Graph>> comp = new Comparator<Entry<Side, Graph>>() { @Override
public int compare(Entry<Side, Graph> o1, Entry<Side, Graph> o2) {
int result = 0;
// compare & compare~~
return result;
}
};
Set<Entry<Side, Graph>> set = new TreeSet<Entry<Side, Graph>>(comp);
set.addAll(m.entrySet());或许你可以考虑上面这样……