Struct PartitionGraph 

pub struct PartitionGraph { /* private fields */ }

Directed partition graph with adjacency between partitions.

Implementations

impl PartitionGraph

pub fn new() -> Self

Creates an empty graph.

pub fn insert_partition( &mut self, partition: ExecutionPartition, ) -> DistributeResult<()>

Inserts a partition.

pub fn connect( &mut self, from: impl Into<String>, to: impl Into<String>, ) -> DistributeResult<()>

Connects two partitions with a directed edge.

pub fn partitions(&self) -> &HashMap<String, ExecutionPartition>

Returns partitions.

pub fn edges(&self) -> &[(String, String)]

Returns edges.

pub fn partition(&self, id: &str) -> Option<&ExecutionPartition>

Looks up a partition by id.

pub fn partition_of_node(&self, node_id: &str) -> Option<&ExecutionPartition>

Finds which partition owns a node id.

pub fn successors(&self, id: &str) -> Vec<&str>

Returns outgoing neighbors of a partition.

pub fn topological_order(&self) -> DistributeResult<Vec<String>>

Returns a topological order of partitions, or errors on cycles / missing nodes.

Trait Implementations

impl Clone for PartitionGraph

fn clone(&self) -> PartitionGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PartitionGraph

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

Formats the value using the given formatter.

impl Default for PartitionGraph

fn default() -> PartitionGraph

Returns the “default value” for a type.