{"id":20139467,"url":"https://github.com/v3ssel/graph_algorithms","last_synced_at":"2025-03-02T23:17:23.791Z","repository":{"id":230360395,"uuid":"779163575","full_name":"v3ssel/graph_algorithms","owner":"v3ssel","description":"Collection of graph algorithms. Graph is based on adjacency matrix.","archived":false,"fork":false,"pushed_at":"2024-03-29T11:05:20.000Z","size":1380,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"develop","last_synced_at":"2025-01-13T10:11:43.377Z","etag":null,"topics":["ant-colony-algorithm","bfs","branches-and-bounds","cpp","dfs","dijkstra-shortest-path","floyd-warshall-algorithm","genetic-algorithm","prim-algorithm","traveling-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":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/v3ssel.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-03-29T07:20:52.000Z","updated_at":"2024-03-29T08:34:55.000Z","dependencies_parsed_at":"2024-03-29T09:23:32.366Z","dependency_job_id":"8bf3e346-315c-4461-bd95-5497fc793ffe","html_url":"https://github.com/v3ssel/graph_algorithms","commit_stats":null,"previous_names":["v3ssel/graph_algorithms"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/v3ssel%2Fgraph_algorithms","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/v3ssel%2Fgraph_algorithms/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/v3ssel%2Fgraph_algorithms/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/v3ssel%2Fgraph_algorithms/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/v3ssel","download_url":"https://codeload.github.com/v3ssel/graph_algorithms/tar.gz/refs/heads/develop","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241582556,"owners_count":19985846,"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":["ant-colony-algorithm","bfs","branches-and-bounds","cpp","dfs","dijkstra-shortest-path","floyd-warshall-algorithm","genetic-algorithm","prim-algorithm","traveling-salesman-problem"],"created_at":"2024-11-13T21:45:38.624Z","updated_at":"2025-03-02T23:17:23.770Z","avatar_url":"https://github.com/v3ssel.png","language":"C++","readme":"# Collection of Graph algorithms\nGraph is implemented in adjacency matrix format, like:\n```\nSIZE\nM A T\nR I X\n* * *\n```\n```\n3\n0 2 4\n3 0 2\n7 9 0\n```\nYou can find example files in `src/assets` directory.\n\n# Collection list\nFor now there are 8 algorithms and some graph operations:\n\nIn `graph.h` you can:\n* Load graph from adjacency matrix\n* Export graph as adjacency matrix\n* Export graph in DOT format\n\nIn `graph_algorithms.h` implemented:\n* Depth First Search\n* Bread First Search\n* Dijkstra algorithm for finding shortest path.\n* Floyd-Warshall algorithm for finding shortest path between all vertices.\n* Prim algorithm for finding least spanning tree.\n\nAnd there are 3 traveling salesman problem solving algorithms in `src/graph/TSM` directory:\n* Ant Colony Optimization algorithm\n* Genetic Algorithm\n* Branches and Bounds algorithm\n\n# Console Interface\n\nIn addition, there are implemented console interface.\n\nFor building use:\n```\nmake install\n```\nor\n```\ncmake . -B build \u0026\u0026 \\\ncmake --build build --target GraphApplication --config=Release\n```\n\nand launch:\n```\n./GraphApplication\n```\n\n# Library\nYou can build a static library only.\n\nFor building only graph, use:\n```\nmake graph.a\n```\n\nFor build with algorithms, use:\n```\nmake graph_algorithms.a\n```\n\nOr you can use cmake directly, see `src/Makefile`\n\n# Tests\nThere are some tests for these algorithms.\nYou can build and run them to check everything is fine.\n\nFor building use:\n```\nmake tests\n```\nor\n```\ncmake . -B build \u0026\u0026 \\\ncmake --build build --target GraphTests --config=Release\n```\n\nand launch:\n```\n./GraphTests\n```\n\n### Note: Tests using src/assets files, make sure they are not edited.\n\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fv3ssel%2Fgraph_algorithms","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fv3ssel%2Fgraph_algorithms","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fv3ssel%2Fgraph_algorithms/lists"}