Google OR-Tools
v9.11
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
simple_graph.cc
Go to the documentation of this file.
1
// Copyright 2010-2024 Google LLC
2
// Licensed under the Apache License, Version 2.0 (the "License");
3
// you may not use this file except in compliance with the License.
4
// You may obtain a copy of the License at
5
//
6
// http://www.apache.org/licenses/LICENSE-2.0
7
//
8
// Unless required by applicable law or agreed to in writing, software
9
// distributed under the License is distributed on an "AS IS" BASIS,
10
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
11
// See the License for the specific language governing permissions and
12
// limitations under the License.
13
14
#include "
ortools/routing/parsers/simple_graph.h
"
15
16
namespace
operations_research
{
17
18
Edge::Edge
(
const
Arc
&
arc
) : tail_(
arc
.
tail
()), head_(
arc
.
head
()) {}
19
Arc::Arc
(
const
Edge
&
edge
) : tail_(
edge
.
tail
()), head_(
edge
.
head
()) {}
20
21
}
// namespace operations_research
operations_research::Arc
Definition
simple_graph.h:62
operations_research::Arc::Arc
Arc(int64_t tail, int64_t head)
Definition
simple_graph.h:64
operations_research::Edge
Definition
simple_graph.h:32
operations_research::Edge::Edge
Edge(int64_t tail, int64_t head)
Definition
simple_graph.h:34
edge
Edge edge
Definition
diffn_util.cc:1033
arc
int arc
Definition
local_search.cc:2839
operations_research
In SWIG mode, we don't want anything besides these top-level includes.
Definition
binary_indexed_tree.h:21
head
int head
Definition
routing_sat.cc:99
tail
int tail
Definition
routing_sat.cc:98
simple_graph.h
ortools
routing
parsers
simple_graph.cc
Generated by
1.12.0