Skip to main navigation Skip to search Skip to main content

Contributed a module for constructing Harary graph to the NetworkX library

Activity: Other

Description

I implemented a Python module for generating a Harary Graph, which is an important type of graph that maximizes node connectivity with given number of edges.
This module became part of NetworkX, a well-received Python package for studying Complex Networks in 2019.

The usage and documentation of this module can be found at https://networkx.org/documentation/stable/reference/index.html.
PeriodJan 2019Oct 2019
Degree of RecognitionInternational