Impact Factor: 7.883
Submit Paper
Volume 6, Issue 3 (March 2020)

Finding Shortest Path For An Octagonal Fuzzy Network

Impact Factor
7.883
Call For Paper
Volume 12 Issue 07

July 2026

Download Paper Format
Copyright Form
Share on:

Author(s)

Harshini K

Abstract

In This Paper, I Have Presented Two Algorithms To Find The Shortest Path From A Source Node To A Destination Node Of A Network. We Also Solved A Numerical Example In Which Each Edge Assigns An Octagonal Fuzzy Number.


Keywords

Euclidean Distance Network Octagonal Fuzzy Number Shortest Path α-c Set.

Paper ID

IJSARTV6I336213

Publication Date

March 31, 2020

Research Area

Mathematics

Submit Your Paper to IJSART

Join the global research community with IJSART. Submit your paper, share your work, and gain worldwide recognition!