A graph drawing apps with artificial intelligent run BFS and DFS algorithm
The aim of this project is to draw a graph that can be easily run Breadth-first search (BFS) and Depth-first search (DFS) algorithm.
Latest version Firefox, Google Chrome, Safari, Opera, and IE
Click to draw a node (on gray area). Left-click on a node that you have created (until the color become red) then left-click to another area that you want to make connection line between node (or click on first node and another node to make connect them). Right-click to erase a node
Breadth-first search. Prinsip algoritma breadth-first search adalah melakukan node expansion terhadap node di fringe yang paling dekat ke root. Implementasi: Fringe adalah sebuah queue, data struktur FIFO (First in First Out).
Depth-first search. Prinsip algoritma depth-first search adalah melakukan node expansion terhadap node di fringe yang paling jauh dari root. Implementasi: Fringe adalah sebuah stack, data struktur LIFO (Last In First Out).