s434681/praca_magisterska
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Commit Graph

  • 328f96d117 Got rid of 20000 node subgroups. master Bartosz 2022-10-22 12:53:46 +0200
  • 1ff0d00c05 Added output of the tests. Bartosz 2022-10-19 16:34:41 +0200
  • 5a582ca490 added more data to dataset. Bartosz 2022-10-19 13:09:54 +0200
  • 7e99f84b10 Added generated dataset to VCS. Bartosz 2022-10-19 12:35:29 +0200
  • e7626bef27 Changed generated datasets to include more graphs and split them into groups by nodes count and number of edges. Started working on code for experiments using those data. Bartosz 2022-10-19 10:47:47 +0200
  • 83c6b3e879 Changed generation of graphs. Generated new dataset. Bartosz 2022-10-04 15:36:17 +0200
  • 68d87448b5 Added means to time and memory tables. Generated new outputs. Bartosz 2022-09-25 20:48:08 +0200
  • 7198cc493f Cleaned readme for now. Bartosz 2022-09-25 16:51:19 +0200
  • f34b221065 Rewrote all 3 algorithms. Generated 10 random graphs and grids for tests. Created testing structure which uses generated graphs and grids as input data to algorithms, measures execution time and memory blocks used by them. Takes these measurements and found weights and builds tables in latex format which compare these data among those three algorithms. Bartosz 2022-09-25 16:42:05 +0200
  • a530372141 Rewrote all 3 algorithms. Generated 10 random graphs and grids for tests. Created testing structure which uses generated graphs and grids as input data to algorithms, measures execution time and memory blocks used by them. Takes these measurements and found weights and builds tables in latex format which compare these data among those three algorithms. Bartosz 2022-09-25 16:41:41 +0200
  • e9cda32103 Changed binary heap to Fibonaccie's heap. Got rid of placeholder data. Bartosz 2022-09-23 16:06:04 +0200
  • 5f23ac65fb Merge branch 'master' of https://git.wmi.amu.edu.pl/s434681/praca_magisterska Bartosz 2022-08-28 18:03:48 +0200
  • 256e8b3908 Changed implementation of Dijkstra algorithm a little. Bartosz 2022-08-28 18:03:26 +0200
  • 2b4ad77912 fixed a copy mistake in dijkstra bartosz 2022-01-18 13:38:48 +0100
  • cab460feb8 Added two png files with graphic representation of two example graphs used in testing of the algorithms. Bartosz 2022-01-17 21:28:34 +0100
  • 044355b547 Added pdf with presentation about the algorithms in polish. Bartosz 2022-01-17 19:44:19 +0100
  • abb169a2f3 Made some changes to bidirectional. Among them added handling of directed graphs. Added some descriptive comments to dijkstra. Bartosz 2022-01-15 18:07:49 +0100
  • 55f1ecc36c Added handing of directed graphs to a_star and dijkstra as well as to reading graphs from file. Bartosz 2022-01-15 14:29:52 +0100
  • 8c680e235e Added presentation of implementaions. Bartosz 2021-11-15 15:01:34 +0100
  • 85995b3d16 Changed dijkstra_algorithm a little. Added printout of the shortest path and weight in the a_star_algorithm. Added implementation of bidirectional algorithm. Still need good heuristic function for A* and bidirectional algorithms. Bartosz 2021-11-02 15:17:18 +0100
  • 602b893f81 Implemented A* algorithm (needs better heuristic function). Bartosz 2021-10-31 13:01:58 +0100
  • 7310699ea8 Implemented dijkstra algorithm with priority queue in binary heap. Bartosz 2021-10-17 11:21:09 +0200
  • 10437a49c3 Created two python packages. One for algorithms implementations of the master thesis and the other for methods, classes and structures meant to help with the use of those algorithms. Bartosz 2021-10-08 18:16:04 +0200
  • c272c732d7 Initialized git repo. Created function for reading graphs from files (or more precisely edges of a graph). Added few datasets of undirected graphs without weights (for now). Bartosz 2021-09-04 16:19:59 +0200