// File: /workspace/github_cpp_makefile_star2_O2/grame-cncm[P]digraph/./dglib/digraphop.hh
// Function: Tarjan<char, std::pair<std::map<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>, int, std::less<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>>>, std::allocator<std::pair<std::__cxx11::basic_string<char, std::char_traits<char>, std::allocator<char>> const, int>>>, int>>::visit(char const&)
void visit(const N& v)
    {
        // std::cout << "start (first) visit of " << v << std::endl;
        auto& x = fAux[v];
        fStack.push(v);
        x.fStacked = true;
        x.fVisited = true;
        x.fNum1 = x.fNum2 = fGroup;
        ++fGroup;

        // std::cout << "visit all nodes connected to " << v << std::endl;
        for (const auto& p : fGraph.connections(v)) {
            // std::cout << "we have a connection " << v << "-" << p.second << "->" << p.first <<
            // std::endl;
            const N& w = p.first;
            auto&    y = fAux[w];
            if (!y.fVisited) {
                visit(w);
                x.fNum2 = std::min(x.fNum2, y.fNum2);
            } else {
                if (y.fStacked) {
                    // std::cout << "the node " << w << " is already in the std::stack" <<
                    // std::endl;
                    x.fNum2 = std::min(x.fNum2, y.fNum1);
                }
            }
        }

        if (x.fNum1 == x.fNum2) {
            // std::cout << "the node " << v << " is the root of a cycle" << std::endl;

            std::set<N> cycle;
            bool        finished = false;
            do {
                const N& w = fStack.top();
                fStack.pop();
                fAux[w].fStacked = false;
                cycle.insert(w);
                finished = (w == v);
            } while (!finished);
            fPartition.insert(cycle);
            if ((cycle.size() > 1) || fGraph.areConnected(v, v)) {
                fCycleCount++;
            }
        }
        // std::cout << "end (first) visit of " << v << std::endl;
    }

// Assembly:
pushq %rbp
pushq %r15
pushq %r14
pushq %r13
pushq %r12
pushq %rbx
subq $0x48, %rsp
movq %rsi, %r14
movq %rdi, %rbx
addq $0x60, %rdi
movq %rdi, (%rsp)
callq 0x4b7e
movq %rax, %r13
leaq 0x10(%rbx), %rdi
movq %rdi, 0x8(%rsp)
movq %r14, %rsi
callq 0x4e2a
movw $0x101, (%r13)          # imm = 0x101
movl 0x8(%rbx), %eax
movl %eax, 0x8(%r13)
movl %eax, 0x4(%r13)
incl %eax
movl %eax, 0x8(%rbx)
movq (%rbx), %rdi
movq %r14, 0x10(%rsp)
movq %r14, %rsi
callq 0x439c
movq %rax, %rbp
movq 0x18(%rax), %r14
addq $0x8, %rbp
cmpq %rbp, %r14
je 0x485d
leaq 0x20(%r14), %r15
movq (%rsp), %rdi
movq %r15, %rsi
callq 0x4b7e
movq %rax, %r12
cmpb $0x0, (%rax)
je 0x4831
cmpb $0x1, 0x1(%r12)
pushq $0x4
popq %rax
je 0x483f
jmp 0x4850
movq %rbx, %rdi
movq %r15, %rsi
callq 0x47a0
pushq $0x8
popq %rax
movl (%r12,%rax), %eax
movl 0x8(%r13), %ecx
cmpl %ecx, %eax
cmovll %eax, %ecx
movl %ecx, 0x8(%r13)
movq %r14, %rdi
callq 0x2170
movq %rax, %r14
jmp 0x4807
movl 0x4(%r13), %eax
cmpl 0x8(%r13), %eax
jne 0x491a
leaq 0x20(%rsp), %rax
andl $0x0, (%rax)
andq $0x0, 0x8(%rax)
movq %rax, 0x10(%rax)
movq %rax, 0x18(%rax)
andq $0x0, 0x20(%rax)
movl $0x200, %r15d           # imm = 0x200
leaq 0x18(%rsp), %r14
movq 0x10(%rsp), %r12
movq 0x8(%rsp), %rbp
movq 0x40(%rbx), %r13
cmpq 0x48(%rbx), %r13
jne 0x48af
movq 0x58(%rbx), %rax
movq -0x8(%rax), %r13
addq %r15, %r13
decq %r13
movq %rbp, %rdi
callq 0x5042
movq (%rsp), %rdi
movq %r13, %rsi
callq 0x4b7e
movb $0x0, 0x1(%rax)
movq %r14, %rdi
movq %r13, %rsi
callq 0x3770
movb (%r13), %al
cmpb (%r12), %al
jne 0x489a
leaq 0x90(%rbx), %rdi
leaq 0x18(%rsp), %rsi
callq 0x5090
cmpq $0x1, 0x40(%rsp)
ja 0x490a
movq (%rbx), %rdi
movq %r12, %rsi
movq %r12, %rdx
callq 0x4bcc
testb %al, %al
je 0x4910
incl 0xc0(%rbx)
leaq 0x18(%rsp), %rdi
callq 0x33c4
addq $0x48, %rsp
popq %rbx
popq %r12
popq %r13
popq %r14
popq %r15
popq %rbp
retq
jmp 0x492b
movq %rax, %rbx
leaq 0x18(%rsp), %rdi
callq 0x33c4
movq %rbx, %rdi
callq 0x2220