| /dports/math/py-or-tools/or-tools-9.2/ortools/graph/ |
| H A D | min_cost_flow.h | 271 FlowQuantity Flow(ArcIndex arc) const;
276 ArcIndex NumArcs() const;
277 NodeIndex Tail(ArcIndex arc) const;
278 NodeIndex Head(ArcIndex arc) const;
288 ArcIndex PermutedArc(ArcIndex arc);
330 typedef typename Graph::ArcIndex ArcIndex; typedef
389 FlowQuantity Flow(ArcIndex arc) const;
425 bool IsAdmissible(ArcIndex arc) const;
519 ArcIndex Opposite(ArcIndex arc) const;
520 bool IsArcDirect(ArcIndex arc) const;
[all …]
|
| H A D | graphs.h | 28 typedef typename Graph::ArcIndex ArcIndex; in precise()
30 static ArcIndex OppositeArc(const Graph& graph, ArcIndex arc) { in precise()
33 static bool IsArcValid(const Graph& graph, ArcIndex arc) { in precise()
39 static ArcIndex ArcReservation(const Graph& graph) { in precise()
43 static void Build(Graph* graph, std::vector<ArcIndex>* permutation) { in precise()
52 typedef Graph::ArcIndex ArcIndex; in precise()
55 typedef typename Graph::ArcIndex ArcIndex; in precise()
58 static ArcIndex OppositeArc(const Graph& graph, ArcIndex arc) { in precise()
61 static bool IsArcValid(const Graph& graph, ArcIndex arc) { in precise()
67 static ArcIndex ArcReservation(const Graph& graph) { in precise()
[all …]
|
| H A D | christofides.h | 47 template <typename CostType, typename ArcIndex = int64_t,
90 CompleteGraph<NodeIndex, ArcIndex> graph_;
111 using ArcIndex = typename GraphType::ArcIndex; in ComputeMinimumWeightMatching() local
115 for (const ArcIndex arc : graph.OutgoingArcs(tail)) { in ComputeMinimumWeightMatching()
147 using ArcIndex = typename GraphType::ArcIndex; in ComputeMinimumWeightMatchingWithMIP() local
158 for (const ArcIndex arc : graph.OutgoingArcs(node)) { in ComputeMinimumWeightMatchingWithMIP()
263 const std::vector<ArcIndex> mst = in Solve()
269 for (ArcIndex arc : mst) { in Solve()
326 [&ordered_arc_costs](ArcIndex arc_a, ArcIndex arc_b) { in Solve()
332 const ArcIndex arc = ordered_arcs[arc_index]; in Solve()
[all …]
|
| H A D | minimum_spanning_tree.h | 49 std::vector<typename Graph::ArcIndex>
52 const std::vector<typename Graph::ArcIndex>& sorted_arcs) { in BuildKruskalMinimumSpanningTreeFromSortedArcs()
53 using ArcIndex = typename Graph::ArcIndex; in BuildKruskalMinimumSpanningTreeFromSortedArcs() local
57 std::vector<ArcIndex> tree_arcs; in BuildKruskalMinimumSpanningTreeFromSortedArcs()
66 const ArcIndex arc = sorted_arcs[arc_index]; in BuildKruskalMinimumSpanningTreeFromSortedArcs()
91 using ArcIndex = typename Graph::ArcIndex; in BuildKruskalMinimumSpanningTree() local
92 std::vector<ArcIndex> sorted_arcs(graph.num_arcs()); in BuildKruskalMinimumSpanningTree()
93 for (const ArcIndex arc : graph.AllForwardArcs()) { in BuildKruskalMinimumSpanningTree()
117 using ArcIndex = typename Graph::ArcIndex; in BuildPrimMinimumSpanningTree() local
120 std::vector<ArcIndex> tree_arcs; in BuildPrimMinimumSpanningTree()
[all …]
|
| H A D | max_flow.h | 170 ArcIndex NumArcs() const;
174 NodeIndex Tail(ArcIndex arc) const;
175 NodeIndex Head(ArcIndex arc) const;
208 FlowQuantity Flow(ArcIndex arc) const;
236 std::vector<ArcIndex> arc_permutation_;
318 typedef typename Graph::ArcIndex ArcIndex; typedef
365 FlowQuantity Flow(ArcIndex arc) const { in Flow()
430 bool IsAdmissible(ArcIndex arc) const { in IsAdmissible()
534 ArcIndex Opposite(ArcIndex arc) const;
535 bool IsArcDirect(ArcIndex arc) const;
[all …]
|
| H A D | min_cost_flow.cc | 396 ArcIndex arc) const { in Flow()
408 ArcIndex arc) const { in Capacity()
418 ArcIndex arc) const { in UnitCost()
447 ArcIndex arc) const { in IsAdmissible()
468 ArcIndex arc) const { in ReducedCost()
963 typename Graph::ArcIndex
1032 ArcIndex SimpleMinCostFlow::PermutedArc(ArcIndex arc) { in PermutedArc()
1094 ArcIndex arc; in SolveWithPossibleAdjustment()
1126 ArcIndex arc; in SolveWithPossibleAdjustment()
1166 ArcIndex SimpleMinCostFlow::Tail(ArcIndex arc) const { return arc_tail_[arc]; } in Tail()
[all …]
|
| H A D | util.h | 201 typedef typename Graph::ArcIndex ArcIndex; in GraphHasDuplicateArcs() typedef
205 for (const ArcIndex arc : graph.OutgoingArcs(tail)) { in GraphHasDuplicateArcs()
210 for (const ArcIndex arc : graph.OutgoingArcs(tail)) { in GraphHasDuplicateArcs()
220 typedef typename Graph::ArcIndex ArcIndex; in GraphIsSymmetric() typedef
225 for (const ArcIndex arc : graph.OutgoingArcs(node)) { in GraphIsSymmetric()
231 std::vector<ArcIndex> count(graph.num_nodes(), 0); in GraphIsSymmetric()
233 for (const ArcIndex arc : graph.OutgoingArcs(node)) { in GraphIsSymmetric()
283 typedef typename Graph::ArcIndex ArcIndex; in RemapGraph() typedef
298 typedef typename Graph::ArcIndex ArcIndex; in GetSubgraphOfNodes() typedef
306 ArcIndex num_arcs = 0; in GetSubgraphOfNodes()
[all …]
|
| H A D | max_flow.cc | 30 const ArcIndex num_arcs = arc_tail_.size(); in AddArcWithCapacity()
77 ArcIndex permuted_arc = in Solve()
84 ArcIndex permuted_arc = in Solve()
308 const ArcIndex arc = it.Index(); in AugmentingPathExists()
326 const ArcIndex arc = it.Index(); in CheckRelabelPrecondition()
446 std::vector<ArcIndex> arc_stack; in PushFlowExcessBackToSource()
459 const ArcIndex arc = it.Index(); in PushFlowExcessBackToSource()
494 const ArcIndex arc = it.Index(); in PushFlowExcessBackToSource()
701 const ArcIndex arc = it.Index(); in SaturateOutgoingArcsFromSource()
903 const ArcIndex arc = it.Index(); in Relabel()
[all …]
|
| H A D | assignment.cc | 24 ArcIndex SimpleLinearSumAssignment::AddArcWithCost(NodeIndex left_node, in AddArcWithCost()
27 const ArcIndex num_arcs = arc_cost_.size(); in AddArcWithCost()
38 ArcIndex SimpleLinearSumAssignment::NumArcs() const { return arc_cost_.size(); } in NumArcs()
40 NodeIndex SimpleLinearSumAssignment::LeftNode(ArcIndex arc) const { in LeftNode()
44 NodeIndex SimpleLinearSumAssignment::RightNode(ArcIndex arc) const { in RightNode()
48 CostValue SimpleLinearSumAssignment::Cost(ArcIndex arc) const { in Cost()
65 const ArcIndex num_arcs = arc_cost_.size(); in Solve()
68 for (ArcIndex arc = 0; arc < num_arcs; ++arc) { in Solve()
|
| H A D | assignment.h | 69 ArcIndex AddArcWithCost(NodeIndex left_node, NodeIndex right_node,
78 ArcIndex NumArcs() const;
82 NodeIndex LeftNode(ArcIndex arc) const;
83 NodeIndex RightNode(ArcIndex arc) const;
84 CostValue Cost(ArcIndex arc) const;
123 std::vector<ArcIndex> assignment_arcs_;
|
| H A D | linear_assignment.h | 230 typedef typename GraphType::ArcIndex ArcIndex;
292 CostValue ArcCost(ArcIndex arc) const {
298 void SetArcCost(ArcIndex arc, CostValue cost);
926 std::vector<ArcIndex> matched_arc_;
1065 bool operator()(typename GraphType::ArcIndex a,
1193 const ArcIndex best_arc = summary.first;
1273 ArcIndex best_arc = arc_it.Index();
1284 const ArcIndex arc = arc_it.Index();
1314 ArcIndex best_arc = arc_it.Index();
1330 const ArcIndex arc = arc_it.Index();
[all …]
|
| /dports/games/libretro-yabause/yabause-ea5b118/yabause/src/libchdr/deps/lzma-16.04/CPP/7zip/UI/Common/ |
| H A D | UpdateProduce.cpp | 23 up2.ArcIndex = pair.ArcIndex; in UpdateProduce()
30 if (pair.ArcIndex >= 0 && callback) in UpdateProduce()
31 callback->ShowDeleteFile(pair.ArcIndex); in UpdateProduce()
62 up2.UseArcProps = (pair.ArcIndex >= 0); in UpdateProduce()
|
| H A D | UpdateProduce.h | 16 int ArcIndex; member
26 ArcIndex = arcIndex; in SetAs_NoChangeArcItem()
30 bool ExistInArchive() const { return ArcIndex != -1; } in ExistInArchive()
38 ArcIndex(-1), in CUpdatePair2()
|
| /dports/games/libretro-play/Play--3cd0a367b5e24c061a6310c68c9fa7f6b531ebd4/deps/Dependencies/lzmasdk-18.05/CPP/7zip/UI/Common/ |
| H A D | UpdateProduce.cpp | 23 up2.ArcIndex = pair.ArcIndex; in UpdateProduce()
30 if (pair.ArcIndex >= 0 && callback) in UpdateProduce()
31 callback->ShowDeleteFile(pair.ArcIndex); in UpdateProduce()
62 up2.UseArcProps = (pair.ArcIndex >= 0); in UpdateProduce()
|
| H A D | UpdateProduce.h | 16 int ArcIndex; member
26 ArcIndex = arcIndex; in SetAs_NoChangeArcItem()
30 bool ExistInArchive() const { return ArcIndex != -1; } in ExistInArchive()
38 ArcIndex(-1), in CUpdatePair2()
|
| /dports/emulators/mess/mame-mame0226/3rdparty/lzma/CPP/7zip/UI/Common/ |
| H A D | UpdateProduce.cpp | 23 up2.ArcIndex = pair.ArcIndex; in UpdateProduce()
30 if (pair.ArcIndex >= 0 && callback) in UpdateProduce()
31 callback->ShowDeleteFile(pair.ArcIndex); in UpdateProduce()
62 up2.UseArcProps = (pair.ArcIndex >= 0); in UpdateProduce()
|
| /dports/www/firefox-esr/firefox-91.8.0/other-licenses/7zstub/src/CPP/7zip/UI/Common/ |
| H A D | UpdateProduce.cpp | 23 up2.ArcIndex = pair.ArcIndex; in UpdateProduce()
30 if (pair.ArcIndex >= 0 && callback) in UpdateProduce()
31 callback->ShowDeleteFile(pair.ArcIndex); in UpdateProduce()
62 up2.UseArcProps = (pair.ArcIndex >= 0); in UpdateProduce()
|
| /dports/archivers/maxcso/maxcso-1.10.0/7zip/CPP/7zip/UI/Common/ |
| H A D | UpdateProduce.cpp | 23 up2.ArcIndex = pair.ArcIndex; in UpdateProduce()
30 if (pair.ArcIndex >= 0 && callback) in UpdateProduce()
31 callback->ShowDeleteFile(pair.ArcIndex); in UpdateProduce()
62 up2.UseArcProps = (pair.ArcIndex >= 0); in UpdateProduce()
|
| /dports/archivers/lzma/lzma-19.00/CPP/7zip/UI/Common/ |
| H A D | UpdateProduce.cpp | 23 up2.ArcIndex = pair.ArcIndex; in UpdateProduce()
30 if (pair.ArcIndex >= 0 && callback) in UpdateProduce()
31 callback->ShowDeleteFile(pair.ArcIndex); in UpdateProduce()
62 up2.UseArcProps = (pair.ArcIndex >= 0); in UpdateProduce()
|
| /dports/archivers/7-zip/7-zip-21.07/CPP/7zip/UI/Common/ |
| H A D | UpdateProduce.cpp | 23 up2.ArcIndex = pair.ArcIndex; in UpdateProduce()
30 if (pair.ArcIndex >= 0 && callback) in UpdateProduce()
31 callback->ShowDeleteFile((unsigned)pair.ArcIndex); in UpdateProduce()
62 up2.UseArcProps = (pair.ArcIndex >= 0); in UpdateProduce()
|
| /dports/emulators/mame/mame-mame0226/3rdparty/lzma/CPP/7zip/UI/Common/ |
| H A D | UpdateProduce.cpp | 23 up2.ArcIndex = pair.ArcIndex; in UpdateProduce()
30 if (pair.ArcIndex >= 0 && callback) in UpdateProduce()
31 callback->ShowDeleteFile(pair.ArcIndex); in UpdateProduce()
62 up2.UseArcProps = (pair.ArcIndex >= 0); in UpdateProduce()
|
| /dports/www/firefox/firefox-99.0/other-licenses/7zstub/src/CPP/7zip/UI/Common/ |
| H A D | UpdateProduce.cpp | 23 up2.ArcIndex = pair.ArcIndex; in UpdateProduce()
30 if (pair.ArcIndex >= 0 && callback) in UpdateProduce()
31 callback->ShowDeleteFile(pair.ArcIndex); in UpdateProduce()
62 up2.UseArcProps = (pair.ArcIndex >= 0); in UpdateProduce()
|
| /dports/mail/thunderbird/thunderbird-91.8.0/other-licenses/7zstub/src/CPP/7zip/UI/Common/ |
| H A D | UpdateProduce.cpp | 23 up2.ArcIndex = pair.ArcIndex; in UpdateProduce()
30 if (pair.ArcIndex >= 0 && callback) in UpdateProduce()
31 callback->ShowDeleteFile(pair.ArcIndex); in UpdateProduce()
62 up2.UseArcProps = (pair.ArcIndex >= 0); in UpdateProduce()
|
| /dports/lang/spidermonkey60/firefox-60.9.0/other-licenses/7zstub/src/CPP/7zip/UI/Common/ |
| H A D | UpdateProduce.cpp | 23 up2.ArcIndex = pair.ArcIndex; in UpdateProduce()
30 if (pair.ArcIndex >= 0 && callback) in UpdateProduce()
31 callback->ShowDeleteFile(pair.ArcIndex); in UpdateProduce()
62 up2.UseArcProps = (pair.ArcIndex >= 0); in UpdateProduce()
|
| /dports/lang/spidermonkey78/firefox-78.9.0/other-licenses/7zstub/src/CPP/7zip/UI/Common/ |
| H A D | UpdateProduce.cpp | 23 up2.ArcIndex = pair.ArcIndex; in UpdateProduce()
30 if (pair.ArcIndex >= 0 && callback) in UpdateProduce()
31 callback->ShowDeleteFile(pair.ArcIndex); in UpdateProduce()
62 up2.UseArcProps = (pair.ArcIndex >= 0); in UpdateProduce()
|