Struct net_ensembles::sw_graph::SwContainer[−][src]

pub struct SwContainer<T: Node> { /* fields omitted */ }
Expand description

Used for accessing neighbor information from graph

  • contains Adjacency list and internal id (normally the index in the graph).
  • also contains user specified data, i.e, T from SwContainer<T>
  • see trait AdjContainer

Implementations

returns iterator over indices of neighbors

  • Iterator returns the same items as self.neigbors(), though it might be more efficient. It will never be less efficient

Count how many root edges are contained

Trait Implementations

Create new instance with id

return reference to what the AdjContainer contains

return mut reference to what the AdjContainer contains

returns iterator over indices of neighbors

count number of neighbors, i.e. number of edges incident to self

returns id of container

returns Some(first element from the adjecency List) or None

check if vertex with other_id is adjacent to self

Note:

(in GenericGraph<T>: id equals the index corresponding to self)

Sorting adjecency lists

  • worst case: O(edges log(edges))

Intended for all AdjContainer, which store all their edges in a continouse slice/vector. This will return a reference to the edge slice, which you can use to iterate or do other stuff Read more

Returns a copy of the value. Read more

Performs copy-assignment from source. Read more

Formats the value using the given formatter. Read more

Deserialize this value from the given Serde deserializer. Read more

  • get iterator over additional information stored at each vertex in order of the indices
  • iterator returns a Node (for example EmptyNode or whatever you used)
  • similar to self.container_iter().map(|container| container.contained())
    • Read more

  • iterate over additional information of neighbors of vertex index
  • iterator returns &T
  • sort_adj will affect the order
  • panics if index out of bounds
    • Read more

  • get iterator over AdjContainer in order of the indices
  • iterator returns AdjContainer<Node>, i.e., A
    • Read more

  • iterate over additional information of neighbors of vertex index
  • iterator returns &T
  • sort_adj will affect the order
  • panics if index out of bounds
    • Read more

  • iterate over additional information of neighbors of vertex index
  • iterator returns (index_neighbor,&T)
  • sort_adj will affect the order
  • panics if index out of bounds
    • Read more

    returns Iterator Read more

    returns Iterator Read more

    returns Iterator Read more

  • iterate over mutable additional information of neighbors of vertex index
  • iterator returns &mut T
  • sort_adj will affect the order
  • panics if index out of bounds
    • Read more

  • iterate over mutable additional information of neighbors of vertex index
  • iterator returns (index_neighbor: usize, neighbor: &mut T)
  • sort_adj will affect the order
  • panics if index out of bounds
    • Read more

  • get iterator over mutable additional information stored at each vertex in order of the indices
  • iterator returns a Node (for example EmptyNode or whatever you used)
    • Read more

    Serialize this value into the given Serde serializer. Read more

    Auto Trait Implementations

    Blanket Implementations

    Gets the TypeId of self. Read more

    Immutably borrows from an owned value. Read more

    Mutably borrows from an owned value. Read more

    Cast from Self to T

    Try converting from Self to T

    Cast to integer, truncating Read more

    Cast to the nearest integer Read more

    Cast the floor to an integer Read more

    Cast the ceiling to an integer Read more

    Try converting to integer with truncation Read more

    Try converting to the nearest integer Read more

    Try converting the floor to an integer Read more

    Try convert the ceiling to an integer Read more

    Convert from T to Self

    Try converting from T to Self

    Performs the conversion.

    Performs the conversion.

    The alignment of pointer.

    The type for initializers.

    Initializes a with the given initializer. Read more

    Dereferences the given pointer. Read more

    Mutably dereferences the given pointer. Read more

    Drops the object pointed to by the given pointer. Read more

    The resulting type after obtaining ownership.

    Creates owned data from borrowed data, usually by cloning. Read more

    🔬 This is a nightly-only experimental API. (toowned_clone_into)

    recently added

    Uses borrowed data to replace owned data, usually by cloning. Read more

    The type returned in the event of a conversion error.

    Performs the conversion.

    The type returned in the event of a conversion error.

    Performs the conversion.