IMPLEMENTASI GRAF PADA PERANCANGAN TOPOLOGI JARINGAN KOMPUTER DENGAN ALGORITMA KRUSKAL (Studi Kasus: Laboratorium Komputer SMK N 1 Kawunganten)

In mathematics there is a theory of graph which is a branch of mathematics that has existed since the first. This graph theory originally appeared in 1736, which was first introduced by Euler to a Swiss graph theory journal. In its development the theory of graph is growing rapidly with the beginning of its progress introduces optimizations that are accomplished with a minimum range tree known as Minimum Spanning Tree (MST). By using MST some everyday problems that can be represented in the graph, such as transportation networks, communication networks, computer networks, and in some game theories. Problems of computer networks are often found in educational institutions that will make the planning of computer lab networks. One of the educational institutions that experienced this problem is SMK N 1 Kawunganten. In the existing computer network topology planning in the laboratory in SMK N 1 Kawunganten still not good in planning and documentation. This poor planning and documentation by measuring the distance between the computer and the hub used. Data collection method used in this research is observation, interview, documentation and literature study. System development method using waterfall. The results of this research is the application used for the implementation of graph on computer network topology in laboratory SMK N 1 Kawunganten with kruskal algorithm