drake::planning::graph_algorithms Namespace Reference

Classes
class	MaxCliqueSolverBase
	The problem of finding the maximum clique in a graph is known to be NP-complete. More...
class	MaxCliqueSolverViaGreedy
	Approximately solves the maximum clique problem via a greedy heuristic. More...
class	MaxCliqueSolverViaMip
	Solves the maximum clique problem to global optimality by solving the mixed-integer program. More...
class	MinCliqueCoverSolverBase
class	MinCliqueCoverSolverViaGreedy
	Approximately solves the min clique cover problem via a greedy heuristic. More...