Struct Graph 

pub struct Graph<N, E> { /* private fields */ }

Implementations

impl<N, E> Graph<N, E>

pub const fn new() -> Self

pub fn node_data_slice(&self) -> &[N]

pub fn add_node(&mut self, node_data: N) -> usize

pub fn add_edge( &mut self, n1: usize, n2: usize, edge_data: E, weight: f32, ) -> Option<usize>

pub fn count_nodes(&self) -> usize

pub fn try_get_edge_between(&self, n1: usize, n2: usize) -> Option<&EdgeInfo<E>>

impl<N: Send + Sync, E: Send + Sync> Graph<N, E>

pub fn initial_community(&self) -> HashMap<usize, CommunityId>

pub fn compute_modularity( &self, assignments: &HashMap<usize, CommunityId>, ) -> f32

pub fn compute_modularity_with_local_move( &self, assignments: &HashMap<usize, CommunityId>, local_move: LocalMove, ) -> f32

pub fn leiden( &self, max_iter: Option<usize>, optimizer: &mut impl ModularityOptimizer, ) -> Graph<Community, ()>

Trait Implementations

impl<N: Debug, E: Debug> Debug for Graph<N, E>

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

Formats the value using the given formatter.

impl<N, E> Default for Graph<N, E>

fn default() -> Self

Returns the “default value” for a type.

impl<'de, N, E> Deserialize<'de> for Graph<N, E>

where N: Deserialize<'de>, E: Deserialize<'de>,

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<N, E> Serialize for Graph<N, E>

where N: Serialize, E: Serialize,

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.