1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
|
Mentored Projects
==================
This page maintains a list of mentored project ideas that contributors can work
on if they are interested in contributing to the NetworkX project. Feel free to
suggest any other idea if you are interested on the
`NetworkX GitHub discussions page <https://github.com/networkx/networkx/discussions>`__
These ideas can be used as projects for Google Summer of Code, Outreachy,
NumFOCUS Small Development Grants and university course/project credits (if
your university allows contribution to open source for credit).
Pedagogical Interactive Notebooks for Algorithms Implemented in NetworkX
------------------------------------------------------------------------
- Abstract: NetworkX has a :ref:`wide variety of algorithms <Algorithms>`
implemented. Even though the algorithms are well documented, explanations of
the ideas behind the algorithms are often missing and we would like to
collect these, write Jupyter notebooks to elucidate these ideas and explore
the algorithms experimentally, and publish the notebooks at
https://github.com/networkx/notebooks. The goal is to gives readers a
deeper outlook behind standard network science and graph theory algorithms
and encourage them to delve further into the topic.
- Recommended Skills: Python, Jupyter notebooks, graph algorithms.
- Expected Outcome: A collection of Interactive Jupyter notebooks which
explain and explore network algorithms to readers and users of NetworkX.
For example, see this notebook on
:doc:`Geometric Generator Models <nx-guides:content/generators/geometric>`
- Complexity: Depending on the algorithms you are interested to work on.
- Interested Mentors: `@MridulS <https://github.com/MridulS/>`__,
`@rossbar <https://github.com/rossbar/>`__
- Expected time commitment: This project can be either a medium project (~175 hours)
or a large project (~350 hours). The contributor is expected to contribute 2-3
pedagogical interactive notebooks for the medium duration project and 4-5 notebooks
for the long duration project.
Visualization API with Matplotlib
---------------------------------
- Abstract: NetworkX has some basic drawing tools that use Matplotlib to render the
images. The API hasn't changed while Matplotlib has changed. Also we have added or
are trying to add new features especially with regard to plotting edges. We'd like
someone to read a lot about what we offer and also what Matplotlib offers, and
come up with a nice way for users to draw graphs flexibly and yet with good defaults.
There is little chance just a broad topic could be completed in one summer, but a
roadmap and substantial headway on that road is possible.
- Recommended Skills: Python, matplotlib experience.
- Expected Outcome: A roadmap for a refined API for the matplotlib tools within NetworkX
as well as code in the form of PR(s) which implement (part of) that API with tests.
- Interested Mentors: `@dschult <https://github.com/dschult/>`__,
`@rossbar <https://github.com/rossbar/>`__
- Expected time commitment: This project will be a full time 10 week project (~350 hrs).
Incorporate a Python library for ISMAGs isomorphism calculations
----------------------------------------------------------------
- Abstract: A team from Sandia Labs has converted the original java implementation of
the ISMAGS isomorphism routines to Python. They have invited us to incorporate that
code into NetworkX if we are interested. We'd like someone to learn the ISMAGS code
we currently provide, and the code from this new library and figure out what the
best combination is to include in NetworkX moving forward. That could be two separate
subpackages of tools, or more likely a combination of the two sets of code, or a
third incantation that combines good features from each.
- Recommended Skills: Python, graph algorithms.
- Expected Outcome: A plan for how to best incorporate ISMAGS into NetworkX along
with code to do that incorporation.
- Interested Mentors: `@dschult <https://github.com/dschult/>`__,
`@rossbar <https://github.com/rossbar/>`__
- Expected time commitment: This project will be a full time 10 week project (~350 hrs).
Centrality Atlas
----------------
- Abstract: The goal of this project would be to produce a comprehensive review
of network centrality measures.
Centrality is a central concept in network science and has many applications
across domains. NetworkX provides many functions for measuring
various types of :doc:`network centrality</reference/algorithms/centrality>`.
The individual centrality functions are typically well-described by their
docstrings (though there's always room for improvement!); however, there
currently is no big-picture overview of centrality.
Furthermore, many of the centrality measures are closely related, but there is
no documentation that describes these relationships.
- Recommended Skills: Python, literature review, technical writing
- Expected Outcome: An executable document that provides an overview and applications
of network centrality measures. Potential outputs include (but are not limited
to): an article for ``nx-guides`` (see above) and/or an example gallery for centrality
measures.
- Interested Mentors: `@dschult <https://github.com/dschult/>`__,
`@rossbar <https://github.com/rossbar/>`__
- Expected time commitment: Variable, though a high-quality review article would
be expected to take several months of dedicated research (~350 hours).
Completed Projects
==================
- `Revisiting and expanding nx-parallel`_
- Program: Google Summer of Code 2024
- Contributor: `@Schefflera-Arboricola <https://github.com/Schefflera-Arboricola>`__
- Link to Proposal: `GSoC 2024: Revisiting and expanding nx-parallel <https://github.com/networkx/archive/blob/main/proposals-gsoc/GSoC-2024-Revisiting-and-expanding-nx-parallel.pdf>`_
- `VF2++ algorithm for graph isomorphism`_
- Program: Google Summer of Code 2022
- Contributor: `@kpetridis24 <https://github.com/kpetridis24/>`__
- Link to Proposal: `GSoC 2022: VF2++ Algorithm <https://github.com/networkx/archive/blob/main/proposals-gsoc/GSoC-2022-VF2plusplus-isomorphism.pdf>`_
- `Louvain community detection algorithm`_
- Program: Google Summer of Code 2021
- Contributor: `@z3y50n <https://github.com/z3y50n/>`__
- Link to Proposal: `GSoC 2021: Community Detection Algorithms <https://github.com/networkx/archive/blob/main/proposals-gsoc/GSoC-2021-Community-Detection-Algorithms.pdf>`__
- `Asadpour algorithm for directed travelling salesman problem`_
- Program: Google Summer of Code 2021
- Contributor: `@mjschwenne <https://github.com/mjschwenne/>`__
- Link to Proposal: `GSoC 2021: Asadpour algorithm <https://github.com/networkx/archive/blob/main/proposals-gsoc/GSoC-2021-Asadpour-Asymmetric-Traveling%20Salesman-Problem.pdf>`__
- Pedagogical notebook: `Directed acyclic graphs and topological sort`_
- Program: Google Summer of Code 2021
- Contributor: `@vdshk <https://github.com/vdshk>`__
- Pedagogical notebooks: `Graph assortativity`_ & `Network flow analysis and Dinitz algorithm`_
- Program: Google Summer of Code 2021
- Contributor: `@harshal-dupare <https://github.com/harshal-dupare/>`__
- Add On system for NetworkX: `NetworkX-Metis`_
- Program: Google Summer of Code 2015
- Contributor: `@OrkoHunter <https://github.com/OrkoHunter/>`__
- Link to Proposal: `GSoC 2015: Add On System for NetworkX <https://github.com/networkx/archive/blob/main/proposals-gsoc/GSoC-2015-Add-on-system-for-NetworkX.md>`__
- `NetworkX 2.0 API`_
- Program: Google Summer of Code 2015
- Contributor: `@MridulS <https://github.com/MridulS/>`__
- Link to Proposal: `GSoC 2015: NetworkX 2.0 API <https://github.com/networkx/archive/blob/main/proposals-gsoc/GSoC-2015-NetworkX-2.0-api.md>`__
.. _`Revisiting and expanding nx-parallel`: https://github.com/Schefflera-Arboricola/blogs/tree/main/networkx/GSoC24
.. _`VF2++ algorithm for graph isomorphism`: https://github.com/networkx/networkx/pull/5788
.. _`Louvain community detection algorithm`: https://github.com/networkx/networkx/pull/4929
.. _`Asadpour algorithm for directed travelling salesman problem`: https://github.com/networkx/networkx/pull/4740
.. _`Directed acyclic graphs and topological sort`: https://github.com/networkx/nx-guides/pull/44
.. _`Graph assortativity`: https://github.com/networkx/nx-guides/pull/42
.. _`Network flow analysis and Dinitz algorithm`: https://github.com/networkx/nx-guides/pull/46
.. _`NetworkX-Metis`: https://github.com/networkx/networkx-metis
.. _`NetworkX 2.0 API`: https://networkx.org/documentation/latest/release/migration_guide_from_1.x_to_2.0.html
..
Project Idea Template
---------------------
- Abstract:
- Recommended Skills:
- Expected Outcome:
- Complexity;
- Interested Mentors:
|
