mirror of
https://hub.njuu.cf/TheAlgorithms/C-Plus-Plus.git
synced 2023-10-11 13:05:55 +08:00
Performed requested changes
This commit is contained in:
parent
3e355d0f7a
commit
e248a614e5
@ -31,9 +31,6 @@
|
|||||||
#include <vector>
|
#include <vector>
|
||||||
#include <queue>
|
#include <queue>
|
||||||
|
|
||||||
/**
|
|
||||||
* Class for representing graph as an adjacency list.
|
|
||||||
*/
|
|
||||||
/**
|
/**
|
||||||
* @namespace graph
|
* @namespace graph
|
||||||
* @brief Graph algorithms
|
* @brief Graph algorithms
|
||||||
@ -44,7 +41,9 @@ namespace graph{
|
|||||||
* @brief Functions for checking whether a graph is bipartite or not
|
* @brief Functions for checking whether a graph is bipartite or not
|
||||||
*/
|
*/
|
||||||
namespace is_graph_bipartite{
|
namespace is_graph_bipartite{
|
||||||
|
/**
|
||||||
|
* @brief Class for representing graph as an adjacency list.
|
||||||
|
*/
|
||||||
class Graph {
|
class Graph {
|
||||||
private:
|
private:
|
||||||
int n; /// size of the graph
|
int n; /// size of the graph
|
||||||
|
Loading…
Reference in New Issue
Block a user