mikael-ros / aljorithm

An attempt at implementing some algorithms in Java, in preparation for an exam in EDAF05

alJorithm

Yet another algorithms repo coded in Java. This is a complement to my algoritHm repo, which hosts some other algorithms written in Haskell. The purpose of this repository is to prepare for the exam in EDAF05 (Algorithms, data structures, and complexity) by implementing some algorithms in my spare time.

The correctness of any of the algorithms cannot be guaranteed due to insufficient test data, but I have tested them to some degree with JUnit - usually one test case each, most of the time.

---

Algorithms found inside

• Dijkstras algorithm

Data structures found inside

• Node
  • DijkstrasNode (a node wrapper with distance)
• Edge
  • WeightedEdge
• Pair
• Path
• Simple Graph based on adjacency list

aljorithm's Issues

Make graphs take any nodes, by letting edges take any nodes

Rather than having to use a wrapper for ex in Dijkstras

Change getEdge() in SimpleGraph to be more efficient

Realized after stopping for today that it currently looks through all edges in a graph, which is terrible. Much better if I search from the adjacencies of either node.

Union-find (naive)

Dijkstras algorithm

Union-find (non-naive)