/dports/biology/seqan/seqan-library-2.4.0/include/seqan/graph_algorithms/ |
H A D | ford_fulkerson.h | 81 TEdgeIterator itE(g); in _buildResidualGraph() 82 for(;!atEnd(itE);goNext(itE)) { in _buildResidualGraph() 84 TFlow f = getProperty(flow, getValue(itE)); in _buildResidualGraph() 85 TCap cap = getProperty(capacity, getValue(itE)); in _buildResidualGraph() 87 TEdgeDescriptor e_rG = findEdge(rG, targetVertex(itE), sourceVertex(itE)); in _buildResidualGraph() 88 if (e_rG == 0) addEdge(rG, targetVertex(itE), sourceVertex(itE), f); in _buildResidualGraph() 92 TEdgeDescriptor e_rG = findEdge(rG, sourceVertex(itE), targetVertex(itE)); in _buildResidualGraph() 93 if (e_rG == 0) addEdge(rG, sourceVertex(itE), targetVertex(itE), cap - f); in _buildResidualGraph() 177 TEdgeIterator itE(g); in fordFulkersonAlgorithm() 178 for(;!atEnd(itE);goNext(itE)) { in fordFulkersonAlgorithm() [all …]
|
H A D | weighted_bipartite_matching.h | 104 TEdgeIterator itE(g); in _weightedBipartiteMatching() 105 for(;!atEnd(itE); goNext(itE)) { in _weightedBipartiteMatching() 106 …if (property(weightMap, (value(itE))) == property(label, sourceVertex(itE)) + property(label, targ… in _weightedBipartiteMatching() 108 …if (getProperty(vertMap, sourceVertex(itE)) == true) addEdge(equalGraph, targetVertex(itE), source… in _weightedBipartiteMatching() 109 else addEdge(equalGraph, sourceVertex(itE), targetVertex(itE)); in _weightedBipartiteMatching() 207 for(;!atEnd(itE); goNext(itE)) { in _weightedBipartiteMatching() 208 …if (property(weightMap, (value(itE))) == property(label, sourceVertex(itE)) + property(label, targ… in _weightedBipartiteMatching() 209 …if (property(vertMap, sourceVertex(itE)) == true) addEdge(equalGraph, targetVertex(itE), sourceVer… in _weightedBipartiteMatching() 210 else addEdge(equalGraph, sourceVertex(itE), targetVertex(itE)); in _weightedBipartiteMatching() 269 TEdgeIterator itE(g); in weightedBipartiteMatching() [all …]
|
H A D | kruskal.h | 115 TEdgeIterator itE(g); in kruskalsAlgorithm() 116 …!atEnd(itE);goNext(itE)) appendValue(edgeList, TWeightEdgePair(getProperty(weight, getValue(itE)),… in kruskalsAlgorithm()
|
H A D | weakly_connected_components.h | 98 for (TEdgeIterator itE(g); !atEnd(itE); goNext(itE)) in weaklyConnectedComponents() 99 … joinSets(unionFind, findSet(unionFind, sourceVertex(itE)), findSet(unionFind, targetVertex(itE))); in weaklyConnectedComponents()
|
/dports/biology/seqan-apps/seqan-seqan-v2.4.0/include/seqan/graph_algorithms/ |
H A D | ford_fulkerson.h | 81 TEdgeIterator itE(g); in _buildResidualGraph() 82 for(;!atEnd(itE);goNext(itE)) { in _buildResidualGraph() 84 TFlow f = getProperty(flow, getValue(itE)); in _buildResidualGraph() 85 TCap cap = getProperty(capacity, getValue(itE)); in _buildResidualGraph() 87 TEdgeDescriptor e_rG = findEdge(rG, targetVertex(itE), sourceVertex(itE)); in _buildResidualGraph() 88 if (e_rG == 0) addEdge(rG, targetVertex(itE), sourceVertex(itE), f); in _buildResidualGraph() 92 TEdgeDescriptor e_rG = findEdge(rG, sourceVertex(itE), targetVertex(itE)); in _buildResidualGraph() 93 if (e_rG == 0) addEdge(rG, sourceVertex(itE), targetVertex(itE), cap - f); in _buildResidualGraph() 177 TEdgeIterator itE(g); in fordFulkersonAlgorithm() 178 for(;!atEnd(itE);goNext(itE)) { in fordFulkersonAlgorithm() [all …]
|
H A D | weighted_bipartite_matching.h | 104 TEdgeIterator itE(g); in _weightedBipartiteMatching() 105 for(;!atEnd(itE); goNext(itE)) { in _weightedBipartiteMatching() 106 …if (property(weightMap, (value(itE))) == property(label, sourceVertex(itE)) + property(label, targ… in _weightedBipartiteMatching() 108 …if (getProperty(vertMap, sourceVertex(itE)) == true) addEdge(equalGraph, targetVertex(itE), source… in _weightedBipartiteMatching() 109 else addEdge(equalGraph, sourceVertex(itE), targetVertex(itE)); in _weightedBipartiteMatching() 207 for(;!atEnd(itE); goNext(itE)) { in _weightedBipartiteMatching() 208 …if (property(weightMap, (value(itE))) == property(label, sourceVertex(itE)) + property(label, targ… in _weightedBipartiteMatching() 209 …if (property(vertMap, sourceVertex(itE)) == true) addEdge(equalGraph, targetVertex(itE), sourceVer… in _weightedBipartiteMatching() 210 else addEdge(equalGraph, sourceVertex(itE), targetVertex(itE)); in _weightedBipartiteMatching() 269 TEdgeIterator itE(g); in weightedBipartiteMatching() [all …]
|
H A D | kruskal.h | 115 TEdgeIterator itE(g); in kruskalsAlgorithm() 116 …!atEnd(itE);goNext(itE)) appendValue(edgeList, TWeightEdgePair(getProperty(weight, getValue(itE)),… in kruskalsAlgorithm()
|
H A D | weakly_connected_components.h | 98 for (TEdgeIterator itE(g); !atEnd(itE); goNext(itE)) in weaklyConnectedComponents() 99 … joinSets(unionFind, findSet(unionFind, sourceVertex(itE)), findSet(unionFind, targetVertex(itE))); in weaklyConnectedComponents()
|
/dports/biology/pbseqan/seqan-21d95d737d8decb5cc3693b9065d81e831e7f57d/include/seqan/graph_algorithms/ |
H A D | ford_fulkerson.h | 81 TEdgeIterator itE(g); in _buildResidualGraph() 82 for(;!atEnd(itE);goNext(itE)) { in _buildResidualGraph() 84 TFlow f = getProperty(flow, getValue(itE)); in _buildResidualGraph() 85 TCap cap = getProperty(capacity, getValue(itE)); in _buildResidualGraph() 87 TEdgeDescriptor e_rG = findEdge(rG, targetVertex(itE), sourceVertex(itE)); in _buildResidualGraph() 88 if (e_rG == 0) addEdge(rG, targetVertex(itE), sourceVertex(itE), f); in _buildResidualGraph() 92 TEdgeDescriptor e_rG = findEdge(rG, sourceVertex(itE), targetVertex(itE)); in _buildResidualGraph() 93 if (e_rG == 0) addEdge(rG, sourceVertex(itE), targetVertex(itE), cap - f); in _buildResidualGraph() 177 TEdgeIterator itE(g); in fordFulkersonAlgorithm() 178 for(;!atEnd(itE);goNext(itE)) { in fordFulkersonAlgorithm() [all …]
|
H A D | weighted_bipartite_matching.h | 104 TEdgeIterator itE(g); in _weightedBipartiteMatching() 105 for(;!atEnd(itE); goNext(itE)) { in _weightedBipartiteMatching() 106 …if (property(weightMap, (value(itE))) == property(label, sourceVertex(itE)) + property(label, targ… in _weightedBipartiteMatching() 108 …if (getProperty(vertMap, sourceVertex(itE)) == true) addEdge(equalGraph, targetVertex(itE), source… in _weightedBipartiteMatching() 109 else addEdge(equalGraph, sourceVertex(itE), targetVertex(itE)); in _weightedBipartiteMatching() 207 for(;!atEnd(itE); goNext(itE)) { in _weightedBipartiteMatching() 208 …if (property(weightMap, (value(itE))) == property(label, sourceVertex(itE)) + property(label, targ… in _weightedBipartiteMatching() 209 …if (property(vertMap, sourceVertex(itE)) == true) addEdge(equalGraph, targetVertex(itE), sourceVer… in _weightedBipartiteMatching() 210 else addEdge(equalGraph, sourceVertex(itE), targetVertex(itE)); in _weightedBipartiteMatching() 269 TEdgeIterator itE(g); in weightedBipartiteMatching() [all …]
|
H A D | kruskal.h | 115 TEdgeIterator itE(g); in kruskalsAlgorithm() 116 …!atEnd(itE);goNext(itE)) appendValue(edgeList, TWeightEdgePair(getProperty(weight, getValue(itE)),… in kruskalsAlgorithm()
|
H A D | weakly_connected_components.h | 98 for (TEdgeIterator itE(g); !atEnd(itE); goNext(itE)) in weaklyConnectedComponents() 99 … joinSets(unionFind, findSet(unionFind, sourceVertex(itE)), findSet(unionFind, targetVertex(itE))); in weaklyConnectedComponents()
|
/dports/cad/opencascade/opencascade-7.6.0/src/HLRTopoBRep/ |
H A D | HLRTopoBRep_Data.cxx | 144 TopTools_ListIteratorOfListOfShape itE; in IsIntLFaceEdge() local 145 for(itE.Initialize(FaceIntL(F)); in IsIntLFaceEdge() 146 itE.More() && !found; in IsIntLFaceEdge() 147 itE.Next()) { in IsIntLFaceEdge() 166 TopTools_ListIteratorOfListOfShape itE; in IsOutLFaceEdge() local 167 for(itE.Initialize(FaceOutL(F)); in IsOutLFaceEdge() 168 itE.More() && !found; in IsOutLFaceEdge() 169 itE.Next()) { in IsOutLFaceEdge() 189 for(itE.Initialize(FaceIsoL(F)); in IsIsoLFaceEdge() 190 itE.More() && !found; in IsIsoLFaceEdge() [all …]
|
/dports/graphics/blender/blender-2.91.0/source/blender/freestyle/intern/winged_edge/ |
H A D | Curvature.cpp | 141 WVertex::incoming_edge_iterator itE; in gts_vertex_mean_curvature_normal() local 143 for (itE = v->incoming_edges_begin(); itE != v->incoming_edges_end(); itE++) { in gts_vertex_mean_curvature_normal() 149 for (itE = v->incoming_edges_begin(); itE != v->incoming_edges_end(); itE++) { in gts_vertex_mean_curvature_normal() 212 WVertex::incoming_edge_iterator itE; in gts_vertex_gaussian_curvature() local 213 for (itE = v->incoming_edges_begin(); itE != v->incoming_edges_end(); itE++) { in gts_vertex_gaussian_curvature() 217 for (itE = v->incoming_edges_begin(); itE != v->incoming_edges_end(); itE++) { in gts_vertex_gaussian_curvature() 312 WVertex::incoming_edge_iterator itE; in gts_vertex_principal_directions() local 326 for (itE = v->incoming_edges_begin(); itE != v->incoming_edges_end(); itE++) { in gts_vertex_principal_directions() 364 for (itE = v->incoming_edges_begin(); itE != v->incoming_edges_end(); itE++) { in gts_vertex_principal_directions() 369 if (!*itE) { in gts_vertex_principal_directions() [all …]
|
/dports/graphics/opencv/opencv-4.5.3/contrib/modules/datasets/src/ |
H A D | slam_kitti.cpp | 129 vector<string>::iterator itE=elems.begin(); in loadDataset() local 130 for (++itE; itE!=elems.end(); ++itE) in loadDataset() 132 curr->p[i].push_back(atof((*itE).c_str())); in loadDataset() 145 for (vector<string>::iterator itE=elems.begin(); itE!=elems.end(); ++itE, ++i) in loadDataset() local 151 p.elem[i] = atof((*itE).c_str()); in loadDataset()
|
/dports/math/ogdf/OGDF/src/ogdf/cluster/ |
H A D | CPlanarSubClusteredGraph.cpp | 109 ListIterator<edge> itE = leftOver.begin(); in call() local 110 while (itE.valid()) in call() 115 edge newCopy = testG.newEdge(nodeCopy[(*itE)->source()], in call() 116 nodeCopy[(*itE)->target()]); in call() 117 edgeCopy[*itE] = newCopy; in call() 124 ++itE; in call() 126 ListIterator<edge> itDel = itE; in call() 127 ++itE; in call()
|
/dports/games/scid/scid/src/ |
H A D | searchindex.cpp | 394 if (param == "white") return std::stable_partition(itB, itE, in doSearch() 397 if (param == "black") return std::stable_partition(itB, itE, in doSearch() 403 if (param == "site") return std::stable_partition(itB, itE, in doSearch() 412 if (param == "date") return std::stable_partition(itB, itE, in doSearch() 418 if (param == "elo") return std::stable_partition(itB, itE, in doSearch() 421 if (param == "welo") return std::stable_partition(itB, itE, in doSearch() 424 if (param == "belo") return std::stable_partition(itB, itE, in doSearch() 427 if (param == "delo") return std::stable_partition(itB, itE, in doSearch() 430 if (param == "eco") return std::stable_partition(itB, itE, in doSearch() 433 if (param == "gnum") return std::stable_partition(itB, itE, in doSearch() [all …]
|
/dports/games/0ad/0ad-0.0.23b-alpha/libraries/source/fcollada/src/FCollada/ |
H A D | FColladaPlugin.cpp | 179 for (FCDExtraSet::iterator itE = extraTrees.begin(); itE != extraTrees.end(); ++itE) in PostImportDocument() local 181 size_t typeCount = itE->first->GetTypeCount(); in PostImportDocument() 184 FCDEType* type = itE->first->GetType(i); in PostImportDocument() 194 FUTrackable* customized = itP->second->ReadFromArchive(technique, itE->first->GetParent()); in PostImportDocument() 214 for (FCDExtraSet::iterator itE = extraTrees.begin(); itE != extraTrees.end(); ++itE) in PreExportDocument() local 216 size_t typeCount = itE->first->GetTypeCount(); in PreExportDocument() 219 FCDEType* type = itE->first->GetType(i); in PreExportDocument()
|
/dports/math/ogdf/OGDF/src/ogdf/orthogonal/ |
H A D | LongestPathCompaction.cpp | 279 SListConstIterator<edge> itE = outCompV.begin(); in moveComponents() local 280 int costOut = D.cost(*itE); in moveComponents() 281 int delta = (pos[(*itE)->target()] - pos[(*itE)->source()]) - in moveComponents() 282 D.length(*itE); in moveComponents() 284 for(++itE; itE.valid(); ++itE) { in moveComponents() 285 costOut += D.cost(*itE); in moveComponents() 286 int d = (pos[(*itE)->target()] - pos[(*itE)->source()]) - in moveComponents() 287 D.length(*itE); in moveComponents()
|
/dports/math/ogdf/OGDF/src/ogdf/upward/ |
H A D | UpwardPlanarSubgraphSimple.cpp | 226 ListConstIterator<edge> itE; in call() local 227 for(itE = delEdges.begin(); itE.valid(); ++itE) in call() 228 GC.delEdge(GC.copy(*itE)); in call() 278 SListConstIterator<edge> itE; in checkAcyclic() local 279 for(itE = added.begin(); itE.valid(); ++itE) in checkAcyclic() 280 graphAcyclicTest.delEdge(*itE); in checkAcyclic()
|
/dports/science/chrono/chrono-7.0.1/src/chrono_thirdparty/HACD/ |
H A D | hacdMeshDecimator.cpp | 99 for(size_t itE = 0; itE < m_vertices[v].m_edges.Size(); ++itE) in Initialize() local 101 idEdge = m_vertices[v].m_edges[itE]; in Initialize() 191 for(size_t itE = 0; itE < m_vertices[v2].m_edges.Size(); ++itE) in EdgeCollapse() local 193 idEdge = m_vertices[v2].m_edges[itE]; in EdgeCollapse() 219 for(size_t itE = 0; itE < m_vertices[v1].m_edges.Size(); ++itE) in EdgeCollapse() local 222 idEdge = m_vertices[v1].m_edges[itE]; in EdgeCollapse() 231 for(size_t itE = 0; itE < m_vertices[idVertex].m_edges.Size(); ++itE) in EdgeCollapse() local 233 idEdge = m_vertices[idVertex].m_edges[itE]; in EdgeCollapse() 270 for(size_t itE = 0; itE < m_vertices[v].m_edges.Size(); ++itE) in IsBoundaryVertex() local 599 for(size_t itE = 0; itE < m_vertices[v1].m_edges.Size(); ++itE) in EdgeCollapse() local [all …]
|
/dports/biology/seqan/seqan-library-2.4.0/share/doc/seqan/html/demos/dox/misc/ |
H A D | enumerate_strings.cpp | 27 for (TEditIterator itE = begin(editEnumerator); !atEnd(itE); goNext(itE)) in main() local 28 std::cout << *itE << '\n'; in main()
|
/dports/biology/seqan-apps/seqan-seqan-v2.4.0/demos/dox/misc/ |
H A D | enumerate_strings.cpp | 27 for (TEditIterator itE = begin(editEnumerator); !atEnd(itE); goNext(itE)) in main() local 28 std::cout << *itE << '\n'; in main()
|
/dports/biology/seqan1/seqan-1.3.1/seqan/graph_msa/ |
H A D | graph_align_tcoffee_base.h | 120 for(;!atEnd(itE);goNext(itE)) cargo(value(itE)) = 1; in buildAlignmentGraph() 322 TEdgeIterator itE(g); in tripletLibraryExtension() 323 for(;!atEnd(itE);goNext(itE)) { in tripletLibraryExtension() 358 for(TEdgeMapIter itE = newEMap.begin(); itE != newEMap.end(); ++itE) in tripletLibraryExtension() local 359 addEdge(g, (*itE).first.first, (*itE).first.second, (*itE).second); in tripletLibraryExtension() 540 TEdgeIterator itE(g); in tripletLibraryExtension() 541 for(;!atEnd(itE);goNext(itE)) { in tripletLibraryExtension() 590 for(TEdgeMapIter itE = newEMap.begin(); itE != newEMap.end(); ++itE) in tripletLibraryExtension() local 591 addEdge(g, (*itE).first.first, (*itE).first.second, (*itE).second); in tripletLibraryExtension() 659 TEdgeIterator itE(g); in graphBasedTripletLibraryExtension() [all …]
|
/dports/biology/seqan/seqan-library-2.4.0/include/seqan/graph_msa/ |
H A D | graph_align_tcoffee_base.h | 145 for(;!atEnd(itE);goNext(itE)) cargo(value(itE)) = 1; in buildAlignmentGraph() 348 TEdgeIterator itE(g); in tripletLibraryExtension() 349 for(;!atEnd(itE);goNext(itE)) { in tripletLibraryExtension() 384 for(TEdgeMapIter itE = newEMap.begin(); itE != newEMap.end(); ++itE) in tripletLibraryExtension() local 385 addEdge(g, (*itE).first.first, (*itE).first.second, (*itE).second); in tripletLibraryExtension() 565 TEdgeIterator itE(g); in tripletLibraryExtension() 566 for(;!atEnd(itE);goNext(itE)) { in tripletLibraryExtension() 615 for(TEdgeMapIter itE = newEMap.begin(); itE != newEMap.end(); ++itE) in tripletLibraryExtension() local 616 addEdge(g, (*itE).first.first, (*itE).first.second, (*itE).second); in tripletLibraryExtension() 683 TEdgeIterator itE(g); in graphBasedTripletLibraryExtension() [all …]
|