FINDING SHORTEST PATH USING DIJKSTRA ALGORITHM

Winata, Adrian Pradipta (2017) FINDING SHORTEST PATH USING DIJKSTRA ALGORITHM. Other thesis, Unika Soegijapranata.

[img]
Preview
Text
12.02.0047 Adrian Pradipta Winata COVER.pdf

Download (2MB) | Preview
[img]
Preview
Text
12.02.0047 Adrian Pradipta Winata BAB I.pdf

Download (70kB) | Preview
[img] Text
12.02.0047 Adrian Pradipta Winata BAB II.pdf
Restricted to Registered users only

Download (82kB)
[img]
Preview
Text
12.02.0047 Adrian Pradipta Winata BAB III.pdf

Download (69kB) | Preview
[img]
Preview
Text
12.02.0047 Adrian Pradipta Winata BAB IV.pdf

Download (75kB) | Preview
[img]
Preview
Text
12.02.0047 Adrian Pradipta Winata BAB V.pdf

Download (230kB) | Preview
[img]
Preview
Text
12.02.0047 Adrian Pradipta Winata BAB VI.pdf

Download (69kB) | Preview
[img]
Preview
Text
12.02.0047 Adrian Pradipta Winata DAFTAR PUSTAKA.pdf

Download (95kB) | Preview
[img]
Preview
Text
12.02.0047 Adrian Pradipta Winata LAMPIRAN.pdf

Download (188kB) | Preview

Abstract

Advances in information technology is now increasingly widespread and very rapidly growing, so it can help people to enjoy the various conveniences that have been generated by these technologies. The main problem of finding the shortest route is of course to find the shortest route or path possible. But for its implementation, this issue can be expanded more widely among others to find the minimum cost, etc. The point is to find the most effective solution that can be applied in the problems faced. Algorithm is a computational procedure that transforms a number of inputs into a number of outputs. Dijkstra's algorithm is a graph search algorithm that completes the shortest path single source problem in which Dijkstra will look for the shortest path from a start vertex by examining and comparing each path. The purpose of this research is to search the shortest route and calculate the path with primary point and direction node. Based on the result, the conclusion is Dijkstra's algorithm can be used to search the shortest route and can calculate the path with primary point and direction node.

Item Type: Thesis (Other)
Subjects: 000 Computer Science, Information and General Works > 004 Data processing & computer science
Divisions: Faculty of Computer Science > Department of Informatics Engineering
Depositing User: Mr Ign. Setya Dwiana
Date Deposited: 05 Dec 2017 08:01
Last Modified: 05 Dec 2017 08:01
URI: http://repository.unika.ac.id/id/eprint/15345

Actions (login required)

View Item View Item