def nodes_by_betweenness(self, treshold=<NUM_LIT:0.0>):
nodes = [(n.betweenness, n) for n in self.nodes if n.betweenness > treshold]<EOL>nodes.sort(); nodes.reverse()<EOL>return [n for w, n in nodes]<EOL>
Returns nodes sorted by betweenness centrality.
        Nodes with a lot of passing traffic will be at the front of the list.