Graph algorithms over `cljgrapht.core` graphs. Every function takes a graph
and returns plain Clojure data: paths as vectors, components as sets, and
scores as maps. The results compose with the rest of your Clojure code.

Direction is important. `connected-components` is for undirected graphs.
`strongly-connected-components`, `topological-sort`, and `cycle?` are for
directed graphs.

Construction and inspection of graphs that use JGraphT.

A vertex can be any Clojure value (keyword, string, number, map). Graphs are
JGraphT's native mutable objects. Constructors and mutators return the same
graph so that you can thread calls, but they mutate the graph in place. This
is a performance wrapper, not a persistent data structure. The algorithms are
in `cljgrapht.algo` and they return plain Clojure data.

Graph generators that return new `cljgrapht.core` graphs.

Graph import and export for `cljgrapht.core` graphs.

Loom protocol interop for raw JGraphT graphs.

This namespace needs a loom artifact (net.clojars.savya/loom or aysylu/loom)
on the classpath. cljgrapht does not include it as a dependency.

EditableGraph operations mutate the underlying JGraphT graph in place and
return the same instance. The return values from the add and remove
operations are the same graph, not new copies. Loom's persistent graph
records behave differently.