method Graph.prototype.shortestPathimport { Graph } from "https://deno.land/x/darango@0.1.6/mod.ts"; shortestPath<T>(startVertex: string,endVertex: string,direction: "OUTBOUND" | "INBOUND" | "ANY",): ArangoCursor<DocumentData<T>>Find the shortest path between a start and end vertex node. Type ParametersTParametersstartVertex: stringThe vertex node to start at. endVertex: stringThe vertex node to end at. direction: "OUTBOUND" | "INBOUND" | "ANY"The direction to follow from the starting node. ReturnsArangoCursor<DocumentData<T>>A cursor over returned vertices.