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

minor docu fixes

This commit is contained in:
scottashton 2014-06-23 14:42:38 +02:00
parent 7efc5b77cf
commit da1cb2e62d
2 changed files with 7 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
Documentation/Books/Users/General-Graphs/Functions.mdpp
View File

@ -1,6 +1,11 @@
!CHAPTER Graph Functions !CHAPTER Graph Functions
This chapter describes various functions on a graph. This chapter describes various functions on a graph.
A lot of these accept a vertex (or edge) example as parameter as defined in the next section.
!SECTION Definition of examples
@startDocuBlock JSF_general_graph_example_description
!SECTION Get vertices from edges. !SECTION Get vertices from edges.

4
Documentation/Books/Users/General-Graphs/Management.mdpp
View File

@ -1,6 +1,6 @@
!CHAPTER Graph Management !CHAPTER Graph Management
In order to create a graph the philosophy of handling the graph content has to introduced. In order to create a graph the philosophy of handling the graph content has to be introduced.
A graph contains a set of edge definitions each referring to one edge collection and A graph contains a set of edge definitions each referring to one edge collection and
defining constraints on the vertex collections used as start and end points of the edges. defining constraints on the vertex collections used as start and end points of the edges.
Furthermore a graph can contain an arbitrary amount of vertex collections, called orphan collections, that are not used in any edge definition but should be managed by the graph. Furthermore a graph can contain an arbitrary amount of vertex collections, called orphan collections, that are not used in any edge definition but should be managed by the graph.
@ -28,7 +28,7 @@ The edge definitions for a graph is an Array containing arbitrary many directed
!SUBSECTION Orphan Collections !SUBSECTION Orphan Collections
Each graph has an orphan collection. It consists of arbitrary many vertex collection (type *document*), that are not Each graph can have an arbitrary amount of orphan collections. These are vertex collections (type *document*), that are not
used in an edge definition of the graph. If the graph is extended with an edge definition using one of the orphans, used in an edge definition of the graph. If the graph is extended with an edge definition using one of the orphans,
it will be removed from the orphan collection automatically. it will be removed from the orphan collection automatically.