-
Notifications
You must be signed in to change notification settings - Fork 1
/
RoutingTable.java
67 lines (60 loc) · 1.94 KB
/
RoutingTable.java
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
/*
* To change this license header, choose License Headers in Project Properties.
* To change this template file, choose Tools | Templates
* and open the template in the editor.
*/
import java.util.ArrayList;
/**
*
* @author asus
*/
public class RoutingTable {
private int m_nNodeId;
private Graph m_Graph;
public RoutingTable(int x_nNodeId)
{
m_nNodeId = x_nNodeId;
m_Graph = new Graph();
for(int i = 0 ; i < Controller.MAX_NODE_COUNT ;i++)
m_Graph.addVertex(String.valueOf(i));
}
public void AddLink(int x_nId1,int x_nId2)
{
String strId1 = String.valueOf(x_nId1);
String strId2 = String.valueOf(x_nId2);
m_Graph.addEdge(strId1, strId2);
}
public ArrayList<String> getPathToDestination(int x_nDestId)
{
AllPaths ap = new AllPaths(m_Graph, String.valueOf(m_nNodeId), String.valueOf(x_nDestId));
return ap.getPaths();
}
public void ClearTable()
{
m_Graph = new Graph();
for(int i = 0 ; i < Controller.MAX_NODE_COUNT ;i++)
m_Graph.addVertex(String.valueOf(i));
}
public int getNextHopToThisDestination(int x_nDest)
{
ArrayList<String> lst = getPathToDestination(x_nDest);
int nNextHop = -1;
int nMaxHopCount = 99;
for(int i = 0 ; i < lst.size() ; i++)
{
String[] arrStr = lst.get(i).split(",");
if(arrStr.length > 1)
{
if(arrStr[0].equals(String.valueOf(m_nNodeId)))
{
if(arrStr.length < nMaxHopCount) // Try to find the shortest path
{
nMaxHopCount = arrStr.length;
nNextHop = Integer.parseInt(arrStr[1].trim());
}
}
}
}
return nNextHop;
}
}