|
Algorithms and Computability Project 0.0.1
Algorithms and Computability Project, we implement graph size, a graph metric, maximum clique search and maximum common subgraph search
|
This is the complete list of members for Graph, including all inherited members.
| fromFilename(const std::string &filename) -> Graph | Graph | static |
| getSize() const -> size_t | Graph | |
| getVertexCount() const -> size_t | Graph | inline |
| Graph() | Graph | inline |
| Graph(const std::vector< std::vector< int > > &&adjacencyMatrix) | Graph | explicit |
| Graph(std::istream &graphStream) | Graph | explicit |
| Graph(std::istream &&graphStream) | Graph | inlineexplicit |
| maxClique(AlgorithmAccuracy accuracy=AlgorithmAccuracy::EXACT) const -> std::vector< size_t > | Graph | |
| maxCliqueGraph(AlgorithmAccuracy accuracy) const -> Graph | Graph | |
| maxSubgraph(const Graph &rhs, AlgorithmAccuracy accuracy=AlgorithmAccuracy::EXACT) -> Graph | Graph | |
| metricDistanceTo(const Graph &rhs, AlgorithmAccuracy accuracy=AlgorithmAccuracy::EXACT) const -> size_t | Graph | |
| modifiedMaxClique(AlgorithmAccuracy accuracy=AlgorithmAccuracy::EXACT) const -> std::vector< size_t > | Graph | |
| modularProduct(const Graph &rhs) -> Graph | Graph | |
| operator<< | Graph | friend |
| operator== | Graph | friend |
| operator[](size_t row) const -> std::vector< int > | Graph | |
| subGraph(std::vector< size_t > &vertices) const -> Graph | Graph | |
| toDotLang() const -> std::string | Graph |