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

GridGraph< N, DirectedTag > Member List |

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

adjacency_iterator typedef | GridGraph< N, DirectedTag > |
Arc typedef | GridGraph< N, DirectedTag > |
arcFromId(index_type i) const | GridGraph< N, DirectedTag > |
ArcIt typedef | GridGraph< N, DirectedTag > |
arcNum() const | GridGraph< N, DirectedTag > |
back_degree(vertex_descriptor const &v) const | GridGraph< N, DirectedTag > |
back_neighbor_vertex_iterator typedef | GridGraph< 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 typedef | GridGraph< N, DirectedTag > |
dimension | GridGraph< 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 typedef | GridGraph< N, DirectedTag > |
direction(Arc const &a) const | GridGraph< N, DirectedTag > |
Edge typedef | GridGraph< N, DirectedTag > |
edge(vertex_descriptor const &u, vertex_descriptor const &v) const | GridGraph< N, DirectedTag > |
edge_descriptor typedef | GridGraph< N, DirectedTag > |
edge_iterator typedef | GridGraph< N, DirectedTag > |
edge_parallel_category typedef | GridGraph< N, DirectedTag > |
edge_propmap_shape_type typedef | GridGraph< N, DirectedTag > |
edgeFromId(index_type i) const | GridGraph< N, DirectedTag > |
EdgeIt typedef | GridGraph< N, DirectedTag > |
edgeNum() const | GridGraph< N, DirectedTag > |
edges_size_type typedef | GridGraph< 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 typedef | GridGraph< N, DirectedTag > |
InArcIt typedef | GridGraph< N, DirectedTag > |
IncBackEdgeIt typedef | GridGraph< N, DirectedTag > |
IncEdgeIt typedef | GridGraph< N, DirectedTag > |
index_type typedef | GridGraph< N, DirectedTag > |
indexMap() const | GridGraph< N, DirectedTag > |
is_directed | GridGraph< N, DirectedTag > | static
maxArcId() const | GridGraph< N, DirectedTag > |
maxEdgeId() const | GridGraph< N, DirectedTag > |
maxNodeId() const | GridGraph< N, DirectedTag > |
neighbor_vertex_iterator typedef | GridGraph< N, DirectedTag > |
Node typedef | GridGraph< N, DirectedTag > |
nodeFromId(index_type i) const | GridGraph< N, DirectedTag > |
NodeIt typedef | GridGraph< 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 typedef | GridGraph< N, DirectedTag > |
out_degree(vertex_descriptor const &v) const | GridGraph< N, DirectedTag > |
out_edge_iterator typedef | GridGraph< N, DirectedTag > |
OutArcIt typedef | GridGraph< N, DirectedTag > |
OutBackArcIt typedef | GridGraph< 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 typedef | GridGraph< 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 typedef | GridGraph< N, DirectedTag > |
vertex_iterator typedef | GridGraph< N, DirectedTag > |
vertex_property_type typedef | GridGraph< N, DirectedTag > |
vertices_size_type typedef | GridGraph< 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