ResidueGraphTypes.hh File Reference

Graph structure for ResidueType. More...

#include <core/chemical/Atom.hh>
#include <core/chemical/Bond.hh>
#include <boost/graph/undirected_graph.hpp>
#include <boost/graph/filtered_graph.hpp>
#include <boost/graph/adjacency_list.hpp>
#include <utility>

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

Typedefs
typedef boost::undirected_graph< Atom, Bond >	core::chemical::ResidueGraph
typedef ResidueGraph::vertex_descriptor	core::chemical::VD
typedef ResidueGraph::edge_descriptor	core::chemical::ED
typedef utility::vector1< VD >	core::chemical::VDs
typedef boost::graph_traits< ResidueGraph >::vertex_iterator	core::chemical::VIter
typedef std::pair< VIter, VIter >	core::chemical::VIterPair
typedef boost::graph_traits< ResidueGraph >::edge_iterator	core::chemical::EIter
typedef std::pair< EIter, EIter >	core::chemical::EIterPair
typedef boost::graph_traits< ResidueGraph >::out_edge_iterator	core::chemical::OutEdgeIter
typedef std::pair< OutEdgeIter, OutEdgeIter >	core::chemical::OutEdgeIterPair
typedef boost::graph_traits< ResidueGraph >::adjacency_iterator	core::chemical::AdjacentIter
typedef std::pair< AdjacentIter, AdjacentIter >	core::chemical::AdjacentIterPair
typedef std::map< std::string, VD >	core::chemical::NameVDMap
typedef std::pair< std::string, VD >	core::chemical::NameVDPair
typedef std::pair< NameVDMap::iterator, bool >	core::chemical::NameVDInserted
typedef boost::adjacency_list< boost::vecS, boost::vecS, boost::undirectedS, boost::property< boost::vertex_name_t, core::chemical::VD >, boost::property< boost::edge_name_t, core::chemical::ED > >	core::chemical::LightWeightResidueGraph
typedef boost::graph_traits< LightWeightResidueGraph >::vertex_descriptor	core::chemical::lwrg_VD
typedef boost::graph_traits< LightWeightResidueGraph >::edge_descriptor	core::chemical::lwrg_ED
typedef boost::graph_traits< LightWeightResidueGraph >::vertex_iterator	core::chemical::lwrg_vd_iter
typedef std::pair< lwrg_vd_iter, lwrg_vd_iter >	core::chemical::lwrg_vd_pair_iter
typedef boost::graph_traits< LightWeightResidueGraph >::edge_iterator	core::chemical::lwrg_edge_iter
typedef boost::graph_traits< LightWeightResidueGraph >::out_edge_iterator	core::chemical::lwrg_out_edge_iter
typedef std::pair< lwrg_out_edge_iter, lwrg_out_edge_iter >	core::chemical::lwrg_out_edge_iter_pair

Functions
bool	core::chemical::has (ResidueGraph const &graph, VD vd)
	Does a ResidueGraph have a given vertex descriptor? More...
bool	core::chemical::has (ResidueGraph const &graph, ED ed)
	Does a ResidueGraph have a given edge descriptor? More...
template<typename Graph >
void	core::chemical::regenerate_graph_vertex_index (Graph &graph)
	When adding and deleting nodes in a graph, sometimes the inner counting of nodes/edges gets outdated. Run this to fix the problem. More...

Variables
constexpr ResidueGraph::vertex_descriptor	core::chemical::INVALID_VD = nullptr

Detailed Description

Graph structure for ResidueType.

This is the typedefs for the graph implementation of ResidueType based on boost graphs.

Author

Steven Combs