util.hh File Reference

Simple utilities for interaction graphs. More...

#include <core/pose/Pose.fwd.hh>
#include <core/pack/interaction_graph/AnnealableGraphBase.fwd.hh>
#include <core/pack/rotamer_set/RotamerSets.fwd.hh>
#include <core/conformation/Residue.fwd.hh>
#include <core/types.hh>
#include <utility/vector1.fwd.hh>
#include <iosfwd>

Namespaces
	core
	A class for reading in the atom type properties.
	core::pack
	core::pack::interaction_graph

Functions
void	core::pack::interaction_graph::get_annealable_graph_summary (std::ostream &igstream, core::pose::Pose const &pose, core::pack::rotamer_set::RotamerSets const &rot_sets, AnnealableGraphBaseCOP const &anngraph, bool const short_version)
	Given an interaction graph, get a summary describing it fully. More...
void	core::pack::interaction_graph::set_externally_generated_packer_solution (core::pose::Pose &pose, std::string const &packer_problem_description, std::string const &packer_solution_description)
	Given a description of a packer problem, a description of the solution, and a pose to put a result in, generate a pose representing the solution. More...
void	core::pack::interaction_graph::generate_pose_from_packer_description (core::pose::Pose &pose, std::string const &packer_problem_description)
	Given the description of a packer problem as generated by get_annealable_graph_summary(), pull out and re-generate the pose. More...
void	core::pack::interaction_graph::generate_rotamers_from_packer_solution_description (utility::vector1< std::pair< core::Size, core::conformation::ResidueCOP > > &rotamers, std::string const &packer_problem_description, std::string const &packer_solution_description)
	Given a packer problem and its solution, generate rotamers from it. More...
void	core::pack::interaction_graph::add_rotamers_to_pose (core::pose::Pose &pose, utility::vector1< std::pair< core::Size, core::conformation::ResidueCOP > > &rotamers)
	Given a vector of solution rotamers and a pose, put the rotamers on the pose. More...

Detailed Description

Simple utilities for interaction graphs.

Author

Vikram K. Mulligan (vmull.nosp@m.igan.nosp@m.@flat.nosp@m.iron.nosp@m.insti.nosp@m.tute.nosp@m..org)