/*MarkChildren(q.front());
    while (!q.empty())
    {
        int searchedElement = q.front();
        q.pop();
        for (int i = 0; i < vertices.size(); i++)
        {
            Vertex *currentVertex = vertices[i];
            if (currentVertex->value == searchedElement)
            {
                for (int j = 0; j < currentVertex->children.size(); j++)
                {
                    if (CheckChildren(currentVertex->children[j]->to) == false)
                    {
                        MarkChildren(currentVertex->children[j]->to);
                        q.push(currentVertex->children[j]->to);
                    }
                }
                break;
            }
        }
        queue <int> temp = q;
        while (!temp.empty())
        {
            cout << temp.front() << " ";
            temp.pop();
        }
        cout << endl;
    }*/