#include <SewGraph.hh>

Inheritance diagram for protocols::sewing::HashEdge:

Public Member Functions
	HashEdge (SewGraph *owner, core::Size n1, core::Size n2)

void	basis_pair (BasisPair basis_pair)

BasisPair const &	basis_pair () const

core::Size	model_resnum (int model_id) const

Public Member Functions inherited from core::graph::Edge
virtual	~Edge ()
	destructor More...

	Edge (Graph *owner, platform::Size first_node_ind, platform::Size second_node_ind)
	Main edge constructor. This should only be invoked by create_new_edge, which itself is only called by add_edge. The ONLY way an edge should be added to a graph is through add_edge. NOTE: edges should be only be deleted by a call to the Graph's delete_edge method, and this method absolutely must be implemented by derived Graph classes. More...

virtual void	copy_from (Edge const *source)
	copy-from for use in Graph::operator= and copy ctors More...

platform::Size	get_other_ind (platform::Size node_index) const
	returns the index of the one node given the index of the other. node_index must be one of the two nodes that this edge is incident upon. More...

Node const *	get_other_node (platform::Size node_index) const
	returns a const pointer to one node given the index of the other. node_index must be one of the two nodes that this edge is incident upon. More...

Node *	get_other_node (platform::Size node_index)
	returns a non-const pointer to one node given the index of the other. node_index must be one of the two nodes that this edge is incident upon. More...

platform::Size	get_first_node_ind () const
	returns the index of the lower node More...

platform::Size	get_second_node_ind () const
	returns the index of the upper node More...

void	set_pos_in_owners_list (EdgeListIter edge_iterator)
	called only by class Graph, this function gives the Edge the data it needs to later delete itself from its owner's edge list in constant time. More...

bool	same_edge (platform::Size node1, platform::Size node2) const
	Is this the same edge as another edge (node1,node2)? Note: this graph does not work for multi-graphs. Edges must be unique. More...

bool	is_loop () const
	Is this edge a loop? In Pseudographs, loop edges are incident twice on a single vertex. More...

virtual platform::Size	count_static_memory () const
	how much memory is statically allocated by this edge More...

virtual platform::Size	count_dynamic_memory () const
	how much memory is dynamically allocated by this edge – must be recursively invoked by a derived class. More...

Private Attributes
BasisPair	basis_pair_

Friends
std::ostream &	operator<< (std::ostream &out, HashEdge const &edge)

Additional Inherited Members
Public Types inherited from core::graph::Edge
typedef EdgeListIterator	EdgeListIter

Protected Member Functions inherited from core::graph::Edge
platform::Size	get_node_index (platform::Size index) const
	get the node index for one of the two nodes this edge is incident upon uses c-style index-from-0. More...

Node const *	get_node (platform::Size index) const
	get a const * to one node that this edge is incident upon uses c-style index-from-0 for these two nodes More...

Node *	get_node (platform::Size index)
	get a non-const * to one node that this edge is incident upon uses c-style index-from-0 for these two nodes More...

Graph const *	get_owner () const
	get a const * to the owning graph More...

Graph *	get_owner ()
	get a non-const * to the owning graph More...