Expand description
Storage-agnostic traits for binary graph views.
oxgraph-graph is the binary graph specialization above oxgraph-topology. Use it
to write generic graph consumers over node/edge vocabulary: endpoint lookup,
outgoing traversal, incoming traversal, and degree queries.
Graph views use topology elements as nodes and topology relations as edges. Implement concrete layouts, snapshots, builders, mutation systems, payloads, and algorithms in higher-level crates by implementing these read-view capabilities.
§Performance contract
Most of the traits and aliases in this crate are graph-vocabulary shadows of
topology traits. Unless a specific item documents otherwise, every method,
iterator, and alias inherits its performance contract from the underlying
topology trait it shadows: O(1) for accessors, O(1) to construct an
iterator plus O(k) to yield k items, and perf: unspecified for
capability-bundle marker traits and blanket impls.
Traits§
- Canonical
Element Identity - Optional local-to-canonical element identity capability.
- Canonical
Incidence Identity - Optional local-to-canonical incidence identity capability.
- Canonical
Relation Identity - Optional local-to-canonical relation identity capability.
- Contains
Edge - Edge-ID containment capability for graph views.
- Contains
Element - Element-ID containment capability for a topology view.
- Contains
Endpoint - Endpoint-ID containment capability for graph views with incidences.
- Contains
Incidence - Incidence-ID containment capability for an incidence-capable topology view.
- Contains
Node - Node-ID containment capability for graph views.
- Contains
Relation - Relation-ID containment capability for a topology view.
- Directed
Graph - Convenience marker bundling endpoint resolution and both traversal directions. One-direction layouts should implement the smaller capability traits they can provide instead.
- Edge
Endpoint Graph - Capability for resolving both directed edge endpoints.
- Edge
Index - Dense edge-index capability for graph views.
- Edge
Source Graph - Capability for resolving directed edge sources.
- Edge
Target Graph - Capability for resolving directed edge targets.
- Element
Incidence Count - Exact element-incidence count capability.
- Element
Incidences - Capability for traversing incidences attached to an element.
- Element
Index - Dense element-index capability for topology views.
- Element
Predecessors - Capability for expanding an element to its directed predecessor elements.
- Element
Successors - Capability for expanding an element to its directed successor elements.
- Element
Weight - Optional total weight capability for topology elements.
- Endpoint
Index - Dense endpoint-index capability for graph views with incidences.
- Forward
Graph - Convenience marker for forward directed graph traversal (target lookup + outgoing edge iteration).
- Graph
Base - Base capability for graph views over topology storage.
- Graph
Counts - Count capability for a graph view.
- Incidence
Base - Incidence identity and role vocabulary for topology views with incidences.
- Incidence
Counts - Count capability for incidence-capable topology views.
- Incidence
Element - Capability for resolving the element side of an incidence.
- Incidence
Index - Dense incidence-index capability for topology views.
- Incidence
Relation - Capability for resolving the relation side of an incidence.
- Incidence
Role - Capability for resolving a role attached to an incidence.
- Incidence
Weight - Optional total weight capability for topology incidences.
- Incoming
Edge Count - Exact incoming-edge count capability.
- Incoming
Graph - Capability for traversing incoming edges to a target node.
- Incoming
Neighbors Graph - Capability for traversing directly preceding incoming neighbor nodes.
- Local
Element Identity - Optional canonical-to-local element identity capability.
- Local
Incidence Identity - Optional canonical-to-local incidence identity capability.
- Local
Relation Identity - Optional canonical-to-local relation identity capability.
- Node
Index - Dense node-index capability for graph views.
- Outgoing
Edge Count - Exact outgoing-edge count capability.
- Outgoing
Graph - Capability for traversing outgoing edges from a source node.
- Outgoing
Neighbors Graph - Capability for traversing directly reachable outgoing neighbor nodes.
- Relation
Incidence Count - Exact relation-incidence count capability.
- Relation
Incidences - Capability for traversing incidences attached to a relation.
- Relation
Index - Dense relation-index capability for topology views.
- Relation
Weight - Optional total weight capability for topology relations.
- Reverse
Graph - Convenience marker for reverse directed graph traversal (source lookup + incoming edge iteration). Expected to be provided by CSC-backed views.
- Topology
Base - Common element and relation identity vocabulary for a topology view.
- Topology
Counts - Count capability for a topology view.
- Topology
Id - Marker trait for compact topology identity handles.
Type Aliases§
- EdgeId
- Graph-facing alias for a topology relation ID (binary graph edge).
- Endpoint
Id - Graph-facing alias for a topology incidence ID (binary graph endpoint).
- Endpoint
Role - Graph-facing alias for a topology role used to distinguish source and target endpoint participation on graph views that expose incidences.
- NodeId
- Graph-facing alias for a topology element ID (binary graph node).