TY - JOUR TI - DEPTH FIRST SEARCH (DFS) UNTUK MENENTUKAN DIAMETER GRAF HIRARKI AU - Nugroho Arif Sudibyo; Ardymulya Iswardani IS - Vol 11 No 2 (2019): Jurnal Ilmiah Matematika dan Pendidikan Matematika PB - Jurusan Matematika FMIPA Universitas Jenderal Soedirman JO - Jurnal Ilmiah Matematika dan Pendidikan Matematika PY - 2019 SP - 29 EP - 36 UR - http://jos.unsoed.ac.id/index.php/jmp/article/view/2265/1322 AB - Let G = (V, E) be a graph. The distance d (u, v) between two vertices u and v is the length of the shortest path between them. The diameter of the graph is the length of the longest path of the shortest paths between any two graph vertices (u ,v) of a graph, . In this paper we propose algorithms for finding diameter of a hierarchy graph using DFS. Diameter of the hierarchy graph using DFS algoritm is four.