min_clique_cover_solver_via_greedy.h File Reference

#include <memory>
#include <set>
#include <vector>
#include <Eigen/Sparse>
#include "drake/planning/graph_algorithms/max_clique_solver_base.h"
#include "drake/planning/graph_algorithms/min_clique_cover_solver_base.h"

Include dependency graph for min_clique_cover_solver_via_greedy.h:

Classes
class	MinCliqueCoverSolverViaGreedy
	Approximately solves the min clique cover problem via a greedy heuristic. More...

Namespaces
	drake
	drake::planning
	drake::planning::graph_algorithms