Struct NetworkData 

pub struct NetworkData { /* private fields */ }

Implementations

impl NetworkData

pub fn new() -> Self

pub fn add_edge<E: Entity, ET: EdgeType<E>>( &mut self, entity_id: EntityId<E>, neighbor: EntityId<E>, weight: f32, inner: ET, ) -> Result<(), IxaError>

Inserts the given edge into the adjacency list for the given entity. If an edge having the same neighbor as the given edge exists, an error is returned.

pub fn remove_edge<E: Entity, ET: EdgeType<E>>( &mut self, entity_id: EntityId<E>, neighbor: EntityId<E>, ) -> Option<Edge<E, ET>>

Remove the edge from the given entity to the given neighbor and return it, or None if the edge does not exist.

pub fn get_edge<E: Entity, ET: EdgeType<E>>( &self, entity_id: EntityId<E>, neighbor: EntityId<E>, ) -> Option<&Edge<E, ET>>

Returns an immutable reference to the edge from the given entity to the given neighbor, or None if the edge does not exist.

pub fn get_edges<E: Entity, ET: EdgeType<E>>( &self, entity_id: EntityId<E>, ) -> Vec<Edge<E, ET>>

Returns a clone of the adjacency list for the given entity. Returns an empty list if the list is empty.

pub fn get_edges_ref<E: Entity, ET: EdgeType<E>>( &self, entity_id: EntityId<E>, ) -> Option<&Vec<Edge<E, ET>>>

Returns a clone of the adjacency list for the given entity. Returns an empty list if the list is empty.

pub fn find_entities_by_degree<E: Entity, ET: EdgeType<E>>( &self, degree: usize, ) -> Vec<EntityId<E>>

Returns a list of EntityId<E>s having exactly the given number of neighbors.

Trait Implementations

impl Default for NetworkData

fn default() -> Self

Returns the “default value” for a type.