文件名称:交通配流编程
介绍说明－－下载内容均来自于网络，请自行研究使用
包含最短路径算法，用户均衡交通流分配，以及包含大型测试网络(Contains the shortest path algorithm, user equilibrium traffic flow assignment, and contains large test networks)
(系统自动生成,下载前可以参看下载内容)
下载文件列表
交通配流编程\FW算法\4Frank-Wolfe方法.pdf
交通配流编程\FW算法\新建文本文档.txt
交通配流编程\shortest path algorithm\Dijkstra.m
交通配流编程\shortest path algorithm\example.m
交通配流编程\shortest path algorithm\matrix data.xls
交通配流编程\shortest path algorithm\matrix data2.xls
交通配流编程\shortest path algorithm\SiouxFalls\Sioux-Falls-Network.doc
交通配流编程\shortest path algorithm\SiouxFalls\SiouxFalls.flow
交通配流编程\shortest path algorithm\SiouxFalls\SiouxFalls_net\SiouxFalls_net.txt
交通配流编程\shortest path algorithm\SiouxFalls\SiouxFalls_net\SiouxFalls_net.xlsx
交通配流编程\shortest path algorithm\SiouxFalls\SiouxFalls_node\SiouxFalls_node.txt
交通配流编程\shortest path algorithm\SiouxFalls\SiouxFalls_travel_time.txt
交通配流编程\shortest path algorithm\SiouxFalls\SiouxFalls_trips\SiouxFalls_trips.txt
交通配流编程\shortest path algorithm\SiouxFalls\SiouxFalls_trips\SiouxFalls_trips.xlsx
交通配流编程\UE\1.xls
交通配流编程\UE\book.m
交通配流编程\UE\Dijkstra.m
交通配流编程\UE\example1.m
交通配流编程\UE\example2.m
交通配流编程\UE\example3.m
交通配流编程\最短路径算法\Dijk.m
交通配流编程\最短路径算法\floyd.m
交通配流编程\最短路径算法\floyd1.m
交通配流编程\最短路径算法\floyd4.m
交通配流编程\最短路径算法\kkk.m
交通配流编程\最短路径算法\wen1.m
交通配流编程\shortest path algorithm\SiouxFalls\SiouxFalls_net
交通配流编程\shortest path algorithm\SiouxFalls\SiouxFalls_node
交通配流编程\shortest path algorithm\SiouxFalls\SiouxFalls_trips
交通配流编程\shortest path algorithm\SiouxFalls
交通配流编程\FW算法
交通配流编程\shortest path algorithm
交通配流编程\UE
交通配流编程\最短路径算法
交通配流编程
交通配流编程\FW算法\新建文本文档.txt
交通配流编程\shortest path algorithm\Dijkstra.m
交通配流编程\shortest path algorithm\example.m
交通配流编程\shortest path algorithm\matrix data.xls
交通配流编程\shortest path algorithm\matrix data2.xls
交通配流编程\shortest path algorithm\SiouxFalls\Sioux-Falls-Network.doc
交通配流编程\shortest path algorithm\SiouxFalls\SiouxFalls.flow
交通配流编程\shortest path algorithm\SiouxFalls\SiouxFalls_net\SiouxFalls_net.txt
交通配流编程\shortest path algorithm\SiouxFalls\SiouxFalls_net\SiouxFalls_net.xlsx
交通配流编程\shortest path algorithm\SiouxFalls\SiouxFalls_node\SiouxFalls_node.txt
交通配流编程\shortest path algorithm\SiouxFalls\SiouxFalls_travel_time.txt
交通配流编程\shortest path algorithm\SiouxFalls\SiouxFalls_trips\SiouxFalls_trips.txt
交通配流编程\shortest path algorithm\SiouxFalls\SiouxFalls_trips\SiouxFalls_trips.xlsx
交通配流编程\UE\1.xls
交通配流编程\UE\book.m
交通配流编程\UE\Dijkstra.m
交通配流编程\UE\example1.m
交通配流编程\UE\example2.m
交通配流编程\UE\example3.m
交通配流编程\最短路径算法\Dijk.m
交通配流编程\最短路径算法\floyd.m
交通配流编程\最短路径算法\floyd1.m
交通配流编程\最短路径算法\floyd4.m
交通配流编程\最短路径算法\kkk.m
交通配流编程\最短路径算法\wen1.m
交通配流编程\shortest path algorithm\SiouxFalls\SiouxFalls_net
交通配流编程\shortest path algorithm\SiouxFalls\SiouxFalls_node
交通配流编程\shortest path algorithm\SiouxFalls\SiouxFalls_trips
交通配流编程\shortest path algorithm\SiouxFalls
交通配流编程\FW算法
交通配流编程\shortest path algorithm
交通配流编程\UE
交通配流编程\最短路径算法
交通配流编程