Home / Technical / Programming / Algorithm


Basic methods for searching graphs

There are two methods for searching graphs that are extremely prevalent, and will form the foundations for more advanced algorithms later on. These two methods are the Depth First Search and the Breadth First Search. Ref

ادامه مطلب »

Mathematics for Programming

Mathematics for programming Reference

ادامه مطلب »

Dijkstra’s algorithm

Dijkstra’s algorithm, conceived by Dutch computer scientist Edsger Dijkstra in 1959,[1] is a graph search algorithm that solves the single-source shortest path problem for a graph with non negative edge path costs, outputting a shortest path tree. This algorithm is often used in routing.

ادامه مطلب »

Programming Game AI by Example

Implementing AI at the team level in addition to the player level creates what is known as tiered AI. This type of AI is used in all sorts of computer games. You will often find tiered AI in real-time strategy (RTS) games where the enemy AI is commonly implemented in ...

ادامه مطلب »

Introduction to algorithms

Introduction to algorithms By Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, is used as the textbook for algorithms courses at many universities. It is also one of the most commonly cited references for algorithms in published papers, with over 2500 citations documented on CiteSee It is ...

ادامه مطلب »