Searched refs:n_vert1 (Results 1 – 2 of 2) sorted by relevance
24 const Int n_vert1 = L1.size(); in merge_vertices() local29 hash_map<std::string, Int> map(n_vert1); in merge_vertices()35 L1.resize(n_vert1 + n_vert2); in merge_vertices()36 Int diff = n_vert1; in merge_vertices()53 const Int n_vert1 = L1.size(); in merge_disjoint_vertices() local57 L1.resize(n_vert1 + n_vert2); in merge_disjoint_vertices()59 for (Int v = 0; v < n_vert1; ++v) in merge_disjoint_vertices()63 L1[n_vert1 + v] = L2[v]+"_2"; in merge_disjoint_vertices()
85 const Int n_vert1 = p_in1.give("N_VERTICES"); in combinatorial_simplicial_product_impl() local89 order1 = Array<Int>(n_vert1); in combinatorial_simplicial_product_impl()100 for (Int i = 0; i < n_vert1; ++i) in combinatorial_simplicial_product_impl()119 Matrix<Int> vert_map(n_vert1, n_vert2); in combinatorial_simplicial_product_impl()132 for (Int i = 0; i < n_vert1; ++i) in combinatorial_simplicial_product_impl()