clojurewerkz.archimedes.vertex — clojurewerkz/archimedes 2.5.0.0

all-connected-vertices clj

(all-connected-vertices v & labels)

Returns vertices connected to this vertex with the given labels

all-edges-of clj

(all-edges-of v & labels)

Returns edges that this vertex is part of, with given labels

assoc! clj

(assoc! elem & kvs)

clear! clj

(clear! elem)

connected-in-vertices clj

(connected-in-vertices v & labels)

Returns vertices connected to this vertex by an inbound edge with the given labels

connected-out-vertices clj

(connected-out-vertices v & labels)

Returns vertices connected to this vertex by an outbound edge with the given labels

connected-vertices-of clj

(connected-vertices-of v direction & labels)

Returns vertices connected to this vertex with a certain direction by the given labels

create! clj

(create! g)

(create! g m)

Create a vertex, optionally with the given property map.

create-with-id! clj

(create-with-id! g id)

(create-with-id! g id m)

Create a vertex, optionally with the given property map.

dissoc! clj

(dissoc! elem & keys)

edges-of clj

(edges-of v direction & labels)

Returns edges that this vertex is part of with direction and with given labels

find-by-id clj

(find-by-id g & ids)

Retrieves nodes by id from the given graph.

find-by-kv clj

(find-by-kv g k v)

Given a key and a value, returns the set of all vertices that sastify the pair.

get clj

(get elem key)

(get elem key not-found)

get-all-vertices clj

(get-all-vertices g)

Returns all vertices.

id-of clj

(id-of elem)

incoming-edges-of clj

(incoming-edges-of v & labels)

Returns incoming (inbound) edges that this vertex is part of, with given labels

keys clj

(keys elem)

merge! clj

(merge! elem & maps)

outgoing-edges-of clj

(outgoing-edges-of v & labels)

Returns outgoing (outbound) edges that this vertex is part of, with given labels

refresh clj

(refresh g vertex)

Gets a vertex back from the database and refreshes it to be usable again.

remove! clj

(remove! g vertex)

Remove a vertex from the given graph.

to-map clj

(to-map vertex)

Returns a persistent map representing the vertex.

unique-upsert! clj

(unique-upsert! & args)

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

unique-upsert-with-id! clj

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

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

update! clj

(update! elem key f & args)

upsert! clj

(upsert! g k m)

Given a key and a property map, upsert! either creates a new node with that property map or updates all nodes with the given key value pair to have the new properties specifiied by the map. Always returns the set of vertices that were just update or created.

upsert-with-id! clj

(upsert-with-id! g id k m)

Given a key and a property map, upsert! either creates a new node with that property map or updates all nodes with the given key value pair to have the new properties specifiied by the map. Always returns the set of vertices that were just update or created.

vals clj

(vals elem)