Hill Climbing Algorithm

import java.util.*; class Node {        int no        String name;        Node left, right;        boolean hasleft, hasright;        float Hn; } public class Hill {        public static void main(String args[]) {               Scanner...

Read More

BFS - Best First Search

import java.util.*; class Node {        int no;        String name;        Node left, right;        boolean hasleft, hasright;        float Hn, Gn, Fn; } public class BEST {        public static void main(String args[]) {               Scanner...

Read More

A* - A Star Algorithm

import java.util.*; class Node { int no;        String name;        Node left; Node right;        boolean hasleft; boolean hasright; float Hn, Gn, Fn; } public class Astar {        public static void main(String args[]) {               Scanner sc = new Scanner(System.in);              ...

Read More