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

//! Submodule defining a complete graph, i.e. a graph that for each possible
//! combination of source and destination nodes has an edge.

use super::Graph;

/// Trait defining a complete graph.
pub trait CompleteGraph: Graph {}

impl<G> CompleteGraph for G where G: Graph {}