GraphSearch/Neighbour.java at master · prabhaks/GraphSearch · 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
public class Neighbour {
	int nodeIndex;
	String name;
	int weight;
	Neighbour next;

	public Neighbour(int nodeIndex, String name, int weight, Neighbour next) {
		this.nodeIndex = nodeIndex;
		this.name = name;
		this.weight = weight;
		this.next = next;
	}

	public Neighbour(int nodeIndex, String name, int weight) {
		this(nodeIndex, name, weight, null);
	}

	public int getNodeIndex() {
		return nodeIndex;
	}

	public void setNodeIndex(int nodeIndex) {
		this.nodeIndex = nodeIndex;
	}

	public String getName() {
		return name;
	}

	public void setName(String name) {
		this.name = name;
	}

	public Neighbour getNext() {
		return next;
	}

	public void setNext(Neighbour next) {
		this.next = next;
	}

	public int getWeight() {
		return weight;
	}

	public void setWeight(int weight) {
		this.weight = weight;
	}
}