Lines Matching full:brief
17 /// \brief Abstract base class for heuristic implementations.
72 /// \brief Construct an instance with a reference to the given solver.
77 /// \brief Get the solver which is using this heuristic instance.
84 /// \brief Get the graph representing the problem to be solved.
88 /// \brief Tell the solver to simplify the graph before the reduction phase.
97 /// \brief Decide whether a node should be optimally or heuristically
115 /// \brief Add the given node to the list of nodes to be optimally reduced.
125 /// \brief Initialise the heuristic.
143 /// \brief Optimally reduce one of the nodes in the optimal reduce list.
167 /// \brief Perform the PBQP reduction process.
186 /// \brief Add a node to the heuristic reduce list.
192 /// \brief Heuristically reduce one of the nodes in the heuristic
200 /// \brief Prepare a change in the costs on the given edge.
206 /// \brief Handle the change in the costs on the given edge.
212 /// \brief Handle the addition of a new edge into the PBQP graph.
218 /// \brief Handle disconnection of an edge from a node.
229 /// \brief Clean up any structures used by HeuristicBase.
