LLVM API Documentation
#include <AnnotatedGraph.h>
Public Types | |
| typedef PGraph::NodeIterator | NodeIterator |
| Iterates over the nodes of a graph. | |
| typedef PGraph::ConstNodeIterator | ConstNodeIterator |
| Iterates over the nodes of a const graph. | |
| typedef PGraph::EdgeIterator | EdgeIterator |
| Iterates over the edges of a graph. | |
| typedef PGraph::ConstEdgeIterator | ConstEdgeIterator |
| Iterates over the edges of a const graph. | |
Public Member Functions | |
| AnnotatedGraph () | |
| AnnotatedGraph (const AnnotatedGraph &other) | |
| AnnotatedGraph & | operator= (const AnnotatedGraph &other) |
| NodeIterator | addNode (const Vector &costs, const NodeData &data) |
| EdgeIterator | addEdge (const NodeIterator &node1Itr, const NodeIterator &node2Itr, const Matrix &costs, const EdgeData &data) |
| NodeData & | getNodeData (const NodeIterator &nodeItr) |
| const NodeData & | getNodeData (const NodeIterator &nodeItr) const |
| EdgeData & | getEdgeData (const EdgeIterator &edgeItr) |
| const EdgeEntry & | getEdgeData (const EdgeIterator &edgeItr) const |
| SimpleGraph | toSimpleGraph () const |
Definition at line 70 of file AnnotatedGraph.h.
| typedef PGraph::NodeIterator PBQP::AnnotatedGraph< NodeData, EdgeData >::NodeIterator |
Iterates over the nodes of a graph.
Reimplemented from PBQP::GraphBase< NodeEntry, EdgeEntry >.
Definition at line 106 of file AnnotatedGraph.h.
| typedef PGraph::ConstNodeIterator PBQP::AnnotatedGraph< NodeData, EdgeData >::ConstNodeIterator |
Iterates over the nodes of a const graph.
Reimplemented from PBQP::GraphBase< NodeEntry, EdgeEntry >.
Definition at line 107 of file AnnotatedGraph.h.
| typedef PGraph::EdgeIterator PBQP::AnnotatedGraph< NodeData, EdgeData >::EdgeIterator |
Iterates over the edges of a graph.
Reimplemented from PBQP::GraphBase< NodeEntry, EdgeEntry >.
Definition at line 108 of file AnnotatedGraph.h.
| typedef PGraph::ConstEdgeIterator PBQP::AnnotatedGraph< NodeData, EdgeData >::ConstEdgeIterator |
Iterates over the edges of a const graph.
Reimplemented from PBQP::GraphBase< NodeEntry, EdgeEntry >.
Definition at line 109 of file AnnotatedGraph.h.
| PBQP::AnnotatedGraph< NodeData, EdgeData >::AnnotatedGraph | ( | ) | [inline] |
Definition at line 111 of file AnnotatedGraph.h.
| PBQP::AnnotatedGraph< NodeData, EdgeData >::AnnotatedGraph | ( | const AnnotatedGraph< NodeData, EdgeData > & | other | ) | [inline] |
Definition at line 113 of file AnnotatedGraph.h.
| AnnotatedGraph& PBQP::AnnotatedGraph< NodeData, EdgeData >::operator= | ( | const AnnotatedGraph< NodeData, EdgeData > & | other | ) | [inline] |
Definition at line 117 of file AnnotatedGraph.h.
References PBQP::GraphBase< NodeEntry, EdgeEntry >::clear().
| NodeIterator PBQP::AnnotatedGraph< NodeData, EdgeData >::addNode | ( | const Vector & | costs, | |
| const NodeData & | data | |||
| ) | [inline] |
Definition at line 123 of file AnnotatedGraph.h.
References PBQP::GraphBase< NodeEntry, EdgeEntry >::addConstructedNode().
| EdgeIterator PBQP::AnnotatedGraph< NodeData, EdgeData >::addEdge | ( | const NodeIterator & | node1Itr, | |
| const NodeIterator & | node2Itr, | |||
| const Matrix & | costs, | |||
| const EdgeData & | data | |||
| ) | [inline] |
Definition at line 127 of file AnnotatedGraph.h.
References PBQP::GraphBase< NodeEntry, EdgeEntry >::addConstructedEdge().
| NodeData& PBQP::AnnotatedGraph< NodeData, EdgeData >::getNodeData | ( | const NodeIterator & | nodeItr | ) | [inline] |
Definition at line 134 of file AnnotatedGraph.h.
References PBQP::AnnotatedNode< NodeData, EdgeData >::getNodeData(), and PBQP::GraphBase< NodeEntry, EdgeEntry >::getNodeEntry().
Referenced by PBQP::HeuristicSolverImpl< Heuristic >::addLink(), PBQP::Heuristics::Briggs::addToRNBucket(), PBQP::Heuristics::Briggs::handleAddLink(), PBQP::Heuristics::Briggs::handleRemoveLink(), PBQP::Heuristics::Briggs::initialise(), PBQP::Heuristics::Briggs::removeFromRNBucket(), PBQP::HeuristicSolverImpl< Heuristic >::removeLink(), PBQP::HeuristicSolverImpl< Heuristic >::removeLinkR2(), PBQP::HeuristicSolverImpl< Heuristic >::setSolution(), PBQP::HSITypes< HeuristicNodeData, HeuristicEdgeData >::EdgeData::setup(), PBQP::Heuristics::Briggs::NodeData::setup(), PBQP::HSITypes< HeuristicNodeData, HeuristicEdgeData >::EdgeData::unlink(), and PBQP::HeuristicSolverImpl< Heuristic >::unlinkNode().
| const NodeData& PBQP::AnnotatedGraph< NodeData, EdgeData >::getNodeData | ( | const NodeIterator & | nodeItr | ) | const [inline] |
Definition at line 138 of file AnnotatedGraph.h.
References PBQP::AnnotatedNode< NodeData, EdgeData >::getNodeData(), and PBQP::GraphBase< NodeEntry, EdgeEntry >::getNodeEntry().
| EdgeData& PBQP::AnnotatedGraph< NodeData, EdgeData >::getEdgeData | ( | const EdgeIterator & | edgeItr | ) | [inline] |
Definition at line 142 of file AnnotatedGraph.h.
References PBQP::AnnotatedEdge< NodeData, EdgeData >::getEdgeData(), and PBQP::GraphBase< NodeEntry, EdgeEntry >::getEdgeEntry().
Referenced by PBQP::HeuristicSolverImpl< Heuristic >::addLink(), PBQP::Heuristics::Briggs::handleAddLink(), PBQP::Heuristics::Briggs::initialise(), and PBQP::HeuristicSolverImpl< Heuristic >::removeLink().
| const EdgeEntry& PBQP::AnnotatedGraph< NodeData, EdgeData >::getEdgeData | ( | const EdgeIterator & | edgeItr | ) | const [inline] |
Definition at line 146 of file AnnotatedGraph.h.
References PBQP::AnnotatedEdge< NodeData, EdgeData >::getEdgeData(), and PBQP::GraphBase< NodeEntry, EdgeEntry >::getEdgeEntry().
| SimpleGraph PBQP::AnnotatedGraph< NodeData, EdgeData >::toSimpleGraph | ( | ) | const [inline] |
Definition at line 150 of file AnnotatedGraph.h.
References PBQP::SimpleGraph::addEdge(), PBQP::SimpleGraph::addNode(), PBQP::GraphBase< NodeEntry, EdgeEntry >::areNodeIDsValid(), PBQP::GraphBase< NodeEntry, EdgeEntry >::assignNodeIDs(), PBQP::GraphBase< NodeEntry, EdgeEntry >::edgesBegin(), PBQP::GraphBase< NodeEntry, EdgeEntry >::edgesEnd(), PBQP::GraphBase< NodeEntry, EdgeEntry >::getEdgeCosts(), PBQP::GraphBase< NodeEntry, EdgeEntry >::getNodeCosts(), PBQP::GraphBase< NodeEntry, EdgeEntry >::getNodeID(), PBQP::GraphBase< NodeEntry, EdgeEntry >::getNumNodes(), PBQP::GraphBase< NodeEntry, EdgeEntry >::nodesBegin(), and PBQP::GraphBase< NodeEntry, EdgeEntry >::nodesEnd().