Expand description
Graphs, finite and infinite.
Graphs are the fundamental combinatorial structure in category theory and a basic building block for higher dimensional categories. We thus aim to provide a flexible set of traits and structs for graphs as they are used in category theory.
Structs§
- Columnar
Graph Mapping - A graph mapping backed by columns.
- Graph
Morphism - A homomorphism between graphs defined by a mapping.
- Hash
Graph - A finite graph with indexed source and target maps, based on hash maps.
- Skel
Graph - A skeletal finite graph with indexed source and target maps.
- Vertex
Set - The set of vertices of a graph.
Enums§
- Graph
Elem - An element in a graph.
- Invalid
Graph - An invalid assignment in a graph.
- Invalid
Graph Morphism - A failure of a mapping between graphs to define a graph homomorphism.
Traits§
- Columnar
FinGraph - A finite graph backed by columns.
- Columnar
Graph - A graph backed by sets and mappings.
- FinGraph
- A graph with finitely many vertices and edges.
- Graph
- A graph.
- Graph
Mapping - A mapping between graphs.
- MutColumnar
Graph - A columnar graph with mutable columns.
- Reflexive
Graph - A reflexive graph.
Type Aliases§
- Skel
Graph Mapping - A graph mapping between skeletal finite graphs, backed by vectors.
- Ustr
Graph - A finite graph with vertices and edges of type
Ustr.