Home
last modified time | relevance | path

Searched defs:G (Results 76 – 100 of 15708) sorted by relevance

12345678910>>...629

/dports/math/suitesparse-cxsparse/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest7.m16 G = GrB.build (i, j, x, m, n) ; variable
21 G = GrB.build (i, j, x, m, n, d) ; variable
25 G = GrB.build (i, j, x, m, n, d) ; variable
31 G = GrB.build (i0, j0, x, struct ('base', 'zero-based')) ; variable
34 G = GrB.build (1:3, 1:3, [1 1 1]) ; variable
37 G = GrB.build (1, 1, [1 2 3]) ; variable
40 G = GrB.build (1:3, 1:3, 1) ; variable
47 G = GrB.build (1:3, 1:3, X) ; variable
H A Dgbtest11.m41 G = GrB (X) variable
46 G = GrB (X) variable
51 G = GrB (X) variable
56 G = GrB (X) variable
61 G = GrB (X) variable
66 G = GrB (X) variable
71 G = GrB (X) variable
76 G = GrB (X) variable
85 G = GrB (X) variable
90 G = GrB (X) variable
/dports/math/suitesparse-graphblas/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest7.m16 G = GrB.build (i, j, x, m, n) ; variable
21 G = GrB.build (i, j, x, m, n, d) ; variable
25 G = GrB.build (i, j, x, m, n, d) ; variable
31 G = GrB.build (i0, j0, x, struct ('base', 'zero-based')) ; variable
34 G = GrB.build (1:3, 1:3, [1 1 1]) ; variable
37 G = GrB.build (1, 1, [1 2 3]) ; variable
40 G = GrB.build (1:3, 1:3, 1) ; variable
47 G = GrB.build (1:3, 1:3, X) ; variable
H A Dgbtest11.m41 G = GrB (X) variable
46 G = GrB (X) variable
51 G = GrB (X) variable
56 G = GrB (X) variable
61 G = GrB (X) variable
66 G = GrB (X) variable
71 G = GrB (X) variable
76 G = GrB (X) variable
85 G = GrB (X) variable
90 G = GrB (X) variable
/dports/graphics/blender/blender-2.91.0/extern/quadriflow/3rd/lemon-1.3.1/test/
H A Dgraph_test.h32 void checkGraphNodeList(const Graph &G, int cnt) in checkGraphNodeList()
195 void checkArcDirections(const Graph& G) { in checkArcDirections()
204 void checkNodeIds(const Graph& G) { in checkNodeIds()
217 void checkRedNodeIds(const Graph& G) { in checkRedNodeIds()
230 void checkBlueNodeIds(const Graph& G) { in checkBlueNodeIds()
243 void checkArcIds(const Graph& G) { in checkArcIds()
256 void checkEdgeIds(const Graph& G) { in checkEdgeIds()
269 void checkGraphNodeMap(const Graph& G) { in checkGraphNodeMap()
299 void checkGraphRedNodeMap(const Graph& G) { in checkGraphRedNodeMap()
359 void checkGraphArcMap(const Graph& G) { in checkGraphArcMap()
[all …]
/dports/math/lemon/lemon-1.3.1/test/
H A Dgraph_test.h32 void checkGraphNodeList(const Graph &G, int cnt) in checkGraphNodeList()
195 void checkArcDirections(const Graph& G) { in checkArcDirections()
204 void checkNodeIds(const Graph& G) { in checkNodeIds()
217 void checkRedNodeIds(const Graph& G) { in checkRedNodeIds()
230 void checkBlueNodeIds(const Graph& G) { in checkBlueNodeIds()
243 void checkArcIds(const Graph& G) { in checkArcIds()
256 void checkEdgeIds(const Graph& G) { in checkEdgeIds()
269 void checkGraphNodeMap(const Graph& G) { in checkGraphNodeMap()
299 void checkGraphRedNodeMap(const Graph& G) { in checkGraphRedNodeMap()
359 void checkGraphArcMap(const Graph& G) { in checkGraphArcMap()
[all …]
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/
H A Dchordal.py33 def is_chordal(G): argument
88 def find_induced_nodes(G, s, t, treewidth_bound=sys.maxsize): argument
165 def chordal_graph_cliques(G): argument
211 def chordal_graph_treewidth(G): argument
264 def _is_complete_graph(G): argument
276 def _find_missing_edge(G): argument
285 def _max_cardinality_node(G, choices, wanna_connect): argument
298 def _find_chordality_breaker(G, s=None, treewidth_bound=sys.maxsize): argument
335 def _chordal_graph_cliques(G): argument
408 def complete_to_chordal_graph(G): argument
H A Deuler.py19 def is_eulerian(G): argument
57 def is_semieulerian(G): argument
65 def _find_path_start(G): argument
90 def _simplegraph_eulerian_circuit(G, source): argument
112 def _multigraph_eulerian_circuit(G, source): argument
136 def eulerian_circuit(G, source=None, keys=False): argument
216 def has_eulerian_path(G, source=None): argument
298 def eulerian_path(G, source=None, keys=False): argument
353 def eulerize(G): argument
/dports/math/suitesparse-config/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest11.m41 G = GrB (X) variable
46 G = GrB (X) variable
51 G = GrB (X) variable
56 G = GrB (X) variable
61 G = GrB (X) variable
66 G = GrB (X) variable
71 G = GrB (X) variable
76 G = GrB (X) variable
85 G = GrB (X) variable
90 G = GrB (X) variable
/dports/math/suitesparse-btf/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest11.m41 G = GrB (X) variable
46 G = GrB (X) variable
51 G = GrB (X) variable
56 G = GrB (X) variable
61 G = GrB (X) variable
66 G = GrB (X) variable
71 G = GrB (X) variable
76 G = GrB (X) variable
85 G = GrB (X) variable
90 G = GrB (X) variable
/dports/math/suitesparse-amd/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest11.m41 G = GrB (X) variable
46 G = GrB (X) variable
51 G = GrB (X) variable
56 G = GrB (X) variable
61 G = GrB (X) variable
66 G = GrB (X) variable
71 G = GrB (X) variable
76 G = GrB (X) variable
85 G = GrB (X) variable
90 G = GrB (X) variable
/dports/math/suitesparse-klu/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest11.m41 G = GrB (X) variable
46 G = GrB (X) variable
51 G = GrB (X) variable
56 G = GrB (X) variable
61 G = GrB (X) variable
66 G = GrB (X) variable
71 G = GrB (X) variable
76 G = GrB (X) variable
85 G = GrB (X) variable
90 G = GrB (X) variable
/dports/math/suitesparse-mongoose/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest11.m41 G = GrB (X) variable
46 G = GrB (X) variable
51 G = GrB (X) variable
56 G = GrB (X) variable
61 G = GrB (X) variable
66 G = GrB (X) variable
71 G = GrB (X) variable
76 G = GrB (X) variable
85 G = GrB (X) variable
90 G = GrB (X) variable
/dports/math/suitesparse-rbio/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest11.m41 G = GrB (X) variable
46 G = GrB (X) variable
51 G = GrB (X) variable
56 G = GrB (X) variable
61 G = GrB (X) variable
66 G = GrB (X) variable
71 G = GrB (X) variable
76 G = GrB (X) variable
85 G = GrB (X) variable
90 G = GrB (X) variable
/dports/math/suitesparse-ldl/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest11.m41 G = GrB (X) variable
46 G = GrB (X) variable
51 G = GrB (X) variable
56 G = GrB (X) variable
61 G = GrB (X) variable
66 G = GrB (X) variable
71 G = GrB (X) variable
76 G = GrB (X) variable
85 G = GrB (X) variable
90 G = GrB (X) variable
/dports/math/suitesparse-colamd/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest11.m41 G = GrB (X) variable
46 G = GrB (X) variable
51 G = GrB (X) variable
56 G = GrB (X) variable
61 G = GrB (X) variable
66 G = GrB (X) variable
71 G = GrB (X) variable
76 G = GrB (X) variable
85 G = GrB (X) variable
90 G = GrB (X) variable
/dports/math/suitesparse-cholmod/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest11.m41 G = GrB (X) variable
46 G = GrB (X) variable
51 G = GrB (X) variable
56 G = GrB (X) variable
61 G = GrB (X) variable
66 G = GrB (X) variable
71 G = GrB (X) variable
76 G = GrB (X) variable
85 G = GrB (X) variable
90 G = GrB (X) variable
/dports/math/suitesparse-spqr/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest11.m41 G = GrB (X) variable
46 G = GrB (X) variable
51 G = GrB (X) variable
56 G = GrB (X) variable
61 G = GrB (X) variable
66 G = GrB (X) variable
71 G = GrB (X) variable
76 G = GrB (X) variable
85 G = GrB (X) variable
90 G = GrB (X) variable
/dports/math/suitesparse-slip_lu/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest11.m41 G = GrB (X) variable
46 G = GrB (X) variable
51 G = GrB (X) variable
56 G = GrB (X) variable
61 G = GrB (X) variable
66 G = GrB (X) variable
71 G = GrB (X) variable
76 G = GrB (X) variable
85 G = GrB (X) variable
90 G = GrB (X) variable
/dports/math/suitesparse-umfpack/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest11.m41 G = GrB (X) variable
46 G = GrB (X) variable
51 G = GrB (X) variable
56 G = GrB (X) variable
61 G = GrB (X) variable
66 G = GrB (X) variable
71 G = GrB (X) variable
76 G = GrB (X) variable
85 G = GrB (X) variable
90 G = GrB (X) variable
/dports/math/suitesparse-camd/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest11.m41 G = GrB (X) variable
46 G = GrB (X) variable
51 G = GrB (X) variable
56 G = GrB (X) variable
61 G = GrB (X) variable
66 G = GrB (X) variable
71 G = GrB (X) variable
76 G = GrB (X) variable
85 G = GrB (X) variable
90 G = GrB (X) variable
/dports/math/suitesparse-ccolamd/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest11.m41 G = GrB (X) variable
46 G = GrB (X) variable
51 G = GrB (X) variable
56 G = GrB (X) variable
61 G = GrB (X) variable
66 G = GrB (X) variable
71 G = GrB (X) variable
76 G = GrB (X) variable
85 G = GrB (X) variable
90 G = GrB (X) variable
/dports/math/suitesparse-csparse/SuiteSparse-5.10.1/GraphBLAS/GraphBLAS/test/
H A Dgbtest11.m41 G = GrB (X) variable
46 G = GrB (X) variable
51 G = GrB (X) variable
56 G = GrB (X) variable
61 G = GrB (X) variable
66 G = GrB (X) variable
71 G = GrB (X) variable
76 G = GrB (X) variable
85 G = GrB (X) variable
90 G = GrB (X) variable
/dports/science/py-pymol/pymol-open-source-2.4.0/layer1/
H A DText.cpp116 bool TextGetIsPicking(PyMOLGlobals * G) in TextGetIsPicking()
173 float *TextGetWorldPos(PyMOLGlobals * G){ in TextGetWorldPos()
183 float *TextGetLabelPos(PyMOLGlobals * G) in TextGetLabelPos()
225 float *TextGetTargetPos(PyMOLGlobals * G){ in TextGetTargetPos()
316 float *TextGetPos(PyMOLGlobals * G) in TextGetPos()
322 float TextGetWidth(PyMOLGlobals * G) in TextGetWidth()
328 float TextGetHeight(PyMOLGlobals * G) in TextGetHeight()
360 float *TextGetColor(PyMOLGlobals * G) in TextGetColor()
459 int TextInit(PyMOLGlobals * G) in TextInit()
495 void TextFree(PyMOLGlobals * G) in TextFree()
[all …]
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/shortest_paths/
H A Dweighted.py40 def _weight_function(G, weight): argument
80 def dijkstra_path(G, source, target, weight="weight"): argument
161 def dijkstra_path_length(G, source, target, weight="weight"): argument
932 def all_pairs_dijkstra(G, cutoff=None, weight="weight"): argument
1111 G, source, target=None, weight="weight", heuristic=False argument
1357 def bellman_ford_path(G, source, target, weight="weight"): argument
1651 def all_pairs_bellman_ford_path_length(G, weight="weight"): argument
1695 def all_pairs_bellman_ford_path(G, weight="weight"): argument
1733 def goldberg_radzik(G, source, weight="weight"): argument
1911 def negative_edge_cycle(G, weight="weight", heuristic=True): argument
[all …]

12345678910>>...629