| CXXGraph 0.4.0 CXXGraph is a header only, that manages the Graphs and it's algorithm in C++

### - a -

- addEdge() : CXXGRAPH::Graph< T >

### - b -

- bellmanford() : CXXGRAPH::Graph< T >
- boruvka() : CXXGRAPH::Graph< T >
- breadth_first_search() : CXXGRAPH::Graph< T >

### - c -

- containsCycle() : CXXGRAPH::Graph< T >

### - d -

- depth_first_search() : CXXGRAPH::Graph< T >
- dial() : CXXGRAPH::Graph< T >
- dijkstra() : CXXGRAPH::Graph< T >

### - e -

- eulerianPath() : CXXGRAPH::Graph< T >

### - f -

- floydWarshall() : CXXGRAPH::Graph< T >
- fordFulkersonMaxFlow() : CXXGRAPH::Graph< T >

### - g -

- getAdjMatrix() : CXXGRAPH::Graph< T >
- getEdge() : CXXGRAPH::Graph< T >
- getEdgeSet() : CXXGRAPH::Graph< T >
- getNodeSet() : CXXGRAPH::Graph< T >
- getPartitionId() : CXXGRAPH::PARTITIONING::Partition< T >
- graph_slicing() : CXXGRAPH::Graph< T >

### - i -

- isConnectedGraph() : CXXGRAPH::Graph< T >
- isCyclicDirectedGraphBFS() : CXXGRAPH::Graph< T >
- isCyclicDirectedGraphDFS() : CXXGRAPH::Graph< T >
- isDirectedGraph() : CXXGRAPH::Graph< T >
- isStronglyConnectedGraph() : CXXGRAPH::Graph< T >
- isUndirectedGraph() : CXXGRAPH::Graph< T >

### - k -

- kosaraju() : CXXGRAPH::Graph< T >
- kruskal() : CXXGRAPH::Graph< T >

### - p -

- partitionGraph() : CXXGRAPH::Graph< T >
- prim() : CXXGRAPH::Graph< T >

### - r -

- readFromFile() : CXXGRAPH::Graph< T >
- removeEdge() : CXXGRAPH::Graph< T >

### - s -

- setEdgeSet() : CXXGRAPH::Graph< T >
- setFind() : CXXGRAPH::Graph< T >
- setPartitionId() : CXXGRAPH::PARTITIONING::Partition< T >
- setUnion() : CXXGRAPH::Graph< T >

### - w -

- writeGraph() : CXXGRAPH::Writer< T >
- writeToFile() : CXXGRAPH::Graph< T >