Lines Matching refs:Graph
25 /// <li> void addToHeuristicList(Graph::NodeItr) : Add a node to the
28 /// <li> void preUpdateEdgeCosts(Graph::EdgeItr) : Handle the (imminent)
30 /// <li> void postUpdateEdgeCostts(Graph::EdgeItr) : Handle the new
32 /// <li> void handleAddEdge(Graph::EdgeItr) : Handle the addition of a new
33 /// edge into the PBQP graph (by R2).
34 /// <li> void handleRemoveEdge(Graph::EdgeItr, Graph::NodeItr) : Handle the
49 /// node/edge in the PBQP graph.
55 typedef std::list<Graph::NodeItr> OptimalList;
58 Graph &g;
66 void addToOptimalReductionList(Graph::NodeItr nItr) {
84 /// \brief Get the graph representing the problem to be solved.
85 /// @return The graph representing the problem to be solved.
86 Graph& getGraph() { return g; }
88 /// \brief Tell the solver to simplify the graph before the reduction phase.
108 bool shouldOptimallyReduce(Graph::NodeItr nItr) {
121 void addToOptimalReduceList(Graph::NodeItr nItr) {
133 for (Graph::NodeItr nItr = g.nodesBegin(), nEnd = g.nodesEnd();
153 Graph::NodeItr nItr = optimalList.front();
169 /// Reduces the problem to the empty graph by repeated application of the
188 void addToHeuristicList(Graph::NodeItr nItr) {
202 void preUpdateEdgeCosts(Graph::EdgeItr eItr) {
208 void postUpdateEdgeCostts(Graph::EdgeItr eItr) {
212 /// \brief Handle the addition of a new edge into the PBQP graph.
214 void handleAddEdge(Graph::EdgeItr eItr) {
224 /// node in the graph.
225 void handleRemoveEdge(Graph::EdgeItr eItr, Graph::NodeItr nItr) {
