equal
deleted
inserted
replaced
1424 /// The function checks if the given undirected graph is bipartite |
1424 /// The function checks if the given undirected graph is bipartite |
1425 /// or not. The \ref Bfs algorithm is used to calculate the result. |
1425 /// or not. The \ref Bfs algorithm is used to calculate the result. |
1426 /// During the execution, the \c partMap will be set as the two |
1426 /// During the execution, the \c partMap will be set as the two |
1427 /// partitions of the graph. |
1427 /// partitions of the graph. |
1428 /// \param graph The undirected graph. |
1428 /// \param graph The undirected graph. |
1429 /// \retval partMap A writeable bool map of nodes. It will be set as the |
1429 /// \retval partMap A writable bool map of nodes. It will be set as the |
1430 /// two partitions of the graph. |
1430 /// two partitions of the graph. |
1431 /// \return %True if \c graph is bipartite, %false otherwise. |
1431 /// \return %True if \c graph is bipartite, %false otherwise. |
1432 /// |
1432 /// |
1433 /// \author Balazs Attila Mihaly |
1433 /// \author Balazs Attila Mihaly |
1434 /// |
1434 /// |