{"id":22153197,"url":"https://github.com/dpetrosy/saed_graph_project","last_synced_at":"2025-03-24T13:42:26.006Z","repository":{"id":213260039,"uuid":"501392184","full_name":"dpetrosy/SAED_graph_project","owner":"dpetrosy","description":"In this repository, I store my course project about graph theory, which I've done during my university education.","archived":false,"fork":false,"pushed_at":"2024-02-05T14:07:04.000Z","size":620,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-29T18:46:40.377Z","etag":null,"topics":["algorithms","console-application","course-work","cpp","cpp11","data-structures","graph","graph-algorithms","graph-theory","graph-visualization","problem-solving","spanning-tree","tree","university-project"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/dpetrosy.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,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2022-06-08T19:55:46.000Z","updated_at":"2024-02-05T14:13:31.000Z","dependencies_parsed_at":"2024-01-13T09:11:21.112Z","dependency_job_id":"52fb4cd9-3a8c-413d-86c9-29e9cd59669e","html_url":"https://github.com/dpetrosy/SAED_graph_project","commit_stats":null,"previous_names":["dpetrosy/graph_course_project","dpetrosy/saed_graph_project"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dpetrosy%2FSAED_graph_project","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dpetrosy%2FSAED_graph_project/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dpetrosy%2FSAED_graph_project/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dpetrosy%2FSAED_graph_project/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/dpetrosy","download_url":"https://codeload.github.com/dpetrosy/SAED_graph_project/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245283856,"owners_count":20590299,"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","console-application","course-work","cpp","cpp11","data-structures","graph","graph-algorithms","graph-theory","graph-visualization","problem-solving","spanning-tree","tree","university-project"],"created_at":"2024-12-02T01:17:29.880Z","updated_at":"2025-03-24T13:42:25.981Z","avatar_url":"https://github.com/dpetrosy.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"## 📜 About Project\n\n**SAED** stands for Synopsys Armenia Educational Department, the university where I received my bachelor's degree. \\\nThis project is course work that I have done during SAED's discrete mathematics course. \\\nThe program finds a spanning tree in the user's inputted graph. \\\nFor program-correct work, you must have [Graphviz](https://graphviz.org/) on your computer.\n\n## 📶 Program Work Steps:\n\n1. Get graph edges by reading the input file \u0026nbsp;`input.txt`\n2. Build an adjacency matrix for the given graph.\n3. By using the adjacency matrix, make a simple graph from the given graph.\n4. Check if the simple graph is connected or not, because a given graph must be connected.\n5. If the graph is connected, find the spanning tree using the DFS algorithm.\n6. Visualize the inputted graph and the spanning tree with Graphviz. \\\n[Input example](README_files/input_example.txt) \u0026nbsp;\u0026nbsp;\u0026nbsp;\u0026nbsp; [Output example](README_files/output_example.jpg)\n\n## 👨‍💻 Getting Started\n\n1. Start by updating the packages list: \u0026nbsp;`sudo apt update`\n2. Install the G++ compiler if you don't have: \u0026nbsp;`sudo apt install build-essential`\n3. Check installation with the command: \u0026nbsp;`g++ --version`\n4. Make must be installed with the build-essential package; check it: \u0026nbsp;`make --version`\n5. Install the make package if you don't have: \u0026nbsp;`sudo apt install make`\n6. Install Graphviz if you don't have: \u0026nbsp;`sudo apt install graphviz`\n7. Check installation with the command: \u0026nbsp;`dot -V`\n8. Clone this repo: \u0026nbsp;`git clone https://github.com/dpetrosy/SAED_graph_project.git`\n9. Go to directory: \u0026nbsp;`cd graph_course_project`\n10. Run the make and build program: \u0026nbsp;`make`\n11. Run executable: \u0026nbsp;`./graph.exe`\n\nCongrats! Now you can see your inputted graph and found the spanning tree :) \\\nYou can change the `input.txt` file and see how the program works 😎\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdpetrosy%2Fsaed_graph_project","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdpetrosy%2Fsaed_graph_project","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdpetrosy%2Fsaed_graph_project/lists"}