gistfile1.sql

match (c1:City {name: "New York"}),
      (c2:City {name: "Seattle"}),
      p = allShortestPaths((c2)-[*]-(c1))
return distinct reduce(routeDesc = "", n in nodes(p) |
                       routeDesc + n.name + " -> ") as routeDesc,
                reduce(totalCost = 0, r in relationships(p) |
                       totalCost + r.cost) as routeCost;

/*
+---------------------------------------------------------------------------------------------+
| routeDesc                                                                       | routeCost |
+---------------------------------------------------------------------------------------------+
| "Seattle -> Helena -> Duluth -> Toronto -> Montreal -> New York -> "            | 24        |
| "Seattle -> Helena -> Winnipeg -> Sault St. Marie -> Montreal -> New York -> "  | 24        |
| "Seattle -> Calgary -> Winnipeg -> Sault St. Marie -> Montreal -> New York -> " | 24        |
| "Seattle -> Helena -> Duluth -> Sault St. Marie -> Montreal -> New York -> "    | 23        |
| "Seattle -> Helena -> Omaha -> Chicago -> Pittsburgh -> New York -> "           | 20        |
| "Seattle -> Helena -> Duluth -> Chicago -> Pittsburgh -> New York -> "          | 20        |
+---------------------------------------------------------------------------------------------+
*/