The most important stages to achieve the calculation of bandwidth in the branches of a graph are: creating the graph and measuring the distances between nodes, calculating the SEI, calculating the traffic for each city, calculating the intercity traffic (traffic matrix), implementation of the algorithm for finding the shortest path, calculation of Erlang in the branches that connect cities, calculation of bandwidth in the main branches (Ahmedi, 2014).