1. 26df2f2 Added short-circuit to Dijkstra when there are no edges. by Thomas Vachuska · 10 years ago
  2. 5c94727 javadoc fixes by Yuta HIGUCHI · 10 years ago
  3. 6c415d1 fix some formats in the k-shortestpathSearch by weibit · 10 years ago
  4. 9a3631b K-shorest path algorithm to support UC1, it can be used by other modules as well. by weibit · 10 years ago
  5. 7b652ad Fixed some javadoc warning/errors. by Thomas Vachuska · 10 years ago
  6. 4f1a60c Revised copyright message. by Thomas Vachuska · 10 years ago
  7. 4353a5a Fixed graph relaxEdge to properly deal with Double.MIN_VALUE. by Thomas Vachuska · 10 years ago
  8. 24c849c Added copyrights to the utils code by Thomas Vachuska · 10 years ago
  9. 4d69087 Doh! Forgot to actually check for negative cycles in relaxEdge. by Thomas Vachuska · 10 years ago
  10. fc9a4ff Fixed equals methods for better efficiency. Cleaned up ClusterService API. by tom · 10 years ago
  11. 82e7257 Converted all package.html files to package-info.java for easier package documentation. by tom · 10 years ago
  12. 0633d68 Added Tarjan SCC computation algorithm and associated tests. by tom · 10 years ago
  13. cbff939 Working on simple topology manager and provider by tom · 10 years ago
  14. eadbb46 Added simple link manager implementation. by tom · 10 years ago
  15. 41c3fcc Added iterative DFS algorithm. by tom · 10 years ago
  16. 2e1f071 Added bellman-ford implementation. by tom · 10 years ago
  17. 19bf421 Fixed some sonar-reported issues. by tom · 10 years ago
  18. c53fa0d Fixed check-style nags. by tom · 10 years ago
  19. 144de69 Added more unit tests for the graph utilities. by tom · 10 years ago
  20. e348941 Added graph-related utility code. by tom · 10 years ago