Dijkstra's algorithm describes how to find the cheapest path from one node to another node in a directed weighted graph.
The first parameter is source record. The second parameter is destination record. The third parameter is a name of property that
If property is not defined in edge or is null, distance between vertexes are 0.
- Luca Garulli (l.garulli--at--orientechnologies.com)
if (OMultiValue.getSize(source) > 1)
return "dijkstra(<sourceVertex>, <destinationVertex>, <weightEdgeFieldName>, [<direction>])";
if (fieldValue instanceof Float)
return (Float) fieldValue;
else if (fieldValue instanceof Number)