"In this task we want to use the algorithm of dijkstra in real life. Therefore we will calculate a route of smallest possible length between 2 points using a map from openstreetmap.org."
1 week of time for this Clap, who cares about exam prep when u got PROGRAMMING homework of hell to do
dijkstras algoritm itself isnt hard to implement
not sure about the conversion of street maps to graphs, i guess u do it manually or have some program that does it
alrdy implemented dijkstras in this weeks homework, but to use it on openstreetmaps u gotta do a lot of shit
1) parsefile(filename) that uses an XML parser (w/e that is) to build a graph with all edges and vertices of the map (additionally use a SAX parser to reduce the size of the file as well as the ram required when using the function)
2) distance() that implements the distance between two vertices (that should be the easiest part i guess)
3) OSMNode closest(MapPoint p) that calculates the closest vertice to the current vertice p
3) hasEdge() to check for a edge between 2 vertices
4) route(MapPoint from, MapPoint to) that implements dijkstra
5) void write(RoutingResult rr) that returns a file in GPX-format that can be opened with something like GPSPrune (navigation system?)
bonus task: you will notice that when you try to use your current program on big maps, that the program takes a long time to calculate a possible route, especially between 2 points that are not too far apart. increase the program's performance:
tips: 1. think about how you can possibly use the air distance between 2 points in your implementation
2. try to reduce the amount of times reduceBySmallerElement() is being called
Beat skeletron 2nd try too on expert with basically your loadout, except it was a blizzard in a balloon and lightning boots. I didnt have an arena but with so much vertical mobility it didnt matter at all
With almost everything on warding the only reason i died was insanely dumb mistakes, nowhere near as hard a fight when he’s literally the last thing you do before dumping 300 beenades on WoF
oh wait nvm he comes after the goblin invasion not after dungeon
i dont think i ever got the goblin outside of the dungeon, it was always beat normal mode skeletron(rofl), go to dungeon and find both him and the chick there
fuck off
im like a B average student
mostly cuz i put 0 effort into my studies
https://www.joindota.com/en/news/64600-jerax-launches-his-own-clothing-brand
that was supposed to be the big news?
ROFL
i'm in jail tomorrow, cya guys in tha future
✌️
"No interesting news going on, lets just put some random shit on our site"
its not even a clothing brand its just some merch
https://www.twitch.tv/arin_the_scrub
hast du eigentlich internet in dem kaff? LULW
ich würde mir wirklich ne switch gönnen weil du wirst da wahrscheinlich eh den ganzen tag nichts machen
dann kannst du speedrunner werden
kindly expecting some songrequests that i forgot to wrote down last time
otherwise weeb shit inc
g a m e s d o n e q u i c k
yo wats the female version of nigga?
niggette?
^LMFAO
or because ure dumb like stick judging by ur posting history
Dreux DESTROYS socialist idiot student with LOGIC and FACTS
"In this task we want to use the algorithm of dijkstra in real life. Therefore we will calculate a route of smallest possible length between 2 points using a map from openstreetmap.org."
1 week of time for this Clap, who cares about exam prep when u got PROGRAMMING homework of hell to do
dijkstras algoritm itself isnt hard to implement
not sure about the conversion of street maps to graphs, i guess u do it manually or have some program that does it
also WLAN wird es sicherlich nicht geben, ich häng vom empfang ab
said like a true middle school edgelord arin!
alrdy implemented dijkstras in this weeks homework, but to use it on openstreetmaps u gotta do a lot of shit
1) parsefile(filename) that uses an XML parser (w/e that is) to build a graph with all edges and vertices of the map (additionally use a SAX parser to reduce the size of the file as well as the ram required when using the function)
2) distance() that implements the distance between two vertices (that should be the easiest part i guess)
3) OSMNode closest(MapPoint p) that calculates the closest vertice to the current vertice p
3) hasEdge() to check for a edge between 2 vertices
4) route(MapPoint from, MapPoint to) that implements dijkstra
5) void write(RoutingResult rr) that returns a file in GPX-format that can be opened with something like GPSPrune (navigation system?)
bonus task: you will notice that when you try to use your current program on big maps, that the program takes a long time to calculate a possible route, especially between 2 points that are not too far apart. increase the program's performance:
tips: 1. think about how you can possibly use the air distance between 2 points in your implementation
2. try to reduce the amount of times reduceBySmallerElement() is being called
als wenn die in so einem kaff gutes internet haben
ich würde mir auf jeden fall die switch früher oder später kaufen, du bist ja 5 tage die woche da richtig, und am WE zuhause & nicht andersherum
ich würde sterben vor langeweile
its kinda an interesting homework though, i'd rather implement this than another compiler task BrokeBack
oh well
good luck
u dont have to write the xml/sax parser urself at least?
we have to write our own sax parser, we can use https://www.tutorialspoint.com/java_xml/java_sax_parse_document.htm as an "inspiration"
so i'll still have to modify that to get the sax parser that works for my task BrokeBack
oh and distance() works by calculating the latitude/longitude points of each respective vertice, it is not given by the xml file OMEGALUL
im gonna fUCJKIGN DIE this week ПРОСТО УНИВЕРСИТЕТ ХУЙНА
wow u really got me
russian vs indian
im SO GOOD
(2nd try btw)
what is this shit
we only had Dijkstra's in discretes and even there we just used it on some graphs and shit
never actually worked with the program
Beat skeletron 2nd try too on expert with basically your loadout, except it was a blizzard in a balloon and lightning boots. I didnt have an arena but with so much vertical mobility it didnt matter at all
With almost everything on warding the only reason i died was insanely dumb mistakes, nowhere near as hard a fight when he’s literally the last thing you do before dumping 300 beenades on WoF
For some reason people in my school started circlejerking twilight like it's 2008 :/
Never understood what they found in that tetralogy, it's simply so shallow and the characters aren't developing
Didn't like it when I was 8 yo and I don't like it today :/
baloon? is that some new item?
i remember having those jungle grappling hooks which was the best shit ever
u can get a shiny red balloon from floating islands, and combine it with the bottle double jump items. the balloon increases jump height
how did u have lightning bvoots and blizzard b4 beating skeletron
oh wait nvm he comes after the goblin invasion not after dungeon
i dont think i ever got the goblin outside of the dungeon, it was always beat normal mode skeletron(rofl), go to dungeon and find both him and the chick there
Terraria good shit
Second most hours on steam after dota
man i haven't played terraria in like three years when i thought that there's not gonna be updates anymore
SEA LMAO is ded.
Oh kool I'm a senior member on here now!
man, EE is like the ultimate dota villain at this point.
get kicked from TI winning team
proceed to kick at least 1 player/year
good shit right there
poor ohaiyo
ee = our guy