FOR v，e，p图遍历AQL不会返回所有可能的顶点
[英]FOR v,e,p graph traversal AQL doesn't return all of the possible vertices
问题描述
My graph has a edge of kind pm_child that forms a tree structure. 
我的图具有pm_child类型的边缘，该边缘形成树结构。 Below is a picture showing an example tree: 下面是显示示例树的图片：
When doing the following AQL command: 在执行以下AQL命令时：
FOR v,e,p IN 1..50 OUTBOUND 'pmsite/482149696650' pm_child RETURN p FOR v，e，p输入1..50出站'pmsite / 482149696650'pm_child返回p
It returns only 14 of the 21 possible "project" kinds. 它仅返回21种可能的“项目”类型中的14种。 This seems like a bug but I wanted to verify I didn't do something silly before I report it. 这似乎是一个错误，但是我想在报告之前确认自己没有做任何愚蠢的事情。
1 个解决方案
解决方案1
1 已采纳 2016-05-05 20:03:19
This question is a red-herring. 这个问题是一条红鲱鱼。 Arangojs introduced a default LIMIT value which truncated the results. Arangojs引入了一个默认的LIMIT值，该值会截断结果。 With some direction from ArangoDB support, I was able to construct a better way to pull out what I needed without the umpteen intermediate traversal results. 在ArangoDB支持的指导下，我能够构造出一种更好的方法来提取我所需的内容，而不会出现大量中间遍历结果。
声明:本站的技术帖子网页，遵循CC BY-SA 4.0协议，如果您需要转载，请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.