sp

Author: gdhucoder

Ch_4_4/TestDijkstraSP.java

@@ -10,6 +10,7 @@ public class TestDijkstraSP {
 
   public static void main(String[] args) {
     _EdgeWeightedDigraph G = new _EdgeWeightedDigraph(new In("algdata/tinyEWD.txt"));
+    StdOut.println(G);
     int s = 0;
     _DijkstraSP sp = new _DijkstraSP(G, s);
     for (int t = 0; t < G.V(); t++) {

Ch_4_4/_EdgeWeightedDigraph.java

@@ -59,4 +59,17 @@ public Iterable<_DirectedEdge> edges() {
     }
     return bag;
   }
+
+  @Override
+  public String toString() {
+    StringBuilder s = new StringBuilder(V + " vertices, " + E + " edges\n");
+    for (int v = 0; v < V; v++) {
+      s.append(v).append(": ");
+      for (_DirectedEdge e : adj(v)) {
+        s.append(e.toString()).append("  ");
+      }
+      s.append("\n");
+    }
+    return s.toString();
+  }
 }

Ch_4_4/note.md

@@ -13,9 +13,11 @@ edge relaxation
 if the length to w is larger than the sum of length to `v` plus weight of `v` to `w`,
 then `relax`: change `distTo[w] = distTo[v] + e.weight()` and `edgeTo[w] = e`.
 
+![2020-05-12_003.jpg](https://gitee.com/gdhu/testtingop/raw/master/2020-05-12_003.jpg)
 
+![2020-05-12_004.jpg](https://gitee.com/gdhu/testtingop/raw/master/2020-05-12_004.jpg)
 
-
+![2020-05-12_006.jpg](https://gitee.com/gdhu/testtingop/raw/master/2020-05-12_006.jpg)