Graph is interconnected nodes.
Graph can be searched the path to travel.
Graph can be expressed with 2 dimensional array or matrix. More precise, it is an array or matrix that mirroring diagonally and the diagonal elements are all zero values.
So,
The algorithm to accomplishes path or route determination is search neighbor's neighbors to search a neighbor, more like search folder inside a subfolders to search a subfolder.
It will reduced.
PRE-REQUISITE
1. Learn 2 dimensional array
Path determination consist of components:
1. Source
2. Destination
3. Map
4. Arrays of path or route
Graph can be searched the path to travel.
Graph can be expressed with 2 dimensional array or matrix. More precise, it is an array or matrix that mirroring diagonally and the diagonal elements are all zero values.
So,
The algorithm to accomplishes path or route determination is search neighbor's neighbors to search a neighbor, more like search folder inside a subfolders to search a subfolder.
It will reduced.
PRE-REQUISITE
1. Learn 2 dimensional array
Path determination consist of components:
1. Source
2. Destination
3. Map
4. Arrays of path or route
Tidak ada komentar:
Posting Komentar