Home
last modified time | relevance | path

Searched refs:G_reduced (Results 1 – 5 of 5) sorted by relevance

/dports/math/ogdf/OGDF/src/ogdf/energybased/
H A DFMMMLayout.cpp97 adjust_positions(G_reduced, A_reduced); in call()
444 Graph& G_reduced, in export_NodeAttributes() argument
448 for(node v_copy : G_reduced.nodes) in export_NodeAttributes()
460 Graph& G_reduced, in make_simple_loopfree() argument
467 G_reduced.clear(); in make_simple_loopfree()
483 EdgeArray<double> new_edgelength(G_reduced); in make_simple_loopfree()
489 A_reduced.init(G_reduced); in make_simple_loopfree()
490 E_reduced.init(G_reduced); in make_simple_loopfree()
517 Graph& G_reduced, in delete_parallel_edges() argument
528 Graph* Graph_ptr = &G_reduced; in delete_parallel_edges()
[all …]
/dports/math/fplll/fplll-5.4.1/tests/
H A Dtest_lll_gram.cpp147 ZZ_mat<ZT> G_reduced; in test_lll() local
148 G_reduced.resize(r, r); in test_lll()
153 (M.b)[i].dot_product(G_reduced(i, j), (M.b)[j], c); in test_lll()
166 if (G(i, j) != G_reduced(i, j)) in test_lll()
H A Dtest_bkz_gram.cpp37 ZZ_mat<ZT> G_reduced; in gram_is_equal() local
38 G_reduced.resize(r, r); in gram_is_equal()
43 (b)[i].dot_product(G_reduced(i, j), (b)[j], c); in gram_is_equal()
56 if (G(i, j) != G_reduced(i, j)) in gram_is_equal()
/dports/math/py-networkx/networkx-2.6.3/networkx/algorithms/
H A Dasteroidal.py160 G_reduced = G.subgraph(set(G.nodes) - closed_neighborhood)
161 for cc in nx.connected_components(G_reduced):
/dports/math/ogdf/OGDF/include/ogdf/energybased/
H A DFMMMLayout.h857 Graph& G_reduced,
871 Graph& G_reduced,
883 Graph& G_reduced,