# mrpandey/d3graphTheory

:boom: Interactive and colorful :art: graph theory tutorials made using d3.js :zap:

repo name | mrpandey/d3graphTheory |

repo link | https://github.com/mrpandey/d3graphTheory |

homepage | https://d3gt.com |

language | JavaScript |

size (curr.) | 1430 kB |

stars (curr.) | 1182 |

created | 2017-08-13 |

license | MIT License |

# D3 Graph Theory

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. – Wikipedia

D3 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.

## Topics Covered So Far

The whole content is broken in several units. So far these units have been added.

Table | Of | Contents |
---|---|---|

1. Vertices and Edges | 2. Order and Size of a Graph | 3. Degree of a Vertex |

4. Degree Sequence of a Graph | 5. Graphic Sequence | 6. Havel-Hakimi Algorithm |

7. Pigeonhole Principle | 8. Regular Graph | 9. Complete Graph |

10. Bipartite Graph | 11. Complete Bipartite Graph | 12. Walk |

13. Open vs Closed Walks | 14. Connectivity | 15. Eulerian Circuit |

16. Eulerian Trail | 17. Graph Coloring | 18. k-Colorable Graph |

19. Chromatic Number | 20. Trees | 21. Rooted Trees |

22. Spanning Tree of a Graph |

The project is still expanding. New topics are added from time to time.

## Upcoming Topics

These topics are planned to be added.

- Planar Graphs
- Chromatic Number
- Trees
- Rooted Trees
- Spanning Tree
- Prim’s Algorithm
- Kruskal’s Algorithm

So, keep checking for updates. :smile:

## Attributions

This project is built with the help of following libraries and projects.

- D3.js
- MathJax
- JQuery
- Bootstrap
- Modal Logic Playground
- Havel-Hakimi
- iconsanscoffee.com
- GitHub Buttons

## License

Copyright (c) 2017 Avinash Pandey. Licensed under MIT License.