Kenny's work is a language for describing the schema of a graph (e.g. "this graph is a bipartite graph"). We want our non-programmers to be able to write graph

Kenny's work is a language for describing the schema of a graph (e.g. "this graph is a bipartite graph"). We want our non-programmers to be able to write graph schemas, hence the DSL. I imagine one could use the Gremlin language to specify a graph schema, but I think it would be a bit obtuse as Gremlin is a query language. We're actually using the Blueprints model under the hood to implement the validation algorithm.