[ VIGRA Homepage | Function Index | Class Index | Namespaces | File List | Main Page ]

GridGraph< N, DirectedTag > Member List VIGRA

This is the complete list of members for GridGraph< N, DirectedTag >, including all inherited members.

adjacency_iterator typedefGridGraph< N, DirectedTag >
Arc typedefGridGraph< N, DirectedTag >
arcFromId(index_type i) const GridGraph< N, DirectedTag >
ArcIt typedefGridGraph< N, DirectedTag >
arcNum() const GridGraph< N, DirectedTag >
back_degree(vertex_descriptor const &v) const GridGraph< N, DirectedTag >
back_neighbor_vertex_iterator typedefGridGraph< N, DirectedTag >
baseNode(IncEdgeIt const &e) const GridGraph< N, DirectedTag >
baseNode(IncBackEdgeIt const &e) const GridGraph< N, DirectedTag >
baseNode(OutArcIt const &a) const GridGraph< N, DirectedTag >
baseNode(OutBackArcIt const &a) const GridGraph< N, DirectedTag >
degree(vertex_descriptor const &v) const GridGraph< N, DirectedTag >
degree_size_type typedefGridGraph< N, DirectedTag >
dimensionGridGraph< N, DirectedTag >static
direct(Edge const &e, bool forward) const GridGraph< N, DirectedTag >
direct(Edge const &e, Node const &n) const GridGraph< N, DirectedTag >
directed_category typedefGridGraph< N, DirectedTag >
direction(Arc const &a) const GridGraph< N, DirectedTag >
Edge typedefGridGraph< N, DirectedTag >
edge(vertex_descriptor const &u, vertex_descriptor const &v) const GridGraph< N, DirectedTag >
edge_descriptor typedefGridGraph< N, DirectedTag >
edge_iterator typedefGridGraph< N, DirectedTag >
edge_parallel_category typedefGridGraph< N, DirectedTag >
edge_propmap_shape_type typedefGridGraph< N, DirectedTag >
edgeFromId(index_type i) const GridGraph< N, DirectedTag >
EdgeIt typedefGridGraph< N, DirectedTag >
edgeNum() const GridGraph< N, DirectedTag >
edges_size_type typedefGridGraph< N, DirectedTag >
findArc(Node const &u, Node const &v, Arc const &=lemon::INVALID) const GridGraph< N, DirectedTag >
findEdge(Node const &u, Node const &v, Edge const &=lemon::INVALID) const GridGraph< N, DirectedTag >
forward_degree(vertex_descriptor const &v) const GridGraph< N, DirectedTag >
get_back_neighbor_vertex_end_iterator(vertex_descriptor const &v) const GridGraph< N, DirectedTag >
get_back_neighbor_vertex_iterator(vertex_descriptor const &v) const GridGraph< N, DirectedTag >
get_edge_end_iterator() const GridGraph< N, DirectedTag >
get_edge_iterator() const GridGraph< N, DirectedTag >
get_in_edge_end_iterator(vertex_descriptor const &v) const GridGraph< N, DirectedTag >
get_in_edge_iterator(vertex_descriptor const &v) const GridGraph< N, DirectedTag >
get_neighbor_vertex_end_iterator(vertex_descriptor const &v) const GridGraph< N, DirectedTag >
get_neighbor_vertex_iterator(vertex_descriptor const &v) const GridGraph< N, DirectedTag >
get_out_back_edge_end_iterator(vertex_descriptor const &v) const GridGraph< N, DirectedTag >
get_out_back_edge_iterator(vertex_descriptor const &v) const GridGraph< N, DirectedTag >
get_out_edge_end_iterator(vertex_descriptor const &v) const GridGraph< N, DirectedTag >
get_out_edge_iterator(vertex_descriptor const &v) const GridGraph< N, DirectedTag >
get_vertex_end_iterator() const GridGraph< N, DirectedTag >
get_vertex_iterator() const GridGraph< N, DirectedTag >
get_vertex_iterator(vertex_descriptor const &v) const GridGraph< N, DirectedTag >
GridGraph(shape_type const &shape, NeighborhoodType ntype=DirectNeighborhood)GridGraph< N, DirectedTag >
id(Node const &v) const GridGraph< N, DirectedTag >
id(Edge const &e) const GridGraph< N, DirectedTag >
id(Arc const &a) const GridGraph< N, DirectedTag >
in_degree(vertex_descriptor const &v) const GridGraph< N, DirectedTag >
in_edge_iterator typedefGridGraph< N, DirectedTag >
InArcIt typedefGridGraph< N, DirectedTag >
IncBackEdgeIt typedefGridGraph< N, DirectedTag >
IncEdgeIt typedefGridGraph< N, DirectedTag >
index_type typedefGridGraph< N, DirectedTag >
indexMap() const GridGraph< N, DirectedTag >
is_directedGridGraph< N, DirectedTag >static
maxArcId() const GridGraph< N, DirectedTag >
maxEdgeId() const GridGraph< N, DirectedTag >
maxNodeId() const GridGraph< N, DirectedTag >
neighbor_vertex_iterator typedefGridGraph< N, DirectedTag >
Node typedefGridGraph< N, DirectedTag >
nodeFromId(index_type i) const GridGraph< N, DirectedTag >
NodeIt typedefGridGraph< N, DirectedTag >
nodeNum() const GridGraph< N, DirectedTag >
num_edges() const GridGraph< N, DirectedTag >
num_vertices() const GridGraph< N, DirectedTag >
oppositeArc(Arc const &a) const GridGraph< N, DirectedTag >
oppositeNode(Node const &n, Edge const &e) const GridGraph< N, DirectedTag >
out_back_edge_iterator typedefGridGraph< N, DirectedTag >
out_degree(vertex_descriptor const &v) const GridGraph< N, DirectedTag >
out_edge_iterator typedefGridGraph< N, DirectedTag >
OutArcIt typedefGridGraph< N, DirectedTag >
OutBackArcIt typedefGridGraph< N, DirectedTag >
pos(Node const &v) const GridGraph< N, DirectedTag >
runningNode(IncEdgeIt const &e) const GridGraph< N, DirectedTag >
runningNode(IncBackEdgeIt const &e) const GridGraph< N, DirectedTag >
runningNode(OutArcIt const &a) const GridGraph< N, DirectedTag >
runningNode(OutBackArcIt const &a) const GridGraph< N, DirectedTag >
shape_type typedefGridGraph< N, DirectedTag >
source(Arc const &a) const GridGraph< N, DirectedTag >
target(Arc const &a) const GridGraph< N, DirectedTag >
u(Edge const &e) const GridGraph< N, DirectedTag >
v(Edge const &e) const GridGraph< N, DirectedTag >
vertex_descriptor typedefGridGraph< N, DirectedTag >
vertex_iterator typedefGridGraph< N, DirectedTag >
vertex_property_type typedefGridGraph< N, DirectedTag >
vertices_size_type typedefGridGraph< N, DirectedTag >

© Ullrich Köthe (ullrich.koethe@iwr.uni-heidelberg.de)
Heidelberg Collaboratory for Image Processing, University of Heidelberg, Germany

html generated using doxygen and Python
vigra 1.11.0 (Fri May 19 2017)