| /dports/graphics/p5-Graph-ReadWrite/Graph-ReadWrite-2.10/lib/Graph/Writer/ |
| H A D | HTK.pm | 55 my $edge_num;
82 $edge_num = 0;
86 print $FILE "J=$edge_num S=", $v2n{$from}, " E=", $v2n{$to};
100 ++$edge_num;
|
| /dports/science/apbs/apbs-pdb2pqr-apbs-1.5-102-g500c1473/apbs/externals/fetk/gamer/src/biom/ |
| H A D | SurfRefine.C | 47 unsigned int local_num_edges = 0, total_num_edges = 0, edge_num = 0; in SurfaceMesh_refine() local
128 vertex2edge[edge_num] = ngr->a; in SurfaceMesh_refine()
136 surfmesh_refine->vertex[nv + edge_num].x = 0.5*(ax + nx); in SurfaceMesh_refine()
137 surfmesh_refine->vertex[nv + edge_num].y = 0.5*(ay + ny); in SurfaceMesh_refine()
138 surfmesh_refine->vertex[nv + edge_num].z = 0.5*(az + nz); in SurfaceMesh_refine()
141 edge_num++; in SurfaceMesh_refine()
|
| /dports/devel/codequery/codequery-0.24.0/showgraph/Layout/ |
| H A D | node_group.cpp | 102 edge_num = 1; in NodeGroup()
105 edge_num = num_peers; in NodeGroup()
109 edge_num = 1; in NodeGroup()
164 edge_num = e1 + e2; in merge()
|
| H A D | node_group.h | 34 unsigned int edge_num; variable
56 return edge_num; in adjEdgesNum()
|
| /dports/games/quakeforge/quakeforge-0.7.2/tools/qfcc/source/ |
| H A D | dot_flow.c | 76 int edge_num = edge - graph->edges; in print_flow_edge() local
93 } else if (set_is_member (graph->dfst, edge_num)) { in print_flow_edge()
123 int edge_num = edge - graph->edges; in print_flow_edge_dag() local
144 } else if (set_is_member (graph->dfst, edge_num)) { in print_flow_edge_dag()
257 int edge_num = edge - graph->edges; in print_flow_edge_statements() local
275 } else if (set_is_member (graph->dfst, edge_num)) { in print_flow_edge_statements()
|
| /dports/math/py-altgraph/altgraph-0.15/altgraph/ |
| H A D | GraphUtil.py | 13 node_num, edge_num, self_loops=False, multi_edges=False): argument
26 if edge_num > max_edges:
49 if g.number_of_edges() >= edge_num:
|
| /dports/devel/codequery/codequery-0.24.0/showgraph/Graph/ |
| H A D | graph_inline.h | 65 edge_num--; in detachEdge()
81 return edge_num; in edgeCount()
178 edge_num++; in newEdgeImpl()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/catapult/telemetry/third_party/altgraph/altgraph/ |
| H A D | GraphUtil.py | 11 def generate_random_graph(node_num, edge_num, self_loops=False, multi_edges=False): argument
24 if edge_num > max_edges:
46 if g.number_of_edges() >= edge_num:
|
| /dports/www/firefox-legacy/firefox-52.8.0esr/python/altgraph/altgraph/ |
| H A D | GraphUtil.py | 11 def generate_random_graph(node_num, edge_num, self_loops=False, multi_edges=False): argument
24 if edge_num > max_edges:
46 if g.number_of_edges() >= edge_num:
|
| /dports/math/xlife++/xlifepp-sources-v2.0.1-2018-05-09/src/space/ |
| H A D | BCElement.hpp | 60 number_t edge_num; //!< edge number related to sub RT shape function member in xlifepp::BCRTShapeFunctionPart
63 : gelt_p(ge),sub_elt_num(sen), edge_num(en), coeff(c) {} in BCRTShapeFunctionPart()
|
| /dports/math/graphthing/graphthing-1.3.2/src/ |
| H A D | graph2.cc | 778 unsigned int edge_num, vertex_num; in chromatic_poly() local
781 edge_num = E.size (); in chromatic_poly()
790 if (edge_num == 0) in chromatic_poly()
795 switch (edge_num) { in chromatic_poly()
802 if (edge_num == 0) { in chromatic_poly()
892 if (edge_num == (vertex_num - 1)) { in chromatic_poly()
895 Polynomial::binomial (-1, edge_num); in chromatic_poly()
901 if ((vertex_num == 4) && (edge_num == 4)) { in chromatic_poly()
910 if ((vertex_num == 4) && (edge_num == 5)) in chromatic_poly()
912 if ((vertex_num == 4) && (edge_num == 6)) in chromatic_poly()
[all …]
|
| /dports/devel/taskflow/taskflow-3.2.0/benchmarks/graph_traversal/ |
| H A D | levelgraph.hpp | 108 size_t edge_num = 1; in LevelGraph() local
113 edge_num = 1 + (std::rand() % _edge_max); in LevelGraph()
116 if(start + edge_num >= length){ in LevelGraph()
121 end = start + edge_num; in LevelGraph()
|
| /dports/graphics/wings/wings-8d019ebe48/src/ |
| H A D | wings.hrl | 236 ltpr=0 :: wings_edge:edge_num(), %Left traversal predecessor
237 ltsu=0 :: wings_edge:edge_num(), %Left traversal successor
238 rtpr=0 :: wings_edge:edge_num(), %Right traversal predecessor
239 rtsu=0 :: wings_edge:edge_num() %Right traversal successor
|
| /dports/devel/hyperscan/hyperscan-5.4.0/src/nfa/ |
| H A D | gough.c | 234 const u8 *buf, u64a offAdj, const u8 *c, u32 edge_num, in run_prog() argument
236 DEBUG_PRINTF("taking edge %u\n", edge_num); in run_prog()
237 u32 prog_offset = edge_prog_table[edge_num]; in run_prog()
349 u32 edge_num = ((u32)s << as) + cprime; in goughExec16_i() local
354 s = succ_table[edge_num]; in goughExec16_i()
386 u32 edge_num = ((u32)s << as) + cprime; in goughExec16_i() local
391 s = succ_table[edge_num]; in goughExec16_i()
504 u32 edge_num = ((u32)s << as) + cprime; in goughExec8_i() local
508 s = succ_table[edge_num]; in goughExec8_i()
535 u32 edge_num = ((u32)s << as) + cprime; in goughExec8_i() local
[all …]
|
| /dports/biology/cufflinks/cufflinks-2.2.1-89-gdc3b0cb/src/lemon/ |
| H A D | smart_graph.h | 309 while(s.edge_num<edges.size()) { in restoreSnapshot()
345 unsigned int edge_num; variable
359 edge_num=g->edges.size(); in Snapshot()
373 edge_num=g->edges.size(); in save()
668 s.edge_num = edges.size(); in saveSnapshot()
673 while(s.edge_num<edges.size()) { in restoreSnapshot()
717 unsigned int edge_num; variable
1061 while(s.edge_num<edges.size()) { in restoreSnapshot()
1110 unsigned int edge_num; variable
1126 edge_num=g->edges.size(); in Snapshot()
[all …]
|
| /dports/devel/boost-docs/boost_1_72_0/boost/graph/detail/ |
| H A D | compressed_sparse_row_struct.hpp | 348 typedef EdgeIndex edge_num; in add_edges_sorted_internal() typedef
349 edge_num new_edge_count = std::distance(first, last); in add_edges_sorted_internal()
353 edge_num edges_added_before_i = new_edge_count; // Count increment to add to rowstarts in add_edges_sorted_internal()
362 edge_num edges_added_to_this_vertex = 0; in add_edges_sorted_internal()
371 edge_num old_rowstart = m_rowstart[i]; in add_edges_sorted_internal()
372 edge_num new_rowstart = m_rowstart[i] + edges_added_before_i; in add_edges_sorted_internal()
373 edge_num old_degree = m_rowstart[i + 1] - m_rowstart[i]; in add_edges_sorted_internal()
374 edge_num new_degree = old_degree + edges_added_to_this_vertex; in add_edges_sorted_internal()
|
| /dports/devel/hyperscan/boost_1_75_0/boost/graph/detail/ |
| H A D | compressed_sparse_row_struct.hpp | 384 typedef EdgeIndex edge_num; in add_edges_sorted_internal() typedef
385 edge_num new_edge_count = std::distance(first, last); in add_edges_sorted_internal()
389 edge_num edges_added_before_i in add_edges_sorted_internal()
404 edge_num edges_added_to_this_vertex = 0; in add_edges_sorted_internal()
416 edge_num old_rowstart = m_rowstart[i]; in add_edges_sorted_internal()
417 edge_num new_rowstart = m_rowstart[i] + edges_added_before_i; in add_edges_sorted_internal()
418 edge_num old_degree = m_rowstart[i + 1] - m_rowstart[i]; in add_edges_sorted_internal()
419 edge_num new_degree = old_degree + edges_added_to_this_vertex; in add_edges_sorted_internal()
|
| /dports/devel/R-cran-BH/BH/inst/include/boost/graph/detail/ |
| H A D | compressed_sparse_row_struct.hpp | 384 typedef EdgeIndex edge_num; in add_edges_sorted_internal() typedef
385 edge_num new_edge_count = std::distance(first, last); in add_edges_sorted_internal()
389 edge_num edges_added_before_i in add_edges_sorted_internal()
404 edge_num edges_added_to_this_vertex = 0; in add_edges_sorted_internal()
416 edge_num old_rowstart = m_rowstart[i]; in add_edges_sorted_internal()
417 edge_num new_rowstart = m_rowstart[i] + edges_added_before_i; in add_edges_sorted_internal()
418 edge_num old_degree = m_rowstart[i + 1] - m_rowstart[i]; in add_edges_sorted_internal()
419 edge_num new_degree = old_degree + edges_added_to_this_vertex; in add_edges_sorted_internal()
|
| /dports/games/frogatto/frogatto-1.3.1/MacOSJet/boost/include/boost/graph/detail/ |
| H A D | compressed_sparse_row_struct.hpp | 353 typedef EdgeIndex edge_num; in add_edges_sorted_internal() typedef
354 edge_num new_edge_count = std::distance(first, last); in add_edges_sorted_internal()
358 edge_num edges_added_before_i = new_edge_count; // Count increment to add to rowstarts in add_edges_sorted_internal()
367 edge_num edges_added_to_this_vertex = 0; in add_edges_sorted_internal()
376 edge_num old_rowstart = m_rowstart[i]; in add_edges_sorted_internal()
377 edge_num new_rowstart = m_rowstart[i] + edges_added_before_i; in add_edges_sorted_internal()
378 edge_num old_degree = m_rowstart[i + 1] - m_rowstart[i]; in add_edges_sorted_internal()
379 edge_num new_degree = old_degree + edges_added_to_this_vertex; in add_edges_sorted_internal()
|
| /dports/databases/percona57-pam-for-mysql/boost_1_59_0/boost/graph/detail/ |
| H A D | compressed_sparse_row_struct.hpp | 348 typedef EdgeIndex edge_num; in add_edges_sorted_internal() typedef
349 edge_num new_edge_count = std::distance(first, last); in add_edges_sorted_internal()
353 edge_num edges_added_before_i = new_edge_count; // Count increment to add to rowstarts in add_edges_sorted_internal()
362 edge_num edges_added_to_this_vertex = 0; in add_edges_sorted_internal()
371 edge_num old_rowstart = m_rowstart[i]; in add_edges_sorted_internal()
372 edge_num new_rowstart = m_rowstart[i] + edges_added_before_i; in add_edges_sorted_internal()
373 edge_num old_degree = m_rowstart[i + 1] - m_rowstart[i]; in add_edges_sorted_internal()
374 edge_num new_degree = old_degree + edges_added_to_this_vertex; in add_edges_sorted_internal()
|
| /dports/math/stanmath/math-4.2.0/lib/boost_1.75.0/boost/graph/detail/ |
| H A D | compressed_sparse_row_struct.hpp | 384 typedef EdgeIndex edge_num; in add_edges_sorted_internal() typedef
385 edge_num new_edge_count = std::distance(first, last); in add_edges_sorted_internal()
389 edge_num edges_added_before_i in add_edges_sorted_internal()
404 edge_num edges_added_to_this_vertex = 0; in add_edges_sorted_internal()
416 edge_num old_rowstart = m_rowstart[i]; in add_edges_sorted_internal()
417 edge_num new_rowstart = m_rowstart[i] + edges_added_before_i; in add_edges_sorted_internal()
418 edge_num old_degree = m_rowstart[i + 1] - m_rowstart[i]; in add_edges_sorted_internal()
419 edge_num new_degree = old_degree + edges_added_to_this_vertex; in add_edges_sorted_internal()
|
| /dports/science/py-scipy/scipy-1.7.1/scipy/_lib/boost/boost/graph/detail/ |
| H A D | compressed_sparse_row_struct.hpp | 384 typedef EdgeIndex edge_num; in add_edges_sorted_internal() typedef
385 edge_num new_edge_count = std::distance(first, last); in add_edges_sorted_internal()
389 edge_num edges_added_before_i in add_edges_sorted_internal()
404 edge_num edges_added_to_this_vertex = 0; in add_edges_sorted_internal()
416 edge_num old_rowstart = m_rowstart[i]; in add_edges_sorted_internal()
417 edge_num new_rowstart = m_rowstart[i] + edges_added_before_i; in add_edges_sorted_internal()
418 edge_num old_degree = m_rowstart[i + 1] - m_rowstart[i]; in add_edges_sorted_internal()
419 edge_num new_degree = old_degree + edges_added_to_this_vertex; in add_edges_sorted_internal()
|
| /dports/databases/xtrabackup/boost_1_59_0/boost/graph/detail/ |
| H A D | compressed_sparse_row_struct.hpp | 348 typedef EdgeIndex edge_num; in add_edges_sorted_internal() typedef
349 edge_num new_edge_count = std::distance(first, last); in add_edges_sorted_internal()
353 edge_num edges_added_before_i = new_edge_count; // Count increment to add to rowstarts in add_edges_sorted_internal()
362 edge_num edges_added_to_this_vertex = 0; in add_edges_sorted_internal()
371 edge_num old_rowstart = m_rowstart[i]; in add_edges_sorted_internal()
372 edge_num new_rowstart = m_rowstart[i] + edges_added_before_i; in add_edges_sorted_internal()
373 edge_num old_degree = m_rowstart[i + 1] - m_rowstart[i]; in add_edges_sorted_internal()
374 edge_num new_degree = old_degree + edges_added_to_this_vertex; in add_edges_sorted_internal()
|
| /dports/databases/percona57-server/boost_1_59_0/boost/graph/detail/ |
| H A D | compressed_sparse_row_struct.hpp | 348 typedef EdgeIndex edge_num; in add_edges_sorted_internal() typedef
349 edge_num new_edge_count = std::distance(first, last); in add_edges_sorted_internal()
353 edge_num edges_added_before_i = new_edge_count; // Count increment to add to rowstarts in add_edges_sorted_internal()
362 edge_num edges_added_to_this_vertex = 0; in add_edges_sorted_internal()
371 edge_num old_rowstart = m_rowstart[i]; in add_edges_sorted_internal()
372 edge_num new_rowstart = m_rowstart[i] + edges_added_before_i; in add_edges_sorted_internal()
373 edge_num old_degree = m_rowstart[i + 1] - m_rowstart[i]; in add_edges_sorted_internal()
374 edge_num new_degree = old_degree + edges_added_to_this_vertex; in add_edges_sorted_internal()
|
| /dports/math/deal.ii/dealii-803d21ff957e349b3799cd3ef2c840bc78734305/bundled/boost-1.70.0/include/boost/graph/detail/ |
| H A D | compressed_sparse_row_struct.hpp | 348 typedef EdgeIndex edge_num; in add_edges_sorted_internal() typedef
349 edge_num new_edge_count = std::distance(first, last); in add_edges_sorted_internal()
353 edge_num edges_added_before_i = new_edge_count; // Count increment to add to rowstarts in add_edges_sorted_internal()
362 edge_num edges_added_to_this_vertex = 0; in add_edges_sorted_internal()
371 edge_num old_rowstart = m_rowstart[i]; in add_edges_sorted_internal()
372 edge_num new_rowstart = m_rowstart[i] + edges_added_before_i; in add_edges_sorted_internal()
373 edge_num old_degree = m_rowstart[i + 1] - m_rowstart[i]; in add_edges_sorted_internal()
374 edge_num new_degree = old_degree + edges_added_to_this_vertex; in add_edges_sorted_internal()
|