LLVM API Documentation
#include <GraphBase.h>
Public Types | |
| typedef NodeList::iterator | NodeIterator |
| Iterates over the nodes of a graph. | |
| typedef NodeList::const_iterator | ConstNodeIterator |
| Iterates over the nodes of a const graph. | |
| typedef EdgeList::iterator | EdgeIterator |
| Iterates over the edges of a graph. | |
| typedef EdgeList::const_iterator | ConstEdgeIterator |
| Iterates over the edges of a const graph. | |
| typedef NodeBaseTraits < ThisGraphT > ::AdjEdgeIterator | AdjEdgeIterator |
| Iterates over the edges attached to a node. | |
| typedef NodeBaseTraits < ThisGraphT > ::ConstAdjEdgeIterator | ConstAdjEdgeIterator |
| Iterates over the edges attached to a node in a const graph. | |
Public Member Functions | |
| unsigned | getNumNodes () const |
| Returns the number of nodes in this graph. | |
| unsigned | getNumEdges () const |
| Returns the number of edges in this graph. | |
| Vector & | getNodeCosts (const NodeIterator &nodeItr) |
| Return the cost vector for the given node. | |
| const Vector & | getNodeCosts (const ConstNodeIterator &nodeItr) const |
| Return the cost vector for the give node. | |
| unsigned | getNodeDegree (const NodeIterator &nodeItr) const |
| Return the degree of the given node. | |
| void | assignNodeIDs () |
| Assigns sequential IDs to the nodes, starting at 0, which remain valid until the next addition or removal of a node. | |
| void | assignNodeIDs (const std::vector< NodeIterator > &nodeOrdering) |
| Assigns sequential IDs to the nodes using the ordering of the given vector. | |
| bool | areNodeIDsValid () const |
| Returns true if valid node IDs are assigned, false otherwise. | |
| unsigned | getNodeID (const ConstNodeIterator &nodeItr) const |
| Return the numeric ID of the given node. | |
| NodeIterator | getNodeItr (unsigned nodeID) |
| Returns the iterator associated with the given node ID. | |
| ConstNodeIterator | getNodeItr (unsigned nodeID) const |
| Returns the iterator associated with the given node ID. | |
| void | removeNode (const NodeIterator &nodeItr) |
| Removes the given node (and all attached edges) from the graph. | |
| NodeIterator | nodesBegin () |
| ConstNodeIterator | nodesBegin () const |
| NodeIterator | nodesEnd () |
| ConstNodeIterator | nodesEnd () const |
| AdjEdgeIterator | adjEdgesBegin (const NodeIterator &nodeItr) |
| ConstAdjEdgeIterator | adjEdgesBegin (const ConstNodeIterator &nodeItr) const |
| AdjEdgeIterator | adjEdgesEnd (const NodeIterator &nodeItr) |
| ConstAdjEdgeIterator | adjEdgesEnd (const ConstNodeIterator &nodeItr) const |
| EdgeIterator | findEdge (const NodeIterator &node1Itr, const NodeIterator &node2Itr) |
| ConstEdgeIterator | findEdge (const ConstNodeIterator &node1Itr, const ConstNodeIterator &node2Itr) const |
| Matrix & | getEdgeCosts (const EdgeIterator &edgeItr) |
| const Matrix & | getEdgeCosts (const ConstEdgeIterator &edgeItr) const |
| NodeIterator | getEdgeNode1Itr (const EdgeIterator &edgeItr) |
| ConstNodeIterator | getEdgeNode1Itr (const ConstEdgeIterator &edgeItr) const |
| NodeIterator | getEdgeNode2Itr (const EdgeIterator &edgeItr) |
| ConstNodeIterator | getEdgeNode2Itr (const ConstEdgeIterator &edgeItr) const |
| NodeIterator | getEdgeOtherNode (const EdgeIterator &edgeItr, const NodeIterator &nodeItr) |
| ConstNodeIterator | getEdgeOtherNode (const ConstEdgeIterator &edgeItr, const ConstNodeIterator &nodeItr) const |
| void | removeEdge (const EdgeIterator &edgeItr) |
| EdgeIterator | edgesBegin () |
| ConstEdgeIterator | edgesBegin () const |
| EdgeIterator | edgesEnd () |
| ConstEdgeIterator | edgesEnd () const |
| void | clear () |
| template<typename OStream> | |
| void | printDot (OStream &os) const |
| template<typename OStream> | |
| void | printDot (OStream &os) |
| template<typename OStream> | |
| void | dumpTo (OStream &os) const |
| template<typename OStream> | |
| void | dumpTo (OStream &os) |
Protected Member Functions | |
| GraphBase () | |
| NodeEntry & | getNodeEntry (const NodeIterator &nodeItr) |
| const NodeEntry & | getNodeEntry (const ConstNodeIterator &nodeItr) const |
| EdgeEntry & | getEdgeEntry (const EdgeIterator &edgeItr) |
| const EdgeEntry & | getEdgeEntry (const ConstEdgeIterator &edgeItr) const |
| NodeIterator | addConstructedNode (const NodeEntry &nodeEntry) |
| EdgeIterator | addConstructedEdge (const EdgeEntry &edgeEntry) |
Definition at line 40 of file GraphBase.h.
| typedef NodeList::iterator PBQP::GraphBase< NodeEntry, EdgeEntry >::NodeIterator |
Iterates over the nodes of a graph.
Reimplemented in PBQP::AnnotatedGraph< NodeData, EdgeData >.
Definition at line 60 of file GraphBase.h.
| typedef NodeList::const_iterator PBQP::GraphBase< NodeEntry, EdgeEntry >::ConstNodeIterator |
Iterates over the nodes of a const graph.
Reimplemented in PBQP::AnnotatedGraph< NodeData, EdgeData >.
Definition at line 62 of file GraphBase.h.
| typedef EdgeList::iterator PBQP::GraphBase< NodeEntry, EdgeEntry >::EdgeIterator |
Iterates over the edges of a graph.
Reimplemented in PBQP::AnnotatedGraph< NodeData, EdgeData >.
Definition at line 64 of file GraphBase.h.
| typedef EdgeList::const_iterator PBQP::GraphBase< NodeEntry, EdgeEntry >::ConstEdgeIterator |
Iterates over the edges of a const graph.
Reimplemented in PBQP::AnnotatedGraph< NodeData, EdgeData >.
Definition at line 66 of file GraphBase.h.
| typedef NodeBaseTraits<ThisGraphT>::AdjEdgeIterator PBQP::GraphBase< NodeEntry, EdgeEntry >::AdjEdgeIterator |
| typedef NodeBaseTraits<ThisGraphT>::ConstAdjEdgeIterator PBQP::GraphBase< NodeEntry, EdgeEntry >::ConstAdjEdgeIterator |
Iterates over the edges attached to a node in a const graph.
Definition at line 74 of file GraphBase.h.
| PBQP::GraphBase< NodeEntry, EdgeEntry >::GraphBase | ( | ) | [inline, protected] |
Definition at line 102 of file GraphBase.h.
| NodeEntry& PBQP::GraphBase< NodeEntry, EdgeEntry >::getNodeEntry | ( | const NodeIterator & | nodeItr | ) | [inline, protected] |
Definition at line 104 of file GraphBase.h.
Referenced by PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::addConstructedEdge(), PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::adjEdgesBegin(), PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::adjEdgesEnd(), PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::assignNodeIDs(), PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::getNodeCosts(), PBQP::AnnotatedGraph< NodeData, EdgeData >::getNodeData(), PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::getNodeDegree(), PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::getNodeID(), PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::removeEdge(), and PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::removeNode().
| const NodeEntry& PBQP::GraphBase< NodeEntry, EdgeEntry >::getNodeEntry | ( | const ConstNodeIterator & | nodeItr | ) | const [inline, protected] |
Definition at line 105 of file GraphBase.h.
| EdgeEntry& PBQP::GraphBase< NodeEntry, EdgeEntry >::getEdgeEntry | ( | const EdgeIterator & | edgeItr | ) | [inline, protected] |
Definition at line 109 of file GraphBase.h.
Referenced by PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::addConstructedEdge(), PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::getEdgeCosts(), PBQP::AnnotatedGraph< NodeData, EdgeData >::getEdgeData(), PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::getEdgeNode1Itr(), PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::getEdgeNode2Itr(), PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::getEdgeOtherNode(), and PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::removeEdge().
| const EdgeEntry& PBQP::GraphBase< NodeEntry, EdgeEntry >::getEdgeEntry | ( | const ConstEdgeIterator & | edgeItr | ) | const [inline, protected] |
Definition at line 110 of file GraphBase.h.
| NodeIterator PBQP::GraphBase< NodeEntry, EdgeEntry >::addConstructedNode | ( | const NodeEntry & | nodeEntry | ) | [inline, protected] |
Definition at line 114 of file GraphBase.h.
Referenced by PBQP::SimpleGraph::addNode(), and PBQP::AnnotatedGraph< NodeData, EdgeData >::addNode().
| EdgeIterator PBQP::GraphBase< NodeEntry, EdgeEntry >::addConstructedEdge | ( | const EdgeEntry & | edgeEntry | ) | [inline, protected] |
Definition at line 124 of file GraphBase.h.
Referenced by PBQP::SimpleGraph::addEdge(), and PBQP::AnnotatedGraph< NodeData, EdgeData >::addEdge().
| unsigned PBQP::GraphBase< NodeEntry, EdgeEntry >::getNumNodes | ( | ) | const [inline] |
Returns the number of nodes in this graph.
Definition at line 160 of file GraphBase.h.
Referenced by PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::assignNodeIDs(), PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::printDot(), PBQP::ExhaustiveSolverImpl::solve(), and PBQP::AnnotatedGraph< NodeData, EdgeData >::toSimpleGraph().
| unsigned PBQP::GraphBase< NodeEntry, EdgeEntry >::getNumEdges | ( | ) | const [inline] |
| Vector& PBQP::GraphBase< NodeEntry, EdgeEntry >::getNodeCosts | ( | const NodeIterator & | nodeItr | ) | [inline] |
Return the cost vector for the given node.
Definition at line 166 of file GraphBase.h.
Referenced by PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::printDot(), PBQP::Heuristics::Briggs::NodeData::setup(), PBQP::ExhaustiveSolverImpl::solve(), and PBQP::AnnotatedGraph< NodeData, EdgeData >::toSimpleGraph().
| const Vector& PBQP::GraphBase< NodeEntry, EdgeEntry >::getNodeCosts | ( | const ConstNodeIterator & | nodeItr | ) | const [inline] |
| unsigned PBQP::GraphBase< NodeEntry, EdgeEntry >::getNodeDegree | ( | const NodeIterator & | nodeItr | ) | const [inline] |
| void PBQP::GraphBase< NodeEntry, EdgeEntry >::assignNodeIDs | ( | ) | [inline] |
Assigns sequential IDs to the nodes, starting at 0, which remain valid until the next addition or removal of a node.
Definition at line 182 of file GraphBase.h.
Referenced by PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::dumpTo(), PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::printDot(), and PBQP::AnnotatedGraph< NodeData, EdgeData >::toSimpleGraph().
| void PBQP::GraphBase< NodeEntry, EdgeEntry >::assignNodeIDs | ( | const std::vector< NodeIterator > & | nodeOrdering | ) | [inline] |
Assigns sequential IDs to the nodes using the ordering of the given vector.
Definition at line 195 of file GraphBase.h.
| bool PBQP::GraphBase< NodeEntry, EdgeEntry >::areNodeIDsValid | ( | ) | const [inline] |
Returns true if valid node IDs are assigned, false otherwise.
Definition at line 206 of file GraphBase.h.
Referenced by PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::dumpTo(), PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::printDot(), and PBQP::AnnotatedGraph< NodeData, EdgeData >::toSimpleGraph().
| unsigned PBQP::GraphBase< NodeEntry, EdgeEntry >::getNodeID | ( | const ConstNodeIterator & | nodeItr | ) | const [inline] |
Return the numeric ID of the given node.
Calls to this method will result in an assertion failure if there have been any node additions or removals since the last call to assignNodeIDs().
Definition at line 213 of file GraphBase.h.
Referenced by PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::dumpTo(), PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::printDot(), PBQP::HeuristicSolverImpl< Heuristic >::setSolution(), and PBQP::AnnotatedGraph< NodeData, EdgeData >::toSimpleGraph().
| NodeIterator PBQP::GraphBase< NodeEntry, EdgeEntry >::getNodeItr | ( | unsigned | nodeID | ) | [inline] |
Returns the iterator associated with the given node ID.
Definition at line 219 of file GraphBase.h.
Referenced by PBQP::ExhaustiveSolverImpl::solve().
| ConstNodeIterator PBQP::GraphBase< NodeEntry, EdgeEntry >::getNodeItr | ( | unsigned | nodeID | ) | const [inline] |
| void PBQP::GraphBase< NodeEntry, EdgeEntry >::removeNode | ( | const NodeIterator & | nodeItr | ) | [inline] |
Removes the given node (and all attached edges) from the graph.
Definition at line 231 of file GraphBase.h.
| NodeIterator PBQP::GraphBase< NodeEntry, EdgeEntry >::nodesBegin | ( | ) | [inline] |
Definition at line 260 of file GraphBase.h.
Referenced by PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::assignNodeIDs(), PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::dumpTo(), PBQP::Heuristics::Briggs::initialise(), PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::printDot(), and PBQP::AnnotatedGraph< NodeData, EdgeData >::toSimpleGraph().
| ConstNodeIterator PBQP::GraphBase< NodeEntry, EdgeEntry >::nodesBegin | ( | ) | const [inline] |
Definition at line 261 of file GraphBase.h.
| NodeIterator PBQP::GraphBase< NodeEntry, EdgeEntry >::nodesEnd | ( | ) | [inline] |
Definition at line 262 of file GraphBase.h.
Referenced by PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::assignNodeIDs(), PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::dumpTo(), PBQP::Heuristics::Briggs::initialise(), PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::printDot(), and PBQP::AnnotatedGraph< NodeData, EdgeData >::toSimpleGraph().
| ConstNodeIterator PBQP::GraphBase< NodeEntry, EdgeEntry >::nodesEnd | ( | ) | const [inline] |
Definition at line 263 of file GraphBase.h.
| AdjEdgeIterator PBQP::GraphBase< NodeEntry, EdgeEntry >::adjEdgesBegin | ( | const NodeIterator & | nodeItr | ) | [inline] |
Definition at line 265 of file GraphBase.h.
Referenced by PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::findEdge(), and PBQP::HeuristicSolverImpl< Heuristic >::setSolution().
| ConstAdjEdgeIterator PBQP::GraphBase< NodeEntry, EdgeEntry >::adjEdgesBegin | ( | const ConstNodeIterator & | nodeItr | ) | const [inline] |
Definition at line 269 of file GraphBase.h.
| AdjEdgeIterator PBQP::GraphBase< NodeEntry, EdgeEntry >::adjEdgesEnd | ( | const NodeIterator & | nodeItr | ) | [inline] |
Definition at line 273 of file GraphBase.h.
Referenced by PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::findEdge(), and PBQP::HeuristicSolverImpl< Heuristic >::setSolution().
| ConstAdjEdgeIterator PBQP::GraphBase< NodeEntry, EdgeEntry >::adjEdgesEnd | ( | const ConstNodeIterator & | nodeItr | ) | const [inline] |
Definition at line 277 of file GraphBase.h.
| EdgeIterator PBQP::GraphBase< NodeEntry, EdgeEntry >::findEdge | ( | const NodeIterator & | node1Itr, | |
| const NodeIterator & | node2Itr | |||
| ) | [inline] |
Definition at line 281 of file GraphBase.h.
Referenced by PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::addConstructedEdge().
| ConstEdgeIterator PBQP::GraphBase< NodeEntry, EdgeEntry >::findEdge | ( | const ConstNodeIterator & | node1Itr, | |
| const ConstNodeIterator & | node2Itr | |||
| ) | const [inline] |
Definition at line 296 of file GraphBase.h.
| Matrix& PBQP::GraphBase< NodeEntry, EdgeEntry >::getEdgeCosts | ( | const EdgeIterator & | edgeItr | ) | [inline] |
| const Matrix& PBQP::GraphBase< NodeEntry, EdgeEntry >::getEdgeCosts | ( | const ConstEdgeIterator & | edgeItr | ) | const [inline] |
Definition at line 315 of file GraphBase.h.
| NodeIterator PBQP::GraphBase< NodeEntry, EdgeEntry >::getEdgeNode1Itr | ( | const EdgeIterator & | edgeItr | ) | [inline] |
Definition at line 319 of file GraphBase.h.
Referenced by PBQP::HeuristicSolverImpl< Heuristic >::addLink(), PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::dumpTo(), PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::findEdge(), PBQP::Heuristics::Briggs::handleAddLink(), PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::printDot(), PBQP::HeuristicSolverImpl< Heuristic >::removeLinkR2(), and PBQP::HSITypes< HeuristicNodeData, HeuristicEdgeData >::EdgeData::setup().
| ConstNodeIterator PBQP::GraphBase< NodeEntry, EdgeEntry >::getEdgeNode1Itr | ( | const ConstEdgeIterator & | edgeItr | ) | const [inline] |
Definition at line 323 of file GraphBase.h.
| NodeIterator PBQP::GraphBase< NodeEntry, EdgeEntry >::getEdgeNode2Itr | ( | const EdgeIterator & | edgeItr | ) | [inline] |
Definition at line 327 of file GraphBase.h.
Referenced by PBQP::HeuristicSolverImpl< Heuristic >::addLink(), PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::dumpTo(), PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::findEdge(), PBQP::Heuristics::Briggs::handleAddLink(), PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::printDot(), PBQP::HeuristicSolverImpl< Heuristic >::removeLinkR2(), and PBQP::HSITypes< HeuristicNodeData, HeuristicEdgeData >::EdgeData::setup().
| ConstNodeIterator PBQP::GraphBase< NodeEntry, EdgeEntry >::getEdgeNode2Itr | ( | const ConstEdgeIterator & | edgeItr | ) | const [inline] |
Definition at line 331 of file GraphBase.h.
| NodeIterator PBQP::GraphBase< NodeEntry, EdgeEntry >::getEdgeOtherNode | ( | const EdgeIterator & | edgeItr, | |
| const NodeIterator & | nodeItr | |||
| ) | [inline] |
Definition at line 335 of file GraphBase.h.
Referenced by PBQP::HeuristicSolverImpl< Heuristic >::setSolution(), and PBQP::HeuristicSolverImpl< Heuristic >::unlinkNode().
| ConstNodeIterator PBQP::GraphBase< NodeEntry, EdgeEntry >::getEdgeOtherNode | ( | const ConstEdgeIterator & | edgeItr, | |
| const ConstNodeIterator & | nodeItr | |||
| ) | const [inline] |
Definition at line 346 of file GraphBase.h.
| void PBQP::GraphBase< NodeEntry, EdgeEntry >::removeEdge | ( | const EdgeIterator & | edgeItr | ) | [inline] |
Definition at line 357 of file GraphBase.h.
Referenced by PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::removeNode().
| EdgeIterator PBQP::GraphBase< NodeEntry, EdgeEntry >::edgesBegin | ( | ) | [inline] |
Definition at line 378 of file GraphBase.h.
Referenced by PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::dumpTo(), PBQP::Heuristics::Briggs::initialise(), PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::printDot(), and PBQP::AnnotatedGraph< NodeData, EdgeData >::toSimpleGraph().
| ConstEdgeIterator PBQP::GraphBase< NodeEntry, EdgeEntry >::edgesBegin | ( | ) | const [inline] |
Definition at line 379 of file GraphBase.h.
| EdgeIterator PBQP::GraphBase< NodeEntry, EdgeEntry >::edgesEnd | ( | ) | [inline] |
Definition at line 380 of file GraphBase.h.
Referenced by PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::dumpTo(), PBQP::Heuristics::Briggs::initialise(), PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::printDot(), and PBQP::AnnotatedGraph< NodeData, EdgeData >::toSimpleGraph().
| ConstEdgeIterator PBQP::GraphBase< NodeEntry, EdgeEntry >::edgesEnd | ( | ) | const [inline] |
Definition at line 381 of file GraphBase.h.
| void PBQP::GraphBase< NodeEntry, EdgeEntry >::clear | ( | ) | [inline] |
Definition at line 383 of file GraphBase.h.
Referenced by PBQP::SimpleGraph::operator=(), and PBQP::AnnotatedGraph< NodeData, EdgeData >::operator=().
| void PBQP::GraphBase< NodeEntry, EdgeEntry >::printDot | ( | OStream & | os | ) | const [inline] |
Definition at line 392 of file GraphBase.h.
Referenced by PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::printDot().
| void PBQP::GraphBase< NodeEntry, EdgeEntry >::printDot | ( | OStream & | os | ) | [inline] |
Definition at line 428 of file GraphBase.h.
| void PBQP::GraphBase< NodeEntry, EdgeEntry >::dumpTo | ( | OStream & | os | ) | const [inline] |
Definition at line 437 of file GraphBase.h.
Referenced by PBQP::GraphBase< PBQP::AnnotatedNode< NodeData, EdgeData >, PBQP::AnnotatedEdge< NodeData, EdgeData > >::dumpTo().
| void PBQP::GraphBase< NodeEntry, EdgeEntry >::dumpTo | ( | OStream & | os | ) | [inline] |
Definition at line 460 of file GraphBase.h.