Graph::isBipartite

#include "HKUAL_graph.h"
#include <iostream>
using namespace std;
using namespace HKUAL;

int main(){
    Graph<string> g;
    g.addVertex("A");
    g.addVertex("B");
    g.addVertex("C");
    g.addVertex("D");
    g.addVertex("E");
    g.addVertex("F");
    g.addEdge("A","D");
    g.addEdge("A","E");
    g.addEdge("A","F");
    g.addEdge("B","D");
    g.addEdge("B","E");
    g.addEdge("B","F");
    g.addEdge("C","D");
    g.addEdge("C","E");
    g.addEdge("C","F");

    if (g.isBipartite())
        cout <<"Yes" << endl;
    else
        cout <<"No" << endl;
    return 0;
}