clojurewerkz.archimedes.edge — com.ardoq/archimedes 4.0.0

assoc! clj

(assoc! elem & kvs)

clear! clj

(clear! elem)

connect! clj

(connect! g v1 label v2)

(connect! g v1 label v2 data)

Connects two vertices with the given label, and, optionally, with the given properties.

connect-with-id! clj

(connect-with-id! g id v1 label v2)

(connect-with-id! g id v1 label v2 data)

Connects two vertices with the given label, and, optionally, with the given properties.

connected? clj

(connected? v1 v2)

(connected? v1 label v2)

Returns whether or not two vertices are connected. Optional third arguement specifying the label of the edge.

dissoc! clj

(dissoc! elem & keys)

edges-between clj

(edges-between v1 v2)

(edges-between v1 label v2)

Returns a set of the edges between two vertices, direction considered.

endpoints clj

(endpoints edge)

Returns the endpoints of the edge in array with the order [starting-node,ending-node].

find-by-id clj

(find-by-id g & ids)

Retrieves edges by id from the graph.

get clj

(get elem key)

(get elem key not-found)

get-all-edges clj

(get-all-edges g)

Returns all edges.

get-vertex clj

(get-vertex e direction)

Get the vertex of the edge in a certain direction.

head-vertex clj

(head-vertex e)

Get the head vertex of the edge.

id-of clj

(id-of elem)

keys clj

(keys elem)

label-of clj

(label-of edge)

Get the label of the edge

merge! clj

(merge! elem & maps)

refresh clj

(refresh g edge)

Goes and grabs the edge from the graph again. Useful for "refreshing" stale edges.

remove! clj

(remove! g edge)

Remove an edge.

tail-vertex clj

(tail-vertex e)

Get the tail vertex of the edge.

to-map clj

(to-map edge)

Returns a persisten map representing the edge.

unique-upconnect! clj

(unique-upconnect! & args)

Like upconnect!, but throws an error when more than element is returned.

unique-upconnect-with-id! clj

(unique-upconnect-with-id! & args)

Like upconnect!, but throws an error when more than element is returned.

upconnect! clj

(upconnect! g v1 label v2)

(upconnect! g v1 label v2 data)

Upconnect takes all the edges between the given vertices with the given label and, if the data is provided, merges the data with the current properties of the edge. If no such edge exists, then an edge is created with the given data.

upconnect-with-id! clj

(upconnect-with-id! g id v1 label v2)

(upconnect-with-id! g id v1 label v2 data)

Upconnect takes all the edges between the given vertices with the given label and, if the data is provided, merges the data with the current properties of the edge. If no such edge exists, then an edge is created with the given data.

update! clj

(update! elem key f & args)

vals clj

(vals elem)