graphrepresentations 0.0.1-alpha.1

A crate providing efficient abstract implementations of different graph representations
Documentation 
1
2
3
4
5
6
7
8

//! Iterator types for the `SimpleGraph`.

use crate::{EdgeId, IdType, NodeId};

/// An iterator over the nodes of a `SimpleGraph`.
pub type SimpleGraphNodeIdIterator = std::iter::Map<std::ops::Range<IdType>, fn(IdType) -> NodeId>;
/// An iterator over the edges of a `SimpleGraph`.
pub type SimpleGraphEdgeIdIterator = std::iter::Map<std::ops::Range<IdType>, fn(IdType) -> EdgeId>;