| addEdge(const Vertex &v1, const Vertex &v2) | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| addVertex() | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| addVertex(const VertexProperties &properties) | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| adjacency_iter typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| adjacency_vertex_range_t typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| AdjacencyFlags enum name | Digikam::Graph< VertexProperties, EdgeProperties > | |
| adjacentVertices(const Vertex &v, AdjacencyFlags flags=AllEdges) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| AllEdges enum value | Digikam::Graph< VertexProperties, EdgeProperties > | |
| alwaysFalse(const T &, const T &) | Digikam::Graph< VertexProperties, EdgeProperties > | inlinestatic |
| BreadthFirstOrder enum value | Digikam::Graph< VertexProperties, EdgeProperties > | |
| clear() | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| const_edge_property_map_t typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| const_vertex_index_map_t typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| const_vertex_property_map_t typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| CopyAllProperties enum value | Digikam::Graph< VertexProperties, EdgeProperties > | |
| CopyEdgeProperties enum value | Digikam::Graph< VertexProperties, EdgeProperties > | |
| copyProperties(Graph &other, GraphCopyFlags flags, const std::vector< vertex_t > &copiedVertices) const | Digikam::Graph< VertexProperties, EdgeProperties > | inlineprotected |
| CopyVertexProperties enum value | Digikam::Graph< VertexProperties, EdgeProperties > | |
| degree_t typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| DepthFirstOrder enum value | Digikam::Graph< VertexProperties, EdgeProperties > | |
| direction | Digikam::Graph< VertexProperties, EdgeProperties > | protected |
| edge(const Vertex &v1, const Vertex &v2) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| edge_iter typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| edge_property_map_t typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| edge_range_t typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| edge_t typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| edgeCount() const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| edgeDifference(const Graph &other, const std::vector< vertex_t > &copiedVertices) const | Digikam::Graph< VertexProperties, EdgeProperties > | inlineprotected |
| EdgePair typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| edgePairs() const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| edges(const Vertex &v, AdjacencyFlags flags=AllEdges) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| edges() const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| EdgesToLeaf enum value | Digikam::Graph< VertexProperties, EdgeProperties > | |
| EdgesToRoot enum value | Digikam::Graph< VertexProperties, EdgeProperties > | |
| findVertexByProperties(const T &value) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| findZeroDegree(bool inOrOut) const | Digikam::Graph< VertexProperties, EdgeProperties > | inlineprotected |
| findZeroDegreeFrom(const Vertex &v, bool inOrOut) const | Digikam::Graph< VertexProperties, EdgeProperties > | inlineprotected |
| getGraph() const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| Graph(MeaningOfDirection direction=ParentToChild) | Digikam::Graph< VertexProperties, EdgeProperties > | inlineexplicit |
| Graph(const Graph &g) | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| graph | Digikam::Graph< VertexProperties, EdgeProperties > | protected |
| graph_traits typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| GraphContainer typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| GraphCopyFlags enum name | Digikam::Graph< VertexProperties, EdgeProperties > | |
| hasEdge(const Vertex &v1, const Vertex &v2) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| hasEdges(const Vertex &v, AdjacencyFlags flags=AllEdges) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| hasEdges() const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| in_edge_iter typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| InboundEdges enum value | Digikam::Graph< VertexProperties, EdgeProperties > | |
| inDegree(const Vertex &v) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| inv_adjacency_iter typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| inv_adjacency_vertex_range_t typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| isConnected(const Vertex &v1, const Vertex &v2) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| isEmpty() const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| isEmptyRange(const range_t &range) | Digikam::Graph< VertexProperties, EdgeProperties > | inlineprotectedstatic |
| isLeaf(const Vertex &v) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| isRoot(const Vertex &v) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| leaves() const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| leavesFrom(const Vertex &v) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| listPath(const Vertex &root, const Vertex &target, const VertexVertexMap &predecessors, MeaningOfDirection dir=ParentToChild) const | Digikam::Graph< VertexProperties, EdgeProperties > | inlineprotected |
| longestPathTouching(const Vertex &v) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| longestPathTouching(const Vertex &v, LessThan lessThan) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| meaningOfDirection() const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| mostRemoteNodes(const VertexIntMap &distances) const | Digikam::Graph< VertexProperties, EdgeProperties > | inlineprotected |
| operator=(const Graph &other) | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| out_edge_iter typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| out_edge_range_t typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| OutboundEdges enum value | Digikam::Graph< VertexProperties, EdgeProperties > | |
| outDegree(const Vertex &v) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| properties(const Vertex &v) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| properties(const Vertex &v) | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| properties(const Vertex &v1, const Vertex &v2) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| properties(const Edge &e) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| properties(const Edge &e) | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| remove(const Vertex &v) | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| ReturnOrder enum name | Digikam::Graph< VertexProperties, EdgeProperties > | |
| roots() const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| rootsOf(const Vertex &v) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| setProperties(const Vertex &v, const VertexProperties &props) | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| setProperties(const Edge &e, const EdgeProperties &props) | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| shortestDistancesFrom(const Vertex &v) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| shortestPath(const Vertex &v1, const Vertex &v2) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| source(const Edge &e) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| target(const Edge &e) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| toEdgeList(const range_t &range) | Digikam::Graph< VertexProperties, EdgeProperties > | inlineprotectedstatic |
| toList(const range_t &range) | Digikam::Graph< VertexProperties, EdgeProperties > | inlineprotectedstatic |
| topologicalSort() const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| toVertexList(const range_t &range) | Digikam::Graph< VertexProperties, EdgeProperties > | inlineprotectedstatic |
| transitiveClosure(GraphCopyFlags flags=CopyAllProperties) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| transitiveReduction(QList< Edge > *removedEdges=0, GraphCopyFlags flags=CopyAllProperties) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| treeFromPredecessors(const Vertex &v, const VertexVertexMap &predecessors) const | Digikam::Graph< VertexProperties, EdgeProperties > | inlineprotected |
| treeFromPredecessorsRecursive(const Vertex &v, QList< Vertex > &vertices, const VertexVertexMap &predecessors) const | Digikam::Graph< VertexProperties, EdgeProperties > | inlineprotected |
| vertex_index_map_t typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| vertex_iter typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| vertex_property_map_t typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| vertex_range_t typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| vertex_t typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| vertexCount() const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| VertexIntMap typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| VertexIntMapAdaptor typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| VertexPair typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| VertexVertexMap typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| VertexVertexMapAdaptor typedef | Digikam::Graph< VertexProperties, EdgeProperties > | |
| vertices() const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| verticesBreadthFirst(const Vertex &givenRef=Vertex()) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| verticesDepthFirstSorted(const Vertex &givenRef, LessThan lessThan) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| verticesDominatedBy(const Vertex &v, const Vertex &root, ReturnOrder order=BreadthFirstOrder) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| verticesDominatedBy(const Vertex &v, const Vertex &root, const QList< Vertex > &presortedVertices) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| verticesDominatedByDepthFirstSorted(const Vertex &v, const Vertex &root, LessThan lessThan) const | Digikam::Graph< VertexProperties, EdgeProperties > | inline |
| ~Graph() | Digikam::Graph< VertexProperties, EdgeProperties > | inlinevirtual |
1.9.1