•Search algorithms: ◦Uninformed search: ◾DFS: Depth-First-Search. ◾BFS: Breadth-First-Search. ◾Dijkstra. ◾Bellman-Ford. ◦Informed search: ◾A star (A*). ◾IDA star (IDA), Iterative Deepening A. ◾AD star (AD): Anytime Dynamic A. ◦Local search: ◾Hill-Climbing. ◾Enforced-Hill-Climbing. ◦Multiobjective search ◾Multiobjective LS algorithm. Original paper: Martins, E. D. Q. V., & Santos, J. L. E. (1999). "The labeling algorithm for the multiobjective shortest path problem". Departamento de Matematica, Universidade de Coimbra, Portugal, Tech. Rep. TR-99/005 (see an example) •3rd party adapters: ◦Java Universal/Graph (JUNG) adapter.

Open Source & Free to use