Jurnal Ilmiah Matematika dan Pendidikan Matematika (JMP)
Vol 11 No 2 (2019): Jurnal Ilmiah Matematika dan Pendidikan Matematika

DEPTH FIRST SEARCH (DFS) UNTUK MENENTUKAN DIAMETER GRAF HIRARKI

Nugroho Arif Sudibyo (Universitas Duta Bangsa)
Ardymulya Iswardani (Universitas Duta Bangsa)



Article Info

Publish Date
27 Dec 2019

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.

Copyrights © 2019






Journal Info

Abbrev

jmp

Publisher

Subject

Mathematics

Description

JMP is a an open access journal which publishes research articles, reviews, case studies, guest edited thematic issues and short communications/letters in all areas of mathematics, applied mathematics, applied commutative algebra and algebraic geometry, mathematical biology, physics and engineering, ...