Multiple research problems based on graph and network analysis
Yonglin Xu · 2013
Dijkstra algorithm, under different constraints, starting from Zhengzhou, research visits to capital cities and municipalities in the country after he returned to the starting point of the optimal path of Zhengzhou. and use approximation algorithms to find approximate optimal solution. The path of the weighted graph problem definition of a balanced group to measure the degree of grouping of the balance.