CYCLUS
|
An arc represents a possible connection between two nodes in the bipartite resource exchange graph.
It is common to refer to the two sets of nodes in a bipartite graph by the set variables U and V (see http://en.wikipedia.org/wiki/Bipartite_graph). By convention, arc.unode() == request node, arc.vnode() == bid node.
Definition at line 67 of file exchange_graph.h.
#include <exchange_graph.h>
Public Member Functions | |
Arc () | |
Arc (boost::shared_ptr< ExchangeNode > unode, boost::shared_ptr< ExchangeNode > vnode) | |
Arc (const Arc &other) | |
double | excl_val () const |
bool | exclusive () const |
bool | operator< (const Arc &rhs) const |
Arc & | operator= (const Arc &other) |
bool | operator== (const Arc &rhs) const |
double | pref () const |
void | pref (double pref) |
boost::shared_ptr< ExchangeNode > | unode () const |
boost::shared_ptr< ExchangeNode > | vnode () const |
|
inline |
default required for usage in maps
Definition at line 72 of file exchange_graph.h.
cyclus::Arc::Arc | ( | boost::shared_ptr< ExchangeNode > | unode, |
boost::shared_ptr< ExchangeNode > | vnode ) |
Definition at line 58 of file exchange_graph.cc.
Definition at line 82 of file exchange_graph.cc.
|
inline |
Definition at line 98 of file exchange_graph.h.
|
inline |
Definition at line 97 of file exchange_graph.h.
Definition at line 86 of file exchange_graph.h.
Definition at line 78 of file exchange_graph.h.
Definition at line 91 of file exchange_graph.h.
|
inline |
Definition at line 99 of file exchange_graph.h.
Definition at line 100 of file exchange_graph.h.
|
inline |
Definition at line 95 of file exchange_graph.h.
|
inline |
Definition at line 96 of file exchange_graph.h.