addDependency(const VertexT &dependency, bool throwIfExists=true) | DependencyGraph< VertexT, EdgeT, GraphT > | inline |
addRelationship(const VertexT &independent, const VertexT &dependent) | DependencyGraph< VertexT, EdgeT, GraphT > | inline |
addRelationship(const VertexT &independent, const VertexT &dependent, const EdgeT &edgeData) | DependencyGraph< VertexT, EdgeT, GraphT > | inline |
begin() | DependencyGraph< VertexT, EdgeT, GraphT > | inline |
begin() const | DependencyGraph< VertexT, EdgeT, GraphT > | inline |
dependencyOrder() const | DependencyGraph< VertexT, EdgeT, GraphT > | inline |
directDependenciesOf(const VertexT &dependency) const | DependencyGraph< VertexT, EdgeT, GraphT > | inline |
end() | DependencyGraph< VertexT, EdgeT, GraphT > | inline |
end() const | DependencyGraph< VertexT, EdgeT, GraphT > | inline |
hasCycles() const | DependencyGraph< VertexT, EdgeT, GraphT > | inline |
hasCycles(std::vector< std::pair< VertexT, VertexT >> &cycleEdges) const | DependencyGraph< VertexT, EdgeT, GraphT > | inline |
hasDependency(const VertexT &dependency) const | DependencyGraph< VertexT, EdgeT, GraphT > | inline |
logGraph(LoggingLevel level, const char *title) | DependencyGraph< VertexT, EdgeT, GraphT > | inline |
lookupDependency(const VertexT &key) const | DependencyGraph< VertexT, EdgeT, GraphT > | inline |
parallelDependencyOrder() const | DependencyGraph< VertexT, EdgeT, GraphT > | inline |
removeDependency(const VertexT &dependency, bool throwIfNotExists=true) | DependencyGraph< VertexT, EdgeT, GraphT > | inline |
removeRelationship(const VertexT &independent, const VertexT &dependent) | DependencyGraph< VertexT, EdgeT, GraphT > | inline |