Representational attributes

Functions
virtual TCap	abstractMixedGraph::Demand (TNode v) const throw (ERRange)
TCap	abstractMixedGraph::MaxDemand () const throw ()
virtual bool	abstractMixedGraph::CDemand () const throw ()
virtual TCap	abstractMixedGraph::UCap (TArc a) const throw (ERRange)
TCap	abstractMixedGraph::MaxUCap () const throw ()
virtual bool	abstractMixedGraph::CUCap () const throw ()
virtual TCap	abstractMixedGraph::LCap (TArc a) const throw (ERRange)
virtual TCap	abstractMixedGraph::MaxLCap () const throw ()
virtual bool	abstractMixedGraph::CLCap () const throw ()
virtual TFloat	abstractMixedGraph::Length (TArc a) const throw (ERRange)
TFloat	abstractMixedGraph::MaxLength () const throw ()
virtual bool	abstractMixedGraph::CLength () const throw ()

---

Function Documentation

bool CDemand (   )  const throw () [virtual, inherited]

Check if the node demands are all the same. Return values: true  All node demands coincide Reimplemented in balancedToBalanced, bigraphToDigraph, digraphToDigraph, and graphToBalanced.

bool CLCap (   )  const throw () [virtual, inherited]

Check if the lower capacity bounds are all the same. Return values: true  All lower capacity bounds coincide Reimplemented in balancedToBalanced, bigraphToDigraph, digraphToDigraph, graphToBalanced, and surfaceGraph.

bool CLength (   )  const throw () [virtual, inherited]

Check if the arc length labels are all the same. Return values: true  All arc length labels coincide Reimplemented in layeredAuxNetwork, balancedToBalanced, bigraphToDigraph, digraphToDigraph, graphToBalanced, and surfaceGraph.

bool CUCap (   )  const throw () [virtual, inherited]

Check if the upper capacity bounds are all the same. Return values: true  All upper capacity bounds coincide Reimplemented in layeredAuxNetwork, balancedToBalanced, bigraphToDigraph, digraphToDigraph, graphToBalanced, and surfaceGraph.

TCap Demand (  TNode  v  )  const throw (ERRange) [virtual, inherited]

Retrieve a node demand. Parameters: v  A node index ranged [0,1,..,n-1] Returns: The demand of node v Reimplemented in balancedToBalanced, bigraphToDigraph, digraphToDigraph, and graphToBalanced.

TCap LCap (  TArc  a  )  const throw (ERRange) [virtual, inherited]

Retrieve a lower capacity bound. Parameters: a  An arc index ranged [0,1,..,2m-1] Returns: The lower capacity bound of arc a Reimplemented in balancedToBalanced, bigraphToDigraph, digraphToDigraph, graphToBalanced, and surfaceGraph.

TFloat Length (  TArc  a  )  const throw (ERRange) [virtual, inherited]

Retrieve an arc length. Parameters: a  An arc index ranged [0,1,..,2m-1] Returns: The length of arc a Reimplemented in layeredAuxNetwork, balancedFNW, balancedToBalanced, bigraphToDigraph, digraphToDigraph, graphToBalanced, and surfaceGraph.

TCap MaxDemand (   )  const throw () [inherited]

Retrieve the maximum node demand. Returns: The maximum demand among all graph nodes

TCap MaxLCap (   )  const throw () [virtual, inherited]

Retrieve the maximum lower capacity bound. Returns: The maximum lower capacity bound among all graph arcs Reimplemented in digraphToDigraph.

TFloat MaxLength (   )  const throw () [inherited]

Retrieve the maximum arc length. Returns: The maximum arc length among all graph arcs Reimplemented in digraphToDigraph.

TCap MaxUCap (   )  const throw () [inherited]

Retrieve the maximum upper capacity bound. Returns: The maximum upper capacity bound among all graph arcs

TCap UCap (  TArc  a  )  const throw (ERRange) [virtual, inherited]

Retrieve an upper capacity bound. Parameters: a  An arc index ranged [0,1,..,2m-1] Returns: The upper capacity bound of arc a Reimplemented in layeredAuxNetwork, balancedToBalanced, bigraphToDigraph, digraphToDigraph, graphToBalanced, layeredShrNetwork, and surfaceGraph.