As an AAI query designer, I want a simple domain specific language (DSL) to use to describe a graph traversal query, so that queries are simpler to express and write, could be easily created by non-developers and eventually be created on the fly by clients. This can be something as simple as pserver > vserver > generic-vnf, but needs to be expressive enough to support the most commonly used capabilities of gremlin in our existing custom queries.
We should also provide the user the ability to say "I want to traverse all the 'vertical' edges to/from this node". This should traverse all of the edges tagged as "vertical" edges to/from that node, without traversing the same edge again, and continue until it finds no more edges to follow. As part of this, all edges must be assigned one or more "categories".
We should also identify commonly used traversals from our existing custom queries, and use these to create stored "query building blocks" that can either be immediately used by a client or inserted into new queries.
A parser from the agreed upon DSL to the query builder pattern also needs to be developed.