Function if

lib/node_ordering/reductions.cpp:813–818

                                        } endfor
                                }
                        } endfor
                        if (shared_neighbor_exists) {
                                // Continue only if there is a shared neighbor 
                                path.push_back(target);
                                degree_3_walk(graph, target, init_node, path, ignore);
                        }
                }
        } endfor
}