loic/routage-optimiste
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Test

Browse source
This commit is contained in:
Loic Guegan 2016-03-29 11:42:05 +02:00
parent 04c6618a68
commit 996c9fc346
2 changed files with 8 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

8
main/Main.java
View file

@ -20,14 +20,14 @@ public class Main {
public static void main(String[] args) {
Grid g=new Grid(Grid.Protocol.AODV);
Grid g=new Grid(Grid.Protocol.DSDV);
// Build Graph for graphstream
MyGraph gr=new MyGraph("Routage Oportuniste", g);
gr.display();
gr.update();
/*
//gr.update();
// Update Graph
while(true){
@ -40,7 +40,7 @@ public class Main {
g.buildEdgeWithRandomWeigth();
System.out.println("Update !");
gr.update();
}*/
}
}
}

8
structure/Grid.java
View file

@ -37,7 +37,8 @@ public class Grid {
this.buildEdgeWithRandomWeigth();
//Build fixed link
this.buildPath();
this.protocol=protocol;
@ -48,7 +49,7 @@ public class Grid {
case DSDV:
case CUSTOM:
HashMap<Integer,Integer> currentBestLink=new HashMap<>();
for(int i=0;i<100000;i++){
for(int i=0;i<1000;i++){
int current=this.getBestLinkIndex();
if(currentBestLink.containsKey(current)){
currentBestLink.put(current, currentBestLink.get(current)+1);
@ -87,8 +88,7 @@ public class Grid {
public void buildEdgeWithRandomWeigth(){
//Build fixed link
this.buildPath();