Changeset 8509 for branches/RoutePlanning/HeuristicLab.Problems.RoutePlanning/3.3/Graph

Timestamp:

08/20/12 17:32:19 (12 years ago)

Author:

spimming

Message:

#1894:
Dijkstra: get node with a specific rank
graph interface extended: get vertices
fixed bug in ReadData method
methods to perform routing algorithm benchmark added to test program

Location:

branches/RoutePlanning/HeuristicLab.Problems.RoutePlanning/3.3/Graph

Files:

• Graph.cs (modified) (1 diff)
• IGraph.cs (modified) (1 diff)

branches/RoutePlanning/HeuristicLab.Problems.RoutePlanning/3.3/Graph/Graph.cs

@@ -25 +25 @@
       vertices.TryGetValue(id, out vertex);
       return vertex;
+    }
+
+    public List<Vertex> GetVertices() {
+      return new List<Vertex>(vertices.Values);
     }
 

branches/RoutePlanning/HeuristicLab.Problems.RoutePlanning/3.3/Graph/IGraph.cs

@@ -5 +5 @@
     void AddVertex(Vertex vertex);
     Vertex GetVertex(long id);
+    List<Vertex> GetVertices();
     void AddEdge(long startId, long endId);
     void AddEdge(Edge<Vertex> edge);