* Prepares v0.10.0 release (#1066)
* Adds SNAPSHOT suffix

Introduces an ISL-based file format for defining graphs externally.

The goal of this format is to offer a way to define graphs to be brought into PartiQL runtime for querying with GPML. It specifically is not a goal to specify the embedding of graphs into Ion.

* Defines an ISL-constrained graph file format.

Also adds unit tests for the format's validation.

* A reader for external graphs.

With some unit tests.

* Addresses straightforward PR comments.

* Use -->, <-, --, etc. symbols to indicate edge direction.

Make use of the idea by @rchowell in PR feedback.

* Straightforward PR1064 feedback.

* Adjusts graph reader to use merged new syntax for edge directionality.

* Removing length-3 direction markers -->  ---  <--

Also, a previously-overlooked further simplification to the schema made possible with the introduction of the markers.

* A reader for external graphs.

With some unit tests.

* Straightforward PR1064 feedback.

* Adjusts graph reader to use merged new syntax for edge directionality.

* Adjusts the reader to the removal of lengh-3 direction markers in the schema.

Make external graphs, of the format defined in #1062 and made readable in #1064, part of PartiQL data model and bindable in evaluation environments. 

Graph bindings in evaluation environments is the primary contribution of this PR.  Done by
- Generalizing the session creation method in `EvaluatorTestBase` to make it possible to specify bindings to graphs. 
- Adding commands `!add_graph` and `!add_graph_from_file` to the CLI shell.

An end-to-end implementation of a fragment of graph pattern matching that can be unit-tested and experimented with in REPL.

The targeted language definition is what was proposed in [RFC-0025](https://github.com/partiql/partiql-docs/blob/main/RFCs/0025-graph-data-model.md) and [RFC-0033](https://github.com/partiql/partiql-docs/blob/main/RFCs/0033-graph-query.md).

The fragment of GPML patterns that is implemented can be characterized as: straight-path patterns with simple label matching and all directed/undirected edge patterns. 
This already allows one to write some interesting queries can be written and tested already.  Some examples are in the unit tests `EvaluatingCompilerGraphMatchTests`.

The evaluation approach is meant to follow the one outlined in Section 6 of the GPML paper [[ACM](https://dl.acm.org/doi/10.1145/3514221.3526057), [arxiv](https://arxiv.org/abs/2112.06217).]
In particular, the computational core of this initial implementation corresponds to Section 6.4, Computation of Path Binding, which deals with elementary "step" patterns and joining their results.  

The most interesting parts are probably the graph abstraction `Graph.kt` and some ideas for graph pattern "plans" in `MatchSpec.kt`, for structuring the matching algorithms in `GraphEngine.kt`.

* Fixes variable resolution in JOIN predicate
* Adds TupleConstraint, Ordered

* Adds Explicit API Mode to Publishing Plugin, Plan, and SPI
* Adds Explicit API Mode to Types Project