![]() |
CXXGraph
0.2.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::PARTITIONING::Partition< 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 |
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 |
floydWarshall() const | CXXGRAPH::Graph< T > | virtual |
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::PARTITIONING::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 > | |
graph_slicing(const Node< T > &start) const | CXXGRAPH::Graph< T > | virtual |
isCyclicDirectedGraphBFS() const | CXXGRAPH::Graph< T > | virtual |
isCyclicDirectedGraphDFS() const | CXXGRAPH::Graph< T > | virtual |
isDirectedGraph() const | CXXGRAPH::Graph< T > | virtual |
isUndirectedGraph() const | CXXGRAPH::Graph< T > | virtual |
Partition() (defined in CXXGRAPH::PARTITIONING::Partition< T >) | CXXGRAPH::PARTITIONING::Partition< T > | |
Partition(unsigned int partitionId) (defined in CXXGRAPH::PARTITIONING::Partition< T >) | CXXGRAPH::PARTITIONING::Partition< T > | |
Partition(const std::list< const Edge< T > * > &edgeSet) (defined in CXXGRAPH::PARTITIONING::Partition< T >) | CXXGRAPH::PARTITIONING::Partition< T > | |
Partition(unsigned int partitionId, const std::list< const Edge< T > * > &edgeSet) (defined in CXXGRAPH::PARTITIONING::Partition< T >) | CXXGRAPH::PARTITIONING::Partition< T > | |
partitionGraph(PARTITIONING::PartitionAlgorithm algorithm, unsigned int numberOfPartitions) 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 edgeId) | CXXGRAPH::Graph< T > | virtual |
setEdgeSet(std::list< const Edge< T > * > &edgeSet) | CXXGRAPH::Graph< T > | virtual |
setPartitionId(unsigned int partitionId) | CXXGRAPH::PARTITIONING::Partition< 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::PARTITIONING::Partition< T >) | CXXGRAPH::PARTITIONING::Partition< T > |