Struct PLM

pub struct PLM { /* private fields */ }

Implementations

impl PLM

pub const BALANCED: &str = "balanced"

pub const NONE: &str = "none"

pub const NONE_RANDOMIZED: &str = "none randomized"

pub const SIMPLE: &str = "simple"

pub fn new( g: &Graph, refine: Option<bool>, gamma: Option<f64>, par: Option<&str>, max_iter: Option<u64>, turbo: Option<bool>, recurse: Option<bool>, ) -> Result<Self>

pub fn coarsen(g: &Graph, zeta: &Partition) -> (Graph, Vec<u64>)

pub fn prolong( g: &Graph, zeta_coarse: &Partition, g_fine: &Graph, node_to_meta_node: &[u64], ) -> Partition

Trait Implementations

impl Algorithm for PLM

fn run(&mut self) -> Result<()>

fn has_finished(&self) -> bool

impl CommunityDetector for PLM

fn get_partition(&mut self) -> Partition