Struct TriangleCounting 

pub struct TriangleCounting { /* private fields */ }

Triangle counting kernel.

Counts triangles using the node-iterator algorithm. Each triangle is counted once.

Implementations

impl TriangleCounting

pub fn new() -> Self

Create a new triangle counting kernel.

pub fn compute(graph: &CsrGraph) -> TriangleCountResult

Count all triangles in the graph.

Uses the node-iterator algorithm with degree ordering to ensure each triangle is counted exactly once.

pub fn count_node_triangles(graph: &CsrGraph, node: u64) -> u64

Count triangles for a specific node.

Trait Implementations

impl Clone for TriangleCounting

fn clone(&self) -> TriangleCounting

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for TriangleCounting

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

Formats the value using the given formatter.

impl Default for TriangleCounting

fn default() -> Self

Returns the “default value” for a type.

impl GpuKernel for TriangleCounting

fn metadata(&self) -> &KernelMetadata

Returns the kernel metadata.

fn validate(&self) -> Result<(), KernelError>

Validate kernel configuration.

fn id(&self) -> &str

Returns the kernel ID.

fn requires_gpu_native(&self) -> bool

Returns true if this kernel requires GPU-native execution.