Struct Graph

pub struct Graph<T>
where
    T: Clone + PartialEq,
{
    pub nodes: Vec<Node<T>>,
}

Fields

nodes: Vec<Node<T>>

Implementations

impl<T> Graph<T>

where T: Clone + PartialEq + Default,

pub fn topological_iter(&self) -> impl Iterator<Item = &Node<T>>

pub fn set_cycles(self, indecies: Vec<usize>) -> Graph<T>

Trait Implementations

impl<T> Clone for Graph<T>

where T: Clone + PartialEq + Clone,

fn clone(&self) -> Graph<T>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T> Codex<NodeChromosome<T>, Graph<T>> for GraphCodex<T>

where T: Clone + PartialEq + Default,

fn encode(&self) -> Genotype<NodeChromosome<T>>

fn decode(&self, genotype: &Genotype<NodeChromosome<T>>) -> Graph<T>

fn spawn(&self, num: usize) -> Vec<T>

Spawn a new instance of T from the Codex. This will encode num new Genotypes and then decode it to a new instance of T.

fn spawn_genotypes(&self, num: usize) -> Vec<Genotype<C>>

Spawn a new instance of Genotype<G, A> from the Codex. This will encode num a new Genotypes.

fn spawn_population(&self, num: usize) -> Population<C>

Spawn a new instance of Population<G, A> from the Codex. This will encode num a new Genotypes

impl<T> Debug for Graph<T>

where T: Clone + PartialEq + Default + Debug,

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl<T> Default for Graph<T>

where T: Clone + PartialEq + Default,

fn default() -> Graph<T>

Returns the “default value” for a type.

impl<T> IntoIterator for Graph<T>

where T: Clone + PartialEq + Default,

type Item = Node<T>

The type of the elements being iterated over.

type IntoIter = IntoIter<Node<T>>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<T> NodeCollection<T> for Graph<T>

where T: Clone + PartialEq + Default,

fn from_nodes(nodes: Vec<Node<T>>) -> Self

fn get(&self, index: usize) -> &Node<T>

fn get_mut(&mut self, index: usize) -> &mut Node<T>

fn get_nodes(&self) -> &[Node<T>]

fn get_nodes_mut(&mut self) -> &mut [Node<T>]

fn set(&mut self, index: usize, node: Node<T>) -> &mut Self

fn iter(&self) -> Iter<'_, Node<T>>

fn iter_mut(&mut self) -> IterMut<'_, Node<T>>

fn len(&self) -> usize

fn is_empty(&self) -> bool

fn attach(&mut self, incoming: usize, outgoing: usize) -> &mut Self

fn detach(&mut self, incoming: usize, outgoing: usize) -> &mut Self

impl<T> NodeRepairs<T> for Graph<T>

where T: Clone + PartialEq + Default,

fn repair(&mut self, factory: Option<&NodeFactory<T>>) -> Self

impl<T> PartialEq for Graph<T>

where T: Clone + PartialEq + PartialEq,

fn eq(&self, other: &Graph<T>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T> Valid for Graph<T>

where T: Clone + PartialEq + Default,

fn is_valid(&self) -> bool

impl<T> StructuralPartialEq for Graph<T>

where T: Clone + PartialEq,