Search Results for "interactive games"

ngraph.path is a JavaScript library that implements efficient pathfinding algorithms for graphs, primarily designed to compute shortest paths in weighted or unweighted networks. It provides a clean API for constructing graph models, assigning weights to edges, and querying for optimal routes between nodes, making it useful for routing, games, maps, and network optimization. The library includes several algorithm implementations such as A*, Dijkstra’s, and breadth-first search, each suited to different types of graph structure and performance needs. It can be integrated with visualization libraries like VivaGraphJS to animate or highlight computed paths in a rendered graph, enabling interactive routing features. ...

WhiteHawk Project: A GNU/Linux Desktop environment for newbies trying to improve the new user experience by giving easy to use applications and games

The library currently consists of an implementation of collision detection of static/moving ellipsoids that exploits frame-coherence using separating planes. Please visit http://www.cs.hku.hk/GraphicsGroup/cd.html for paper references.

JavaGO is an Open Source Java library for the Game of GO (weiqi, baduk) analysis. Implements: base game classes, montecarlo simulations, SGF reader/writer, game variants, GTP, etc. Elegant interfaces/class design. Speed efficient w/small footprint. TDD.