(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
Merges an attribute map with the existing attributes of a node or edge
(remove-attrs g node-or-edge attributes)
(remove-attrs g n1 n2 attributes)
Removes the attributes from the node or edge
Removes the attributes from the node or edge
(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
Sets the attribute map of a node or edge, overwriting existing attribute map
An object that knows how to produce paths on demand between any pair of nodes, using path-between
An object that knows how to produce paths on demand between any pair of nodes, using path-between
(path-between paths src dest)
The shortest path between src and dest
The shortest path between src and dest
An object that knows how to produce paths on demand from a given source, using path-to
An object that knows how to produce paths on demand from a given source, using path-to
(path-to paths dest)
The shortest path to dest
The shortest path to dest
All the things you can do to a path
All the things you can do to a path
(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.
Returns the cost of the path with respect to the property that was minimized in the search that produced this path.
(edges-in-path path)
A list of edges comprising the path
A list of edges comprising the path
(end-of-path path)
Returns the last node in the path
Returns the last node in the path
(nodes-in-path path)
A list of nodes comprising the path
A list of nodes comprising the path
(start-of-path path)
Returns the first node in the path
Returns the first node in the path
Is it an Ubergraph?
Is it an Ubergraph?
(ubergraph? g)
(directed-edge? e)
Is e a directed edge?
Is e a directed edge?
(mirror-edge? e)
Is e the mirrored half of the undirected edge?
Is e the mirrored half of the undirected edge?
(undirected-edge? e)
Is e one 'direction' of an undirected edge?
Is e one 'direction' of an undirected edge?
(add-directed-edges* g edges)
Adds directed edges regardless of the graph's undirected/directed default
Adds directed edges regardless of the graph's undirected/directed default
(add-undirected-edges* g edges)
Adds undirected edges regardless of the graph's undirected/directed default
Adds undirected edges regardless of the graph's undirected/directed default
(find-edge g query)
(find-edge g src dest)
Returns first edge that matches the query
Returns first edge that matches the query
(find-edges g query)
(find-edges g src dest)
Returns all edges that match the query
Returns all edges that match the query
(other-direction g edge)
Returns the other direction of this edge in graph g
Returns the other direction of this edge in graph g
cljdoc is a website building & hosting documentation for Clojure/Script libraries
× close