Package com.orientechnologies.orient.graph.sql.functions
| Class | Description |
|---|---|
| OGraphFunctionFactory | |
| 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 |
Gets the incoming and outgoing Vertices of current Vertex.
|
| OSQLFunctionBothE |
Gets the incoming and outgoing Edges of current Vertex.
|
| OSQLFunctionBothV |
Gets the incoming and outgoing Vertices of current Edge.
|
| OSQLFunctionDijkstra |
Dijkstra's algorithm describes how to find the cheapest path from one node to another node in a directed weighted graph.
|
| OSQLFunctionGremlin |
Executes a GREMLIN expression as function of SQL engine.
|
| OSQLFunctionHeuristicPathFinderAbstract |
Abstract class to find paths between nodes using heuristic .
|
| OSQLFunctionIn |
Gets the incoming Vertices of current Vertex.
|
| OSQLFunctionInE |
Gets the incoming Edges of current Vertex.
|
| OSQLFunctionInV |
Gets the incoming Vertex of current Edge.
|
| OSQLFunctionLabel |
Hi-level function that return the label for both edges and vertices.
|
| OSQLFunctionMove |
Hi-level function to move inside a graph.
|
| OSQLFunctionMoveFiltered | |
| OSQLFunctionOut |
Gets the outgoing Vertices of current Vertex.
|
| OSQLFunctionOutE |
Gets the outgoing Edges of current Vertex.
|
| OSQLFunctionOutV |
Gets the outgoing Vertex of current Edge.
|
| 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–2016 Orient Technologies. All rights reserved.