Connectivity Algorithm in Simple Graphs
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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Universitas Syiah Kuala, Faculty of Mathematics and Natural Science
2014-07-01
|
| Series: | Jurnal Natural |
| Online Access: | http://jurnal.unsyiah.ac.id/natural/article/view/1387 |