Skip to content
Snippets Groups Projects

Repository graph

You can move around the graph by using the arrow keys.
Select Git revision
  • AltNodeClass
  • Inverse_Graph
  • ListOfPlaces
  • New_edge_class
  • Strings_result
  • Trying_optimization
  • altTest
  • anders-landmarks
  • anders-refactoring
  • andersTwo
  • badbranch-needsfix
  • interestPts
  • main default
  • newAltEdge
  • newNewEdge
  • new_branch
  • new_node_class
  • node-stuff
  • testing
  • uwubranch
20 results
Created with Raphaël 2.2.018Nov17161514131198uwuuwubranchuwubranchFail AltnewAltEdgenewAltEdgetestsAlt mk1Print latitud og longitudanders-refactor…anders-refactoringstuffFormat time method was fixedCheck timeRefactored code. Added Comparator class.Possible solution was addednewNewEdgenewNewEdgeFormat method was addednew_branchnew_branchWorkingbadbranch-needs…badbranch-needsfixStill needs fixThis needs to be fixedNew implementation of ALTAltNodeClassAltNodeClassadded stuffInverse_GraphInverse_GraphInverse graph method was addedFix file printinganders-landmarksanders-landmarksAdded loading landmark file to arrayFixed landmark preprocessing.new_node_classnew_node_classFile Writer was addedAlt prepreocessingGet Node number by name was addedType-checker was addedFind places method was added to the programNew implementation of DijkstraNew_edge_classNew_edge_classSome changestestingtestingBoolean array was added to DikjstraBoolean array was addedStrings_resultStrings_resultPrim was addedResult is a string not and arrayListNodes are needed to show coordinatesSmall changeArraylistAgainnode-stuffnode-stuffMoved Djikstra to Graph classDijkstra with out arrayListTrying_optimiza…Trying_optimizationTrying optimizationGet list of closes places was addedListOfPlacesListOfPlacesmethod that returns list of places is implementedInterest point stuffinterestPtsinterestPts