graph:
  toString={V={}, E={}}
  directed=true, weighted=true, isEmpty=true
vertices=[], vertexCount=0
edges=[], edgeCount=0
paths:

adding vertices ...
graph:
  toString={V={D, E, F, G, A, B, C}, E={}}
  directed=true, weighted=true, isEmpty=false
vertices=[D, E, F, G, A, B, C], vertexCount=7
  vertex D: degree=0, inDegree=0, outDegree=0, containsVertex(D)=true, neighbors=[]
  vertex E: degree=0, inDegree=0, outDegree=0, containsVertex(E)=true, neighbors=[]
  vertex F: degree=0, inDegree=0, outDegree=0, containsVertex(F)=true, neighbors=[]
  vertex G: degree=0, inDegree=0, outDegree=0, containsVertex(G)=true, neighbors=[]
  vertex A: degree=0, inDegree=0, outDegree=0, containsVertex(A)=true, neighbors=[]
  vertex B: degree=0, inDegree=0, outDegree=0, containsVertex(B)=true, neighbors=[]
  vertex C: degree=0, inDegree=0, outDegree=0, containsVertex(C)=true, neighbors=[]
edges=[], edgeCount=0
paths:
  (D,D) isReachable=true, shortest=[D], minWeight=[D] (cost=0)
  (D,E) isReachable=false, shortest=null, minWeight=null
  (D,F) isReachable=false, shortest=null, minWeight=null
  (D,G) isReachable=false, shortest=null, minWeight=null
  (D,A) isReachable=false, shortest=null, minWeight=null
  (D,B) isReachable=false, shortest=null, minWeight=null
  (D,C) isReachable=false, shortest=null, minWeight=null
  (E,D) isReachable=false, shortest=null, minWeight=null
  (E,E) isReachable=true, shortest=[E], minWeight=[E] (cost=0)
  (E,F) isReachable=false, shortest=null, minWeight=null
  (E,G) isReachable=false, shortest=null, minWeight=null
  (E,A) isReachable=false, shortest=null, minWeight=null
  (E,B) isReachable=false, shortest=null, minWeight=null
  (E,C) isReachable=false, shortest=null, minWeight=null
  (F,D) isReachable=false, shortest=null, minWeight=null
  (F,E) isReachable=false, shortest=null, minWeight=null
  (F,F) isReachable=true, shortest=[F], minWeight=[F] (cost=0)
  (F,G) isReachable=false, shortest=null, minWeight=null
  (F,A) isReachable=false, shortest=null, minWeight=null
  (F,B) isReachable=false, shortest=null, minWeight=null
  (F,C) isReachable=false, shortest=null, minWeight=null
  (G,D) isReachable=false, shortest=null, minWeight=null
  (G,E) isReachable=false, shortest=null, minWeight=null
  (G,F) isReachable=false, shortest=null, minWeight=null
  (G,G) isReachable=true, shortest=[G], minWeight=[G] (cost=0)
  (G,A) isReachable=false, shortest=null, minWeight=null
  (G,B) isReachable=false, shortest=null, minWeight=null
  (G,C) isReachable=false, shortest=null, minWeight=null
  (A,D) isReachable=false, shortest=null, minWeight=null
  (A,E) isReachable=false, shortest=null, minWeight=null
  (A,F) isReachable=false, shortest=null, minWeight=null
  (A,G) isReachable=false, shortest=null, minWeight=null
  (A,A) isReachable=true, shortest=[A], minWeight=[A] (cost=0)
  (A,B) isReachable=false, shortest=null, minWeight=null
  (A,C) isReachable=false, shortest=null, minWeight=null
  (B,D) isReachable=false, shortest=null, minWeight=null
  (B,E) isReachable=false, shortest=null, minWeight=null
  (B,F) isReachable=false, shortest=null, minWeight=null
  (B,G) isReachable=false, shortest=null, minWeight=null
  (B,A) isReachable=false, shortest=null, minWeight=null
  (B,B) isReachable=true, shortest=[B], minWeight=[B] (cost=0)
  (B,C) isReachable=false, shortest=null, minWeight=null
  (C,D) isReachable=false, shortest=null, minWeight=null
  (C,E) isReachable=false, shortest=null, minWeight=null
  (C,F) isReachable=false, shortest=null, minWeight=null
  (C,G) isReachable=false, shortest=null, minWeight=null
  (C,A) isReachable=false, shortest=null, minWeight=null
  (C,B) isReachable=false, shortest=null, minWeight=null
  (C,C) isReachable=true, shortest=[C], minWeight=[C] (cost=0)

adding edges ...
graph:
  toString={V={D, E, F, G, A, B, C}, E={(D,E,weight=2), (D,F,weight=8), (D,G,weight=4), (D,C,weight=2), (E,G,weight=6), (G,F,weight=1), (A,D,weight=1), (A,B,weight=2), (B,D,weight=3), (B,E,weight=10), (C,F,weight=5), (C,A,weight=4)}}
  directed=true, weighted=true, isEmpty=false
vertices=[D, E, F, G, A, B, C], vertexCount=7
  vertex D: degree=4, inDegree=2, outDegree=4, containsVertex(D)=true, neighbors=[E, F, G, C]
  vertex E: degree=1, inDegree=2, outDegree=1, containsVertex(E)=true, neighbors=[G]
  vertex F: degree=0, inDegree=3, outDegree=0, containsVertex(F)=true, neighbors=[]
  vertex G: degree=1, inDegree=2, outDegree=1, containsVertex(G)=true, neighbors=[F]
  vertex A: degree=2, inDegree=1, outDegree=2, containsVertex(A)=true, neighbors=[D, B]
  vertex B: degree=2, inDegree=1, outDegree=2, containsVertex(B)=true, neighbors=[D, E]
  vertex C: degree=2, inDegree=1, outDegree=2, containsVertex(C)=true, neighbors=[F, A]
edges=[null, null, null, null, null, null, null, null, null, null, null, null], edgeCount=12
  edge null: containsEdge(null)=true
  edge null: containsEdge(null)=true
  edge null: containsEdge(null)=true
  edge null: containsEdge(null)=true
  edge null: containsEdge(null)=true
  edge null: containsEdge(null)=true
  edge null: containsEdge(null)=true
  edge null: containsEdge(null)=true
  edge null: containsEdge(null)=true
  edge null: containsEdge(null)=true
  edge null: containsEdge(null)=true
  edge null: containsEdge(null)=true
paths:
  (D,D) isReachable=true, shortest=[D], minWeight=[D] (cost=0)
  (D,E) isReachable=true, shortest=[D, E], minWeight=[D, E] (cost=2)
  (D,F) isReachable=true, shortest=[D, F], minWeight=[D, G, F] (cost=5)
  (D,G) isReachable=true, shortest=[D, G], minWeight=[D, G] (cost=4)
  (D,A) isReachable=true, shortest=[D, C, A], minWeight=[D, C, A] (cost=6)
  (D,B) isReachable=true, shortest=[D, C, A, B], minWeight=[D, C, A, B] (cost=8)
  (D,C) isReachable=true, shortest=[D, C], minWeight=[D, C] (cost=2)
  (E,D) isReachable=false, shortest=null, minWeight=null
  (E,E) isReachable=true, shortest=[E], minWeight=[E] (cost=0)
  (E,F) isReachable=true, shortest=[E, G, F], minWeight=[E, G, F] (cost=7)
  (E,G) isReachable=true, shortest=[E, G], minWeight=[E, G] (cost=6)
  (E,A) isReachable=false, shortest=null, minWeight=null
  (E,B) isReachable=false, shortest=null, minWeight=null
  (E,C) isReachable=false, shortest=null, minWeight=null
  (F,D) isReachable=false, shortest=null, minWeight=null
  (F,E) isReachable=false, shortest=null, minWeight=null
  (F,F) isReachable=true, shortest=[F], minWeight=[F] (cost=0)
  (F,G) isReachable=false, shortest=null, minWeight=null
  (F,A) isReachable=false, shortest=null, minWeight=null
  (F,B) isReachable=false, shortest=null, minWeight=null
  (F,C) isReachable=false, shortest=null, minWeight=null
  (G,D) isReachable=false, shortest=null, minWeight=null
  (G,E) isReachable=false, shortest=null, minWeight=null
  (G,F) isReachable=true, shortest=[G, F], minWeight=[G, F] (cost=1)
  (G,G) isReachable=true, shortest=[G], minWeight=[G] (cost=0)
  (G,A) isReachable=false, shortest=null, minWeight=null
  (G,B) isReachable=false, shortest=null, minWeight=null
  (G,C) isReachable=false, shortest=null, minWeight=null
  (A,D) isReachable=true, shortest=[A, D], minWeight=[A, D] (cost=1)
  (A,E) isReachable=true, shortest=[A, D, E], minWeight=[A, D, E] (cost=3)
  (A,F) isReachable=true, shortest=[A, D, F], minWeight=[A, D, G, F] (cost=6)
  (A,G) isReachable=true, shortest=[A, D, G], minWeight=[A, D, G] (cost=5)
  (A,A) isReachable=true, shortest=[A], minWeight=[A] (cost=0)
  (A,B) isReachable=true, shortest=[A, B], minWeight=[A, B] (cost=2)
  (A,C) isReachable=true, shortest=[A, D, C], minWeight=[A, D, C] (cost=3)
  (B,D) isReachable=true, shortest=[B, D], minWeight=[B, D] (cost=3)
  (B,E) isReachable=true, shortest=[B, E], minWeight=[B, D, E] (cost=5)
  (B,F) isReachable=true, shortest=[B, D, F], minWeight=[B, D, G, F] (cost=8)
  (B,G) isReachable=true, shortest=[B, D, G], minWeight=[B, D, G] (cost=7)
  (B,A) isReachable=true, shortest=[B, D, C, A], minWeight=[B, D, C, A] (cost=9)
  (B,B) isReachable=true, shortest=[B], minWeight=[B] (cost=0)
  (B,C) isReachable=true, shortest=[B, D, C], minWeight=[B, D, C] (cost=5)
  (C,D) isReachable=true, shortest=[C, A, D], minWeight=[C, A, D] (cost=5)
  (C,E) isReachable=true, shortest=[C, A, D, E], minWeight=[C, A, D, E] (cost=7)
  (C,F) isReachable=true, shortest=[C, F], minWeight=[C, F] (cost=5)
  (C,G) isReachable=true, shortest=[C, A, D, G], minWeight=[C, A, D, G] (cost=9)
  (C,A) isReachable=true, shortest=[C, A], minWeight=[C, A] (cost=4)
  (C,B) isReachable=true, shortest=[C, A, B], minWeight=[C, A, B] (cost=6)
  (C,C) isReachable=true, shortest=[C], minWeight=[C] (cost=0)