Enum DimacsProblem 

pub enum DimacsProblem {
    Max {
        source: Option<VertexId>,
        target: Option<VertexId>,
        capacity: Vec<f64>,
    },
    Edge {
        labels: Vec<i64>,
    },
}

The problem described by a DIMACS file, see DimacsFlow.

Variants

Max

A maximum flow problem (p max).

Fields

source: Option<VertexId>

The source vertex (0-based igraph id; DIMACS ids start from 1), None if the file has no n <id> s line.

target: Option<VertexId>

The target vertex (0-based igraph id), None if the file has no n <id> t line.

capacity: Vec<f64>

The capacity of each edge, in edge id order.

Edge

An “edge” problem (p edge), e.g. a graph coloring instance (see Graph::vertex_coloring_greedy to solve one).

Fields

labels: Vec<i64>

The integer label of each vertex: its 1-based DIMACS index (igraph 1.0.0 and 1.0.1 cannot parse the n lines that would change it).

Trait Implementations

impl Clone for DimacsProblem

fn clone(&self) -> DimacsProblem

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for DimacsProblem

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

Formats the value using the given formatter.

impl PartialEq for DimacsProblem

fn eq(&self, other: &DimacsProblem) -> 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 StructuralPartialEq for DimacsProblem