Contact Line (+234) 703-093-9342
HealthFlex
×
  • Home
  • About Us
    • Message From the Dean
    • Meet The Team
      • SAC Team
      • LOC Committee
  • Our Journal
    • Journal Cover Page
    • IJNAS Volume 1. No.1
    • IJNAS Volume 2. No.1
    • IJNAS Volume 2. No.2
    • IJNAS Volume 3. No.1&2
    • IJNAS Volume 4. No.1&2
    • IJNAS Volume 5. No.1&2
    • IJNAS Volume 6. No.1&2
    • IJNAS Volume 7. No.1&2
    • IJNAS Volume 12
  • Conferences
    • Conference 2021
    • Conference 2019
    • List of Hotels
    • Conference Programme
  • Resources
    • Conference Programme
      • List of Hotels
  • Contact Us

Shortest path (route) determination in telecommunication network systems in Nigeria. – O. A. Ofem and E. E. Williams

November 28, 2020Journals Vol2. No1

ABSTRACT

An algorithm that is designed essentially to find a path of minimum length between two specified vertices of a connected weighted graph is known as shortest path algorithm. The algorithm for solving a class of these kind of problem was developed by E. W. Dijkstra in 1959. The fundamental aim of this research paper is to establish a means through which data can traverse from one point to another with the minimum distance.

Download Full Article

Contact Us

(+234) 703-093-9342

info@unicalfps.com

http://www.unicalfps.com

Faculty of Physical Sciences, University of Calabar. P.M.B 1115 – Calabar. Nigeria

Quick Links

  • Home
  • About Us
    • Message From the Dean
    • Meet The Team
      • SAC Team
      • LOC Committee
  • Our Journal
    • Journal Cover Page
    • IJNAS Volume 1. No.1
    • IJNAS Volume 2. No.1
    • IJNAS Volume 2. No.2
    • IJNAS Volume 3. No.1&2
    • IJNAS Volume 4. No.1&2
    • IJNAS Volume 5. No.1&2
    • IJNAS Volume 6. No.1&2
    • IJNAS Volume 7. No.1&2
    • IJNAS Volume 12
  • Conferences
    • Conference 2021
    • Conference 2019
    • List of Hotels
    • Conference Programme
  • Resources
    • Conference Programme
      • List of Hotels
  • Contact Us
Copyright ©2019 all rights reserved