| /dports/math/ogdf/OGDF/include/ogdf/graphalg/ |
| H A D | ShortestPathAlgorithms.h | 51 void bfs_SPAP(const Graph& G, NodeArray<NodeArray<TCost>>& distance, TCost edgeCosts) { in bfs_SPAP() argument
53 bfs_SPSS(v, G, distance[v], edgeCosts); in bfs_SPAP()
74 TCost d = distanceArray[w] + edgeCosts; in bfs_SPSS()
98 EdgeArray<TCost> edgeCosts(G); in dijkstra_SPAP()
101 edgeCosts[e] = GA.doubleWeight(e); in dijkstra_SPAP()
102 avgCosts += edgeCosts[e]; in dijkstra_SPAP()
104 dijkstra_SPAP(G, shortestPathMatrix, edgeCosts); in dijkstra_SPAP()
119 const EdgeArray<TCost>& edgeCosts) in dijkstra_SPAP() argument
122 dijkstra_SPSS(v, G, shortestPathMatrix[v], edgeCosts); in dijkstra_SPAP()
140 const EdgeArray<TCost>& edgeCosts) in dijkstra_SPSS() argument
[all …]
|
| /dports/security/clamav-lts/clamav-0.103.5/libclamav/c++/llvm/lib/CodeGen/PBQP/ |
| H A D | HeuristicSolver.h | 507 Matrix &edgeCosts = g.getEdgeCosts(eItr); in tryNormaliseEdgeMatrix() local
516 rowMin = edgeCosts[r][c]; in tryNormaliseEdgeMatrix()
522 edgeCosts.subFromRow(r, rowMin); in tryNormaliseEdgeMatrix()
525 edgeCosts.setRow(r, 0); in tryNormaliseEdgeMatrix()
534 colMin = edgeCosts[r][c]; in tryNormaliseEdgeMatrix()
540 edgeCosts.subFromCol(c, colMin); in tryNormaliseEdgeMatrix()
543 edgeCosts.setCol(c, 0); in tryNormaliseEdgeMatrix()
547 return edgeCosts.isZero(); in tryNormaliseEdgeMatrix()
569 Matrix &edgeCosts = g.getEdgeCosts(eItr); in computeSolution() local
574 v += edgeCosts.getColAsVector(adjSolution); in computeSolution()
[all …]
|
| H A D | Graph.h | 377 const Matrix &edgeCosts = getEdgeCosts(edgeItr); in printDot() local
379 for (unsigned i = 0; i < edgeCosts.getRows(); ++i) { in printDot()
380 os << edgeCosts.getRowAsVector(i) << "\\n"; in printDot()
|
| /dports/math/ogdf/OGDF/include/ogdf/energybased/ |
| H A D | StressMinimization.h | 91 inline void setEdgeCosts(double edgeCosts);
215 void StressMinimization::setEdgeCosts(double edgeCosts) { in setEdgeCosts() argument
216 m_edgeCosts = (edgeCosts > 0) ? edgeCosts : 100; in setEdgeCosts()
|
| H A D | PivotMDS.h | 69 void setEdgeCosts(double edgeCosts){ in setEdgeCosts() argument
70 m_edgeCosts = edgeCosts; in setEdgeCosts()
|
| /dports/math/ogdf/OGDF/src/ogdf/energybased/ |
| H A D | PivotMDS.cpp | 254 EdgeArray<double> edgeCosts; in getPivotDistanceMatrix() local
258 edgeCosts.init(G); in getPivotDistanceMatrix()
261 edgeCosts[e] = GA.doubleWeight(e); in getPivotDistanceMatrix()
275 dijkstra_SPSS(pivNode, G, shortestPathSingleSource, edgeCosts); in getPivotDistanceMatrix()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/llvm/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | ReductionRules.h | 203 const Matrix& edgeCosts = G.getEdgeCosts(EId); in backpropagate() local
206 v += edgeCosts.getColAsVector(s.getSelection(mId)); in backpropagate()
209 v += edgeCosts.getRowAsVector(s.getSelection(mId)); in backpropagate()
|
| /dports/devel/wasi-libcxx/llvm-project-13.0.1.src/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | ReductionRules.h | 203 const Matrix& edgeCosts = G.getEdgeCosts(EId); in backpropagate() local
206 v += edgeCosts.getColAsVector(s.getSelection(mId)); in backpropagate()
209 v += edgeCosts.getRowAsVector(s.getSelection(mId)); in backpropagate()
|
| /dports/devel/llvm-cheri/llvm-project-37c49ff00e3eadce5d8703fdc4497f28458c64a8/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | ReductionRules.h | 203 const Matrix& edgeCosts = G.getEdgeCosts(EId); in backpropagate() local
206 v += edgeCosts.getColAsVector(s.getSelection(mId)); in backpropagate()
209 v += edgeCosts.getRowAsVector(s.getSelection(mId)); in backpropagate()
|
| /dports/devel/llvm10/llvm-10.0.1.src/include/llvm/CodeGen/PBQP/ |
| H A D | ReductionRules.h | 203 const Matrix& edgeCosts = G.getEdgeCosts(EId); in backpropagate() local
206 v += edgeCosts.getColAsVector(s.getSelection(mId)); in backpropagate()
209 v += edgeCosts.getRowAsVector(s.getSelection(mId)); in backpropagate()
|
| /dports/graphics/llvm-mesa/llvm-13.0.1.src/include/llvm/CodeGen/PBQP/ |
| H A D | ReductionRules.h | 203 const Matrix& edgeCosts = G.getEdgeCosts(EId); in backpropagate() local
206 v += edgeCosts.getColAsVector(s.getSelection(mId)); in backpropagate()
209 v += edgeCosts.getRowAsVector(s.getSelection(mId)); in backpropagate()
|
| /dports/devel/llvm12/llvm-project-12.0.1.src/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | ReductionRules.h | 203 const Matrix& edgeCosts = G.getEdgeCosts(EId); in backpropagate() local
206 v += edgeCosts.getColAsVector(s.getSelection(mId)); in backpropagate()
209 v += edgeCosts.getRowAsVector(s.getSelection(mId)); in backpropagate()
|
| /dports/devel/llvm11/llvm-11.0.1.src/include/llvm/CodeGen/PBQP/ |
| H A D | ReductionRules.h | 203 const Matrix& edgeCosts = G.getEdgeCosts(EId); in backpropagate() local
206 v += edgeCosts.getColAsVector(s.getSelection(mId)); in backpropagate()
209 v += edgeCosts.getRowAsVector(s.getSelection(mId)); in backpropagate()
|
| /dports/www/chromium-legacy/chromium-88.0.4324.182/third_party/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | ReductionRules.h | 203 const Matrix& edgeCosts = G.getEdgeCosts(EId); in backpropagate() local
206 v += edgeCosts.getColAsVector(s.getSelection(mId)); in backpropagate()
209 v += edgeCosts.getRowAsVector(s.getSelection(mId)); in backpropagate()
|
| /dports/lang/rust/rustc-1.58.1-src/src/llvm-project/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | ReductionRules.h | 203 const Matrix& edgeCosts = G.getEdgeCosts(EId); in backpropagate() local
206 v += edgeCosts.getColAsVector(s.getSelection(mId)); in backpropagate()
209 v += edgeCosts.getRowAsVector(s.getSelection(mId)); in backpropagate()
|
| /dports/devel/llvm-devel/llvm-project-f05c95f10fc1d8171071735af8ad3a9e87633120/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | ReductionRules.h | 203 const Matrix& edgeCosts = G.getEdgeCosts(EId); in backpropagate() local
206 v += edgeCosts.getColAsVector(s.getSelection(mId)); in backpropagate()
209 v += edgeCosts.getRowAsVector(s.getSelection(mId)); in backpropagate()
|
| /dports/devel/wasi-compiler-rt13/llvm-project-13.0.1.src/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | ReductionRules.h | 203 const Matrix& edgeCosts = G.getEdgeCosts(EId); in backpropagate() local
206 v += edgeCosts.getColAsVector(s.getSelection(mId)); in backpropagate()
209 v += edgeCosts.getRowAsVector(s.getSelection(mId)); in backpropagate()
|
| /dports/devel/wasi-compiler-rt12/llvm-project-12.0.1.src/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | ReductionRules.h | 203 const Matrix& edgeCosts = G.getEdgeCosts(EId); in backpropagate() local
206 v += edgeCosts.getColAsVector(s.getSelection(mId)); in backpropagate()
209 v += edgeCosts.getRowAsVector(s.getSelection(mId)); in backpropagate()
|
| /dports/devel/tinygo/tinygo-0.14.1/llvm-project/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | ReductionRules.h | 203 const Matrix& edgeCosts = G.getEdgeCosts(EId); in backpropagate() local
206 v += edgeCosts.getColAsVector(s.getSelection(mId)); in backpropagate()
209 v += edgeCosts.getRowAsVector(s.getSelection(mId)); in backpropagate()
|
| /dports/devel/llvm13/llvm-project-13.0.1.src/llvm/include/llvm/CodeGen/PBQP/ |
| H A D | ReductionRules.h | 203 const Matrix& edgeCosts = G.getEdgeCosts(EId); in backpropagate() local
206 v += edgeCosts.getColAsVector(s.getSelection(mId)); in backpropagate()
209 v += edgeCosts.getRowAsVector(s.getSelection(mId)); in backpropagate()
|
| /dports/devel/llvm90/llvm-9.0.1.src/include/llvm/CodeGen/PBQP/ |
| H A D | ReductionRules.h | 203 const Matrix& edgeCosts = G.getEdgeCosts(EId); in backpropagate() local
206 v += edgeCosts.getColAsVector(s.getSelection(mId)); in backpropagate()
209 v += edgeCosts.getRowAsVector(s.getSelection(mId)); in backpropagate()
|
| /dports/devel/llvm80/llvm-8.0.1.src/include/llvm/CodeGen/PBQP/ |
| H A D | ReductionRules.h | 204 const Matrix& edgeCosts = G.getEdgeCosts(EId); in backpropagate() local
207 v += edgeCosts.getColAsVector(s.getSelection(mId)); in backpropagate()
210 v += edgeCosts.getRowAsVector(s.getSelection(mId)); in backpropagate()
|
| /dports/devel/llvm70/llvm-7.0.1.src/include/llvm/CodeGen/PBQP/ |
| H A D | ReductionRules.h | 204 const Matrix& edgeCosts = G.getEdgeCosts(EId); in backpropagate() local
207 v += edgeCosts.getColAsVector(s.getSelection(mId)); in backpropagate()
210 v += edgeCosts.getRowAsVector(s.getSelection(mId)); in backpropagate()
|
| /dports/math/ogdf/OGDF/include/ogdf/planarity/boyer_myrvold/ |
| H A D | BoyerMyrvoldPlanar.h | 92 const EdgeArray<int> *edgeCosts = nullptr);
104 const EdgeArray<int> *edgeCosts = nullptr)
105 …t>(embeddingGrade), limitStructures, output, randomness, avoidE2Minors, extractSubgraph, edgeCosts) in BoyerMyrvoldPlanar() argument
|
| /dports/math/ogdf/OGDF/src/ogdf/planarity/boyer_myrvold/ |
| H A D | BoyerMyrvoldPlanar.cpp | 54 const EdgeArray<int> *edgeCosts) // costs for removing each edge in BoyerMyrvoldPlanar() argument
62 m_edgeCosts(edgeCosts), in BoyerMyrvoldPlanar()
|