mirror of https://gitee.com/bigwinds/arangodb
31 lines
984 B
Plaintext
31 lines
984 B
Plaintext
!CHAPTER Graphs
|
|
|
|
A Graph consists of vertices and edges. The vertex collection contains the
|
|
documents forming the vertices. The edge collection contains the documents
|
|
forming the edges. Together both collections form a graph. Assume that the
|
|
vertex collection is called `vertices` and the edges collection `edges`, then
|
|
you can build a graph using the Graph constructor.
|
|
|
|
arango> var Graph = require("org/arangodb/graph").Graph;
|
|
|
|
arango> g1 = new Graph("graph", "vertices", "edges");
|
|
Graph("vertices", "edges")
|
|
|
|
<!--
|
|
@verbinclude graph25
|
|
-->
|
|
|
|
It is possible to use different edges with the same vertices. For instance, to
|
|
build a new graph with a different edge collection use
|
|
|
|
arango> var Graph = require("org/arangodb/graph").Graph;
|
|
|
|
arango> g2 = new Graph("graph", "vertices", "alternativeEdges");
|
|
Graph("vertices", "alternativeEdges")
|
|
|
|
<!--
|
|
@verbinclude graph26
|
|
-->
|
|
It is, however, impossible to use different vertices with the same edges. Edges
|
|
are tied to the vertices.
|