{"id":22616184,"url":"https://github.com/blargian/bgl","last_synced_at":"2025-03-29T00:43:40.474Z","repository":{"id":211452951,"uuid":"729160495","full_name":"Blargian/BGL","owner":"Blargian","description":"Repository with code for learning how to use the Boost Graph Library ","archived":false,"fork":false,"pushed_at":"2023-12-12T19:14:54.000Z","size":33,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-03T10:46:32.716Z","etag":null,"topics":["bgl","boost-graph","boost-graph-library","contributions-welcome","example-code","examples","graph","graphs","helpwanted","learning-boost","learning-exercise","opensource-projects"],"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/Blargian.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":"2023-12-08T15:01:36.000Z","updated_at":"2023-12-11T18:34:50.000Z","dependencies_parsed_at":"2023-12-11T19:30:32.079Z","dependency_job_id":"caea28be-3c92-429c-885d-45539bd1c8fa","html_url":"https://github.com/Blargian/BGL","commit_stats":null,"previous_names":["blargian/bgl"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Blargian%2FBGL","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Blargian%2FBGL/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Blargian%2FBGL/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Blargian%2FBGL/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Blargian","download_url":"https://codeload.github.com/Blargian/BGL/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246122244,"owners_count":20726822,"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":["bgl","boost-graph","boost-graph-library","contributions-welcome","example-code","examples","graph","graphs","helpwanted","learning-boost","learning-exercise","opensource-projects"],"created_at":"2024-12-08T19:11:28.416Z","updated_at":"2025-03-29T00:43:40.454Z","avatar_url":"https://github.com/Blargian.png","language":"C++","readme":"# Learning Boost Graph Library 💡\n\nThis is an opensource project with the aim of creating a repository with useful notes and code examples for learning the Boost Graph Library. BGL is an incredible piece of C++ design, which strives for genericity. Unfortunately this genericity can sometimes make it feel a little challenging to pick up. This project is aimed at lowering the barrier to entry for new comers to BGL. [Contributions](/doc/setup_instructions.md) are welcome, let's learn together!   \n\n\u003ctable\u003e\n\u003cthead\u003e\n  \u003ctr\u003e\n    \u003cth\u003eFile\u003c/th\u003e\n    \u003cth\u003eDescription\u003c/th\u003e\n  \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n  \u003ctr\u003e\n    \u003ctd\u003ekevin-bacon.cpp\u003c/td\u003e\n    \u003ctd\u003eAn example which uses breadth-first search to find the bacon number of actors. (six degrees of Kevin Bacon problem) taken from the BGL book.\u003c/td\u003e\n  \u003c/tr\u003e\n  \u003ctr\u003e\n    \u003ctd\u003ekruskal.cpp\u003c/td\u003e\n    \u003ctd\u003eA basic example of how to use Kruskals algorithm to find the MST. Taken from BGL library examples.\u003c/td\u003e\n  \u003c/tr\u003e\n  \u003ctr\u003e\n    \u003ctd\u003etiny-ewg.cpp\u003c/td\u003e\n    \u003ctd\u003eReads in data from a textfile, creates a graph out of it and then finds the minimum spanning tree using Kruskal's algorithm\u003c/td\u003e\n  \u003c/tr\u003e\n  \u003ctr\u003e\n    \u003ctd\u003etiny-ewg-improved.cpp\u003c/td\u003e\n    \u003ctd\u003eExample by user sehe on stackexchange which makes some simplifications and improvements to the tiny-ewg example\u003c/td\u003e\n  \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\nInstructions to get the project working on your local machine can be found [here](/doc/setup_instructions.md)\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fblargian%2Fbgl","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fblargian%2Fbgl","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fblargian%2Fbgl/lists"}