ubergraph.invariants — ubergraph 0.7.1

attrs-val-not-map clj

(attrs-val-not-map g)

bad-attrs-keys clj

(bad-attrs-keys g)

check-invariants clj

(check-invariants g)

Checks whether the internal data structures of an ubergraph satisfy invariants assumed by the implementation. The implementation of this function is one way to document these invariants, plus being an executable way to check for bugs in the implementation.

Returns a map with the key :error, where the associated value is a boolean indicating whether any errors were found. Other keys can be returned if there is an error, indicating details about any invariant violations found.

duplicate-edge-uuids clj

(duplicate-edge-uuids g)

duplicates clj

(duplicates coll)

edge-id-set clj

(edge-id-set g)

edges-with-wrong-src-or-dest clj

(edges-with-wrong-src-or-dest g)

node-info-with-non-node-key clj

(node-info-with-non-node-key g)

node-info-with-wrong-val clj

(node-info-with-wrong-val g)

node-info-wrong-degree clj

(node-info-wrong-degree g)

node-map-val-wrong-type-or-keys clj

(node-map-val-wrong-type-or-keys g)

nodes-also-edge-uuids clj

(nodes-also-edge-uuids g)

nodes-also-edges clj

(nodes-also-edges g)

nodes-logical-false clj

(nodes-logical-false g)

undirected-edges-paired-incorrectly clj

(undirected-edges-paired-incorrectly g)