Then, a maximum spanning tree T q of the graph is calculated starting from vertex q (see the bold edges in Figure 4(e)).
t q will include all the infinite-weight edges from q to its direct descendants, namely, the hubs.