-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathgraph.java
More file actions
executable file
·116 lines (103 loc) · 2.24 KB
/
Copy pathgraph.java
File metadata and controls
executable file
·116 lines (103 loc) · 2.24 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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
import java.util.*;
class Graph {
void main() {
read();
printMatrix();
floyd();
}
void floyd() {
for (int t = 0; t < vertex; t++) {
for (int u = 0; u < vertex; u++) {
for (int v = 0; v < vertex; v++) {
matrix[u][v] = Math.min(matrix[u][v],
matrix[u][t] + matrix[t][v]);
}
}
}
int h = getIndex("HuaHin");
int k = getIndex("Korat");
System.out.println("Cost = " + matrix[h][k]);
}
void common(String s, String t) {
int i = getIndex(s);
int j = getIndex(t);
for (int k = 0; k < vertex; k++) {
if (i != k && j != k) {
if (matrix[i][k] == 1 && matrix[k][j] == 1) {
System.out.println(names[k]);
}
}
}
}
String maxFriend() {
int max = 0;
String name = "";
for (int i = 0; i < vertex; i++) {
int count = 0;
for (int j = 0; j < vertex; j++) {
if (matrix[i][j] == 1) {
count++;
}
}
if (max < count) {
max = count;
name = names[i];
}
}
return name;
}
int INFINITY = 99999;
void read() {
for (int i = 0; i < MAX_VERTEX; i++) {
for (int j = 0; j < MAX_VERTEX; j++) {
matrix[i][j] = INFINITY;
}
}
vertex = 0;
Scanner scanner = new Scanner(System.in);
while (scanner.hasNextLine()) {
String line = scanner.nextLine();
String [] tokens = line.split("\t");
int value = 0;
try { value = Integer.parseInt(tokens[2]); } catch (Exception e) {}
int i = getIndex(tokens[0]);
int j = getIndex(tokens[1]);
matrix[i][j] = value;
matrix[j][i] = value;
matrix[i][i] = 0;
matrix[j][j] = 0;
}
}
int MAX_VERTEX = 1024;
int [][] matrix = new int[MAX_VERTEX][MAX_VERTEX];
String [] names = new String[MAX_VERTEX];
int vertex = 0;
int getIndex(String s) {
for (int i = 0; i < vertex; i++) {
if (s.equals(names[i])) {
return i;
}
}
names[vertex] = s;
vertex++;
return vertex-1;
}
void printMatrix() {
System.out.print("\t");
for (int i = 0; i < vertex; i++) {
System.out.print(names[i] + "\t");
}
System.out.println();
for (int i = 0; i < vertex; i++) {
System.out.print(names[i] + "\t");
for (int j = 0; j < vertex; j++) {
System.out.print(matrix[i][j] + "\t");
}
System.out.println();
}
}
public static void main(String [] args) {
Graph g = new Graph();
g.main();
}
}