Trait GraphNodeId 

pub trait GraphNodeId:
    Copy
    + Eq
    + Hash
    + Ord
    + Debug {
    type Adjacent: Copy + Debug + From<(Self, Direction)> + Into<(Self, Direction)>;
    type Edge: Copy + Eq + Hash + Debug + From<(Self, Self)> + Into<(Self, Self)>;

    // Required method
    fn kind(&self) -> &'static str;
}

Types that can be used as node identifiers in a DiGraph/UnGraph.

Required Associated Types

type Adjacent: Copy + Debug + From<(Self, Direction)> + Into<(Self, Direction)>

The type that packs and unpacks this GraphNodeId with a Direction. This is used to save space in the graph’s adjacency list.

type Edge: Copy + Eq + Hash + Debug + From<(Self, Self)> + Into<(Self, Self)>

The type that packs and unpacks this GraphNodeId with another GraphNodeId. This is used to save space in the graph’s edge list.

Required Methods

fn kind(&self) -> &'static str

Name of the kind of this node id.

For structs, this should return a human-readable name of the struct. For enums, this should return a human-readable name of the enum variant.

Dyn Compatibility

This trait is not dyn compatible.

In older versions of Rust, dyn compatibility was called "object safety".

Implementors

impl GraphNodeId for NodeId

type Adjacent = CompactNodeIdAndDirection

type Edge = CompactNodeIdPair

impl GraphNodeId for SystemKey

type Adjacent = (SystemKey, Direction)

type Edge = (SystemKey, SystemKey)

impl GraphNodeId for SystemSetKey

type Adjacent = (SystemSetKey, Direction)

type Edge = (SystemSetKey, SystemSetKey)