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

Fixed wrong link in Aql/GraphOperations

This commit is contained in:
Thomas Schmidts 2014-07-11 15:47:47 +02:00
parent 3293208b6a
commit ecb2c29729
1 changed files with 18 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -5303,9 +5303,9 @@ function IS_EXAMPLE_SET (example) {
///
/// * *graphName* : The name of the graph as a string.
/// * *startVertexExample* : An example for the desired start Vertices
/// (see [example](#short_explaination_of_the_vertex_example_parameter)).
/// (see [example](#short_explanation_of_the_example_parameter)).
/// * *endVertexExample* : An example for the desired
/// end Vertices (see [example](#short_explaination_of_the_vertex_example_parameter)).
/// end Vertices (see [example](#short_explanation_of_the_example_parameter)).
/// * *options* (optional) : An object containing the following options::
/// * *direction* : The direction of the edges as a string.
/// Possible values are *outbound*, *inbound* and *any* (default).
@ -5319,7 +5319,7 @@ function IS_EXAMPLE_SET (example) {
/// end vertex of a path.
/// * *edgeExamples* : A filter example for the
/// edges in the shortest paths
/// (see [example](#short_explaination_of_the_vertex_example_parameter)).
/// (see [example](#short_explanation_of_the_example_parameter)).
/// * *algorithm* : The algorithm to calculate
/// the shortest paths. If both start and end vertex examples are empty
/// [Floyd-Warshall](http://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm) is
@ -5432,7 +5432,7 @@ function GRAPH_TRAVERSAL (vertexCollection,
/// *Parameters*
/// * *graphName* : The name of the graph as a string.
/// * *startVertexExample* : An example for the desired
/// vertices (see [example](#short_explaination_of_the_vertex_example_parameter)).
/// vertices (see [example](#short_explanation_of_the_example_parameter)).
/// * *direction* : The direction of the edges as a string. Possible values
/// are *outbound*, *inbound* and *any* (default).
/// * *options* (optional) : Object containing optional options, see
@ -5622,7 +5622,7 @@ function GENERAL_GRAPH_DISTANCE_TO (graphName,
///
/// * *graphName* : The name of the graph as a string.
/// * *startVertexExample* : An example for the desired
/// vertices (see [example](#short_explaination_of_the_vertex_example_parameter)).
/// vertices (see [example](#short_explanation_of_the_example_parameter)).
/// * *direction* : The direction of the edges as a string.
/// Possible values are *outbound*, *inbound* and *any* (default).
/// * *connectName* : The result attribute which
@ -5790,14 +5790,14 @@ function GRAPH_NEIGHBORS (vertexCollection,
///
/// * *graphName* : The name of the graph as a string.
/// * *vertexExample* : An example for the desired
/// vertices (see [example](#short_explaination_of_the_vertex_example_parameter)).
/// vertices (see [example](#short_explanation_of_the_example_parameter)).
/// * *options* : An object containing the following options::
/// * *direction* : The direction
/// of the edges. Possible values are *outbound*, *inbound* and *any* (default).
/// * *edgeExamples* : A filter example for the edges to
/// the neighbors (see [example](#short_explaination_of_the_vertex_example_parameter)).
/// the neighbors (see [example](#short_explanation_of_the_example_parameter)).
/// * *neighborExamples* : An example for the desired neighbors
/// (see [example](#short_explaination_of_the_vertex_example_parameter)).
/// (see [example](#short_explanation_of_the_example_parameter)).
/// * *edgeCollectionRestriction* : One or multiple edge
/// collection names. Only edges from these collections will be considered for the path.
/// * *vertexCollectionRestriction* : One or multiple vertex
@ -5907,7 +5907,7 @@ function GENERAL_GRAPH_NEIGHBORS (graphName,
///
/// * *graphName* : The name of the graph as a string.
/// * *vertexExample* : An example for the desired
/// vertices (see [example](#short_explaination_of_the_vertex_example_parameter)).
/// vertices (see [example](#short_explanation_of_the_example_parameter)).
/// * *options* (optional) : An object containing the following options::
/// * *direction* : The direction
/// of the edges as a string. Possible values are *outbound*, *inbound* and *any* (default).
@ -5920,9 +5920,9 @@ function GENERAL_GRAPH_NEIGHBORS (graphName,
/// collection names. Only vertices from these collections will be considered as
/// end vertex of a path.
/// * *edgeExamples* : A filter example
/// for the edges (see [example](#short_explaination_of_the_vertex_example_parameter)).
/// for the edges (see [example](#short_explanation_of_the_example_parameter)).
/// * *neighborExamples* : An example for
/// the desired neighbors (see [example](#short_explaination_of_the_vertex_example_parameter)).
/// the desired neighbors (see [example](#short_explanation_of_the_example_parameter)).
/// * *minDepth* : Defines the minimal length of a path from an edge
/// to a vertex (default is 1, which means only the edges directly connected to a vertex would
/// be returned).
@ -5991,7 +5991,7 @@ function GENERAL_GRAPH_EDGES (
///
/// * *graphName* : The name of the graph as a string.
/// * *vertexExample* : An example for the desired
/// vertices (see [example](#short_explaination_of_the_vertex_example_parameter)).
/// vertices (see [example](#short_explanation_of_the_example_parameter)).
/// * *options* (optional) : An object containing the following options::
/// * *direction* : The direction of the edges as a string. Possible values are
/// *outbound*, *inbound* and *any* (default).
@ -6187,9 +6187,9 @@ function GENERAL_GRAPH_COMMON_NEIGHBORS (
///
/// * *graphName* : The name of the graph as a string.
/// * *vertex1Example* : An example for the desired
/// vertices (see [example](#short_explaination_of_the_vertex_example_parameter)).
/// vertices (see [example](#short_explanation_of_the_example_parameter)).
/// * *vertex2Example* : An example for the desired
/// vertices (see [example](#short_explaination_of_the_vertex_example_parameter)).
/// vertices (see [example](#short_explanation_of_the_example_parameter)).
/// * *options* (optional) : An object containing the following options::
/// * *vertex1CollectionRestriction* : One or multiple vertex
/// collection names. Only vertices from these collections will be considered.
@ -6322,7 +6322,7 @@ function GENERAL_GRAPH_COMMON_PROPERTIES (
///
/// * *graphName* : The name of the graph as a string.
/// * *vertexExample* : An example for the desired
/// vertices (see [example](#short_explaination_of_the_vertex_example_parameter)).
/// vertices (see [example](#short_explanation_of_the_example_parameter)).
/// * *options* (optional) : An object containing the following options::
/// * *direction* : The direction of the edges as a string.
/// Possible values are *outbound*, *inbound* and *any* (default).
@ -6335,7 +6335,7 @@ function GENERAL_GRAPH_COMMON_PROPERTIES (
/// collection names. Only vertices from these collections will be considered as
/// end vertex of a path.
/// * *edgeExamples* : A filter example for the edges in the
/// shortest paths (see [example](#short_explaination_of_the_vertex_example_parameter)).
/// shortest paths (see [example](#short_explanation_of_the_example_parameter)).
/// * *algorithm* : The algorithm to calculate
/// the shortest paths as a string. If vertex example is empty
/// [Floyd-Warshall](http://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm) is
@ -6504,7 +6504,7 @@ function GENERAL_GRAPH_ECCENTRICITY (graphName, options) {
///
/// * *graphName* : The name of the graph as a string.
/// * *vertexExample* : An example for the desired
/// vertices (see [example](#short_explaination_of_the_vertex_example_parameter)).
/// vertices (see [example](#short_explanation_of_the_example_parameter)).
/// * *options* : An object containing the following options::
/// * *direction* : The direction of the edges.
/// Possible values are *outbound*, *inbound* and *any* (default).
@ -6518,7 +6518,7 @@ function GENERAL_GRAPH_ECCENTRICITY (graphName, options) {
/// end vertex of a path.
/// * *edgeExamples* : A filter example for the
/// edges in the shortest paths (
/// see [example](#short_explaination_of_the_vertex_example_parameter)).
/// see [example](#short_explanation_of_the_example_parameter)).
/// * *algorithm* : The algorithm to calculate
/// the shortest paths. Possible values are
/// [Floyd-Warshall](http://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall_algorithm) (default)