AQL EDGES，NEIGHBORS等与GRAPH_EDGES，GRAPH_NEIGHBORS有什么区别

Question

In ArangoDB, there seem to be two set of functions for working with graphs. One one side you have EDGES , NEIGHBORS , TRAVERSAL , SHORTEST_PATH and more ( https://docs.arangodb.com/Aql/GraphFunctions.html ).

OTOH there are the graph operations ( https://docs.arangodb.com/Aql/GraphOperations.html ) that seems to have the same functions prefixed by GRAPH and with some different parameters, such as GRAPH_EDGES , GRAPH_NEIGHBORS , GRAPH_TRAVERSAL , GRAPH_SHORTEST_PATH .

What is the difference between these. Are they used in different scenarios? Are there performance differences, etc?

Answer 1

There is no general recommendation which to choose over the other - it depends on your requirements.

The EDGES functions may work on collections that are not managed by the graph module, and thus may not be visible in the graph viewer (but you may use them on collections that are also managed). It however has lesser overhead by not doing graph management.

The GRAPH_EDGES family is the more recent implementation. It only works on managed graphs that you can also browse in the graph viewer . As you already noted, the later have many more options to ie filter the graphs by examples etc.

With ArangoDB 3 the GRAPH_* family of functions was removed. We explain in this cookbook how their functionality can be achieved with AQL in ArangoDB 3.