Labeled links to or from a node
The decomposition of a graph into two detached contexts focused on distinguished "first" and "last" nodes.
The view of a graph focused on the context surrounding a particular node.
The decomposition of a graph into possibly a detached context focused on one node, and the rest of the graph.
The decomposition of a graph into a detached context focused on one node, and the rest of the graph.
The label, predecessors, and successors of a given node
An implementation of an inductive graph where nodes of type
N
are labeled with A
, and edges are labeled with B
.
The internal representation of a graph
Labeled path through a graph
Inward directed tree as a list of labeled paths
Unlabeled path through a graph
Inward directed tree as a list of paths
Quasi-unlabaled edge
Quasi-unlabeled node
Create an (n,k)
-banana tree, which is an undirected graph obtained by connecting one leaf
of each of n
copies of a k
-star graph with a single root vertex that is distinct
from all the stars.
Build a graph from a list of contexts
Create a graph that is a cycle of the given nodes
An empty graph
Turn an adjacency list of labeled edges into an intmap of sets of labels
Find the first path in a labeled search tree that starts with the given node
Find all paths in a labeled search tree that start with the given node
Find the first path in a search tree that starts with the given node
The monoid of graph unions
Create a graph from lists of labeled nodes and edges
Build a graph from elements of a partially ordered set.
Build a graph from elements of a partially ordered set.
The resulting graph has an edge from vertex x
to vertex y
precisely when x <= y
.
Build a graph from lists of labeled nodes and edges, ignoring edges that reference missing nodes
Create a directed star graph of degree n
Turn an intmap of sets of labels into an adjacency list of labeled edges