Advertisement
Guest User

Untitled

a guest
Jun 25th, 2017
61
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.99 KB | None | 0 0
  1. package relayrtest;
  2.  
  3.  
  4. import java.util.ArrayList;
  5. import javax.json.*;
  6. import javax.swing.Timer;
  7.  
  8.  
  9.  
  10. public class LocationOptimizer{
  11.  
  12. static private InputFileManager inputFile;
  13. static private InputInformation inputInfo;
  14. static private OutputInformation outputInfo;
  15. static private OutputFileManager outputFile;
  16.  
  17. public static void main ( String[] argumments){
  18. long a=System.currentTimeMillis();
  19.  
  20. if (argumments.length==0 )
  21. System.exit(0);
  22.  
  23.  
  24. inputFile = new InputFileManager(argumments[0]);
  25.  
  26.  
  27. inputInfo = new InputInformation(inputFile.getJsonObject());
  28.  
  29.  
  30.  
  31. outputInfo=FindUnnecessaryFireBrigades( a);
  32. outputFile = new OutputFileManager(outputInfo);
  33.  
  34.  
  35.  
  36. }
  37.  
  38.  
  39.  
  40.  
  41.  
  42.  
  43. static public OutputInformation FindUnnecessaryFireBrigades(long a){
  44.  
  45. DjikstraAlgorithm djikstraSearch = new DjikstraAlgorithm(inputInfo.getCities(),
  46. inputInfo.getGraphVerticles());
  47. Optimizer opti = new Optimizer(djikstraSearch,inputInfo);
  48. ArrayList<String> cities= opti.optimizeGraph();
  49. final ArrayList<String> end=cities;
  50.  
  51.  
  52. Timer t = new Timer(inputInfo.getTimeout(),event->{
  53.  
  54. outputInfo = new OutputInformation(end);
  55. outputFile = new OutputFileManager(outputInfo);
  56. System.exit(0);
  57. });
  58. t.start();
  59.  
  60.  
  61. ArrayList<String> checkCities=new ArrayList();
  62. while(!cities.equals(checkCities))
  63. {
  64.  
  65. cities=checkCities;
  66. DjikstraAlgorithm djikstraSearchcheck=new DjikstraAlgorithm(inputInfo.getCities(),
  67. inputInfo.getGraphVerticles());
  68. Optimizer opti2 = new Optimizer(djikstraSearchcheck,inputInfo);
  69. checkCities=opti2.optimizeGraph();
  70.  
  71. }
  72.  
  73. return new OutputInformation(cities);
  74.  
  75. }
  76.  
  77. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement