Enum GraphAlgorithm 

pub enum GraphAlgorithm {
    PageRank,
    Wcc,
    LabelPropagation,
    Lcc,
    Sssp,
    Betweenness,
    Closeness,
    Harmonic,
    Degree,
    Louvain,
    Triangles,
    Diameter,
    KCore,
}

Supported graph algorithms.

Each variant maps to a standalone algorithm implementation under src/engine/graph/algo/. Used by PhysicalPlan::GraphAlgo to identify which algorithm to dispatch.

Variants

PageRank

PageRank — link analysis (power iteration).

Wcc

Weakly Connected Components — union-find.

LabelPropagation

Community Detection — label propagation.

Lcc

Local Clustering Coefficient — per-node triangle density.

Sssp

Single-Source Shortest Path — weighted Dijkstra.

Betweenness

Betweenness Centrality — Brandes’ algorithm.

Closeness

Closeness Centrality — inverse distance sum.

Harmonic

Harmonic Centrality — inverse distance harmonic mean.

Degree

Degree Centrality — normalized degree.

Louvain

Louvain Community Detection — modularity optimization.

Triangles

Triangle Counting — global or per-node.

Diameter

Graph Diameter / Eccentricity.

KCore

k-Core Decomposition — peeling algorithm.

Implementations

impl GraphAlgorithm

pub fn name(&self) -> &'static str

Human-readable name for progress reporting and result column headers.

pub fn is_iterative(&self) -> bool

Whether this algorithm is iterative (emits progress per iteration).

pub fn result_schema(&self) -> &'static [(&'static str, AlgoColumnType)]

Result column schema: (column_name, column_type).

Used by the Arrow result builder to construct RecordBatches and by the DDL layer to advertise result columns.

Trait Implementations

impl Clone for GraphAlgorithm

fn clone(&self) -> GraphAlgorithm

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Copy for GraphAlgorithm

impl Debug for GraphAlgorithm

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for GraphAlgorithm

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Eq for GraphAlgorithm

impl<'__msgpack_de> FromMessagePack<'__msgpack_de> for GraphAlgorithm

fn read<R: Read<'__msgpack_de>>(reader: &mut R) -> Result<Self, Error>

where Self: Sized,

Reads the MessagePack representation of this value from the provided reader.

impl Hash for GraphAlgorithm

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl PartialEq for GraphAlgorithm

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

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Serialize for GraphAlgorithm

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

where __S: Serializer,

Serialize this value into the given Serde serializer.

impl StructuralPartialEq for GraphAlgorithm

impl ToMessagePack for GraphAlgorithm

fn write<W: Write>(&self, writer: &mut W) -> Result<(), Error>

Writes the MessagePack representation of this value into the provided writer.