tokens: Instead of constructing a minimum spanning tree ( MST ) or a shortest path tree ( SPT ) with no cycles on the graph ; our procedure constructs a spanning subgraph whose edges are chosen based on their modularity .