Urban road network optimal restoration sequence scheme based on greedy algorithm

The invention discloses an urban road network optimal restoration sequence scheme based on a greedy algorithm. The method comprises the steps of: a, obtaining a set of roads to be restored in a known road network; b, defining importance discrimination indexes from the aspect of road network restoration; c, calculating importance discrimination indexes of each road in set of roads to be restored; d, utilizing a greedy selection idea to restore the most important road in the set of roads to be restored; e, repeating the steps c and d on residual roads to be restored until the set of roads to be restored is empty because after one road in the road network is restored, the state of the road network is changed, and importance discrimination indexes of the roads change too; and f, outputting a road restoration sequence, wherein the sequence is the optimal restoration sequence, and the obtained restoration sequence scheme is the optimal restoration sequence scheme of the road network. The applicability of the greedy algorithm to the road network optimal restoration sequence problem is theoretically proved, and by adopting the greedy algorithm, a large amount of tedious calculation is avoided, the efficiency is high, and the result has important guiding significance to urban road network optimal restoration in real life.