void BFS(element *vertices, int max_chrome, int max_valency)
{
    element *subgraph = new element;
    subgraph->next = vertices->next;
    delete_element(vertices,vertices->next->number);

    while (subgraph)
    {
        while (vertices)
        {
            vertices = vertices->next;
            if (subgraph->next->data[vertices->number] == '1')
            {
                add_element(subgraph, vertices);
                delete_element(vertices,vertices->number);
            }
        }
        subgraph = subgraph->next;
    }


}