kanhar/mvc_simple
This is a stripped down MVC that uses a stripped down REST model (currently only supports GET) to make a really simple web application. The key here is NOT functionality but simplicity.
Developer Profile
kanhar
Discovered public repositories for kanhar in the GitHub catalog.
kanhar/xna
Xna Multiplayer game, for a software engineering class. Many years ago!
kanhar/android_geotagger
An android application that allows for pictures to be tagged with GPS + allowing the user to add custom information to the Image EXIF metadata. This information is then later searchable.
kanhar/simplex
An example of the simplex method to solve a system of simultaneous equations. More info here: http://kmwiki.info/wiki/index.php/Code/CPlusPlus/Simplex
kanhar/X_Monotone_Longest_Path
Find the x-monotone longest path given a set of points. X monotone longest path is a path that moves only in the x axis, increasing as it progresses. Similar to this: http://en.wikipedia.org/wiki/Longest_increasing_subsequence
kanhar/k_server
A dynamic programming type solution to the k-server problem: http://en.wikipedia.org/wiki/K-server_problem
kanhar/bottleneck_shortest_path
In graph algorithms, the widest path problem, also known as the bottleneck shortest path problem or the maximum capacity path problem, is the problem of finding a path between two designated vertices in a weighted directed graph, maximizing the weight of the minimum-weight edge in the path. For instance, if the graph represents connections between routers in the Internet, and the weight of an edge represents the bandwidth of a connection between two routers, the widest path problem is the problem of finding an end-to-end path between two Internet nodes that has the maximum possible bandwidth.[1] The weight of the minimum-weight edge is known as the capacity or bandwidth of the path. As well as its applications in network routing, the widest path problem is also an important component of the Schulze method for deciding the winner of a multiway election,[2] and has been applied to digital compositing,[3] metabolic analysis,[4] and the computation of maximum flows.[5] It is possible to adapt most shortest path algorithms to compute widest paths, by modifying them to use the bottleneck distance instead of path length.[6] However, in many cases even faster algorithms are possible.
kanhar/compiler
An introductory Pascal Compiler that has a web front end, where a typed program is tokenized, converted to MSIL, and then executed in simple easy to understand steps! Good learning exercise for a compiler!