Expand description
Structures to manipulate the Software Heritage graph
In order to load only what is necessary, these structures are initially created
by calling SwhUnidirectionalGraph::new
or SwhBidirectionalGraph::new
, then calling methods
on them to progressively load additional data (load_properties
, load_all_properties
,
load_labels
)
Re-exports§
pub use crate::arc_iterators::IntoFlattenedLabeledArcsIterator;
Structs§
- Default
Underlying Graph - Newtype for
BvGraph
with its type parameters set to what the SWH graph needs. - SwhBidirectional
Graph - Class representing the compressed Software Heritage graph in both directions.
- SwhUnidirectional
Graph - Class representing the compressed Software Heritage graph in a single direction.
Traits§
- SwhBackward
Graph - SwhForward
Graph - SwhFull
Graph - Alias for structures representing a graph with all arcs, arc labels, and node properties loaded.
- SwhGraph
- SwhGraph
With Properties - SwhLabeled
Backward Graph - SwhLabeled
Forward Graph - Underlying
Graph - Supertrait of
RandomAccessLabeling
with methods to act like aRandomAccessGraph
.
Functions§
- load_
bidirectional Deprecated - Deprecated alias for
SwhBidirectionalGraph::new
- load_
full - Loads a bidirectional graph, then all its properties, then its labels.
- load_
unidirectional Deprecated - Deprecated alias for
SwhUnidirectionalGraph::new