Searched refs:nodepairs (Results 1 – 4 of 4) sorted by relevance
/dports/math/ogdf/OGDF/include/ogdf/graphalg/steiner_tree/ |
H A D | FullComponentGeneratorDreyfusWagner.h | 65 NodePairs nodepairs; member 67 DWMData(T _cost, NodePairs _nodepairs) : cost(_cost), nodepairs(_nodepairs) {} in DWMData() 72 nodepairs.clear(); in invalidate() 78 return cost == 0 || !(nodepairs.empty() && subgraphs.empty()); in valid() 102 nodepairs.push(nodepair); in add() 310 NodePairs nodepairs; in initializeMap() local 311 nodepairs.push(NodePair(key.front(), key.back())); in initializeMap() 312 m_map.fastInsert(key, DWMData(m_distance[t][v], nodepairs)); in initializeMap() 326 for (auto nodepair : data.nodepairs) { in getSteinerTreeFor()
|
/dports/devel/p5-Tree-Trie/Tree-Trie-1.9/ |
H A D | Trie.pm | 190 my @nodepairs = ({ 194 while (scalar @nodepairs) { 195 my $np = pop @nodepairs; 211 push @nodepairs, {
|
/dports/science/elmerfem/elmerfem-release-9.0/elmergrid/src/ |
H A D | egparallel.c | 4654 nodepairs = Imatrix(1,maxsides,1,2); in SaveElmerInputPartitioned() 4656 nodepairs[i][1] = nodepairs[i][2] = 0; in SaveElmerInputPartitioned() 4667 nodeconnections[nodepairs[i][1]] += 1; in SaveElmerInputPartitioned() 4689 ind = nodeconnections[nodepairs[i][1]]; in SaveElmerInputPartitioned() 4707 if(!nodepairs[ind][1] || !nodepairs[ind][2]) continue; in SaveElmerInputPartitioned() 4709 if(nodepairs[ind][2] == nodepairs[ind2][2]) { in SaveElmerInputPartitioned() 4710 nodepairs[ind2][1] = nodepairs[ind2][2] = 0; in SaveElmerInputPartitioned() 4737 … if(nodepairs[ind2][1] == data->topology[i][j] && nodepairs[ind2][2] == data->topology[i][k]) { in SaveElmerInputPartitioned() 4738 nodepairs[ind2][1] = nodepairs[ind2][2] = 0; in SaveElmerInputPartitioned() 4748 ind = nodepairs[i][1]; in SaveElmerInputPartitioned() [all …]
|
/dports/math/SCIP/scip-7.0.3/src/scip/ |
H A D | sepa_mcf.c | 4896 NODEPAIRENTRY* nodepairs; in nodepairqueueCreate() local 5052 nodepairs = (*nodepairqueue)->nodepairs; in nodepairqueueCreate() 5055 nodepairs[nnodepairs] = nodepair; in nodepairqueueCreate() 5077 nodepairs = (*nodepairqueue)->nodepairs; in nodepairqueueCreate() 5081 if(!SCIPisInfinity(scip,nodepairs[n].weight)) in nodepairqueueCreate() 5084 minweight = MIN(minweight, nodepairs[n].weight); in nodepairqueueCreate() 5096 int node1 = nodepairs[n].node1; in nodepairqueueCreate() 5097 int node2 = nodepairs[n].node2; in nodepairqueueCreate() 5155 if( SCIPisPositive(scip, nodepairs[n].weight)) in nodepairqueueCreate() 5160 nodepairs[n].weight += maxweight; in nodepairqueueCreate() [all …]
|