This is an algorithm to determine the district which is most prominent or important in terms of transportations. The mathematical concept used for the algorithm is Betweenees Centrality.
Input: The graph of the state assuming the length of the neighbour district is 1.
Output: Betweeneess centrality of all districts.