DEPTH FIRST SEARCH (DFS) UNTUK MENENTUKAN DIAMETER GRAF HIRARKI

  • Nugroho Arif Sudibyo Universitas Duta Bangsa
  • Ardymulya Iswardani Universitas Duta Bangsa
DOI: https://doi.org/10.20884/1.jmp.2019.11.2.2265

Abstract

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.

Published
2019-12-27
How to Cite
SUDIBYO, Nugroho Arif; ISWARDANI, Ardymulya. DEPTH FIRST SEARCH (DFS) UNTUK MENENTUKAN DIAMETER GRAF HIRARKI. Jurnal Ilmiah Matematika dan Pendidikan Matematika, [S.l.], v. 11, n. 2, p. 29-36, dec. 2019. ISSN 2550-0422. Available at: <http://jos.unsoed.ac.id/index.php/jmp/article/view/2265>. Date accessed: 22 sep. 2023. doi: https://doi.org/10.20884/1.jmp.2019.11.2.2265.
Citation Formats
Issue
Vol 11 No 2 (2019): Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP)
Section
Articles

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.