Lines Matching +defs:H +defs:J +defs:k +defs:l +defs:C +defs:I +defs:N
716 int k; in assign() local
748 void graphe::vertex::set_multiedge(int v,int k) { in set_multiedge()
947 graphe::rectangle::rectangle(double X,double Y,double W,double H,layout *ly) { in rectangle()
1100 size_t graphe::sets_intersection(const iset &A,const iset &B,iset &I) { in sets_intersection()
1107 size_t graphe::sets_intersection(const ivector &A,const iset &B,iset &I) { in sets_intersection()
1440 vecteur l=makevecteur(28,12,15,13,42,45,43,27,30); in graphe() local
1649 int k=i<j?j:i; in set_edge_visited() local
2366 int j=0,k=0; in read_dot() local
2565 int deg,start=n+i0,k; in read_gen() local
3091 int i,j,k; in induce_subgraph() local
3454 for (int k=0;k<n;k+=2) { in find_maximum_matching() local
3517 int n=cycle.size(),k=i,m=j-i,l=0; in arc_path() local
3533 for (int k=0;k<n;++k) { in find_chords() local
3540 int m=D.size(),k=0,i,j,k_next,l,v,w,r,f; in find_chords() local
3594 int n=face.size(),k=chords.size(),i,j,p,q,r,s,t,u; in fold_face() local
3918 double step_length=K,shrinking_factor=0.9,eps=K*tol,C=0.01,D=C*K*K; in force_directed_placement() local
4023 for (int k=dist.size();k-->1;) { in edge_labels_placement() local
4034 for (int k=0;k<n-1;++k) { in edge_labels_placement() local
4123 sparsemat Q,I,R,IG; in coarsening() local
4175 int n=node_count(),m=removed_nodes.size(),J; in coarsening_ec() local
4281 for (int k=0;k<n;++k) { in make_regular_polygon_layout() local
4324 double d,cool,C=std::sqrt((double)n/M_PI),eps=tol/std::sqrt((double)n); in make_circular_layout() local
4463 void graphe::cp_recurse(ivector &C,ivector &P,ivector &incumbent) { in cp_recurse()
4467 int p,k; in cp_recurse() local
4492 ivector P(n),C; in cp_maxclique() local
4581 int k; in maxclique() local
4705 int n=G->node_count(),col=0,k; in make_values() local
4731 int n=G->node_count(),i,j,k; in formulate_mip() local
4915 for (int k=0;k<len;++k) { in generate_rows() local
4957 for (int k=0;k<len;++k) { in generate_rows() local
5121 for (int k=0;k<nxcols;++k) { in color_vertices() local
5180 int m=E.size(),maxdeg=0,deg,i,j,k; in exact_edge_coloring() local
5217 bool graphe::clique_cover(ivectors &cover,int k) { in clique_cover()
5242 graphe C(ctx,false); in clique_cover() local
5275 graphe C(ctx,false); in maximum_independent_set() local
5335 void graphe::remove_isolated_nodes(const iset &I,graphe &G) { in remove_isolated_nodes()
5338 for (int k=0;k<n;++k) { in remove_isolated_nodes() local
5365 void graphe::set_multiedge(const ipair &e,int k) { in set_multiedge()
5377 int k; in weights2multiedges() local
5427 for (int k=0;k<n;++k) { in subdivide_edge() local
5474 void ntupk(graphe::ivectors &v,int n,int k,const graphe::ivector &elem,int i) { in ntupk()
5517 for (int k=0;k<d;++k) { in hakimi() local
5582 int j=0,k; in make_lcf_graph() local
5604 void graphe::make_sierpinski_graph(int n,int k,bool triangle) { in make_sierpinski_graph()
5609 int N=std::pow(k,n); in make_sierpinski_graph() local
5654 int k=0,m,n; in make_shrikhande_graph() local
5704 int k=partition_sizes.size(); in make_complete_multipartite_graph() local
5739 void graphe::make_petersen_graph(int n,int k,layout *x) { in make_petersen_graph()
5763 void graphe::generate_nk_sets(int n,int k,vector<ulong> &v) { in generate_nk_sets()
5764 ulong N=std::pow(2,n); in generate_nk_sets() local
5774 bool graphe::make_kneser_graph(int n,int k) { in make_kneser_graph()
5829 graphe C(ctx); in make_web_graph() local
5892 void graphe::make_complete_kary_tree(int k,int d) { in make_complete_kary_tree()
6193 int n=node_count(),root,d,ad,maxd=-1,i,k,p; in find_ears() local
6367 int j,k=-1; in find_eulerian_trail() local
6393 int j,k; in find_cycle_dfs() local
6481 int v,w,k; in face_has_edge() local
6512 int i,j,k,n,f,s=sg,bc=max_subgraph_index(),cnt; in demoucron() local
6688 int c,pf,cf,k,n; in embed_children_blocks() local
6785 for (int k=0;k<nf;++k) { in planar_embedding() local
7029 int l=0,d,j,i,k=n,is1=0,is2=0,m,ll,ls; in ranrut() local
7260 int k; in make_random_planar() local
7315 for (int k=0;k<(isdir?2:1);++k) { in erdos_renyi() local
7327 int N=(n*(n-1))/(isdir?1:2),i,j,r; in erdos_renyi() local
7334 for (int k=0;k<(islarge?N-m:m);++k) { in erdos_renyi() local
7364 int j,k; in preferential_attachment() local
7399 int k=1,m,n=s.size(); in is_graphic_sequence() local
7413 int n=node_count(),k,i; in molloy_reed() local
7503 for (int k=0;k<sz;++k) { in make_random_sequential() local
7539 for (int k=0;k<d;++k) { in make_random_bipartite() local
7546 for (int k=0;k<-d;++k) { in make_random_bipartite() local
7562 int prob_total,k,dd; in make_random_regular() local
8030 int n=(weights=W).size(),k,w; in bucketsampler() local
8068 int k=nearest_pow2(w); in insert() local
8080 int old_k=pos.first,index=pos.second,k=nearest_pow2(w),last; in update() local
8823 void graphe::distance(int i,const ivector &J,ivector &dist,ivectors *shortest_paths) { in distance()
8825 int k,p,len; in distance() local
8857 int n=node_count(),i,j,k; in allpairs_distance() local
9269 void graphe::strec(int i,int t,int counter,int np,iset &Q,vecteur ×tamp,vecteur &l) { in strec()
9310 for (int k=nb;k-->0;) { in strec() local
9347 vecteur timestamp(n,0),l(n,0); in parametrized_st_orientation() local
9358 int n=node_count(),k=0,i,maxdeg,d,col=0; in greedy_vertex_coloring_biggs() local
9394 int c=0,k; in greedy_vertex_coloring() local
9531 for (int k=0;k<n;++k) { in make_plane_dual() local
9628 bool graphe::is_vertex_colorable(int k) { in is_vertex_colorable()
9819 ivector dist,J(n-1); in transitive_closure() local
9826 for (int k=0;k<n;++k) { in transitive_closure() local
10111 int k; in max_flow() local
10174 int i,j,k,p,q,temp; in min_st_cut() local
10217 int k; in minimal_cut() local
10224 int i,j,min_cut,flow,temp,I,J,K,S,T,DEG,NV,NE; in minimal_cut() local
10392 int nonzeros=0,i,j,k,l,cnt=0,nrows,ncols,nrows0; in formulate_mip() local
10470 for (int k=0;k<(sg<0?nv:sg_nv);++k) { in lower_bound() local
10602 for (int k=0;k<m;++k) { in append_sce() local
10695 int k; in make_hierarchical_clustering_forest() local
10831 int i=first.tail,j=first.head,k; in solve() local
10936 for (int l=0;l<n;++l) { in farthest_insertion() local
10978 int n=hc.size()-1,b1,e1,b2,e2,b3,e3,i1,j1,i2,j2,i3,j3,i,j,k,var,iter_count=0,moves_count=0; in perform_3opt_moves() local
11117 int i,j,k,l,b1,b2,e1,e2,n=hc.size()-1,iter_count=0,moves_count=0; in straighten() local
11167 bool graphe::tsp::is_move_feasible(int k,const ivector &t,const ipairs &x) { in is_move_feasible()
11207 for (int k=0;k<n;++k) t1_alt.push_back(k); // initialize alternatives for t1 in lin_kernighan() local
11218 for (int k=0;k<n;++k) { in lin_kernighan() local
11238 for (int k=1;k<=i;++k) w+=wx[k]-(k==i?0.0:wy[k]); in lin_kernighan() local
11253 for (int k=y_tmp.size();k-->0;) { in lin_kernighan() local
11272 for (int k=0;k<n;++k) t1_alt.push_back(k); // initialize alternatives for t1 in lin_kernighan() local
11277 for (int k=0;k<n;++k) { in lin_kernighan() local
11293 int k; in lin_kernighan() local
11381 int i,j,k,n=eind.size(); in min_wpm_heur() local
11431 for (int k=0;k<m;++k) { in christofides() local
11518 ivector I; in select_branching_variable() local
11528 int N=I.size(); in select_branching_variable() local
11584 int i,j,k,m=sg<0?ne:sg_ne,n=sg<0?nv:sg_nv,nedg=0,nz; in rowgen() local
11759 for (int k=0;k<n;++k) { in solve() local
11814 void graphe::atsp::ksolve(int k,ivectors &hcv,dvector &costs) { in ksolve()
11858 bool graphe::find_directed_tours(int k,ivectors &hcv,dvector &costs,const ipairs &incl) { in find_directed_tours()
12002 gen graphe::colon_label(int i, int j,int k) { in colon_label()
12012 int lab,k,i,hcol=default_highlighted_vertex_color; in simplify() local
12199 graphe::intpoly graphe::poly_geom(int var,int k,bool leading_one,bool add_other_var) { in poly_geom()
12481 int k=184207,l=0,u,v; in clustering_coeff() local
12591 int n=node_count(),k=RAND_MAX,mindeg=RAND_MAX,deg,v; in vertex_connectivity() local
12834 for (int k=1;k<K;++k) { in find_kspaths() local