{"id":19463681,"url":"https://github.com/4s4v1n/simple-navigator","last_synced_at":"2026-06-07T21:32:10.654Z","repository":{"id":143557755,"uuid":"544672323","full_name":"4s4v1n/Simple-Navigator","owner":"4s4v1n","description":"Algorithms on graphs","archived":false,"fork":false,"pushed_at":"2022-10-03T04:15:35.000Z","size":35,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-01-08T03:11:02.246Z","etag":null,"topics":["algorithms","ant-algorithm","cpp","graph","prime-algortihm","salesman-problem"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/4s4v1n.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null}},"created_at":"2022-10-03T02:41:23.000Z","updated_at":"2022-10-03T04:19:52.000Z","dependencies_parsed_at":"2023-10-21T16:21:34.970Z","dependency_job_id":null,"html_url":"https://github.com/4s4v1n/Simple-Navigator","commit_stats":null,"previous_names":["4s4v1n/simple-navigator"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/4s4v1n%2FSimple-Navigator","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/4s4v1n%2FSimple-Navigator/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/4s4v1n%2FSimple-Navigator/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/4s4v1n%2FSimple-Navigator/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/4s4v1n","download_url":"https://codeload.github.com/4s4v1n/Simple-Navigator/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":240672824,"owners_count":19838930,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["algorithms","ant-algorithm","cpp","graph","prime-algortihm","salesman-problem"],"created_at":"2024-11-10T18:11:47.635Z","updated_at":"2025-02-25T12:53:14.604Z","avatar_url":"https://github.com/4s4v1n.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Simple navigator\n\n![logo](./images/graph.svg)\n\n## Content\n\nThe project implements graphical and popular algorithms on graphs, namely:\n\n1) Search in Europe.\n2) Search in search.\n3) Finding the shortest path between two vertices.\n4) Finding the shortest path among all pairs of vertices.\n5) Finding the minimum spanning tree.\n6) Solving the Salesman problem.\n\nThere is a common console interface that is not contained in the view.\n\nTo build and run from the project center:\n``` bash\ncd src \u0026\u0026 do everything\n```\n\nTo clear a project:\n``` bash\ncd src \u0026\u0026 clear\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2F4s4v1n%2Fsimple-navigator","html_url":"https://awesome.ecosyste.ms/projects/github.com%2F4s4v1n%2Fsimple-navigator","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2F4s4v1n%2Fsimple-navigator/lists"}