搜索资源列表
换乘问题
- 本程序的主要功能为求最小乘车路径问题-the main functions of the procedures for the sake of the smallest travel routing problem
zhoumao
- 换乘次数最少是乘客出行时考虑的首要因素。描述了传 统的Dijkstra 算法,并分析了Dijkstra 算法不适合公交网络最优路径选择的原因。最后根据公交乘客可以步行小段 距离再转车的实际情况,提出一种基于换乘次数最少的公交最短路径改进算-takes the least number of passenger trips is considered the primary factor. Descr iption of the traditional Dijkstra algorithm
renrui
- 用c++编写的公交最小换乘次数的算法，基于dijkstra算法-Prepared using c++ bus minimal transfer times of algorithms, based on dijkstra algorithm
Min-timeTake-the-bus-
- 乘公交，看奥运，数模题目算法，在一个网络中求解，最小换乘次数-Take the bus to see the Olympic Games, the digital-to-analog topics algorithm in a network to solve the minimal transfer times
huawei
- 华为上机题目，包括灯亮盏数、地铁换乘、最大最小值、括号匹配、回文数、将第一行中含有第二行中“23”的数输出并排序-Huawei computer subject, including the light lamp, transit, maximum minimum, parentheses matching, palindrome, will be the first line contains 23 the number of output in the second row and so