A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
DEPTH FIRST SEARCH (DFS) UNTUK MENENTUKAN DIAMETER GRAF HIRARKI
Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP)
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.doi:10.20884/1.jmp.2019.11.2.2265 fatcat:ebruovat4nc3hdrcf7xmbkktlm