算法流程及实验数据均根据《基于起讫点的均衡交通分配算法》，其中求最短路一共写了两种，一是Dijkstra,另一种是矩阵法放在test及其他文件内，主程序未采用
资源文件列表
undergraduate thesis_by lee_DMU/Dijkstra.m , 1878
undergraduate thesis_by lee_DMU/frank_wolf.m , 5216
undergraduate thesis_by lee_DMU/ifexsit.m , 1351
undergraduate thesis_by lee_DMU/oldloadflow.m , 1002
undergraduate thesis_by lee_DMU/Regions.csv , 27
undergraduate thesis_by lee_DMU/solve_step_length.m , 1083
undergraduate thesis_by lee_DMU/target_fval.m , 516
undergraduate thesis_by lee_DMU/test/Dijkstra.m , 1878
undergraduate thesis_by lee_DMU/test/ifexsit.m , 1351
undergraduate thesis_by lee_DMU/test/oldloadflow.m , 1002
undergraduate thesis_by lee_DMU/test/Regions.csv , 27
undergraduate thesis_by lee_DMU/test/solve_step_length.m , 514
undergraduate thesis_by lee_DMU/test/target_fval.m , 187
undergraduate thesis_by lee_DMU/test/test.m , 5313
undergraduate thesis_by lee_DMU/test/test_ODBFW.m , 105
undergraduate thesis_by lee_DMU/test/update_q_path.asv , 708
undergraduate thesis_by lee_DMU/test/update_q_path.m , 788
undergraduate thesis_by lee_DMU/test/update_weight.m , 197
undergraduate thesis_by lee_DMU/test/数据表.xlsx , 10978
undergraduate thesis_by lee_DMU/test_ODBFW.m , 105
undergraduate thesis_by lee_DMU/test及其他/minpath.m , 813
undergraduate thesis_by lee_DMU/test及其他/test.m , 397
undergraduate thesis_by lee_DMU/update_q_path.asv , 708
undergraduate thesis_by lee_DMU/update_q_path.m , 788
undergraduate thesis_by lee_DMU/update_weight.m , 394
undergraduate thesis_by lee_DMU/数据表.xlsx , 10978