Module fera_graph::props
source · Expand description
Traits and implementation for properties (key to values mapping).
Examples
use fera_graph::prelude::*;
let g = CompleteGraph::new(4);
let mut p = g.default_vertex_prop(0i32);
p[3] = -3;
assert_eq!(0, p.get(0));
assert_eq!(-3, p.get(3));
let abs_p = p.map(i32::abs);
assert_eq!(3, abs_p.get(3));Structs
A property backed by an array.
An edge property that delegates all operations to a wrapped property.
A vertex property that delegates all operations to a wrapped property.
A read only property backed by a function.
A property backed by a
HashMap.A property that ignore writes.
A property that maps the value of a wrapped property with a function.
Enums
Indicates the status of an item in a traverse algorithm.
Traits
An edge property that can be read using indexing operation.
A edge property.
A edge property that can be read/write using indexing operation.
An edge property that can be read/write using indexing operation.
An abstract property that maps keys in domain
K to the corresponding values.A property that can be read/write using indexing operations.
A vertex property that can be read using indexing operation.
A vertex property.
A vertex property that can be read/write using indexing operation.
A vertex property that can be created using a graph reference and a value.
A graph that has a property that maps each edge to an integer in the range
0..num_edges.A graph that has a default edge property type, that is, has a default implementation to
associated values with edges.
A graph that has a property that maps each vertex to an integer in the range
0..num_vertices.A graph that has a default vertex property type, that is, has a default implementation to
associated values with vertices.