用java实现HS和LCR选举算法

[{"title":"（ 16 个子文件 13KB ） 用java实现HS和LCR选举算法","children":[{"title":"DistributedProtocols","children":[{"title":"src","children":[{"title":"HS","children":[{"title":"Message.java <span style='color:#111;'> 621B </span>","children":null,"spread":false},{"title":"HS.java <span style='color:#111;'> 8.19KB </span>","children":null,"spread":false},{"title":"Process.java <span style='color:#111;'> 8.72KB </span>","children":null,"spread":false},{"title":"ProcessState.java <span style='color:#111;'> 697B </span>","children":null,"spread":false}],"spread":true},{"title":"README.md <span style='color:#111;'> 284B </span>","children":null,"spread":false},{"title":"LCR","children":[{"title":"Process.java <span style='color:#111;'> 3.36KB </span>","children":null,"spread":false},{"title":"LCR.java <span style='color:#111;'> 3.96KB </span>","children":null,"spread":false}],"spread":true}],"spread":true},{"title":".idea","children":[{"title":"misc.xml <span style='color:#111;'> 278B </span>","children":null,"spread":false},{"title":"workspace.xml <span style='color:#111;'> 5.66KB </span>","children":null,"spread":false},{"title":"modules.xml <span style='color:#111;'> 287B </span>","children":null,"spread":false},{"title":"codeStyles","children":[{"title":"Project.xml <span style='color:#111;'> 269B </span>","children":null,"spread":false},{"title":"codeStyleConfig.xml <span style='color:#111;'> 153B </span>","children":null,"spread":false}],"spread":true},{"title":"sbt.xml <span style='color:#111;'> 440B </span>","children":null,"spread":false},{"title":".gitignore <span style='color:#111;'> 184B </span>","children":null,"spread":false}],"spread":true},{"title":"DistributedProtocols.iml <span style='color:#111;'> 509B </span>","children":null,"spread":false},{"title":"data","children":[{"title":"data.txt <span style='color:#111;'> 17B </span>","children":null,"spread":false}],"spread":true}],"spread":true}],"spread":true}]