c34026b101
note: done using ```sh git grep -l "2010-2024 Google" | xargs sed -i 's/2010-2024 Google/2010-2025 Google/' ```
53 lines
2.1 KiB
C#
53 lines
2.1 KiB
C#
// Copyright 2010-2025 Google LLC
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
using System;
|
|
using Xunit;
|
|
|
|
using Google.OrTools.ConstraintSolver;
|
|
using Google.OrTools.Routing;
|
|
|
|
namespace Google.OrTools.Tests {
|
|
public class RoutingSolverTest {
|
|
[Theory]
|
|
[InlineData(false)]
|
|
[InlineData(true)]
|
|
public void SolverTest(bool callGC) {
|
|
// Create Routing Index Manager
|
|
RoutingIndexManager manager = new RoutingIndexManager(
|
|
5/*locations*/, 1/*vehicle*/, 0/*depot*/);
|
|
// Create Routing Model.
|
|
RoutingModel routing = new RoutingModel(manager);
|
|
// Create a distance callback.
|
|
int transitCallbackIndex = routing.RegisterTransitCallback(
|
|
(long fromIndex, long toIndex) => {
|
|
// Convert from routing variable Index to distance matrix NodeIndex.
|
|
var fromNode = manager.IndexToNode(fromIndex);
|
|
var toNode = manager.IndexToNode(toIndex);
|
|
return Math.Abs(toNode - fromNode);
|
|
});
|
|
// Define cost of each arc.
|
|
routing.SetArcCostEvaluatorOfAllVehicles(transitCallbackIndex);
|
|
if (callGC) {
|
|
GC.Collect();
|
|
}
|
|
// Setting first solution heuristic.
|
|
RoutingSearchParameters searchParameters = RoutingGlobals.DefaultRoutingSearchParameters();
|
|
searchParameters.FirstSolutionStrategy = FirstSolutionStrategy.Types.Value.PathCheapestArc;
|
|
Assignment solution = routing.SolveWithParameters(searchParameters);
|
|
// 0 --(+1)-> 1 --(+1)-> 2 --(+1)-> 3 --(+1)-> 4 --(+4)-> 0 := +8
|
|
Assert.Equal(8, solution.ObjectiveValue());
|
|
}
|
|
}
|
|
} // namespace Google.Sample.Tests
|