-
Notifications
You must be signed in to change notification settings - Fork 275
Expand file tree
/
Copy pathInit.java
More file actions
77 lines (68 loc) · 3.37 KB
/
Copy pathInit.java
File metadata and controls
77 lines (68 loc) · 3.37 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
package subway.domain;
import org.jgrapht.alg.shortestpath.DijkstraShortestPath;
import org.jgrapht.graph.DefaultWeightedEdge;
import org.jgrapht.graph.WeightedMultigraph;
public class Init {
public static DijkstraShortestPath dijkstraDistance;
public static DijkstraShortestPath dijkstraTime;
public static void initialize() {
initializeStation();
initializeLine();
initializeTimeGraph();
dijkstraDistance = initializeDistanceGraph();
dijkstraTime = initializeTimeGraph();
}
public static void initializeStation() {
for (String name : Constants.STATIONS)
StationRepository.addStation(new Station(name));
}
public static void initializeLine() {
Line line2 = new Line(Constants.LINE_2);
LineRepository.addLine(line2, Constants.LINE_2_STATIONS);
Line line3 = new Line(Constants.LINE_3);
LineRepository.addLine(line3, Constants.LINE_3_STATIONS);
Line lineSinbundang = new Line(Constants.LINE_SINBUNDANG);
LineRepository.addLine(lineSinbundang, Constants.LINE_SINBUNDANG_STATIONS);
}
public static DijkstraShortestPath initializeDistanceGraph() {
WeightedMultigraph<String, DefaultWeightedEdge> graph = initializeGraph();
int edges = 0;
for (Line line : LineRepository.lines())
edges += line.getSize() - 1;
for (int i = 0; i < edges; i++) {
graph.setEdgeWeight(graph.addEdge("교대역", "강남역"), 2);
graph.setEdgeWeight(graph.addEdge("강남역", "역삼역"), 2);
graph.setEdgeWeight(graph.addEdge("교대역", "남부터미널역"), 3);
graph.setEdgeWeight(graph.addEdge("남부터미널역", "양재역"), 6);
graph.setEdgeWeight(graph.addEdge("양재역", "매봉역"), 1);
graph.setEdgeWeight(graph.addEdge("강남역", "양재역"), 2);
graph.setEdgeWeight(graph.addEdge("양재역", "양재시민의숲역"), 10);
}
DijkstraShortestPath dijkstraDistance = new DijkstraShortestPath(graph);
return dijkstraDistance;
}
public static DijkstraShortestPath initializeTimeGraph() {
WeightedMultigraph<String, DefaultWeightedEdge> graph = initializeGraph();
int edges = 0;
for (Line line : LineRepository.lines())
edges += line.getSize() - 1;
for (int i = 0; i < edges; i++) {
graph.setEdgeWeight(graph.addEdge("교대역", "강남역"), 3);
graph.setEdgeWeight(graph.addEdge("강남역", "역삼역"), 3);
graph.setEdgeWeight(graph.addEdge("교대역", "남부터미널역"), 2);
graph.setEdgeWeight(graph.addEdge("남부터미널역", "양재역"), 5);
graph.setEdgeWeight(graph.addEdge("양재역", "매봉역"), 1);
graph.setEdgeWeight(graph.addEdge("강남역", "양재역"), 8);
graph.setEdgeWeight(graph.addEdge("양재역", "양재시민의숲역"), 3);
}
DijkstraShortestPath dijkstraTime = new DijkstraShortestPath(graph);
return dijkstraTime;
}
public static WeightedMultigraph<String, DefaultWeightedEdge> initializeGraph() {
WeightedMultigraph<String, DefaultWeightedEdge> graph
= new WeightedMultigraph(DefaultWeightedEdge.class);
for (String name : Constants.STATIONS)
graph.addVertex(name);
return graph;
}
}