undirected_graph.cc File Reference

#include <boost/graph/undirected_graph.hpp>
#include <boost/graph/filtered_graph.hpp>
#include <boost/graph/named_function_params.hpp>
#include <boost/graph/breadth_first_search.hpp>
#include <iostream>
#include <utility/vector1.hh>

Classes
struct	Atom
struct	Bond
class	AtomNumFilter
class	PathFinder

Typedefs
typedef boost::undirected_graph< Atom, Bond >	Graph
typedef Graph::vertex_descriptor	VD
typedef utility::vector1< VD >	VDs
typedef Graph::edge_descriptor	ED
typedef std::pair< ED, bool >	EdgeBoolPair
typedef boost::graph_traits< Graph >::vertex_iterator	VIter
typedef boost::graph_traits< Graph >::edge_iterator	EIter
typedef std::pair< VIter, VIter >	VIterPair
typedef std::pair< EIter, EIter >	EIterPair
typedef boost::graph_traits< Graph >::out_edge_iterator	OutEdgeIter
typedef boost::graph_traits< Graph >::in_edge_iterator	InEdgeIter
typedef boost::graph_traits< Graph >::adjacency_iterator	AdjacencyIter
typedef std::pair< OutEdgeIter, OutEdgeIter >	OutEdgeIterPair
typedef std::pair< InEdgeIter, InEdgeIter >	InEdgeIterPair
typedef std::pair< AdjacencyIter, AdjacencyIter >	AdjacencyIterPair

Functions
std::ostream &	operator<< (std::ostream &os, Atom a)
std::ostream &	operator<< (std::ostream &os, Bond b)
template<typename graph_t >
void	print_graph (graph_t const &g)
	A better print function that works with any graph type. More...
void	manual_copy (Graph const &g_old, Graph &g_new)
int	main ()

Typedef Documentation

AdjacencyIter

typedef boost::graph_traits<Graph>::adjacency_iterator AdjacencyIter

AdjacencyIterPair

typedef std::pair<AdjacencyIter, AdjacencyIter> AdjacencyIterPair

ED

typedef Graph::edge_descriptor ED

EdgeBoolPair

typedef std::pair<ED, bool> EdgeBoolPair

EIter

typedef boost::graph_traits<Graph>::edge_iterator EIter

EIterPair

typedef std::pair<EIter, EIter> EIterPair

Graph

typedef boost::undirected_graph< Atom, Bond > Graph

InEdgeIter

typedef boost::graph_traits<Graph>::in_edge_iterator InEdgeIter

InEdgeIterPair

typedef std::pair<InEdgeIter, InEdgeIter> InEdgeIterPair

OutEdgeIter

typedef boost::graph_traits<Graph>::out_edge_iterator OutEdgeIter

OutEdgeIterPair

typedef std::pair<OutEdgeIter, OutEdgeIter> OutEdgeIterPair

VD

typedef Graph::vertex_descriptor VD

VDs

typedef utility::vector1<VD> VDs

VIter

typedef boost::graph_traits<Graph>::vertex_iterator VIter

VIterPair

typedef std::pair<VIter, VIter> VIterPair

Function Documentation

main()

int main

(

)

References a, docking::a1, docking::a2, docking::a3, compute_difference::b, docking::b1, docking::b2, utility::io::oc::cout, end, g(), ObjexxFCL::get(), Atom::i, manual_copy(), closure_error::path, print_graph(), basic::options::OptionKeys::hotspot::target, oop_scan::v1, and oop_scan::v2.

manual_copy()

void manual_copy	(	Graph const &	g_old,
		Graph &	g_new
	)

References a, compute_difference::b, utility::io::oc::cout, print_graph(), and basic::options::OptionKeys::hotspot::target.

Referenced by main().

operator<<() [1/2]

std::ostream& operator<<	(	std::ostream &	os,
		Atom	a
	)

References a.

operator<<() [2/2]

std::ostream& operator<<	(	std::ostream &	os,
		Bond	b
	)

References compute_difference::b.

print_graph()

template<typename graph_t >

void print_graph

(

graph_t const &

g

)

A better print function that works with any graph type.

References a, compute_difference::b, utility::io::oc::cout, g(), and basic::options::OptionKeys::hotspot::target.

Referenced by main(), and manual_copy().