A = new Node();
B = new Node();
C = new Node();
D = new Node();
E = new Node();
F = new Node();

A.addPath(B, 6);
A.addPath(C, 2);
B.addPath(F, 1);
C.addPath(D, 2);
C.addPath(E, 6);
D.addPath(B, 3);
D.addPath(F, 4);
E.addPath(D, 3);
E.addPath(F, 1);

A.getOptimalPathTo(F);