Article Per Year (5 Year)
p-Index From 2021 - 2026
0
P-Index
This Author published in this journals
All Journal Jurnal Natural
Rahmah Zuhra
Unknown Affiliation
Agriculture, Biological Sciences & Forestry Astronomy Biochemistry, Genetics & Molecular Biology Chemistry Earth & Planetary Sciences Energy Immunology & microbiology Neuroscience Physics

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

 1 
Connectivity Algorithm in Simple Graphs Reza Wafdan; Mahyus Ihsan; Rahmah Zuhra
Jurnal Natural Volume 14, Number 1, March 2014
Publisher : Universitas Syiah Kuala

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (193.351 KB)

Abstract

This paper discusses about connectivity algorithm in simple graphs. The algorithm has three stages, namely, adjacent vertices search, adjacent vertices investigation and component investigation. The aim of connectivity algorithm is to check whether a graph is connected or disconnected with the scope set. There are three sets which are used in this algorithm, namely, vertex, edge and adjacent vertices sets. The simple graph is connected if the graph has only one component or if the number of adjacent vertices elements is equal to the number of vertices. Otherwise, if the simple graph has more than one component or if the number of adjacent vertices elements is not equal to the number of vertices then the algorithm will conclude that the graph is disconnected.
Co-Authors Mahyus Ihsan Reza Wafdan