Add an attribute to node or edge

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

Adds directed edges, regardless of whether the underlying graph is directed or undirected

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

Adds edges to graph g of the form [n1 n2], [n1 n2 weight], or [n1 n2 attr-map].

Add edges to graph g. See add-edges

Adds nodes to graph g. Nodes can be any type of object

Add nodes to graph g. See add-nodes

Takes any number of [node attr-map] pairs, and adds them to graph g.

Takes a sequence of [node attr-map] pairs, and adds them to graph g.

Adds undirected edges, regardless of whether the underlying graph is directed or undirected

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

If true, two edges between the same pair of nodes in the same direction
are permitted.  If false, adding a new edge between the same pair of nodes as an existing edge will
merge the edges into a single edge, and adding an undirected edge on top of an existing directed edge
will `upgrade' the directed edge to undirected and merge attributes.

Return the attribute on a node or edge

Return all attributes on a node or edge

Builds graphs using node descriptions of the form node-label or [node-label attribute-map]
and edge descriptions of the form [src dest], [src dest weight], or [src dest attribute-map].
Also can build from other ubergraphs and from adjacency maps.

Use ^:node and ^:edge metadata to resolve ambiguous inits, or build your graph with the more
precise add-nodes, add-nodes-with-attrs, and add-edges functions.

Counts how many edges are in g.
Undirected edges are counted twice, once for each direction.

Counts how many nodes are in g

Counts how many edges are in g.
Undirected edges are counted only once.

Returns the dest node of the edge

Digraph constructor. See build-graph for description of valid inits

Is e a directed edge?

Many ubergraph functions can take either an *edge description* (i.e., [src dest]
[src dest weight] or [src dest attribute-map]) or an actual edge object.  This function
is used to convert edge descriptions into an edge object, or passing through an edge
object unchanged, so regardless of what you pass in, you're guaranteed to get out
an edge object.

Returns [src dest attribute-map] with ^:edge metadata so it can be safely used as an input to build-graph

Tests whether o is an edge object

Edges in g. May return each edge twice in an undirected graph

Takes a string intended to be used as a node or edge label in a
Graphviz graph, and returns a string with several characters that
cause problems for Graphviz with suitable replacements.  Called for
you automatically if you use the ':auto-label true' option of the
viz-graph function, but you may want to use it for label strings you
provide to viz-graph when you do not use that option.

Returns first edge that matches the query

Returns all edges that match the query

Graph constructor. See build-graph for description of valid inits

Returns true when edge [n1 n2] is in g

Returns true when node is in g

Returns the number of direct predecessors to node

Returns all the incoming edges of node

Is e the mirrored half of the undirected edge?

Multidigraph constructor. See build-graph for description of valid inits

Multigraph constructor. See build-graph for description of valid inits

Returns seq of nodes that are either successors or predecessors of the node

Returns [node attribute-map], which can be safely used as an input to build-graph

Returns a collection of the nodes in graph g

Returns the other direction of this edge in graph g

Returns the number of outgoing edges of node

Returns all the outgoing edges of node

Pretty print an ubergraph

Returns direct predecessors of node

Returns direct predecessors of node

Removes all nodes and edges from graph g

Remove an attribute from a node or edge

Removes the attributes from the node or edge

Removes edges from graph g. See remove-edges

Removes nodes from graph g

Remove nodes from graph g. See remove-nodes

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

Returns the source node of the edge

Returns direct successors of node

Returns direct successors of node

Returns a graph with all edges reversed

General ubergraph construtor. Takes booleans for allow-parallel? and undirected? to
call either graph, digraph, multigraph, or multidigraph.
See build-graph for description of valid inits

Is e one 'direction' of an undirected edge?

If true, new edges in g are undirected by default.  If false,
new edges in g are directed by default.

Uses graphviz to generate a visualization of your graph. Graphviz
must be installed on your computer and in your path. Passes along
to graphviz the attributes on the nodes and edges, so graphviz-related
attributes such as color, style, label, etc. will be respected.

Takes an optional map which can contain:
:auto-label true (labels each node/edge with its attribute map)
:layout :dot, :neato, :fdp, :sfdp, :twopi, or :circo
:save {:filename _, :format _} where format is one of
:bmp :dot :eps :gif :ico :jpg :jpeg :pdf :png :ps :ps2 :svgz :tif :tiff :vmlz :wbmp
Additionally map can contain graph attributes for graphviz like :bgcolor, :label, :splines, ...

Returns the weight of edge e or edge [n1 n2]

Returns the weight of edge e or edge [n1 n2]