Home
last modified time | relevance | path

Searched defs:G (Results 101 – 125 of 17372) sorted by relevance

12345678910>>...695

/dports/math/igraph/igraph-0.9.5/vendor/glpk/api/
H A Dgraph.c59 static void create_graph(glp_graph *G, int v_size, int a_size) in create_graph()
72 { glp_graph *G; in glp_create_graph() local
101 void glp_set_graph_name(glp_graph *G, const char *name) in glp_set_graph_name()
143 int glp_add_vertices(glp_graph *G, int nadd) in glp_add_vertices()
246 glp_arc *glp_add_arc(glp_graph *G, int i, int j) in glp_add_arc()
368 void glp_del_arc(glp_graph *G, glp_arc *a) in glp_del_arc()
419 static void delete_graph(glp_graph *G) in delete_graph()
452 void glp_delete_graph(glp_graph *G) in glp_delete_graph()
460 void glp_create_v_index(glp_graph *G) in glp_create_v_index()
478 int glp_find_vertex(glp_graph *G, const char *name) in glp_find_vertex()
[all …]
/dports/math/glpk/glpk-5.0/src/api/
H A Dgraph.c59 static void create_graph(glp_graph *G, int v_size, int a_size) in create_graph()
72 { glp_graph *G; in glp_create_graph() local
101 void glp_set_graph_name(glp_graph *G, const char *name) in glp_set_graph_name()
143 int glp_add_vertices(glp_graph *G, int nadd) in glp_add_vertices()
246 glp_arc *glp_add_arc(glp_graph *G, int i, int j) in glp_add_arc()
368 void glp_del_arc(glp_graph *G, glp_arc *a) in glp_del_arc()
419 static void delete_graph(glp_graph *G) in delete_graph()
452 void glp_delete_graph(glp_graph *G) in glp_delete_graph()
460 void glp_create_v_index(glp_graph *G) in glp_create_v_index()
478 int glp_find_vertex(glp_graph *G, const char *name) in glp_find_vertex()
[all …]
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/coloring/
H A Dgreedy_coloring.py25 def strategy_largest_first(G, colors): argument
36 def strategy_random_sequential(G, colors, seed=None): argument
50 def strategy_smallest_last(G, colors): argument
107 def _maximal_independent_set(G): argument
123 def strategy_independent_set(G, colors): argument
147 def strategy_connected_sequential_bfs(G, colors): argument
160 def strategy_connected_sequential_dfs(G, colors): argument
173 def strategy_connected_sequential(G, colors, traversal="bfs"): argument
205 def strategy_saturation_largest_first(G, colors): argument
253 def greedy_color(G, strategy="largest_first", interchange=False): argument
/dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/include/llvm/ADT/
H A DPostOrderIterator.h143 static po_iterator begin(const GraphT &G) { in begin()
146 static po_iterator end(const GraphT &G) { return po_iterator(); } in end()
148 static po_iterator begin(const GraphT &G, SetType &S) { in begin()
200 po_ext_iterator<T, SetType> po_ext_begin(T G, SetType &S) { in po_ext_begin()
205 po_ext_iterator<T, SetType> po_ext_end(T G, SetType &S) { in po_ext_end()
223 ipo_iterator<T> ipo_begin(const T &G) { in ipo_begin()
228 ipo_iterator<T> ipo_end(const T &G){ in ipo_end()
233 iterator_range<ipo_iterator<T>> inverse_post_order(const T &G) { in inverse_post_order()
258 inverse_post_order_ext(const T &G, SetType &S) { in inverse_post_order_ext()
295 void Initialize(const GraphT &G) { in Initialize()
[all …]
/dports/graphics/llvm-mesa/llvm-13.0.1.src/include/llvm/ADT/
H A DPostOrderIterator.h143 static po_iterator begin(const GraphT &G) { in begin()
146 static po_iterator end(const GraphT &G) { return po_iterator(); } in end()
148 static po_iterator begin(const GraphT &G, SetType &S) { in begin()
200 po_ext_iterator<T, SetType> po_ext_begin(T G, SetType &S) { in po_ext_begin()
205 po_ext_iterator<T, SetType> po_ext_end(T G, SetType &S) { in po_ext_end()
223 ipo_iterator<T> ipo_begin(const T &G) { in ipo_begin()
228 ipo_iterator<T> ipo_end(const T &G){ in ipo_end()
233 iterator_range<ipo_iterator<T>> inverse_post_order(const T &G) { in inverse_post_order()
258 inverse_post_order_ext(const T &G, SetType &S) { in inverse_post_order_ext()
295 void Initialize(const GraphT &G) { in Initialize()
[all …]
/dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/include/llvm/ADT/
H A DPostOrderIterator.h143 static po_iterator begin(const GraphT &G) { in begin()
146 static po_iterator end(const GraphT &G) { return po_iterator(); } in end()
148 static po_iterator begin(const GraphT &G, SetType &S) { in begin()
200 po_ext_iterator<T, SetType> po_ext_begin(T G, SetType &S) { in po_ext_begin()
205 po_ext_iterator<T, SetType> po_ext_end(T G, SetType &S) { in po_ext_end()
223 ipo_iterator<T> ipo_begin(const T &G) { in ipo_begin()
228 ipo_iterator<T> ipo_end(const T &G){ in ipo_end()
233 iterator_range<ipo_iterator<T>> inverse_post_order(const T &G) { in inverse_post_order()
258 inverse_post_order_ext(const T &G, SetType &S) { in inverse_post_order_ext()
295 void Initialize(const GraphT &G) { in Initialize()
[all …]
/dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/include/llvm/ADT/
H A DPostOrderIterator.h143 static po_iterator begin(const GraphT &G) { in begin()
146 static po_iterator end(const GraphT &G) { return po_iterator(); } in end()
148 static po_iterator begin(const GraphT &G, SetType &S) { in begin()
200 po_ext_iterator<T, SetType> po_ext_begin(T G, SetType &S) { in po_ext_begin()
205 po_ext_iterator<T, SetType> po_ext_end(T G, SetType &S) { in po_ext_end()
223 ipo_iterator<T> ipo_begin(const T &G) { in ipo_begin()
228 ipo_iterator<T> ipo_end(const T &G){ in ipo_end()
233 iterator_range<ipo_iterator<T>> inverse_post_order(const T &G) { in inverse_post_order()
258 inverse_post_order_ext(const T &G, SetType &S) { in inverse_post_order_ext()
295 void Initialize(const GraphT &G) { in Initialize()
[all …]
/dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/include/llvm/ADT/
H A DPostOrderIterator.h143 static po_iterator begin(const GraphT &G) { in begin()
146 static po_iterator end(const GraphT &G) { return po_iterator(); } in end()
148 static po_iterator begin(const GraphT &G, SetType &S) { in begin()
200 po_ext_iterator<T, SetType> po_ext_begin(T G, SetType &S) { in po_ext_begin()
205 po_ext_iterator<T, SetType> po_ext_end(T G, SetType &S) { in po_ext_end()
223 ipo_iterator<T> ipo_begin(const T &G) { in ipo_begin()
228 ipo_iterator<T> ipo_end(const T &G){ in ipo_end()
233 iterator_range<ipo_iterator<T>> inverse_post_order(const T &G) { in inverse_post_order()
258 inverse_post_order_ext(const T &G, SetType &S) { in inverse_post_order_ext()
295 void Initialize(const GraphT &G) { in Initialize()
[all …]
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/
H A Dtriads.py120 def _tricode(G, v, u, w): argument
133 def triadic_census(G, nodelist=None): argument
215 def is_triad(G): argument
236 def all_triplets(G): argument
254 def all_triads(G): argument
273 def triads_by_type(G): argument
297 def triad_type(G): argument
385 def random_triad(G): argument
/dports/math/suitesparse-klu/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest44.m10 G = GrB (A) ; variable
16 G = GrB (pi) ; variable
22 G = GrB (B) ; variable
31 G = false ([3 4], 'like', H) ; variable
35 G = false (3, 4, 'like', H) ; variable
39 G = true ([3 4], 'like', H) ; variable
43 G = true (3, 4, 'like', H) ; variable
/dports/math/suitesparse-amd/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest44.m10 G = GrB (A) ; variable
16 G = GrB (pi) ; variable
22 G = GrB (B) ; variable
31 G = false ([3 4], 'like', H) ; variable
35 G = false (3, 4, 'like', H) ; variable
39 G = true ([3 4], 'like', H) ; variable
43 G = true (3, 4, 'like', H) ; variable
/dports/math/suitesparse-rbio/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest44.m10 G = GrB (A) ; variable
16 G = GrB (pi) ; variable
22 G = GrB (B) ; variable
31 G = false ([3 4], 'like', H) ; variable
35 G = false (3, 4, 'like', H) ; variable
39 G = true ([3 4], 'like', H) ; variable
43 G = true (3, 4, 'like', H) ; variable
/dports/math/suitesparse-ldl/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest44.m10 G = GrB (A) ; variable
16 G = GrB (pi) ; variable
22 G = GrB (B) ; variable
31 G = false ([3 4], 'like', H) ; variable
35 G = false (3, 4, 'like', H) ; variable
39 G = true ([3 4], 'like', H) ; variable
43 G = true (3, 4, 'like', H) ; variable
/dports/math/suitesparse-mongoose/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest44.m10 G = GrB (A) ; variable
16 G = GrB (pi) ; variable
22 G = GrB (B) ; variable
31 G = false ([3 4], 'like', H) ; variable
35 G = false (3, 4, 'like', H) ; variable
39 G = true ([3 4], 'like', H) ; variable
43 G = true (3, 4, 'like', H) ; variable
/dports/math/suitesparse-cholmod/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest44.m10 G = GrB (A) ; variable
16 G = GrB (pi) ; variable
22 G = GrB (B) ; variable
31 G = false ([3 4], 'like', H) ; variable
35 G = false (3, 4, 'like', H) ; variable
39 G = true ([3 4], 'like', H) ; variable
43 G = true (3, 4, 'like', H) ; variable
/dports/math/suitesparse-colamd/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest44.m10 G = GrB (A) ; variable
16 G = GrB (pi) ; variable
22 G = GrB (B) ; variable
31 G = false ([3 4], 'like', H) ; variable
35 G = false (3, 4, 'like', H) ; variable
39 G = true ([3 4], 'like', H) ; variable
43 G = true (3, 4, 'like', H) ; variable
/dports/math/suitesparse-ccolamd/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest44.m10 G = GrB (A) ; variable
16 G = GrB (pi) ; variable
22 G = GrB (B) ; variable
31 G = false ([3 4], 'like', H) ; variable
35 G = false (3, 4, 'like', H) ; variable
39 G = true ([3 4], 'like', H) ; variable
43 G = true (3, 4, 'like', H) ; variable
/dports/math/suitesparse-slip_lu/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest44.m10 G = GrB (A) ; variable
16 G = GrB (pi) ; variable
22 G = GrB (B) ; variable
31 G = false ([3 4], 'like', H) ; variable
35 G = false (3, 4, 'like', H) ; variable
39 G = true ([3 4], 'like', H) ; variable
43 G = true (3, 4, 'like', H) ; variable
/dports/math/suitesparse-spqr/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest44.m10 G = GrB (A) ; variable
16 G = GrB (pi) ; variable
22 G = GrB (B) ; variable
31 G = false ([3 4], 'like', H) ; variable
35 G = false (3, 4, 'like', H) ; variable
39 G = true ([3 4], 'like', H) ; variable
43 G = true (3, 4, 'like', H) ; variable
/dports/math/suitesparse-umfpack/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest44.m10 G = GrB (A) ; variable
16 G = GrB (pi) ; variable
22 G = GrB (B) ; variable
31 G = false ([3 4], 'like', H) ; variable
35 G = false (3, 4, 'like', H) ; variable
39 G = true ([3 4], 'like', H) ; variable
43 G = true (3, 4, 'like', H) ; variable
/dports/math/suitesparse-camd/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest44.m10 G = GrB (A) ; variable
16 G = GrB (pi) ; variable
22 G = GrB (B) ; variable
31 G = false ([3 4], 'like', H) ; variable
35 G = false (3, 4, 'like', H) ; variable
39 G = true ([3 4], 'like', H) ; variable
43 G = true (3, 4, 'like', H) ; variable
/dports/math/suitesparse-btf/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest44.m10 G = GrB (A) ; variable
16 G = GrB (pi) ; variable
22 G = GrB (B) ; variable
31 G = false ([3 4], 'like', H) ; variable
35 G = false (3, 4, 'like', H) ; variable
39 G = true ([3 4], 'like', H) ; variable
43 G = true (3, 4, 'like', H) ; variable
/dports/math/suitesparse-csparse/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest44.m10 G = GrB (A) ; variable
16 G = GrB (pi) ; variable
22 G = GrB (B) ; variable
31 G = false ([3 4], 'like', H) ; variable
35 G = false (3, 4, 'like', H) ; variable
39 G = true ([3 4], 'like', H) ; variable
43 G = true (3, 4, 'like', H) ; variable
/dports/math/suitesparse-cxsparse/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest44.m10 G = GrB (A) ; variable
16 G = GrB (pi) ; variable
22 G = GrB (B) ; variable
31 G = false ([3 4], 'like', H) ; variable
35 G = false (3, 4, 'like', H) ; variable
39 G = true ([3 4], 'like', H) ; variable
43 G = true (3, 4, 'like', H) ; variable
/dports/math/suitesparse-config/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest44.m10 G = GrB (A) ; variable
16 G = GrB (pi) ; variable
22 G = GrB (B) ; variable
31 G = false ([3 4], 'like', H) ; variable
35 G = false (3, 4, 'like', H) ; variable
39 G = true ([3 4], 'like', H) ; variable
43 G = true (3, 4, 'like', H) ; variable

12345678910>>...695