Home
last modified time | relevance | path

Searched refs:NodeIndex (Results 1 – 25 of 1154) sorted by relevance

12345678910>>...47

/dports/math/py-or-tools/or-tools-9.2/ortools/graph/
H A Dperfect_matching.h224 NodeIndex root;
260 Edge(NodeIndex t, NodeIndex h, CostValue c) in Edge()
270 NodeIndex OtherEnd(NodeIndex n) const { in OtherEnd()
296 NodeIndex tail;
297 NodeIndex head;
309 void AddEdge(NodeIndex tail, NodeIndex head, CostValue cost);
335 NodeIndex Match(NodeIndex n) const;
340 void Grow(EdgeIndex e, NodeIndex tail, NodeIndex head);
432 NodeIndex OtherEnd(const Edge& edge, NodeIndex node) const { in OtherEnd()
450 const std::vector<NodeIndex>& SubNodes(NodeIndex n);
[all …]
H A Dstrongly_connected_components.h82 template <typename NodeIndex>
85 void emplace_back(NodeIndex const* b, NodeIndex const* e) { in emplace_back()
117 NodeIndex current_scc_start = 0; in FindStronglyConnectedComponents()
127 const NodeIndex index = node_index_[node]; in FindStronglyConnectedComponents()
136 NodeIndex min_head_index = kSettledIndex; in FindStronglyConnectedComponents()
182 static constexpr NodeIndex kSettledIndex =
183 std::numeric_limits<NodeIndex>::max();
188 std::vector<NodeIndex> scc_stack_;
194 std::vector<NodeIndex> scc_start_index_;
202 std::vector<NodeIndex> node_index_;
[all …]
H A Deulerian_path.h41 typedef typename Graph::NodeIndex NodeIndex; in IsEulerianGraph() typedef
54 template <typename NodeIndex, typename Graph>
73 template <typename NodeIndex, typename Graph>
78 std::vector<NodeIndex> tour; in BuildEulerianPathFromNode()
80 std::vector<NodeIndex> tour_stack = {root}; in BuildEulerianPathFromNode()
86 const NodeIndex node = tour_stack.back(); in BuildEulerianPathFromNode()
115 template <typename NodeIndex, typename Graph>
118 std::vector<NodeIndex> tour; in BuildEulerianTourFromNode()
139 typedef typename Graph::NodeIndex NodeIndex; in BuildEulerianPath() typedef
140 std::vector<NodeIndex> path; in BuildEulerianPath()
[all …]
H A Dcliques.h145 template <typename NodeIndex>
152 using IsArcCallback = std::function<bool(NodeIndex, NodeIndex)>;
264 NodeIndex pivot;
317 inline bool IsArc(NodeIndex node1, NodeIndex node2) const { in IsArc()
339 const NodeIndex num_nodes_;
359 template <typename NodeIndex>
392 template <typename NodeIndex>
408 template <typename NodeIndex>
425 template <typename NodeIndex>
436 template <typename NodeIndex>
[all …]
H A Dmax_flow.h162 ArcIndex AddArcWithCapacity(NodeIndex tail, NodeIndex head,
167 NodeIndex NumNodes() const;
196 Status Solve(NodeIndex source, NodeIndex sink);
229 FlowModelProto CreateFlowModelProto(NodeIndex source, NodeIndex sink) const;
232 NodeIndex num_nodes_;
317 typedef typename Graph::NodeIndex NodeIndex; typedef
334 GenericMaxFlow(const Graph* graph, NodeIndex source, NodeIndex sink);
541 void ComputeReachableNodes(NodeIndex start, std::vector<NodeIndex>* result);
600 NodeIndex source_;
603 NodeIndex sink_;
[all …]
H A Dchristofides.h48 typename NodeIndex = int32_t,
49 typename CostFunction = std::function<CostType(NodeIndex, NodeIndex)>>
99 std::vector<NodeIndex> tsp_path_;
108 std::pair<typename GraphType::NodeIndex, typename GraphType::NodeIndex>>>
112 using NodeIndex = typename GraphType::NodeIndex; in ComputeMinimumWeightMatching() local
114 for (NodeIndex tail : graph.AllNodes()) { in ComputeMinimumWeightMatching()
127 std::vector<std::pair<NodeIndex, NodeIndex>> match; in ComputeMinimumWeightMatching()
144 std::pair<typename GraphType::NodeIndex, typename GraphType::NodeIndex>>>
148 using NodeIndex = typename GraphType::NodeIndex; in ComputeMinimumWeightMatchingWithMIP() local
205 std::vector<std::pair<NodeIndex, NodeIndex>> matching; in ComputeMinimumWeightMatchingWithMIP()
[all …]
H A Dmin_cost_flow.h231 ArcIndex AddArcWithCapacityAndUnitCost(NodeIndex tail, NodeIndex head,
275 NodeIndex NumNodes() const;
277 NodeIndex Tail(ArcIndex arc) const;
278 NodeIndex Head(ArcIndex arc) const;
294 std::vector<NodeIndex> arc_tail_;
295 std::vector<NodeIndex> arc_head_;
329 typedef typename Graph::NodeIndex NodeIndex; typedef
429 bool IsActive(NodeIndex node) const;
500 void Discharge(NodeIndex node);
514 void Relabel(NodeIndex node);
[all …]
H A Dperfect_matching.cc38 graph_->AddEdge(BlossomGraph::NodeIndex(tail), BlossomGraph::NodeIndex(head), in AddEdgeWithCost()
110 using NodeIndex = BlossomGraph::NodeIndex; typedef
114 BlossomGraph::NodeIndex(-1);
130 void BlossomGraph::AddEdge(NodeIndex tail, NodeIndex head, CostValue cost) { in AddEdge()
340 NodeIndex BlossomGraph::Match(NodeIndex n) const { in Match()
361 NodeIndex tail = Tail(edge); in DebugCheckNoPossiblePrimalUpdates()
474 void BlossomGraph::Grow(EdgeIndex e, NodeIndex tail, NodeIndex head) { in Grow()
833 NodeIndex tail, NodeIndex head) { in FindTightExternalEdgeBetweenNodes()
892 const NodeIndex end_node = in Expand()
908 const NodeIndex node = in Expand()
[all …]
H A Dassignment.h69 ArcIndex AddArcWithCost(NodeIndex left_node, NodeIndex right_node,
75 NodeIndex NumNodes() const;
82 NodeIndex LeftNode(ArcIndex arc) const;
83 NodeIndex RightNode(ArcIndex arc) const;
108 NodeIndex RightMate(NodeIndex left_node) const { in RightMate()
114 CostValue AssignmentCost(NodeIndex left_node) const { in AssignmentCost()
119 NodeIndex num_nodes_;
120 std::vector<NodeIndex> arc_tail_;
121 std::vector<NodeIndex> arc_head_;
H A Dlinear_assignment.h229 typedef typename GraphType::NodeIndex NodeIndex;
324 NodeIndex NumNodes() const {
351 inline NodeIndex GetMate(NodeIndex left_node) const {
412 virtual NodeIndex Get() = 0;
423 NodeIndex Get() override {
431 std::vector<NodeIndex> v_;
442 NodeIndex Get() override {
450 std::deque<NodeIndex> q_;
534 NodeIndex num_left_nodes_;
913 NodeIndex total_excess_;
[all …]
/dports/converters/wkhtmltopdf/qt-5db36ec/src/3rdparty/webkit/Source/JavaScriptCore/dfg/
H A DDFGByteCodeParser.cpp199 NodeIndex toInt32(NodeIndex index) in toInt32()
235 NodeIndex toNumber(NodeIndex index) in toNumber()
298 NodeIndex getThis() in getThis()
389 NodeIndex one() in one()
417 …NodeIndex addToGraph(NodeType op, NodeIndex child1 = NoNode, NodeIndex child2 = NoNode, NodeIndex … in addToGraph()
419 NodeIndex resultIndex = (NodeIndex)m_graph.size(); in addToGraph()
426 …NodeIndex addToGraph(NodeType op, OpInfo info, NodeIndex child1 = NoNode, NodeIndex child2 = NoNod… in addToGraph()
428 NodeIndex resultIndex = (NodeIndex)m_graph.size(); in addToGraph()
435 …NodeIndex addToGraph(NodeType op, OpInfo info1, OpInfo info2, NodeIndex child1 = NoNode, NodeIndex… in addToGraph()
437 NodeIndex resultIndex = (NodeIndex)m_graph.size(); in addToGraph()
[all …]
H A DDFGSpeculativeJIT.h78 NodeIndex m_nodeIndex;
85 NodeIndex nodeIndex;
131 GPRReg fillSpeculateIntStrict(NodeIndex);
132 GPRReg fillSpeculateCell(NodeIndex);
252 NodeIndex index() const in index()
273 NodeIndex m_index;
296 NodeIndex index() const in index()
310 NodeIndex m_index;
332 NodeIndex index() const in index()
346 NodeIndex m_index;
[all …]
/dports/math/py-or-tools/or-tools-9.2/ortools/constraint_solver/
H A Drouting_index_manager.cc30 std::vector<std::pair<NodeIndex, NodeIndex>>( in RoutingIndexManager()
38 std::vector<std::pair<NodeIndex, NodeIndex>> starts_ends(num_vehicles); in RoutingIndexManager()
47 const std::vector<std::pair<NodeIndex, NodeIndex>>& starts_ends) { in RoutingIndexManager() argument
53 const std::vector<std::pair<NodeIndex, NodeIndex>>& starts_ends) { in Initialize() argument
54 static const NodeIndex kZeroNode(0); in Initialize()
59 absl::flat_hash_set<NodeIndex> starts; in Initialize()
60 absl::flat_hash_set<NodeIndex> ends; in Initialize()
62 for (const std::pair<NodeIndex, NodeIndex>& start_end : starts_ends) { in Initialize()
104 NodeIndex end = starts_ends[i].second; in Initialize()
128 for (const NodeIndex node : nodes) { in NodesToIndices()
[all …]
H A Drouting_index_manager.h51 typedef RoutingNodeIndex NodeIndex; typedef
60 const std::vector<NodeIndex>& starts,
61 const std::vector<NodeIndex>& ends);
64 const std::vector<std::pair<NodeIndex, NodeIndex> >& starts_ends);
82 int64_t NodeToIndex(NodeIndex node) const { in NodeToIndex()
89 const std::vector<NodeIndex>& nodes) const;
92 NodeIndex IndexToNode(int64_t index) const { in IndexToNode()
98 std::vector<NodeIndex> IndicesToNodes(
112 const std::vector<std::pair<NodeIndex, NodeIndex> >& starts_ends);
114 std::vector<NodeIndex> index_to_node_;
[all …]
/dports/science/elmerfem/elmerfem-release-9.0/fem/src/modules/ResultOutputSolve/
H A DDXOutputSolver.F90329 INTEGER :: NodeIndex(MAX_PART_ELEM, MAX_VERTIX) local
495 SUBROUTINE TranslateElem( Elem, NodeIndex, nElem )
503 NodeIndex(1,:3) = Elem % NodeIndexes(1:3)
506 NodeIndex(1,:3) = Elem % NodeIndexes(1:3)
507 NodeIndex(2,:3) = Elem % NodeIndexes((/ 1,3,4 /))
510 NodeIndex(1,:3) = Elem % NodeIndexes((/ 1,5,9 /))
511 NodeIndex(2,:3) = Elem % NodeIndexes((/ 5,2,9 /))
512 NodeIndex(3,:3) = Elem % NodeIndexes((/ 2,6,9 /))
513 NodeIndex(4,:3) = Elem % NodeIndexes((/ 6,3,9 /))
520 NodeIndex(1,:) = Elem % NodeIndexes(1:4)
[all …]
/dports/mail/thunderbird/thunderbird-91.8.0/third_party/rust/rose_tree/src/
H A Dlib.rs17 pub use petgraph::graph::NodeIndex;
63 child: NodeIndex<Ix>,
71 child: NodeIndex<Ix>,
82 child: NodeIndex<Ix>,
95 pub fn new(root: N) -> (Self, NodeIndex<Ix>) { in new()
135 pub fn add_child(&mut self, parent: NodeIndex<Ix>, kid: N) -> NodeIndex<Ix> { in add_child()
154 pub fn index_twice_mut(&mut self, a: NodeIndex<Ix>, b: NodeIndex<Ix>) -> (&mut N, &mut N) { in index_twice_mut()
204 pub fn parent(&self, child: NodeIndex<Ix>) -> Option<NodeIndex<Ix>> { in parent()
261 fn index(&self, index: NodeIndex<Ix>) -> &N { in index()
279 type Item = NodeIndex<Ix>;
[all …]
/dports/www/firefox-esr/firefox-91.8.0/third_party/rust/rose_tree/src/
H A Dlib.rs17 pub use petgraph::graph::NodeIndex;
63 child: NodeIndex<Ix>,
71 child: NodeIndex<Ix>,
82 child: NodeIndex<Ix>,
95 pub fn new(root: N) -> (Self, NodeIndex<Ix>) { in new()
135 pub fn add_child(&mut self, parent: NodeIndex<Ix>, kid: N) -> NodeIndex<Ix> { in add_child()
154 pub fn index_twice_mut(&mut self, a: NodeIndex<Ix>, b: NodeIndex<Ix>) -> (&mut N, &mut N) { in index_twice_mut()
204 pub fn parent(&self, child: NodeIndex<Ix>) -> Option<NodeIndex<Ix>> { in parent()
261 fn index(&self, index: NodeIndex<Ix>) -> &N { in index()
279 type Item = NodeIndex<Ix>;
[all …]
/dports/devel/racer/racer-2.1.48/cargo-crates/rustc-ap-rustc_data_structures-722.0.0/src/graph/implementation/
H A Dmod.rs43 source: NodeIndex,
44 target: NodeIndex,
63 pub struct NodeIndex(pub usize); struct
80 impl NodeIndex { implementation
202 source: NodeIndex, in adjacent_edges() argument
211 source: NodeIndex, in successor_nodes() argument
218 target: NodeIndex, in predecessor_nodes() argument
225 start: NodeIndex, in depth_traverse() argument
235 ) -> Vec<NodeIndex> { in nodes_in_postorder() argument
308 stack: Vec<NodeIndex>,
[all …]
/dports/devel/racer/racer-2.1.48/cargo-crates/rustc-ap-rustc_data_structures-718.0.0/src/graph/implementation/
H A Dmod.rs43 source: NodeIndex,
44 target: NodeIndex,
63 pub struct NodeIndex(pub usize); struct
80 impl NodeIndex { impl
202 source: NodeIndex, in adjacent_edges() argument
211 source: NodeIndex, in successor_nodes() argument
218 target: NodeIndex, in predecessor_nodes() argument
225 start: NodeIndex, in depth_traverse() argument
235 ) -> Vec<NodeIndex> { in nodes_in_postorder() argument
308 stack: Vec<NodeIndex>,
[all …]
/dports/lang/rust/rustc-1.58.1-src/compiler/rustc_data_structures/src/graph/implementation/
H A Dmod.rs43 source: NodeIndex,
44 target: NodeIndex,
63 pub struct NodeIndex(pub usize); struct
80 impl NodeIndex { impl
202 source: NodeIndex, in adjacent_edges() argument
211 source: NodeIndex, in successor_nodes() argument
218 target: NodeIndex, in predecessor_nodes() argument
225 start: NodeIndex, in depth_traverse() argument
235 ) -> Vec<NodeIndex> { in nodes_in_postorder() argument
308 stack: Vec<NodeIndex>,
[all …]
/dports/lang/rust/rustc-1.58.1-src/vendor/rustc-ap-rustc_data_structures/src/graph/implementation/
H A Dmod.rs43 source: NodeIndex,
44 target: NodeIndex,
63 pub struct NodeIndex(pub usize); struct
80 impl NodeIndex { implementation
202 source: NodeIndex, in adjacent_edges() argument
211 source: NodeIndex, in successor_nodes() argument
218 target: NodeIndex, in predecessor_nodes() argument
225 start: NodeIndex, in depth_traverse() argument
235 ) -> Vec<NodeIndex> { in nodes_in_postorder() argument
308 stack: Vec<NodeIndex>,
[all …]
/dports/math/py-or-tools/or-tools-9.2/examples/cpp/
H A Dcvrptw_lib.h83 int64_t Demand(RoutingIndexManager::NodeIndex from,
89 const RoutingIndexManager::NodeIndex depot_;
100 int64_t Compute(RoutingIndexManager::NodeIndex from,
115 int64_t Compute(RoutingIndexManager::NodeIndex from,
135 using NodeIndex = RoutingIndexManager::NodeIndex; variable
163 int64_t LocationContainer::ManhattanDistance(NodeIndex from, NodeIndex to) const { in ManhattanDistance()
172 int64_t LocationContainer::ManhattanTime(NodeIndex from, NodeIndex to) const { in ManhattanTime()
176 bool LocationContainer::SameLocation(NodeIndex node1, NodeIndex node2) const { in SameLocation()
186 return SameLocation(NodeIndex(node1), NodeIndex(node2)); in SameLocationFromIndex()
229 int64_t RandomDemand::Demand(NodeIndex from, NodeIndex /*to*/) const { in Demand() argument
[all …]
/dports/math/py-or-tools/or-tools-9.2/ortools/constraint_solver/samples/
H A Dvrp_pickup_delivery.cc67 {RoutingIndexManager::NodeIndex{1},
68 RoutingIndexManager::NodeIndex{6}},
69 {RoutingIndexManager::NodeIndex{2},
71 {RoutingIndexManager::NodeIndex{4},
72 RoutingIndexManager::NodeIndex{3}},
73 {RoutingIndexManager::NodeIndex{5},
74 RoutingIndexManager::NodeIndex{9}},
75 {RoutingIndexManager::NodeIndex{7},
76 RoutingIndexManager::NodeIndex{8}},
77 {RoutingIndexManager::NodeIndex{15},
[all …]
H A Dvrp_pickup_delivery_lifo.cc67 {RoutingIndexManager::NodeIndex{1},
68 RoutingIndexManager::NodeIndex{6}},
69 {RoutingIndexManager::NodeIndex{2},
71 {RoutingIndexManager::NodeIndex{4},
72 RoutingIndexManager::NodeIndex{3}},
73 {RoutingIndexManager::NodeIndex{5},
74 RoutingIndexManager::NodeIndex{9}},
75 {RoutingIndexManager::NodeIndex{7},
76 RoutingIndexManager::NodeIndex{8}},
77 {RoutingIndexManager::NodeIndex{15},
[all …]
H A Dvrp_pickup_delivery_fifo.cc67 {RoutingIndexManager::NodeIndex{1},
68 RoutingIndexManager::NodeIndex{6}},
69 {RoutingIndexManager::NodeIndex{2},
71 {RoutingIndexManager::NodeIndex{4},
72 RoutingIndexManager::NodeIndex{3}},
73 {RoutingIndexManager::NodeIndex{5},
74 RoutingIndexManager::NodeIndex{9}},
75 {RoutingIndexManager::NodeIndex{7},
76 RoutingIndexManager::NodeIndex{8}},
77 {RoutingIndexManager::NodeIndex{15},
[all …]

12345678910>>...47