Enum PyramidAlgo 

pub enum PyramidAlgo {
    Louvain,
    Types,
}

Which algorithm forms the pyramid’s communities. The format and every downstream consumer key on opaque community IDs, so the choice only changes how the partition is computed — all modes must be deterministic to keep the file content-hash reproducible (see docs/BENCHMARK.md).

Variants

Louvain

Topological communities by Louvain modularity (the default, byte-identical across runs). “What clusters densely?”

Types

RDF-native partition: one community per rdf:type class (the type predicate auto-detected, or forced via --type-predicate), untyped / object-only nodes in one «untyped» bucket. Communities are self-naming (a community is a class), the summary graph becomes the class→class relation graph, and the subClassOf rollups supply the coarser levels. Falls back to PyramidAlgo::Louvain when the graph has no usable typing.

Implementations

impl PyramidAlgo

pub fn from_cli(s: &str) -> Option<PyramidAlgo>

Parse the CLI spelling (louvain / types); None for anything else.

Trait Implementations

impl Clone for PyramidAlgo

fn clone(&self) -> PyramidAlgo

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for PyramidAlgo

impl Debug for PyramidAlgo

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

Formats the value using the given formatter.

impl Default for PyramidAlgo

fn default() -> PyramidAlgo

Returns the “default value” for a type.

impl Eq for PyramidAlgo

impl PartialEq for PyramidAlgo

fn eq(&self, other: &PyramidAlgo) -> bool

Equality operator ==.

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

Inequality operator !=.

impl StructuralPartialEq for PyramidAlgo