geometric-traits 0.2.3

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

//! Submodule for the transposed directed graph traits.

use super::{DirectedEdges, TransposedEdges};
use crate::traits::SparseBiMatrix2D;

/// Trait defining the properties of a transposed directed graph.
pub trait TransposedDirectedEdges:
    TransposedEdges<BiMatrix = <Self as TransposedDirectedEdges>::DirectedBiMatrix> + DirectedEdges
{
    /// The type of matrix required to store the transposed edges.
    type DirectedBiMatrix: SparseBiMatrix2D<RowIndex = Self::SourceNodeId, ColumnIndex = Self::DestinationNodeId>;
}

impl<E> TransposedDirectedEdges for E
where
    E: DirectedEdges + TransposedEdges,
    E::BiMatrix: SparseBiMatrix2D<RowIndex = E::SourceNodeId, ColumnIndex = E::DestinationNodeId>,
{
    type DirectedBiMatrix = E::BiMatrix;
}

/// Trait defining the properties of a directed graph.
pub trait TransposedDirectedGraph: super::DirectedGraph {}

impl<G> TransposedDirectedGraph for G where G: super::DirectedGraph {}