@Q:
FOR p IN OUTBOUND K_SHORTEST_PATHS 'places/Aberdeen' TO 'places/London'
GRAPH 'kShortestPathsGraph'
LIMIT 3
RETURN {
places: p.vertices[*].label,
travelTimes: p.edges[*].travelTime,
travelTimeTotal: SUM(p.edges[*].travelTime)
}
@R
[
{
"places": [
"Aberdeen",
"Leuchars",
"Edinburgh",
"York",
"London"
],
"travelTimes": [
1.5,
1.5,
3.5,
1.8
],
"travelTimeTotal": 8.3
},
{
"places": [
"Aberdeen",
"Leuchars",
"Edinburgh",
"York",
"Carlisle",
"Birmingham",
"London"
],
"travelTimes": [
1.5,
1.5,
3.5,
3.5,
2,
1.5
],
"travelTimeTotal": 13.5
},
{
"places": [
"Aberdeen",
"Leuchars",
"Edinburgh",
"Glasgow",
"Carlisle",
"York",
"London"
],
"travelTimes": [
1.5,
1.5,
1,
1,
2.5,
1.8
],
"travelTimeTotal": 9.3
}
]