why are my nodes not printing from the greatest to the smallest? what is wrong with my code? private class NodeComparator implements Comparator $\{$

@Override

public int compare$($Node node$1,$ Node node$2)\{$

return node$1.$getIncomingEdges$().$size$()-$ node$2.$getIncomingEdges$().$size$()$; $\}$ private void runDelivA$()\{$

List indegrees $=$ graph.getNodeList$()$;

indegrees.sort$($new NodeComparator$())$;

System.out.println$("$Indegree:$")$;

for$($Node n:graph.getNodeList$())\{$

System.out.println$($n$)$;

$\}$

$//$

$\}$