{"id":22376750,"url":"https://github.com/benami171/system_programming2_exe1","last_synced_at":"2026-02-16T04:36:18.401Z","repository":{"id":237689441,"uuid":"795053751","full_name":"benami171/System_Programming2_Exe1","owner":"benami171","description":"Algorithms and Operations on Graphs.","archived":false,"fork":false,"pushed_at":"2024-07-18T17:02:14.000Z","size":2031,"stargazers_count":2,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-06-17T21:45:55.454Z","etag":null,"topics":["bipartite-graphs","cpp","graph","graph-algorithms","negative-cycles","shortest-path-algorithm"],"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/benami171.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-05-02T13:46:47.000Z","updated_at":"2024-07-18T17:02:17.000Z","dependencies_parsed_at":"2024-07-18T20:05:00.957Z","dependency_job_id":null,"html_url":"https://github.com/benami171/System_Programming2_Exe1","commit_stats":null,"previous_names":["benami171/system_programming2_exe1"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/benami171/System_Programming2_Exe1","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/benami171%2FSystem_Programming2_Exe1","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/benami171%2FSystem_Programming2_Exe1/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/benami171%2FSystem_Programming2_Exe1/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/benami171%2FSystem_Programming2_Exe1/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/benami171","download_url":"https://codeload.github.com/benami171/System_Programming2_Exe1/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/benami171%2FSystem_Programming2_Exe1/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":29500535,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-02-16T03:57:51.541Z","status":"ssl_error","status_checked_at":"2026-02-16T03:55:59.854Z","response_time":115,"last_error":"SSL_connect returned=1 errno=0 peeraddr=140.82.121.6:443 state=error: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"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":["bipartite-graphs","cpp","graph","graph-algorithms","negative-cycles","shortest-path-algorithm"],"created_at":"2024-12-04T22:11:14.302Z","updated_at":"2026-02-16T04:36:18.378Z","avatar_url":"https://github.com/benami171.png","language":"C++","readme":"# Graph Algorithms Project\n\n- This project implements various graph algorithms in C++. The algorithms are implemented in the `Algorithms` class and are used to perform operations on instances of the `Graph` class.\n- The graph is undirected by default in the constructor, if we want to state that the graph is directed we will type `Graph g(true);` or use the `setIsDirected` method in Graph.cpp\n\n## Algorithms Implemented\n\n- `isConnected(Graph graph)`: Checks if theres a vertex that can reach all other vertices.\n- `shortestPath(Graph\u0026 graph, int start, int end)`: Finds the shortest path between two vertices using BFS, Dijkstra or Bellman-Ford algorithm, will return the path or No path found.\n- `isContainsCycle(Graph\u0026 graph)`: Checks if the graph contains a cycle using DFS, returns any cycle there is, \"0\" if there isnt.\n- `findCycle(Graph\u0026 graph)`: A helper function to find a cycle in the graph.\n- `isBipartite(Graph\u0026 graph)`: Checks if the graph is bipartite, if so, it will return the two sets.\n- `negativeCycle(Graph\u0026 graph)`: Checks if the graph contains a negative cycle and returns \"Negative cycle detected\" if there is one, and \"Graph does not contain a negative cycle\" otherwise.\n\n## How to Run\n\nThe project includes a Makefile for easy compilation and running of the code. Here are some commands you can use:\n\n- `make run`: Compiles the code and runs the demo.\n- `make demo`: Compiles the code for the demo.\n- `make test`: Compiles the code for the tests.\n- `make tidy`: Runs clang-tidy on the source files to check for code quality issues.\n- `make valgrind`: Runs valgrind on the demo and test executables to check for memory leaks.\n- `make clean`: Removes all compiled files.\n\n## Testing\n\nThe project includes a test file that contains a lot of tests to check the algorithms on directed/undirected graphs\nwith negative weights/no weights/positive weights.\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbenami171%2Fsystem_programming2_exe1","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbenami171%2Fsystem_programming2_exe1","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbenami171%2Fsystem_programming2_exe1/lists"}