adjacency-list 0.0.2

Adjacency List and Adjacency Graph
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
27
28
29
30
31
32

#![deny(missing_debug_implementations, missing_copy_implementations)]
// #![warn(missing_docs, rustdoc::missing_crate_level_docs)]
#![doc = include_str!("../readme.md")]
#![doc(html_logo_url = "https://raw.githubusercontent.com/oovm/shape-rs/dev/projects/images/Trapezohedron.svg")]
#![doc(html_favicon_url = "https://raw.githubusercontent.com/oovm/shape-rs/dev/projects/images/Trapezohedron.svg")]

mod iters;
mod sparse_edges;
mod sparse_nodes;
pub(crate) mod utils;

pub use crate::{
    sparse_edges::{one_way_iter::*, AdjacencyEdgeDict},
    sparse_nodes::AdjacencyNodeList,
};

/// Sparse adjacency list, edge-first directed graph
pub type DiGraphAED = AdjacencyEdgeDict<{ graph_types::GraphKind::Directed.is_one_way() }>;
/// Sparse adjacency list, edge-first undirected graph
pub type UnGraphAED = AdjacencyEdgeDict<{ graph_types::GraphKind::Directed.is_two_way() }>;
/// Sparse adjacency list, node-first directed graph
pub type DiGraphAND = AdjacencyEdgeDict<{ graph_types::GraphKind::Directed.is_one_way() }>;
/// Sparse adjacency list, node-first undirected graph
pub type UnGraphAND = AdjacencyEdgeDict<{ graph_types::GraphKind::Directed.is_two_way() }>;
/// Dense adjacency list, edge-first directed graph
pub type DiGraphAEL = AdjacencyEdgeDict<{ graph_types::GraphKind::Directed.is_one_way() }>;
/// Dense adjacency list, edge-first undirected graph
pub type UnGraphAEL = AdjacencyEdgeDict<{ graph_types::GraphKind::Directed.is_two_way() }>;
/// Dense adjacency list, node-first directed graph
pub type DiGraphANL = AdjacencyEdgeDict<{ graph_types::GraphKind::Directed.is_one_way() }>;
/// Dense adjacency list, node-first undirected graph
pub type UnGraphANL = AdjacencyEdgeDict<{ graph_types::GraphKind::Directed.is_two_way() }>;