![]() |
CXXGraph
0.1.6
CXXGraph is a header only, that manages the Graphs and it's algorithm in C++
|
This is the complete list of members for CXXGRAPH::Partition< T >, including all inherited members.
| addEdge(const Edge< T > *edge) | CXXGRAPH::Graph< T > | virtual |
| ALG_1 enum value (defined in CXXGRAPH::Graph< T >) | CXXGRAPH::Graph< T > | |
| ALG_2 enum value (defined in CXXGRAPH::Graph< T >) | CXXGRAPH::Graph< T > | |
| breadth_first_search(const Node< T > &start) 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 |
| E_InputOutputFormat enum name | CXXGRAPH::Graph< T > | |
| E_PartitionAlgorithm enum name | CXXGRAPH::Graph< T > | |
| getAdjMatrix() const | CXXGRAPH::Graph< T > | virtual |
| getEdge(unsigned long edgeId) const | CXXGRAPH::Graph< T > | virtual |
| getEdgeSet() const | CXXGRAPH::Graph< T > | virtual |
| getNodeSet() const | CXXGRAPH::Graph< T > | virtual |
| getPartitionId() const | CXXGRAPH::Partition< T > | |
| Graph()=default (defined in CXXGRAPH::Graph< T >) | CXXGRAPH::Graph< T > | |
| Graph(const std::list< const Edge< T > * > &edgeSet) (defined in CXXGRAPH::Graph< T >) | CXXGRAPH::Graph< T > | |
| GREEDY_VC enum value | CXXGRAPH::Graph< T > | |
| InputOutputFormat typedef (defined in CXXGRAPH::Graph< T >) | CXXGRAPH::Graph< T > | |
| isCyclicDirectedGraphBFS() const | CXXGRAPH::Graph< T > | virtual |
| isCyclicDirectedGraphDFS() const | CXXGRAPH::Graph< T > | virtual |
| isDirectedGraph() const | CXXGRAPH::Graph< T > | virtual |
| OUT_1 enum value (defined in CXXGRAPH::Graph< T >) | CXXGRAPH::Graph< T > | |
| OUT_2 enum value (defined in CXXGRAPH::Graph< T >) | CXXGRAPH::Graph< T > | |
| Partition() (defined in CXXGRAPH::Partition< T >) | CXXGRAPH::Partition< T > | |
| Partition(unsigned int partitionId) (defined in CXXGRAPH::Partition< T >) | CXXGRAPH::Partition< T > | |
| Partition(const std::list< const Edge< T > * > &edgeSet) (defined in CXXGRAPH::Partition< T >) | CXXGRAPH::Partition< T > | |
| Partition(unsigned int partitionId, const std::list< const Edge< T > * > &edgeSet) (defined in CXXGRAPH::Partition< T >) | CXXGRAPH::Partition< T > | |
| PartitionAlgorithm typedef (defined in CXXGRAPH::Graph< T >) | CXXGRAPH::Graph< T > | |
| partitionGraph(PartitionAlgorithm algorithm, unsigned int numberOfPartitions) 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 edgeId) | CXXGRAPH::Graph< T > | virtual |
| setEdgeSet(std::list< const Edge< T > * > &edgeSet) | CXXGRAPH::Graph< T > | virtual |
| setPartitionId(unsigned int partitionId) | CXXGRAPH::Partition< T > | |
| STANDARD_CSV enum value | CXXGRAPH::Graph< T > | |
| STANDARD_TSV enum value | CXXGRAPH::Graph< T > | |
| 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 > | |
| ~Partition()=default (defined in CXXGRAPH::Partition< T >) | CXXGRAPH::Partition< T > |