package test; import java.util.ArrayList; import java.util.Arrays; import java.util.List; import Graph.Edge; import Graph.Graph; import Graph.Vertex; public class GraphTestData { public static final Vertex VERTEX_S = new Vertex("S", Integer.MAX_VALUE, null); public static final Vertex VERTEX_A = new Vertex("A", Integer.MAX_VALUE, null); public static final Vertex VERTEX_B = new Vertex("B", Integer.MAX_VALUE, null); public static final Vertex VERTEX_C = new Vertex("C", Integer.MAX_VALUE, null); public static final Vertex VERTEX_D = new Vertex("D", Integer.MAX_VALUE, null); public static final Vertex VERTEX_E = new Vertex("E", Integer.MAX_VALUE, null); public static final Vertex VERTEX_F = new Vertex("F", Integer.MAX_VALUE, null); public static final Vertex VERTEX_H = new Vertex("H", Integer.MAX_VALUE, null); public static final Vertex VERTEX_G = new Vertex("G", Integer.MAX_VALUE, null); public static final List VERTEXES = new ArrayList<>( Arrays.asList(VERTEX_S, VERTEX_A, VERTEX_B, VERTEX_C, VERTEX_D, VERTEX_E, VERTEX_F, VERTEX_H, VERTEX_G)); public static final Edge EDGE_SA = new Edge(VERTEX_S, VERTEX_A, 3); public static final Edge EDGE_AS = new Edge(VERTEX_A, VERTEX_S, 3); public static final Edge EDGE_SB = new Edge(VERTEX_S, VERTEX_B, 4); public static final Edge EDGE_BS = new Edge(VERTEX_B, VERTEX_S, 4); public static final Edge EDGE_AC = new Edge(VERTEX_A, VERTEX_C, 3); public static final Edge EDGE_CA = new Edge(VERTEX_C, VERTEX_A, 3); public static final Edge EDGE_BC = new Edge(VERTEX_B, VERTEX_C, 1); public static final Edge EDGE_CB = new Edge(VERTEX_C, VERTEX_B, 1); public static final Edge EDGE_AD = new Edge(VERTEX_A, VERTEX_D, 2); public static final Edge EDGE_DA = new Edge(VERTEX_D, VERTEX_A, 2); public static final Edge EDGE_DE = new Edge(VERTEX_D, VERTEX_E, 3); public static final Edge EDGE_ED = new Edge(VERTEX_E, VERTEX_D, 3); public static final Edge EDGE_CE = new Edge(VERTEX_C, VERTEX_E, 2); public static final Edge EDGE_EC = new Edge(VERTEX_E, VERTEX_C, 2); public static final Edge EDGE_CF = new Edge(VERTEX_C, VERTEX_F, 1); public static final Edge EDGE_FC = new Edge(VERTEX_F, VERTEX_C, 1); public static final Edge EDGE_EF = new Edge(VERTEX_E, VERTEX_F, 8); public static final Edge EDGE_FE = new Edge(VERTEX_F, VERTEX_E, 8); public static final Edge EDGE_DH = new Edge(VERTEX_D, VERTEX_H, 5); public static final Edge EDGE_HD = new Edge(VERTEX_H, VERTEX_D, 5); public static final Edge EDGE_EH = new Edge(VERTEX_E, VERTEX_H, 2); public static final Edge EDGE_HE = new Edge(VERTEX_H, VERTEX_E, 2); public static final Edge EDGE_FH = new Edge(VERTEX_F, VERTEX_H, 6); public static final Edge EDGE_HF = new Edge(VERTEX_H, VERTEX_F, 6); public static final Edge EDGE_FG = new Edge(VERTEX_F, VERTEX_G, 10); public static final Edge EDGE_GF = new Edge(VERTEX_G, VERTEX_F, 10); public static final Edge EDGE_HG = new Edge(VERTEX_H, VERTEX_G, 2); public static final Edge EDGE_GH = new Edge(VERTEX_G, VERTEX_H, 2); public static final List EDGES = new ArrayList<>(Arrays.asList(EDGE_SA, EDGE_AS, EDGE_SB, EDGE_BS, EDGE_AC, EDGE_CA, EDGE_BC, EDGE_CB, EDGE_AD, EDGE_DA, EDGE_DE, EDGE_ED, EDGE_CE, EDGE_EC, EDGE_CF, EDGE_FC, EDGE_EF, EDGE_FE, EDGE_DH, EDGE_HD, EDGE_EH, EDGE_HE, EDGE_FH, EDGE_HF, EDGE_FG, EDGE_GF, EDGE_HG, EDGE_GH)); public static final Graph GRAPH = new Graph(VERTEXES, EDGES); public static final List SOLUTION = new ArrayList<>( Arrays.asList(VERTEX_S, VERTEX_B, VERTEX_C, VERTEX_E, VERTEX_H, VERTEX_G)); }