bool CheckCycle(Leader *Graph)
{
    Leader *p = Graph;
    while (p)
    {
        Leader *p = Graph;
        while (p && p->count != 0)
        {
            p = p->nx;
        }
        if(p)
        {
            p->count = -1;
            for (Trailer *t = p->tr; t; t = t->nx)
            {
                t->ld->count--;
            }
        }
        else
        {
            Leader *walker = Graph;
            for (; walker && walker->count == -1; walker = walker->nx);
            return walker != nullptr;
        }
    }
    return true;
}