geometric-traits 0.2.2

Trait-based algebraic and graph algorithms for Rust, supporting no_std environments
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26

//! Submodule providing naively implemented data structures for graphs.
//!
//! These data structures are not optimized for performance, but are useful for
//! some general use cases where performance is not critical.

#[cfg(feature = "std")]
pub mod directory_tree;
pub mod generic_bigraph;
pub mod generic_edges_builder;
pub mod generic_graph;
pub mod generic_monoplex_bipartite_graph_builder;
pub mod generic_vocabulary_builder;
#[cfg(feature = "alloc")]
pub mod named_types;
pub mod undirected_edges_builder;

#[cfg(feature = "std")]
pub use directory_tree::DirectoryTree;
pub use generic_bigraph::GenericBiGraph;
pub use generic_edges_builder::GenericEdgesBuilder;
pub use generic_graph::GenericGraph;
pub use generic_monoplex_bipartite_graph_builder::GenericMonoplexBipartiteGraphBuilder;
pub use generic_vocabulary_builder::GenericVocabularyBuilder;
#[cfg(feature = "alloc")]
pub use named_types::*;
pub use undirected_edges_builder::GenericUndirectedMonopartiteEdgesBuilder;