 |
CXXGraph
0.4.0
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
|
|
CXXGraph
0.4.0
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
|
This is the complete list of members for CXXGRAPH::Graph< T >, including all inherited members.
| addEdge(const Edge< T > *edge) | CXXGRAPH::Graph< T > | virtual |
| bellmanford(const Node< T > &source, const Node< T > &target) const | CXXGRAPH::Graph< T > | virtual |
| boruvka() const | CXXGRAPH::Graph< T > | virtual |
| breadth_first_search(const Node< T > &start) const | CXXGRAPH::Graph< T > | virtual |
| containsCycle(const T_EdgeSet< T > *) const | CXXGRAPH::Graph< T > | virtual |
| containsCycle(const T_EdgeSet< T > *edgeSet, std::unordered_map< unsigned long long, Subset > *) const | CXXGRAPH::Graph< T > | virtual |
| depth_first_search(const Node< T > &start) const | CXXGRAPH::Graph< T > | virtual |
| dial(const Node< T > &source, int maxWeight) const | CXXGRAPH::Graph< T > | virtual |
| dijkstra(const Node< T > &source, const Node< T > &target) const | CXXGRAPH::Graph< T > | virtual |
| eulerianPath() const | CXXGRAPH::Graph< T > | virtual |
| floydWarshall() const | CXXGRAPH::Graph< T > | virtual |
| fordFulkersonMaxFlow(const Node< T > &source, const Node< T > &target) const | CXXGRAPH::Graph< T > | virtual |
| getAdjMatrix() const | CXXGRAPH::Graph< T > | virtual |
| getEdge(unsigned long long edgeId) const | CXXGRAPH::Graph< T > | virtual |
| getEdgeSet() const | CXXGRAPH::Graph< T > | virtual |
| getNodeSet() const | CXXGRAPH::Graph< T > | virtual |
| Graph()=default (defined in CXXGRAPH::Graph< T >) | CXXGRAPH::Graph< T > | |
| Graph(const T_EdgeSet< T > &edgeSet) (defined in CXXGRAPH::Graph< T >) | CXXGRAPH::Graph< T > | |
| graph_slicing(const Node< T > &start) const | CXXGRAPH::Graph< T > | virtual |
| isConnectedGraph() const | CXXGRAPH::Graph< T > | virtual |
| isCyclicDirectedGraphBFS() const | CXXGRAPH::Graph< T > | virtual |
| isCyclicDirectedGraphDFS() const | CXXGRAPH::Graph< T > | virtual |
| isDirectedGraph() const | CXXGRAPH::Graph< T > | virtual |
| isStronglyConnectedGraph() const | CXXGRAPH::Graph< T > | virtual |
| isUndirectedGraph() const | CXXGRAPH::Graph< T > | virtual |
| kosaraju() const | CXXGRAPH::Graph< T > | virtual |
| kruskal() const | CXXGRAPH::Graph< T > | virtual |
| operator<< (defined in CXXGRAPH::Graph< T >) | CXXGRAPH::Graph< T > | friend |
| operator<< (defined in CXXGRAPH::Graph< T >) | CXXGRAPH::Graph< T > | friend |
| partitionGraph(PARTITIONING::PartitionAlgorithm algorithm, unsigned int numberOfPartitions, double param1=0.0, double param2=0.0, double param3=0.0, unsigned int numberOfthreads=std::thread::hardware_concurrency()) const | CXXGRAPH::Graph< T > | virtual |
| prim() const | CXXGRAPH::Graph< T > | virtual |
| readFromFile(InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool readNodeFeat=false, bool readEdgeWeight=false) | CXXGRAPH::Graph< T > | virtual |
| removeEdge(unsigned long long edgeId) | CXXGRAPH::Graph< T > | virtual |
| setEdgeSet(T_EdgeSet< T > &edgeSet) | CXXGRAPH::Graph< T > | virtual |
| setFind(std::unordered_map< unsigned long long, Subset > *, const unsigned long long elem) const | CXXGRAPH::Graph< T > | virtual |
| setUnion(std::unordered_map< unsigned long long, Subset > *, const unsigned long long set1, const unsigned long long elem2) const | CXXGRAPH::Graph< T > | virtual |
| writeToFile(InputOutputFormat format=InputOutputFormat::STANDARD_CSV, const std::string &workingDir=".", const std::string &OFileName="graph", bool compress=false, bool writeNodeFeat=false, bool writeEdgeWeight=false) const | CXXGRAPH::Graph< T > | virtual |
| ~Graph()=default (defined in CXXGRAPH::Graph< T >) | CXXGRAPH::Graph< T > | virtual |
1.9.1