{"id":13425910,"url":"https://github.com/mrpandey/d3graphTheory","last_synced_at":"2025-03-15T20:31:33.753Z","repository":{"id":37752449,"uuid":"100203010","full_name":"mrpandey/d3graphTheory","owner":"mrpandey","description":":boom: Interactive and colorful :art: graph theory tutorials made using d3.js :zap:","archived":false,"fork":false,"pushed_at":"2023-10-22T18:18:02.000Z","size":1356,"stargazers_count":1788,"open_issues_count":4,"forks_count":167,"subscribers_count":50,"default_branch":"master","last_synced_at":"2025-03-08T13:26:52.692Z","etag":null,"topics":["algorithms","d3-visualization","d3js","graph-algorithms","graph-theory","javascript","mathematics"],"latest_commit_sha":null,"homepage":"https://d3gt.com","language":"JavaScript","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/mrpandey.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":"CONTRIBUTING.md","funding":".github/FUNDING.yml","license":"LICENSE","code_of_conduct":"CODE_OF_CONDUCT.md","threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":"ROADMAP.md","authors":null},"funding":{"github":null,"patreon":null,"open_collective":null,"ko_fi":null,"tidelift":null,"community_bridge":null,"liberapay":null,"issuehunt":null,"otechie":null,"lfx_crowdfunding":null,"custom":"https://www.paypal.com/paypalme/mrpandey/5usd"}},"created_at":"2017-08-13T20:33:11.000Z","updated_at":"2025-03-06T05:18:18.000Z","dependencies_parsed_at":"2024-01-14T16:09:32.170Z","dependency_job_id":"3e95f12c-02f5-42a0-bc58-f3578c53240d","html_url":"https://github.com/mrpandey/d3graphTheory","commit_stats":{"total_commits":160,"total_committers":10,"mean_commits":16.0,"dds":0.375,"last_synced_commit":"f943065f80e397ef9685c5aca384d3dc3c5ebc38"},"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mrpandey%2Fd3graphTheory","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mrpandey%2Fd3graphTheory/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mrpandey%2Fd3graphTheory/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mrpandey%2Fd3graphTheory/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mrpandey","download_url":"https://codeload.github.com/mrpandey/d3graphTheory/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":243790939,"owners_count":20348378,"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","d3-visualization","d3js","graph-algorithms","graph-theory","javascript","mathematics"],"created_at":"2024-07-31T00:01:21.861Z","updated_at":"2025-03-15T20:31:31.381Z","avatar_url":"https://github.com/mrpandey.png","language":"JavaScript","funding_links":["https://www.paypal.com/paypalme/mrpandey/5usd","https://www.paypal.me/mrpandey/"],"categories":["JavaScript"],"sub_categories":[],"readme":"\u003cp align=\"center\"\u003e\n  \u003cimg src=\"img/banner.png\" style=\"max-width:100%;\"\u003e\n\u003c/p\u003e\n\n# D3 Graph Theory\n\n[![Click to see the action](https://forthebadge.com/images/badges/check-it-out.svg)](https://d3gt.com/)\n\n[![Donate](https://img.shields.io/badge/%24-donate-orange.svg?style=flat-square)](https://www.paypal.me/mrpandey/)\n\n\u003e In mathematics, graph theory is the study of graphs, which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of vertices, nodes, or points which are connected by edges, arcs, or lines.\n\u003e -- \u003ccite\u003eWikipedia\u003c/cite\u003e\n\nD3 Graph Theory is a front-end project aimed at anyone who wants to learn graph theory. It provides a quick and interactive introduction to the subject. The visuals used in the project makes it an effective learning tool.\n\n## Topics Covered So Far\n\nThe whole content is broken in several units. So far these units have been added.\n\n| Table | Of | Contents |\n| --- | --- | --- |\n|1. [Vertices and Edges](https://d3gt.com/unit.html?vertices-and-edges)|2. [Order and Size of a Graph](https://d3gt.com/unit.html?order-and-size)|3. [Degree of a Vertex](https://d3gt.com/unit.html?degree-of-vertex)|\n|4. [Degree Sequence of a Graph](https://d3gt.com/unit.html?degree-sequence)|5. [Graphic Sequence](https://d3gt.com/unit.html?graphic-sequence)|6. [Havel-Hakimi Algorithm](https://d3gt.com/unit.html?havel-hakimi)|\n|7. [Pigeonhole Principle](https://d3gt.com/unit.html?pigeonhole)|8. [Regular Graph](https://d3gt.com/unit.html?regular-graph)|9. [Complete Graph](https://d3gt.com/unit.html?complete-graph)|\n|10. [Bipartite Graph](https://d3gt.com/unit.html?bipartite)|11. [Complete Bipartite Graph](https://d3gt.com/unit.html?complete-bipartite)|12. [Walk](https://d3gt.com/unit.html?walk)|\n|13. [Open vs Closed Walks](https://d3gt.com/unit.html?open-vs-closed)|14. [Connectivity](https://d3gt.com/unit.html?connectivity)|15. [Eulerian Circuit](https://d3gt.com/unit.html?eulerian-circuit)|\n|16. [Eulerian Trail](https://d3gt.com/unit.html?eulerian-trail)|17. [Graph Coloring](https://d3gt.com/unit.html?graph-coloring)|18. [k-Colorable Graph](https://d3gt.com/unit.html?k-colorable)|\n|19. [Chromatic Number](https://d3gt.com/unit.html?chromatic-number)|20. [Trees](https://d3gt.com/unit.html?trees)|21. [Rooted Trees](https://d3gt.com/unit.html?rooted-trees)|\n|22. [Spanning Tree of a Graph](https://d3gt.com/unit.html?spanning-tree)|\n\nThe project is still expanding. New topics are added from time to time.\n\n## Upcoming Topics\n\nThese topics are planned to be added.\n\n- [ ] Planar Graphs\n- [x] Chromatic Number\n- [x] Trees\n- [x] Rooted Trees\n- [x] Spanning Tree\n- [ ] Prim's Algorithm\n- [ ] Kruskal's Algorithm\n\nSo, keep checking for updates. :smile:\n\n## Attributions\n\nThis project is built with the help of following libraries and projects.\n\n* [D3.js](https://github.com/d3/d3)\n* [MathJax](https://github.com/mathjax/MathJax)\n* [JQuery](https://github.com/jquery/jquery)\n* [Bootstrap](https://github.com/twbs/bootstrap)\n* [Modal Logic Playground](https://github.com/rkirsling/modallogic)\n* [Havel-Hakimi](https://github.com/jacquerie/hh)\n* [iconsanscoffee.com](http://iconsandcoffee.com/)\n* [GitHub Buttons](https://ghbtns.com/)\n\n## License\n\nCopyright (c) 2017 [Avinash Pandey](http://mrpandey.com). Licensed under [MIT License](https://github.com/mrpandey/d3graphTheory/blob/master/LICENSE).\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmrpandey%2Fd3graphTheory","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmrpandey%2Fd3graphTheory","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmrpandey%2Fd3graphTheory/lists"}