
| Class | Description |
|---|---|
| OSQLFunctionAstar |
A*'s algorithm describes how to find the cheapest path from one node to another node in a
directed weighted graph with husrestic function.
|
| OSQLFunctionBoth |
Created by luigidellaquila on 03/01/17.
|
| OSQLFunctionBothE |
Created by luigidellaquila on 03/01/17.
|
| OSQLFunctionBothV |
Created by luigidellaquila on 03/01/17.
|
| OSQLFunctionDijkstra |
Dijkstra's algorithm describes how to find the cheapest path from one node to another node in a
directed weighted graph.
|
| OSQLFunctionHeuristicPathFinderAbstract |
Abstract class to find paths between nodes using heuristic .
|
| OSQLFunctionIn |
Created by luigidellaquila on 03/01/17.
|
| OSQLFunctionInE |
Created by luigidellaquila on 03/01/17.
|
| OSQLFunctionInV |
Created by luigidellaquila on 03/01/17.
|
| OSQLFunctionMove |
Created by luigidellaquila on 03/01/17.
|
| OSQLFunctionMoveFiltered |
Created by luigidellaquila on 03/01/17.
|
| OSQLFunctionOut |
Created by luigidellaquila on 03/01/17.
|
| OSQLFunctionOutE |
Created by luigidellaquila on 03/01/17.
|
| OSQLFunctionOutV |
Created by luigidellaquila on 03/01/17.
|
| OSQLFunctionPathFinder |
Abstract class to find paths between nodes.
|
| OSQLFunctionShortestPath |
Shortest path algorithm to find the shortest path from one node to another node in a directed
graph.
|
| Enum | Description |
|---|---|
| HeuristicFormula |
Heuristic formula enum.
|
Copyright © 2009–2025 OrientDB. All rights reserved.