|
| EWBaseGraphRef () |
|
| EWBaseGraphRef (Pointed *g) |
|
| EWBaseGraphRef (const Base &other) |
|
virtual | ~EWBaseGraphRef () |
|
virtual void | insert (Edge e, Weight w=(Weight) 0) |
|
virtual Weight | weight (const Edge &e) |
|
virtual Weight | weight (const Edge &e) const |
|
virtual Weight | Fm (const Vertex &v) const |
|
| BaseGraphRef () |
|
| BaseGraphRef (Pointed *g) |
|
| BaseGraphRef (const Base &other) |
|
virtual | ~BaseGraphRef () |
|
virtual void | insert (Vertex v) |
|
virtual void | insert (Edge e) |
|
virtual bool | contains (const Vertex &v) const |
|
virtual bool | contains (const Edge &e) const |
|
virtual bool | empty () const |
|
virtual void | clear () |
|
virtual bool | operator== (const This &other) const |
|
virtual bool | operator!= (const This &other) const |
|
virtual bool | operator> (const This &other) const |
|
virtual bool | operator< (const This &other) const |
|
virtual bool | operator>= (const This &other) const |
|
virtual bool | operator<= (const This &other) const |
|
virtual bool | isAdjacent (const Vertex &x, const Vertex &y) const |
|
virtual bool | isLinked (const Vertex &x, const Vertex &y) const |
|
virtual bool | isSubGraph (const Graph &g) const |
|
virtual bool | isConnectedComponent (const Graph &g) const |
|
virtual bool | isAdjacentTo (const Vertex &v, const Graph &g) const |
|
virtual bool | isAdjacentFrom (const Vertex &v, const Graph &g) const |
|
virtual bool | isAdjacent (const Edge &e) const |
|
virtual bool | isLinked (const Vertex &v) const |
|
virtual bool | isExtension (const Graph &h, const Graph &g) const |
|
virtual bool | isForestRelativeTo (const Graph &h, const Graph &g) const |
|
virtual bool | isSpanningForestRelativeTo (const Graph &h, const Graph &g) const |
|
virtual bool | isTree (const Graph &g) const |
|
virtual bool | isSpanningTree (const Graph &g) const |
|
virtual bool | isForest (const Graph &g) const |
|
virtual bool | isSpanningForest (const Graph &g) const |
|
template<typename EdgeIterator > |
bool | isGraphCut (EdgeIterator begin, EdgeIterator end, const Graph &g) const |
|
template<typename EdgeSet > |
bool | isGraphCut (const EdgeSet &es, const Graph &g) const |
|
template<typename E, typename W>
class bio::EWBaseGraphRef< E, W >
Reference to a EWBaseGraph.
This utility class is the entry point to edge weighted graphs. It permits to avoid unnecessary copys of big structures, while giving access to all the necessary methods.
Definition at line 122 of file edgeweightedgraph.h.