Trait ConnectivityAlgorithms 

pub trait ConnectivityAlgorithms<R: Runtime> {
    // Required methods
    fn connected_components(
        &self,
        graph: &GraphData<R>,
    ) -> Result<ComponentResult<R>>;
    fn strongly_connected_components(
        &self,
        graph: &GraphData<R>,
    ) -> Result<ComponentResult<R>>;
    fn is_connected(&self, graph: &GraphData<R>) -> Result<bool>;
    fn is_strongly_connected(&self, graph: &GraphData<R>) -> Result<bool>;
}

Graph connectivity algorithms.

Determines connected components and connectivity properties.

Required Methods

fn connected_components( &self, graph: &GraphData<R>, ) -> Result<ComponentResult<R>>

Find connected components of an undirected graph.

Uses BFS-based label propagation. Each node gets labeled with its component ID (smallest node index in the component).

For directed graphs, treats edges as undirected.

fn strongly_connected_components( &self, graph: &GraphData<R>, ) -> Result<ComponentResult<R>>

Find strongly connected components of a directed graph.

Uses Tarjan’s algorithm (sequential DFS-based). For undirected graphs, equivalent to connected_components.

fn is_connected(&self, graph: &GraphData<R>) -> Result<bool>

Check if the graph is connected (undirected) or weakly connected (directed).

fn is_strongly_connected(&self, graph: &GraphData<R>) -> Result<bool>

Check if the directed graph is strongly connected.

Every node is reachable from every other node.

Implementations on Foreign Types

impl ConnectivityAlgorithms<CpuRuntime> for CpuClient

fn connected_components( &self, graph: &GraphData<CpuRuntime>, ) -> Result<ComponentResult<CpuRuntime>>

fn strongly_connected_components( &self, graph: &GraphData<CpuRuntime>, ) -> Result<ComponentResult<CpuRuntime>>

fn is_connected(&self, graph: &GraphData<CpuRuntime>) -> Result<bool>

fn is_strongly_connected(&self, graph: &GraphData<CpuRuntime>) -> Result<bool>

Implementors