{"id":33601,"date":"2023-02-10T18:10:43","date_gmt":"2023-02-10T12:40:43","guid":{"rendered":"https:\/\/jassweb.com\/solved\/solved-shortest-path-using-php-closed\/"},"modified":"2023-02-10T18:10:43","modified_gmt":"2023-02-10T12:40:43","slug":"solved-shortest-path-using-php-closed","status":"publish","type":"post","link":"https:\/\/jassweb.com\/solved\/solved-shortest-path-using-php-closed\/","title":{"rendered":"[Solved] Shortest path using php [closed]"},"content":{"rendered":"

[ad_1]
\n<\/p>\n

\n
\n
<\/div>\n
\n
\n

As Mark Baker pointed out, you’ll need to use something like Dijkstra’s algorithm to traverse a weighted graph (which is what you’ll have when you include distances).<\/p>\n

Here’s a simple distance function I found here<\/a>:<\/p>\n

<?php\n\n\/*::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::*\/\n\/*::                                                                         :*\/\n\/*::  This routine calculates the distance between two points (given the     :*\/\n\/*::  latitude\/longitude of those points). It is being used to calculate     :*\/\n\/*::  the distance between two locations using GeoDataSource(TM) Products    :*\/\n\/*::                                                                         :*\/\n\/*::  Definitions:                                                           :*\/\n\/*::    South latitudes are negative, east longitudes are positive           :*\/\n\/*::                                                                         :*\/\n\/*::  Passed to function:                                                    :*\/\n\/*::    lat1, lon1 = Latitude and Longitude of point 1 (in decimal degrees)  :*\/\n\/*::    lat2, lon2 = Latitude and Longitude of point 2 (in decimal degrees)  :*\/\n\/*::    unit = the unit you desire for results                               :*\/\n\/*::           where: 'M' is statute miles                                   :*\/\n\/*::                  'K' is kilometers (default)                            :*\/\n\/*::                  'N' is nautical miles                                  :*\/\n\/*::  Worldwide cities and other features databases with latitude longitude  :*\/\n\/*::  are available at http:\/\/www.geodatasource.com                          :*\/\n\/*::                                                                         :*\/\n\/*::  For enquiries, please contact sales@geodatasource.com                  :*\/\n\/*::                                                                         :*\/\n\/*::  Official Web site: http:\/\/www.geodatasource.com                        :*\/\n\/*::                                                                         :*\/\n\/*::         GeoDataSource.com (C) All Rights Reserved 2013                  :*\/\n\/*::                                                                         :*\/\n\/*::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::*\/\nfunction distance($lat1, $lon1, $lat2, $lon2, $unit) {\n\n  $theta = $lon1 - $lon2;\n  $dist = sin(deg2rad($lat1)) * sin(deg2rad($lat2)) +  cos(deg2rad($lat1)) * cos(deg2rad($lat2)) * cos(deg2rad($theta));\n  $dist = acos($dist);\n  $dist = rad2deg($dist);\n  $miles = $dist * 60 * 1.1515;\n  $unit = strtoupper($unit);\n\n  if ($unit == \"K\") {\n    return ($miles * 1.609344);\n  } else if ($unit == \"N\") {\n      return ($miles * 0.8684);\n    } else {\n        return $miles;\n      }\n}\n\necho distance(32.9697, -96.80322, 29.46786, -98.53506, \"M\") . \" Miles<br>\";\necho distance(32.9697, -96.80322, 29.46786, -98.53506, \"K\") . \" Kilometers<br>\";\necho distance(32.9697, -96.80322, 29.46786, -98.53506, \"N\") . \" Nautical Miles<br>\";\n\n?>\n<\/code><\/pre>\n
To find all distances between nodes, you’ll need to simply loop through all your nodes.  You’ll come out with an array that looks something like this:<\/p>\n
$distance[0][1] = 10;\n$distance[0][2] = 12;\n$distance[0][3] = 7;\n...\n$distance[4][3] = 14;\n<\/code><\/pre>\n
Where the dimensions of your array represent your node numbers, and the assigned value is the distance.  You’d run this array through Dijkstra to find the shortest weighted path.<\/p>\n
Hope this helps you.  If you need further assistance you might want to try to refine your question to be more narrow.  Graph traversal is a VERY broad area of study.  Good luck.<\/p>\n<\/p><\/div>\n
<\/div>\n<\/div>\n
            0<\/span> <\/p><\/div>\n<\/div>\n
[ad_2]<\/p>\n
solved Shortest path using php [closed] <\/p>\n","protected":false},"excerpt":{"rendered":"
[ad_1] As Mark Baker pointed out, you’ll need to use something like Dijkstra’s algorithm to traverse a weighted graph (which is what you’ll have when you include distances). Here’s a simple distance function I found here: <?php \/*::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::*\/ \/*:: :*\/ \/*:: This routine calculates the distance between two points (given the :*\/ \/*:: latitude\/longitude of … Read more<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[320],"tags":[457,339,2816],"class_list":["post-33601","post","type-post","status-publish","format-standard","hentry","category-solved","tag-algorithm","tag-php","tag-shortest-path"],"yoast_head":"\n[Solved] Shortest path using php [closed] - JassWeb<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/jassweb.com\/solved\/solved-shortest-path-using-php-closed\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"[Solved] Shortest path using php [closed] - JassWeb\" \/>\n<meta property=\"og:description\" content=\"[ad_1] As Mark Baker pointed out, you’ll need to use something like Dijkstra’s algorithm to traverse a weighted graph (which is what you’ll have when you include distances). Here’s a simple distance function I found here: <?php \/*::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::*\/ \/*:: :*\/ \/*:: This routine calculates the distance between two points (given the :*\/ \/*:: latitude\/longitude of ... Read more\" \/>\n<meta property=\"og:url\" content=\"https:\/\/jassweb.com\/solved\/solved-shortest-path-using-php-closed\/\" \/>\n<meta property=\"og:site_name\" content=\"JassWeb\" \/>\n<meta property=\"article:published_time\" content=\"2023-02-10T12:40:43+00:00\" \/>\n<meta name=\"author\" content=\"Kirat\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Written by\" \/>\n\t<meta name=\"twitter:data1\" content=\"Kirat\" \/>\n\t<meta name=\"twitter:label2\" content=\"Est. reading time\" \/>\n\t<meta name=\"twitter:data2\" content=\"2 minutes\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\\\/\\\/schema.org\",\"@graph\":[{\"@type\":\"Article\",\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/solved-shortest-path-using-php-closed\\\/#article\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/solved-shortest-path-using-php-closed\\\/\"},\"author\":{\"name\":\"Kirat\",\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/#\\\/schema\\\/person\\\/65c9c7b7958150c0dc8371fa35dd7c31\"},\"headline\":\"[Solved] Shortest path using php [closed]\",\"datePublished\":\"2023-02-10T12:40:43+00:00\",\"mainEntityOfPage\":{\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/solved-shortest-path-using-php-closed\\\/\"},\"wordCount\":144,\"publisher\":{\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/#organization\"},\"keywords\":[\"algorithm\",\"php\",\"shortest-path\"],\"articleSection\":[\"Solved\"],\"inLanguage\":\"en-US\"},{\"@type\":\"WebPage\",\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/solved-shortest-path-using-php-closed\\\/\",\"url\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/solved-shortest-path-using-php-closed\\\/\",\"name\":\"[Solved] Shortest path using php [closed] - JassWeb\",\"isPartOf\":{\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/#website\"},\"datePublished\":\"2023-02-10T12:40:43+00:00\",\"breadcrumb\":{\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/solved-shortest-path-using-php-closed\\\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\\\/\\\/jassweb.com\\\/solved\\\/solved-shortest-path-using-php-closed\\\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/solved-shortest-path-using-php-closed\\\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"[Solved] Shortest path using php [closed]\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/#website\",\"url\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/\",\"name\":\"JassWeb\",\"description\":\"Build High-quality Websites\",\"publisher\":{\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"},{\"@type\":\"Organization\",\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/#organization\",\"name\":\"Jass Web\",\"url\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/\",\"logo\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/#\\\/schema\\\/logo\\\/image\\\/\",\"url\":\"https:\\\/\\\/jassweb.com\\\/wp-content\\\/uploads\\\/2021\\\/02\\\/jass-website-logo-1.png\",\"contentUrl\":\"https:\\\/\\\/jassweb.com\\\/wp-content\\\/uploads\\\/2021\\\/02\\\/jass-website-logo-1.png\",\"width\":693,\"height\":132,\"caption\":\"Jass Web\"},\"image\":{\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/#\\\/schema\\\/logo\\\/image\\\/\"}},{\"@type\":\"Person\",\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/#\\\/schema\\\/person\\\/65c9c7b7958150c0dc8371fa35dd7c31\",\"name\":\"Kirat\",\"image\":{\"@type\":\"ImageObject\",\"inLanguage\":\"en-US\",\"@id\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/wp-content\\\/litespeed\\\/avatar\\\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1777008400\",\"url\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/wp-content\\\/litespeed\\\/avatar\\\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1777008400\",\"contentUrl\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/wp-content\\\/litespeed\\\/avatar\\\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1777008400\",\"caption\":\"Kirat\"},\"sameAs\":[\"http:\\\/\\\/jassweb.com\"],\"url\":\"https:\\\/\\\/jassweb.com\\\/solved\\\/author\\\/jaspritsinghghumangmail-com\\\/\"}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"[Solved] Shortest path using php [closed] - JassWeb","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/jassweb.com\/solved\/solved-shortest-path-using-php-closed\/","og_locale":"en_US","og_type":"article","og_title":"[Solved] Shortest path using php [closed] - JassWeb","og_description":"[ad_1] As Mark Baker pointed out, you’ll need to use something like Dijkstra’s algorithm to traverse a weighted graph (which is what you’ll have when you include distances). Here’s a simple distance function I found here: <?php \/*::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::*\/ \/*:: :*\/ \/*:: This routine calculates the distance between two points (given the :*\/ \/*:: latitude\/longitude of ... Read more","og_url":"https:\/\/jassweb.com\/solved\/solved-shortest-path-using-php-closed\/","og_site_name":"JassWeb","article_published_time":"2023-02-10T12:40:43+00:00","author":"Kirat","twitter_card":"summary_large_image","twitter_misc":{"Written by":"Kirat","Est. reading time":"2 minutes"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/jassweb.com\/solved\/solved-shortest-path-using-php-closed\/#article","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/solved-shortest-path-using-php-closed\/"},"author":{"name":"Kirat","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31"},"headline":"[Solved] Shortest path using php [closed]","datePublished":"2023-02-10T12:40:43+00:00","mainEntityOfPage":{"@id":"https:\/\/jassweb.com\/solved\/solved-shortest-path-using-php-closed\/"},"wordCount":144,"publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"keywords":["algorithm","php","shortest-path"],"articleSection":["Solved"],"inLanguage":"en-US"},{"@type":"WebPage","@id":"https:\/\/jassweb.com\/solved\/solved-shortest-path-using-php-closed\/","url":"https:\/\/jassweb.com\/solved\/solved-shortest-path-using-php-closed\/","name":"[Solved] Shortest path using php [closed] - JassWeb","isPartOf":{"@id":"https:\/\/jassweb.com\/solved\/#website"},"datePublished":"2023-02-10T12:40:43+00:00","breadcrumb":{"@id":"https:\/\/jassweb.com\/solved\/solved-shortest-path-using-php-closed\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/jassweb.com\/solved\/solved-shortest-path-using-php-closed\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/jassweb.com\/solved\/solved-shortest-path-using-php-closed\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/jassweb.com\/solved\/"},{"@type":"ListItem","position":2,"name":"[Solved] Shortest path using php [closed]"}]},{"@type":"WebSite","@id":"https:\/\/jassweb.com\/solved\/#website","url":"https:\/\/jassweb.com\/solved\/","name":"JassWeb","description":"Build High-quality Websites","publisher":{"@id":"https:\/\/jassweb.com\/solved\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/jassweb.com\/solved\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"},{"@type":"Organization","@id":"https:\/\/jassweb.com\/solved\/#organization","name":"Jass Web","url":"https:\/\/jassweb.com\/solved\/","logo":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/","url":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","contentUrl":"https:\/\/jassweb.com\/wp-content\/uploads\/2021\/02\/jass-website-logo-1.png","width":693,"height":132,"caption":"Jass Web"},"image":{"@id":"https:\/\/jassweb.com\/solved\/#\/schema\/logo\/image\/"}},{"@type":"Person","@id":"https:\/\/jassweb.com\/solved\/#\/schema\/person\/65c9c7b7958150c0dc8371fa35dd7c31","name":"Kirat","image":{"@type":"ImageObject","inLanguage":"en-US","@id":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1777008400","url":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1777008400","contentUrl":"https:\/\/jassweb.com\/solved\/wp-content\/litespeed\/avatar\/1261af3c9451399fa1336d28b98ea3bb.jpg?ver=1777008400","caption":"Kirat"},"sameAs":["http:\/\/jassweb.com"],"url":"https:\/\/jassweb.com\/solved\/author\/jaspritsinghghumangmail-com\/"}]}},"_links":{"self":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/33601","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/comments?post=33601"}],"version-history":[{"count":0,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/posts\/33601\/revisions"}],"wp:attachment":[{"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/media?parent=33601"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/categories?post=33601"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/jassweb.com\/solved\/wp-json\/wp\/v2\/tags?post=33601"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}