Pencarian SPBU Terdekat dan Penentuan Jarak Terpendek Menggunakan Algoritma DIJKSTRA (Studi Kasus di Kabupaten Jember) | Zendy

AI Assistant Blog Pricing

Open Access

Pencarian SPBU Terdekat dan Penentuan Jarak Terpendek Menggunakan Algoritma DIJKSTRA (Studi Kasus di Kabupaten Jember)

Author(s) -

Windi Eka Yulia Retnani,

Dwiretno Istiadi,

Abdul Roqib

Publication year - 2015

Publication title -

jurnal nasional teknik elektro

Language(s) - Italian

Resource type - Journals

eISSN - 2407-7267

pISSN - 2302-2949

DOI - 10.20449/jnte.v4i1.132

Subject(s) - dijkstra's algorithm , physics , computer science , shortest path problem , theoretical computer science , graph

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom

About

About Careers Publisher Partners Contact Us Get Organisational Trial or Quote

Learn

FAQs Blog Terms of Use Privacy Policy

Download the Zendy App

Download on the

Discover

Explore

Copyright Knowledge E © 2026. All Rights Reserved.