Question

我正在开发路径查找器AngularJS应用程序，该应用程序从用户From，To和搜索类型（最便宜或最快）获取3个输入，并且应该找到完整的连续路径从城市到另一个给定JSON文件，其中数据看起来像< / p>

 {
"currency": "EUR",
"deals": [{
    "transport": "train",
    "departure": "London",
    "arrival": "Amsterdam",
    "duration": {
        "h": "05",
        "m": "00"
    },
    "cost": 160,
    "discount": 0,
    "reference": "TLA0500"
}, {
    "transport": "bus",
    "departure": "London",
    "arrival": "Amsterdam",
    "duration": {
        "h": "07",
        "m": "45"
    },
    "cost": 40,
    "discount": 25,
    "reference": "BLA0745"
}, {
    "transport": "car",
    "departure": "London",
    "arrival": "Amsterdam",
    "duration": {
        "h": "04",
        "m": "45"
    },
    "cost": 120,
    "discount": 0,
    "reference": "CLA0445"
}, {
    "transport": "train",
    "departure": "London",
    "arrival": "Paris",
    "duration": {
        "h": "04",
        "m": "30"
    },"cost": 160,
    "discount": 0,
    "reference": "TLP0430"
}, {
    "transport": "bus",
    "departure": "London",
    "arrival": "Paris",
    "duration": {
        "h": "05",
        "m": "30"
    },
    "cost": 40,
    "discount": 50,
    "reference": "BLP0530"
}, {
    "transport": "car",
    "departure": "London",
    "arrival": "Paris",
    "duration": {
        "h": "04",
        "m": "15"
    },
    "cost": 120,
    "discount": 0,
    "reference": "CLP0415"
},...

该计划应该采取例如：从：伦敦到：莫斯科搜索类型：最便宜并且搭乘列车从伦敦 - >巴黎100 $ 巴黎 - >柏林90美元乘巴士......等到莫斯科我正在考虑使用Dijkstra算法，但我想知道如何使用它，而我们可能有多个选项从一个城市到另一个城市，这意味着多个边缘具有不同的值，如公共汽车时间和飞机时间的一个！

最便宜或最快的路径算法

0 个答案: