|
1 | 1 | package pipelinescript.java;
|
2 | 2 |
|
3 | 3 | import java.util.ArrayList;
|
| 4 | +import java.util.HashMap; |
4 | 5 | import java.util.List;
|
5 |
| - |
6 |
| -public class Graph { |
7 |
| - |
| 6 | +import java.util.Map; |
| 7 | +// node1, node2, weight |
| 8 | +public class Graph extends Table { |
| 9 | + Table graph; |
8 | 10 | private List<Node> nodes;
|
9 |
| - public Graph() { |
10 |
| - nodes = new ArrayList<>(); |
| 11 | + public Graph(int numofEdge) { |
| 12 | + super(numofEdge,3); |
| 13 | + graph = getTable(); |
| 14 | + //nodes = new ArrayList<>(); |
11 | 15 | }
|
12 |
| - |
13 |
| - public Graph(List<Node> node) { |
14 |
| - nodes = node; |
| 16 | + public List<Node> getGraphNode(){ |
| 17 | + List<Node> nodes = new ArrayList<>(); |
| 18 | + String [][]edge = graph.getTableString(); |
| 19 | + int numEdge = edge.length; |
| 20 | + |
| 21 | + for (String[] ed : edge) { |
| 22 | + int n1 = Integer.parseInt(ed[0]); |
| 23 | + int n2 = Integer.parseInt(ed[1]); |
| 24 | + int weig = Integer.parseInt(ed[2]); |
| 25 | + |
| 26 | + if (!nodes.contains(new Node(n1))) { |
| 27 | + nodes.add(new Node(n1)); |
| 28 | + } |
| 29 | + if (!nodes.contains(new Node(n2))){ |
| 30 | + nodes.add(new Node(n2)); |
| 31 | + } |
| 32 | + Node node1 = nodes.get(nodes.indexOf(new Node(n1))); |
| 33 | + Node node2 = nodes.get(nodes.indexOf(new Node(n2))); |
| 34 | + node1.adj.put(node2, weig); |
| 35 | + // INDIRECTED GRAPH, REMOVE THIS LINE TO MAKE IT DIRECTED GRAPH |
| 36 | + node2.adj.put(node1, weig); |
| 37 | + } |
| 38 | + return nodes; |
15 | 39 | }
|
16 |
| - |
17 |
| - |
| 40 | + |
18 | 41 | }
|
19 | 42 | class Node {
|
20 | 43 | String stringData;
|
21 |
| - int intData; |
22 |
| - List<Node> adj; |
| 44 | + int nodeNumber; |
| 45 | + Map<Node, Integer> adj; |
23 | 46 | public Node() {
|
24 |
| - intData = -1; |
25 | 47 | stringData = null;
|
26 |
| - adj = new ArrayList<>(); |
| 48 | + adj = new HashMap<>(); |
27 | 49 | }
|
28 | 50 |
|
29 |
| - public Node(int iData , String sData) { |
30 |
| - intData = iData; |
| 51 | + public Node(int nodeNum) { |
| 52 | + adj = new HashMap<>(); |
| 53 | + this.nodeNumber= nodeNum; |
| 54 | + } |
| 55 | + public Node(int nodeNum , String sData) { |
| 56 | + adj = new HashMap<>(); |
| 57 | + this.nodeNumber= nodeNum; |
31 | 58 | stringData = sData;
|
| 59 | + |
32 | 60 | }
|
33 |
| - |
34 |
| - |
35 |
| - public List<Node> getNeighbor() { |
| 61 | + public Map getNeighbor() { |
36 | 62 | return adj;
|
37 | 63 | }
|
38 | 64 |
|
| 65 | + @Override |
| 66 | + public boolean equals(Object o){ |
| 67 | + Node n = (Node)o; |
| 68 | + return n.nodeNumber == this.nodeNumber ? true:false; |
| 69 | + } |
39 | 70 |
|
40 | 71 | }
|
0 commit comments