pub struct DimacsGraph {
pub graph: Graph,
pub problem: DimacsProblem,
pub source: Option<u32>,
pub target: Option<u32>,
pub capacity: Option<Vec<f64>>,
pub labels: Option<Vec<i64>>,
}Expand description
Result of reading a DIMACS file.
Fields§
§graph: GraphThe parsed graph.
problem: DimacsProblemProblem type.
source: Option<u32>Source vertex (0-based). Only meaningful for Max problems.
target: Option<u32>Target vertex (0-based). Only meaningful for Max problems.
capacity: Option<Vec<f64>>Edge capacities (one per edge, in edge order). Only present for
Max problems.
labels: Option<Vec<i64>>Vertex labels (indexed by vertex id). Only present for Edge
problems when at least one n line appears.
Trait Implementations§
Source§impl Clone for DimacsGraph
impl Clone for DimacsGraph
Source§fn clone(&self) -> DimacsGraph
fn clone(&self) -> DimacsGraph
Returns a duplicate of the value. Read more
1.0.0 · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreAuto Trait Implementations§
impl !Freeze for DimacsGraph
impl !RefUnwindSafe for DimacsGraph
impl Send for DimacsGraph
impl !Sync for DimacsGraph
impl Unpin for DimacsGraph
impl UnsafeUnpin for DimacsGraph
impl UnwindSafe for DimacsGraph
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more