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

spellchecked gitbook for general-graph and ahuacatl

This commit is contained in:
scottashton 2014-06-23 13:34:44 +02:00
parent 8b347c6714
commit 371bfabf67
3 changed files with 7 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
Documentation/Books/Users/Aql/GraphOperations.mdpp
View File

@ -14,7 +14,7 @@ the examples.
!SUBSECTION Edges and Vertices related functions.
This section describes various AQL functions which can be used to recieve information about the graph's vertices, edges, neighbor relationship and shared properties.
This section describes various AQL functions which can be used to receive information about the graph's vertices, edges, neighbor relationship and shared properties.
!SUBSUBSECTION GRAPH_EDGES

14
js/common/modules/org/arangodb/general-graph.js
View File

@ -1547,15 +1547,15 @@ var _extendEdgeDefinitions = function (edgeDefinition) {
/// The creation of a graph requires the name of the graph and a definition of its edges.
///
/// For every type of edge definition a convenience method exists that can be used to create a graph.
/// Optionaly a list of vertex collections can be added, which are not used in any edge definition.
/// These collections are refered to as orphan collections within this chapter.
/// Optionally a list of vertex collections can be added, which are not used in any edge definition.
/// These collections are referred to as orphan collections within this chapter.
/// All collections used within the creation process are created if they do not exist.
///
/// *Parameter*
///
/// * *graphName*: Unique identifier of the graph
/// * *edgeDefinitions* (optional): List of relation definition objects
/// * *orphanCollections* (optional): List of additonal vertex collection names
/// * *orphanCollections* (optional): List of additional vertex collection names
///
/// *Examples*
///
@ -1664,7 +1664,6 @@ var _create = function (graphName, edgeDefinitions, orphanCollections) {
'edgeDefinitions' : edgeDefinitions,
'_key' : graphName
});
require("internal").print("precreate");
return new Graph(graphName, edgeDefinitions, collections[0], collections[1], orphanCollections);
};
@ -1790,7 +1789,6 @@ var bindEdgeCollections = function(self, edgeCollections) {
var bindVertexCollections = function(self, vertexCollections) {
_.each(vertexCollections, function(key) {
require("internal").print("each resolved");
var obj = db._collection(key);
var result;
var wrap = wrapCollection(obj);
@ -1884,7 +1882,6 @@ var updateBindCollections = function(graph) {
bindVertexCollections(graph, edgeDef.to);
}
);
require("internal").print("preVertex");
bindVertexCollections(graph, graph.__orphanCollections);
};
@ -2115,7 +2112,6 @@ var Graph = function(graphName, edgeDefinitions, vertexCollections, edgeCollecti
createHiddenProperty(this, "__idsToRemove", []);
createHiddenProperty(this, "__collectionsToLock", []);
createHiddenProperty(this, "__orphanCollections", orphanCollections);
require("internal").print("preBind");
updateBindCollections(self);
};
@ -2229,7 +2225,7 @@ var checkIfMayBeDropped = function(colName, graphName, graphs) {
/// *Remove a graph*
///
/// A graph can be dropped by its name.
/// This will automatically drop al collections contained in the graph as
/// This will automatically drop all collections contained in the graph as
/// long as they are not used within other graphs.
/// To drop the collections, the optional parameter *drop-collections* can be set to *true*.
///
@ -3126,7 +3122,7 @@ Graph.prototype._eccentricity = function(options) {
/// g._absoluteCloseness({}, {weight : 'distance'});
/// @END_EXAMPLE_ARANGOSH_OUTPUT
///
/// A route planner example, the absolute closeness of all germanCities regarding only
/// A route planner example, the absolute closeness of all german Cities regarding only
/// outbound paths.
///
/// @EXAMPLE_ARANGOSH_OUTPUT{generalGraphModuleAbsCloseness3}

2
js/server/modules/org/arangodb/ahuacatl.js
View File

@ -5503,7 +5503,7 @@ function GRAPH_TRAVERSAL_TREE (vertexCollection,
/// ).toArray();
/// @END_EXAMPLE_ARANGOSH_OUTPUT
///
/// A route planner example, distance from Hambug and Cologne to Lyon:
/// A route planner example, distance from Hamburg and Cologne to Lyon:
///
/// @EXAMPLE_ARANGOSH_OUTPUT{generalGraphDistanceTo2}
/// ~ var db = require("internal").db;