LLVM API Documentation
#include <Briggs.h>
Public Member Functions | |
| void | initialise (Solver &solver) |
| void | addToRNBucket (const GraphNodeIterator &nodeItr) |
| void | removeFromRNBucket (const GraphNodeIterator &nodeItr) |
| void | handleAddLink (const GraphEdgeIterator &edgeItr) |
| void | handleRemoveLink (const GraphEdgeIterator &edgeItr, const GraphNodeIterator &nodeItr) |
| void | processRN () |
| bool | rNBucketEmpty () const |
Classes | |
| class | EdgeData |
| class | LinkDegreeComparator |
| class | NodeData |
| class | SpillPriorityComparator |
Definition at line 28 of file Briggs.h.
| void PBQP::Heuristics::Briggs::initialise | ( | Solver & | solver | ) | [inline] |
Definition at line 275 of file Briggs.h.
References PBQP::GraphBase< NodeEntry, EdgeEntry >::edgesBegin(), PBQP::GraphBase< NodeEntry, EdgeEntry >::edgesEnd(), PBQP::AnnotatedGraph< NodeData, EdgeData >::getEdgeData(), PBQP::HeuristicSolverImpl< Heuristic >::getGraph(), PBQP::AnnotatedGraph< NodeData, EdgeData >::getNodeData(), PBQP::GraphBase< NodeEntry, EdgeEntry >::nodesBegin(), PBQP::GraphBase< NodeEntry, EdgeEntry >::nodesEnd(), PBQP::Heuristics::Briggs::EdgeData::setup(), and PBQP::Heuristics::Briggs::NodeData::setup().
| void PBQP::Heuristics::Briggs::addToRNBucket | ( | const GraphNodeIterator & | nodeItr | ) | [inline] |
| void PBQP::Heuristics::Briggs::removeFromRNBucket | ( | const GraphNodeIterator & | nodeItr | ) | [inline] |
| void PBQP::Heuristics::Briggs::handleAddLink | ( | const GraphEdgeIterator & | edgeItr | ) | [inline] |
Definition at line 321 of file Briggs.h.
References PBQP::AnnotatedGraph< NodeData, EdgeData >::getEdgeData(), PBQP::GraphBase< NodeEntry, EdgeEntry >::getEdgeNode1Itr(), PBQP::GraphBase< NodeEntry, EdgeEntry >::getEdgeNode2Itr(), PBQP::HSITypes< HeuristicNodeData, HeuristicEdgeData >::NodeData::getHeuristicData(), PBQP::HSITypes< HeuristicNodeData, HeuristicEdgeData >::NodeData::getLinkDegree(), PBQP::AnnotatedGraph< NodeData, EdgeData >::getNodeData(), and PBQP::Heuristics::Briggs::EdgeData::setup().
| void PBQP::Heuristics::Briggs::handleRemoveLink | ( | const GraphEdgeIterator & | edgeItr, | |
| const GraphNodeIterator & | nodeItr | |||
| ) | [inline] |
Definition at line 340 of file Briggs.h.
References PBQP::AnnotatedGraph< NodeData, EdgeData >::getNodeData(), and PBQP::Heuristics::Briggs::NodeData::handleRemoveLink().
| void PBQP::Heuristics::Briggs::processRN | ( | ) | [inline] |
Definition at line 346 of file Briggs.h.
References PBQP::HeuristicSolverImpl< Heuristic >::pushStack(), and PBQP::HeuristicSolverImpl< Heuristic >::unlinkNode().
| bool PBQP::Heuristics::Briggs::rNBucketEmpty | ( | ) | const [inline] |