ubergraph.protocols — ubergraph 0.7.1

Attrs clj protocol

add-attrs clj

(add-attrs g node-or-edge attribute-map)

(add-attrs g n1 n2 attribute-map)

Merges an attribute map with the existing attributes of a node or edge

remove-attrs clj

(remove-attrs g node-or-edge attributes)

(remove-attrs g n1 n2 attributes)

Removes the attributes from the node or edge

set-attrs clj

(set-attrs g node-or-edge attribute-map)

(set-attrs g n1 n2 attribute-map)

Sets the attribute map of a node or edge, overwriting existing attribute map

IAllPaths clj protocol

An object that knows how to produce paths on demand between any pair of nodes, using path-between

path-between clj

(path-between paths src dest)

The shortest path between src and dest

IAllPathsFromSource clj protocol

An object that knows how to produce paths on demand from a given source, using path-to

path-to clj

(path-to paths dest)

The shortest path to dest

IPath clj protocol

All the things you can do to a path

cost-of-path clj

(cost-of-path path)

Returns the cost of the path with respect to the property that was minimized in the search that produced this path.

edges-in-path clj

(edges-in-path path)

A list of edges comprising the path

end-of-path clj

(end-of-path path)

Returns the last node in the path

nodes-in-path clj

(nodes-in-path path)

A list of nodes comprising the path

start-of-path clj

(start-of-path path)

Returns the first node in the path

IUbergraph clj protocol

Is it an Ubergraph?

ubergraph? clj

(ubergraph? g)

MixedDirectionEdgeTests clj protocol

directed-edge? clj

(directed-edge? e)

Is e a directed edge?

mirror-edge? clj

(mirror-edge? e)

Is e the mirrored half of the undirected edge?

undirected-edge? clj

(undirected-edge? e)

Is e one 'direction' of an undirected edge?

MixedDirectionGraph clj protocol

add-directed-edges* clj

(add-directed-edges* g edges)

Adds directed edges regardless of the graph's undirected/directed default

add-undirected-edges* clj

(add-undirected-edges* g edges)

Adds undirected edges regardless of the graph's undirected/directed default

QueryableGraph clj protocol

find-edge clj

(find-edge g query)

(find-edge g src dest)

Returns first edge that matches the query

find-edges clj

(find-edges g query)

(find-edges g src dest)

Returns all edges that match the query

UndirectedGraph clj protocol

other-direction clj

(other-direction g edge)

Returns the other direction of this edge in graph g