ProjectFiles/crashGraph.java at master · 2XB3GreenLight/ProjectFiles · GitHub

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
78
79
80
81
82
83
84
85
86
87
88
89
90
package cas2xb3.greenlight;

import java.io.IOException;

public class crashGraph {

	private static double[][] crashArr;

	// Calculates the severity of the inputed crash point
	public static double crashSeverity(double[] crashPoint) {

		double indSeverity = 1 / (2.0 * crashPoint[3]);
		double weather = 1 / (5.0 * crashPoint[4]);
		double paved = 0.9 + (crashPoint[5] / 10.0);

		double totalSeverity = indSeverity + weather + paved;
		return totalSeverity;
	}

	// The 4 crashes adjacent to the inputed crash
	public static int[] NSWECrashes(int crashIndex) {
		crashArr = Data.getArray();
		int[] NSWEcrash = new int[4];
		NSWEcrash[0] = 0;
		NSWEcrash[1] = 0;
		NSWEcrash[2] = 0;
		NSWEcrash[3] = 0;
		double distN = 100.0;
		double distS = 100.0;
		double distW = 100.0;
		double distE = 100.0;
		for (int i = 0; i < Data.getCollisionCount(); i++) {
			double otherLat = crashArr[i][1];
			double thisLat = crashArr[crashIndex][1];
			double otherLong = crashArr[i][2];
			double thisLong = crashArr[crashIndex][2];
			if (otherLat > thisLat && (otherLat - thisLat) <= distN && (otherLong - thisLong < 0.01)
					&& (thisLong - otherLong < 0.01)) {
				distN = otherLat - thisLat;
				NSWEcrash[0] = i;
			}
			if (otherLat < thisLat && (thisLat - otherLat) <= distS && (otherLong - thisLong < 0.01)
					&& (thisLong - otherLong < 0.01)) {
				distS = thisLat - otherLat;
				NSWEcrash[1] = i;
			}
			if (otherLong > thisLong && (otherLong - thisLong) <= distW && (otherLat - thisLat < 0.01)
					&& (thisLat - otherLat < 0.01)) {
				distW = otherLong - thisLong;
				NSWEcrash[2] = i;
			}
			if (otherLong < thisLong && (thisLong - otherLong) <= distE && (otherLat - thisLat < 0.01)
					&& (thisLat - otherLat < 0.01)) {
				distE = thisLong - otherLong;
				NSWEcrash[3] = i;
			}
		}

		return NSWEcrash;
	}

	public static EdgeWeightedDigraph fullGraph() throws IOException {

		EdgeWeightedDigraph G = new EdgeWeightedDigraph(Data.getCollisionCount());

		crashArr = Data.getArray();

		for (int i = 0; i < 10; i++) {

			int[] NSWEcrash = NSWECrashes(i);
			int n = NSWEcrash[0];
			int s = NSWEcrash[1];
			int w = NSWEcrash[2];
			int e = NSWEcrash[3];
			DirectedEdge northC = new DirectedEdge(i, n, crashSeverity(crashArr[i]) + crashSeverity(crashArr[n]));
			G.addEdge(northC);
			DirectedEdge southC = new DirectedEdge(i, s, crashSeverity(crashArr[i]) + crashSeverity(crashArr[s]));
			G.addEdge(southC);
			DirectedEdge westC = new DirectedEdge(i, w, crashSeverity(crashArr[i]) + crashSeverity(crashArr[w]));
			G.addEdge(westC);
			DirectedEdge eastC = new DirectedEdge(i, e, crashSeverity(crashArr[i]) + crashSeverity(crashArr[e]));
			G.addEdge(eastC);

		}

		return G;

	}

}