mgx::VVGraph< VertexContent, EdgeContent > Member List

This is the complete list of members for mgx::VVGraph< VertexContent, EdgeContent >, including all inherited members.

any() const	mgx::VVGraph< VertexContent, EdgeContent >
anyIn(const vertex_t &v) const	mgx::VVGraph< VertexContent, EdgeContent >
begin()	mgx::VVGraph< VertexContent, EdgeContent >	inline
begin() const	mgx::VVGraph< VertexContent, EdgeContent >	inline
circ_neighbor_iterator typedef	mgx::VVGraph< VertexContent, EdgeContent >
circ_neighbor_iterator_pair typedef	mgx::VVGraph< VertexContent, EdgeContent >
clear(const vertex_t &v)	mgx::VVGraph< VertexContent, EdgeContent >
clear()	mgx::VVGraph< VertexContent, EdgeContent >
clear(iterator it)	mgx::VVGraph< VertexContent, EdgeContent >
const_circ_neighbor_iterator typedef	mgx::VVGraph< VertexContent, EdgeContent >
const_circ_neighbor_iterator_pair typedef	mgx::VVGraph< VertexContent, EdgeContent >
const_edge_t typedef	mgx::VVGraph< VertexContent, EdgeContent >
const_iterator typedef	mgx::VVGraph< VertexContent, EdgeContent >
const_neighbor_found_t typedef	mgx::VVGraph< VertexContent, EdgeContent >	protected
const_neighbor_iterator typedef	mgx::VVGraph< VertexContent, EdgeContent >
const_neighbor_iterator_pair typedef	mgx::VVGraph< VertexContent, EdgeContent >
contains(const vertex_t &v) const	mgx::VVGraph< VertexContent, EdgeContent >
count(const vertex_t &v) const	mgx::VVGraph< VertexContent, EdgeContent >
edge(const vertex_t &src, const vertex_t &tgt)	mgx::VVGraph< VertexContent, EdgeContent >
edge(const vertex_t &src, const vertex_t &tgt) const	mgx::VVGraph< VertexContent, EdgeContent >
edge_list_t typedef	mgx::VVGraph< VertexContent, EdgeContent >	protected
edge_t typedef	mgx::VVGraph< VertexContent, EdgeContent >
empty() const	mgx::VVGraph< VertexContent, EdgeContent >	inline
empty(const vertex_t &v) const	mgx::VVGraph< VertexContent, EdgeContent >
end()	mgx::VVGraph< VertexContent, EdgeContent >	inline
end() const	mgx::VVGraph< VertexContent, EdgeContent >	inline
erase(const vertex_t &v)	mgx::VVGraph< VertexContent, EdgeContent >
erase(iterator pos)	mgx::VVGraph< VertexContent, EdgeContent >
eraseAllEdges(const vertex_t &v)	mgx::VVGraph< VertexContent, EdgeContent >
eraseAllEdges()	mgx::VVGraph< VertexContent, EdgeContent >
eraseAllEdges(iterator it)	mgx::VVGraph< VertexContent, EdgeContent >
eraseAllEdges(NeighborhoodPair *it)	mgx::VVGraph< VertexContent, EdgeContent >	protected
eraseEdge(const vertex_t &src, const vertex_t &tgt)	mgx::VVGraph< VertexContent, EdgeContent >
eraseEdge(const vertex_t &v, neighbor_iterator pos)	mgx::VVGraph< VertexContent, EdgeContent >
eraseEdge(const vertex_t &v, circ_neighbor_iterator pos)	mgx::VVGraph< VertexContent, EdgeContent >
findIn(const vertex_t &v, const vertex_t &n)	mgx::VVGraph< VertexContent, EdgeContent >
findIn(const vertex_t &v, const vertex_t &n) const	mgx::VVGraph< VertexContent, EdgeContent >
findInVertex(const vertex_t &v, const vertex_t &neighbor)	mgx::VVGraph< VertexContent, EdgeContent >	protected
findInVertex(const vertex_t &v, const vertex_t &neighbor) const	mgx::VVGraph< VertexContent, EdgeContent >	protected
findIterator(const NeighborhoodPair *np)	mgx::VVGraph< VertexContent, EdgeContent >	protected
findIterator(const NeighborhoodPair *np) const	mgx::VVGraph< VertexContent, EdgeContent >	protected
findVertex(const vertex_t &v)	mgx::VVGraph< VertexContent, EdgeContent >	protected
findVertex(const vertex_t &v) const	mgx::VVGraph< VertexContent, EdgeContent >	protected
insert(const vertex_t &v, bool checkUnique=true)	mgx::VVGraph< VertexContent, EdgeContent >
insert(Iterator first, Iterator last, bool checkUnique=true)	mgx::VVGraph< VertexContent, EdgeContent >
insert(const std::pair< Iterator, Iterator > &range, bool checkUnique=true)	mgx::VVGraph< VertexContent, EdgeContent >
insertEdge(const vertex_t &src, const vertex_t &tgt)	mgx::VVGraph< VertexContent, EdgeContent >
int_const_neighbor_iterator typedef	mgx::VVGraph< VertexContent, EdgeContent >	protected
int_neighbor_iterator typedef	mgx::VVGraph< VertexContent, EdgeContent >	protected
isModified() const	mgx::VVGraph< VertexContent, EdgeContent >	inline
iterator typedef	mgx::VVGraph< VertexContent, EdgeContent >
lookup	mgx::VVGraph< VertexContent, EdgeContent >	protected
lookup_t typedef	mgx::VVGraph< VertexContent, EdgeContent >
modified	mgx::VVGraph< VertexContent, EdgeContent >	protected
neighbor_found_t typedef	mgx::VVGraph< VertexContent, EdgeContent >	protected
neighbor_iterator typedef	mgx::VVGraph< VertexContent, EdgeContent >
neighbor_iterator_pair typedef	mgx::VVGraph< VertexContent, EdgeContent >
neighborhood	mgx::VVGraph< VertexContent, EdgeContent >	protected
neighborhood_t typedef	mgx::VVGraph< VertexContent, EdgeContent >
neighborhood_value_type typedef	mgx::VVGraph< VertexContent, EdgeContent >
neighbors(const vertex_t &v) const	mgx::VVGraph< VertexContent, EdgeContent >
neighbors(const vertex_t &v)	mgx::VVGraph< VertexContent, EdgeContent >
neighbors(const vertex_t &v, const vertex_t &n)	mgx::VVGraph< VertexContent, EdgeContent >
neighbors(const vertex_t &v, const vertex_t &n) const	mgx::VVGraph< VertexContent, EdgeContent >
nextTo(const vertex_t &v, const vertex_t &neighbor, unsigned int n=1) const	mgx::VVGraph< VertexContent, EdgeContent >
operator=(const VVGraph &other)	mgx::VVGraph< VertexContent, EdgeContent >
operator==(const VVGraph &other) const	mgx::VVGraph< VertexContent, EdgeContent >
operator[](size_type idx) const	mgx::VVGraph< VertexContent, EdgeContent >
prevTo(const vertex_t &v, const vertex_t &ref, unsigned int n=1) const	mgx::VVGraph< VertexContent, EdgeContent >
reference(vertex_t v) const	mgx::VVGraph< VertexContent, EdgeContent >	inline
replace(const vertex_t &v, const vertex_t &neighbor, const vertex_t &new_neighbor)	mgx::VVGraph< VertexContent, EdgeContent >
reserve(size_type s)	mgx::VVGraph< VertexContent, EdgeContent >	inline
reverse()	mgx::VVGraph< VertexContent, EdgeContent >
setModified(bool _modified)	mgx::VVGraph< VertexContent, EdgeContent >	inline
size() const	mgx::VVGraph< VertexContent, EdgeContent >	inline
size_type typedef	mgx::VVGraph< VertexContent, EdgeContent >
source(const edge_t &edge) const	mgx::VVGraph< VertexContent, EdgeContent >	inline
spliceAfter(const vertex_t &v, const vertex_t &neighbor, const vertex_t &new_neighbor)	mgx::VVGraph< VertexContent, EdgeContent >
spliceBefore(const vertex_t &v, const vertex_t &neighbor, const vertex_t &new_neighbor)	mgx::VVGraph< VertexContent, EdgeContent >
subgraph(const VertexContainer &vertexes) const	mgx::VVGraph< VertexContent, EdgeContent >
subgraph(const VertexContainer &verts) const	mgx::VVGraph< VertexContent, EdgeContent >
swap(VVGraph &other)	mgx::VVGraph< VertexContent, EdgeContent >
target(const edge_t &edge) const	mgx::VVGraph< VertexContent, EdgeContent >	inline
uniqueLine(const vertex_t &v, const vertex_t &n) const	mgx::VVGraph< VertexContent, EdgeContent >
uniqueTri(const vertex_t &v, const vertex_t &n, const vertex_t &m) const	mgx::VVGraph< VertexContent, EdgeContent >
valence(const vertex_t &v) const	mgx::VVGraph< VertexContent, EdgeContent >
value_type typedef	mgx::VVGraph< VertexContent, EdgeContent >
vertex_t typedef	mgx::VVGraph< VertexContent, EdgeContent >
VVGraph()	mgx::VVGraph< VertexContent, EdgeContent >	inline
VVGraph(const VVGraph &copy)	mgx::VVGraph< VertexContent, EdgeContent >
VVGraph(Iterator begin, Iterator end, bool checkUnique=true)	mgx::VVGraph< VertexContent, EdgeContent >	inline
VVGraph(const Container &c, bool checkUnique=true)	mgx::VVGraph< VertexContent, EdgeContent >	inline
~VVGraph()	mgx::VVGraph< VertexContent, EdgeContent >	inline