[4860] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17180] | 3 | * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[4860] | 4 | *
|
---|
| 5 | * This file is part of HeuristicLab.
|
---|
| 6 | *
|
---|
| 7 | * HeuristicLab is free software: you can redistribute it and/or modify
|
---|
| 8 | * it under the terms of the GNU General Public License as published by
|
---|
| 9 | * the Free Software Foundation, either version 3 of the License, or
|
---|
| 10 | * (at your option) any later version.
|
---|
| 11 | *
|
---|
| 12 | * HeuristicLab is distributed in the hope that it will be useful,
|
---|
| 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
| 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
---|
| 15 | * GNU General Public License for more details.
|
---|
| 16 | *
|
---|
| 17 | * You should have received a copy of the GNU General Public License
|
---|
| 18 | * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
|
---|
| 19 | */
|
---|
| 20 | #endregion
|
---|
| 21 |
|
---|
| 22 | using System;
|
---|
| 23 | using System.Collections.Generic;
|
---|
| 24 | using System.IO;
|
---|
| 25 |
|
---|
| 26 | namespace HeuristicLab.Problems.VehicleRouting {
|
---|
| 27 | class SolutionParser {
|
---|
| 28 | private string file;
|
---|
| 29 |
|
---|
| 30 | private List<List<int>> routes;
|
---|
| 31 |
|
---|
| 32 | public List<List<int>> Routes {
|
---|
| 33 | get {
|
---|
| 34 | return routes;
|
---|
| 35 | }
|
---|
| 36 | }
|
---|
| 37 |
|
---|
| 38 | public SolutionParser(string file) {
|
---|
| 39 | this.file = file;
|
---|
| 40 | this.routes = new List<List<int>>();
|
---|
| 41 | }
|
---|
| 42 |
|
---|
| 43 | public void Parse() {
|
---|
| 44 | this.routes.Clear();
|
---|
| 45 | using (StreamReader reader = new StreamReader(file)) {
|
---|
| 46 | String line;
|
---|
| 47 | while ((line = reader.ReadLine()) != null) {
|
---|
| 48 | string[] token = line.Split(new string[] { " " }, StringSplitOptions.RemoveEmptyEntries);
|
---|
| 49 |
|
---|
| 50 | if (token.Length > 2) {
|
---|
| 51 | List<int> route = new List<int>();
|
---|
| 52 |
|
---|
| 53 | for (int i = 2; i < token.Length; i++) {
|
---|
| 54 | route.Add(int.Parse(token[i]));
|
---|
| 55 | }
|
---|
| 56 |
|
---|
| 57 | routes.Add(route);
|
---|
| 58 | }
|
---|
| 59 | }
|
---|
| 60 | }
|
---|
| 61 | }
|
---|
| 62 | }
|
---|
| 63 | }
|
---|