Hawkin
/
arangodb
mirror of https://gitee.com/bigwinds/arangodb
1
0
Fork 0
Code Issues Projects Releases Wiki Activity

Docs: adds links to AQL traversal for anonymous graphs

This commit is contained in:
Simran Brucherseifer 2016-09-28 16:38:21 +02:00
parent 1fbd043893
commit 7366ef3982
1 changed files with 4 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
Documentation/Books/Manual/Graphs/README.mdpp
View File

@ -51,6 +51,10 @@ You may use anonymous graphs in the [traversals](Traversals/README.md) and in th
Anonymous graphs don't have *edge definitions* describing which *vertex collection* is connected by which *edge collection*. The graph model has to be maintained in the client side code. Anonymous graphs don't have *edge definitions* describing which *vertex collection* is connected by which *edge collection*. The graph model has to be maintained in the client side code.
This gives you more freedom than the strict *named graphs*. This gives you more freedom than the strict *named graphs*.
- [AQL Graph Operations](../../AQL/Graphs/index.html) are available for both, named and anonymous graphs:
- [AQL Traversals](../../AQL/Graphs/Traversals.html)
- [AQL Shortest Path](../../AQL/Graphs/ShortestPath.html)
!SUBSUBSECTION When to choose anonymous or named graphs? !SUBSUBSECTION When to choose anonymous or named graphs?
As noted above, named graphs ensure graph integrity, both when inserting or removing edges or vertices. As noted above, named graphs ensure graph integrity, both when inserting or removing edges or vertices.