{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/shortest-path-distance-approximation-using","title":"Shortest path distance approximation using deep learning techniques","arxiv_id":"2002.05257","date":"2020-02-12","proceeding":null,"authors":["Fatemeh Salehi Rizi","Joerg Schloetterer","Michael Granitzer"],"abstract":"Computing shortest path distances between nodes lies at the heart of many graph algorithms and applications. Traditional exact methods such as breadth-first-search (BFS) do not scale up to contemporary, rapidly evolving today's massive networks. Therefore, it is required to find approximation methods to enable scalable graph processing with a significant speedup. In this paper, we utilize vector embeddings learnt by deep learning techniques to approximate the shortest paths distances in large graphs. We show that a feedforward neural network fed with embeddings can approximate distances with relatively low distortion error. The suggested method is evaluated on the Facebook, BlogCatalog, Youtube and Flickr social networks.","url_abs":"https://arxiv.org/abs/2002.05257v1","url_pdf":"https://arxiv.org/pdf/2002.05257v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"shortest-path-distance-approximation-using","repo_url":"https://github.com/nayash/shortest-distance-approx-deep-learning","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":{"status":"ok","spdx":"Apache-2.0"}}],"tasks":[{"task_slug":"deep-learning","task_name":"Deep Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2002.05257","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.05257"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/nayash/shortest-distance-approx-deep-learning","reach":{"status":"ok","spdx":"Apache-2.0"}}],"summary":{"unverified":5},"by_repo_kind":{"listed":{"samples":5,"ran":0,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":0,"samples":[{"code_sha256_prefix":"c71ec4f39a2bea7a","entry":"alias_draw","repo":"nayash/shortest-distance-approx-deep-learning","repo_kind":"listed","path":"src/node2vec/node2vec3.py","file_url":"https://github.com/nayash/shortest-distance-approx-deep-learning/blob/HEAD/src/node2vec/node2vec3.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"c71ec4f39a2bea7a"}},{"code_sha256_prefix":"0ddb0dd1cf3b67dd","entry":"alias_setup","repo":"nayash/shortest-distance-approx-deep-learning","repo_kind":"listed","path":"src/node2vec/node2vec3.py","file_url":"https://github.com/nayash/shortest-distance-approx-deep-learning/blob/HEAD/src/node2vec/node2vec3.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"0ddb0dd1cf3b67dd"}},{"code_sha256_prefix":"837f4f6252759989","entry":"cleanup_file_path","repo":"nayash/shortest-distance-approx-deep-learning","repo_kind":"listed","path":"src/utils.py","file_url":"https://github.com/nayash/shortest-distance-approx-deep-learning/blob/HEAD/src/utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"837f4f6252759989"}},{"code_sha256_prefix":"4ce03fc053708d03","entry":"dict_to_str","repo":"nayash/shortest-distance-approx-deep-learning","repo_kind":"listed","path":"src/utils.py","file_url":"https://github.com/nayash/shortest-distance-approx-deep-learning/blob/HEAD/src/utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"4ce03fc053708d03"}},{"code_sha256_prefix":"e86d3e61362917f7","entry":"seconds_to_minutes","repo":"nayash/shortest-distance-approx-deep-learning","repo_kind":"listed","path":"src/utils.py","file_url":"https://github.com/nayash/shortest-distance-approx-deep-learning/blob/HEAD/src/utils.py","link_basis":"harvester_set","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"mcp_get_code":{"code_sha256":"e86d3e61362917f7"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}