Personal collection of data structures and algorithms in Haxe

Extensible graph data structure and algorithms

• Introducing the jonas.graph package wiki page
• jonas.graph.Digraph: base for an extensible directed graph data structure, using adjacency lists
• jonas.graph.DFSColoringGraph: DFS proper graph coloring (sub optimal)
• jonas.graph.SPDijkstraDigraph: shortest paths on digraphs with no negative costs using Dijkstra's algorithm
• jonas.graph.SPAStarDigraph: shortest paths using A* algorithm (Dijkstra + heuristic cost estimate)
• More...

Data structures

• jonas.ds.DAryHeap: D-arity max/min heaps, array based implementation
• jonas.ds.RjTree: R-Tree variant (visualization, Describing the API for jonas.ds.RjTree wiki page)
• jonas.ds.queue.PriorityQueue: based on DAryHeap
• More...

Other

• jonas.sort.Heapsort: based on DAryHeap
• jonas.HMAC: hash-based message authentication code
• jonas.NumberPrinter: pretty numeric printing in haXe
• More...

Other open-source Haxe projects

• haxei: an interactive Haxe shell

Working on (my free time)

• Nme-maps: build 2d maps from GIS databases (desktop/windows/neko/cpp): basics + point layer are ok; RjTree still needs some work; missing line and polygon layers; rudimentary interface with some mouse events and a console (haxei)
• More graph algorithms (used in transportation planning): smart shortest path updating, transit assignment

Future plans

• Skip lists

Powered by Haxe and my free time

Jonas Malaco Filho, weekends and 0-6am