[2015-11-24 01:46:41 UTC] well I mean we have a large data set of LITERALLY OVER 9000 edges and nodes... so initially when I first implemented my graph to do it, it took like 36 seconds, then after I decided to disregard the warning on the assignment to "DON'T REUSE CODE" [2015-11-24 01:46:52 UTC] i got it to work in 10 seconds [2015-11-24 01:47:22 UTC] in any case like I said, writing tests isn't difficult, just super boring and not fun [2015-11-24 19:14:17 UTC] Over 9000?! Is that even possible? [2015-11-24 20:08:14 UTC] Yes, well, its more like [b]340955[/b] edges, which I guess ain't that big compared to real data, and also buq25, no it wouldnt fail.. that's the HOLE point of dijkstra's algorithm... [2015-11-24 20:49:53 UTC] But, either it would fail if you made enough 1 or 7s in a row before it gives up calculating the route, or it's just straight up brute force [2015-11-24 20:50:58 UTC] One of them would ocasionally give incorrect results and the other is really boring [2015-11-24 20:57:17 UTC] I mean, the algorithm is simple enough that I most likely could have figured it out myself when I had programming classes when I was 16 [2015-11-24 20:57:33 UTC] If our teacher had given us the problem as a puzzle [2015-11-24 21:00:37 UTC] Well, if I were to try to cover up my hubris, how is the data given to you? [2015-11-24 21:05:55 UTC] Since i remember that I was enjoying [url=https://projecteuler.net]Project Euler[/url] quite a bit, and they had [url=https://projecteuler.net/problem=67]this[/url] challenge that could be seen as a massive graph with nodes [2015-11-24 21:06:43 UTC] its a large file, where the data is in pairs, one side is the nodes, the other side is the edges, and so each edge corresponds to a bunch of nodes, which are all linked to each other by that edge [2015-11-24 21:07:18 UTC] and so to create a weighted graph from that, originally I planned on creating a normal graph from the data, then going through each node and its edges and creating a new graph.. which Like i said took 36 seconds [2015-11-24 21:07:48 UTC] then i decided fuk that and created a new method that just creates the graph directly, which took like only 6 seconds [2015-11-24 21:08:58 UTC] and no it wouldnt fail since if you do have enough in a row, then it will just brute force, since if we did not explore a certain node, we would keep on going [2015-11-24 21:09:23 UTC] anyways, i have until 11 pm, so 10 hours, to create a bunch of tests and write comments [2015-11-24 21:09:44 UTC] and knowing me I probably will take until 10pm then complain about having maths homework due [2015-11-24 21:09:49 UTC] SIGH [2015-11-24 21:21:09 UTC] Alright, seems cool [2015-11-24 21:21:33 UTC] I've got 7 essays I have to write over the next 2 weeks, so I'll just not do that until like in 2 weeks