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
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40

//! Submodule defining a trait for a bipartite weighted monoplex graph.
//!
//! Such a graph is characterized by the fact that:
//!
//! * It is bipartite, i.e. it has two sets of nodes, and all edges can solely
//!   connect nodes from different sets.
//! * It is weighted, i.e. each edge has an associated weight.
//! * It is monoplex, i.e. it has only one type of edge.

use super::{MonoplexBipartiteGraph, WeightedEdges, WeightedMonoplexGraph};

/// Trait implemented by bipartite weighted monoplex graphs.
pub trait BipartiteWeightedMonoplexGraph:
    WeightedMonoplexGraph<
        WeightedEdges = <Self as BipartiteWeightedMonoplexGraph>::BipartiteWeightedEdges,
    > + MonoplexBipartiteGraph<
        MonoplexBipartiteEdges = <Self as BipartiteWeightedMonoplexGraph>::BipartiteWeightedEdges,
    >
{
    /// The underlying type used to represent the edges of the graph.
    type BipartiteWeightedEdges: WeightedEdges<
            SourceNodeId = Self::LeftNodeId,
            DestinationNodeId = Self::RightNodeId,
            Weight = Self::Weight,
            WeightedEdge = Self::Edge,
        >;
}

impl<G> BipartiteWeightedMonoplexGraph for G
where
    G: WeightedMonoplexGraph + MonoplexBipartiteGraph<MonoplexBipartiteEdges = G::WeightedEdges>,
    <G as WeightedMonoplexGraph>::WeightedEdges: WeightedEdges<
            SourceNodeId = G::LeftNodeId,
            DestinationNodeId = G::RightNodeId,
            Weight = G::Weight,
            WeightedEdge = G::Edge,
        >,
{
    type BipartiteWeightedEdges = G::WeightedEdges;
}