Changeset 14471 for branches/MemPRAlgorithm/HeuristicLab.Problems.Instances.DIMACS/3.3/Parser.cs

Timestamp:

12/09/16 15:56:22 (7 years ago)

Author:

abeham

Message:

#2701:

• Updated GraphColoringProblem and Problems.Instances
  • Added new fitness function from literature
  • Added DIMACS benchmark instances
• Updated LinearLinkageEncoding
  • Added HammingSimilarityCalculator

Location:

branches/MemPRAlgorithm/HeuristicLab.Problems.Instances.DIMACS

Files:

• . (added)
• 3.3 (added)
• 3.3/Parser.cs (copied) (copied from branches/MemPRAlgorithm/HeuristicLab.Problems.Instances.QAPLIB/3.3/QAPLIBParser.cs) (2 diffs)

branches/MemPRAlgorithm/HeuristicLab.Problems.Instances.DIMACS/3.3/Parser.cs

@@ -21 +21 @@
 
 using System;
+using System.Collections.Generic;
 using System.IO;
 
-namespace HeuristicLab.Problems.Instances.QAPLIB {
-  public class QAPLIBParser {
-    public int Size { get; private set; }
-    public double[,] Distances { get; private set; }
-    public double[,] Weights { get; private set; }
+namespace HeuristicLab.Problems.Instances.DIMACS {
+  public class Parser {
+    public int Nodes { get; private set; }
+    public int Edges { get; private set; }
+    public ICollection<Tuple<int, int>> AdjacencyList { get { return edges; } }
+    private HashSet<Tuple<int, int>> edges;
 
-    public QAPLIBParser() {
+    public Parser() {
       Reset();
     }
 
     public void Reset() {
-      Size = 0;
-      Distances = null;
-      Weights = null;
+      Nodes = 0;
+      Edges = 0;
+      edges = new HashSet<Tuple<int, int>>();
     }
 
@@ -54 +56 @@
     /// <returns>True if the file was successfully read or false otherwise.</returns>
     public void Parse(Stream stream) {
+      char[] delim = new char[] { ' ', '\t' };
       var reader = new StreamReader(stream);
-      Size = int.Parse(reader.ReadLine());
-      Distances = new double[Size, Size];
-      Weights = new double[Size, Size];
-      char[] delim = new char[] { ' ', '\t' };
+      var line = reader.ReadLine().Trim();
+      // skip comments
+      while (line.StartsWith("c", StringComparison.InvariantCultureIgnoreCase)) line = reader.ReadLine().Trim();
 
-      Weights = ParseMatrix(reader, delim);
-      Distances = ParseMatrix(reader, delim);
-    }
-
-    private double[,] ParseMatrix(StreamReader reader, char[] delim) {
-      int read = 0, k = 0;
-      double[,] result = new double[Size, Size];
-      while (k < Size) {
-        if (reader.EndOfStream) throw new InvalidDataException("Reached end of stream while reading second matrix.");
-        string valLine = reader.ReadLine();
-        while (String.IsNullOrWhiteSpace(valLine)) valLine = reader.ReadLine();
-        string[] vals = valLine.Split(delim, StringSplitOptions.RemoveEmptyEntries);
-        foreach (string val in vals) {
-          result[k, read++] = double.Parse(val);
-          if (read == Size) {
-            read = 0;
-            k++;
-          }
-        }
-      }
-      return result;
+      // p edge NODES EDGES
+      var split = line.Split(delim, StringSplitOptions.RemoveEmptyEntries);
+      Nodes = int.Parse(split[2]);
+      do {
+        line = reader.ReadLine();
+        if (string.IsNullOrEmpty(line)) break;
+        // e XX YY
+        split = line.Split(delim, StringSplitOptions.RemoveEmptyEntries);
+        var src = int.Parse(split[1]);
+        var tgt = int.Parse(split[2]);
+        Tuple<int, int> e = null;
+        if (src < tgt) e = Tuple.Create(src, tgt);
+        else if (src > tgt) e = Tuple.Create(tgt, src);
+        else continue; // src == tgt
+        if (edges.Add(e)) Edges++;
+      } while (!reader.EndOfStream);
     }
   }