Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Read through the NetworkX tutorial and create a python script #5

Open
MridulS opened this issue Mar 28, 2022 · 4 comments
Open

Read through the NetworkX tutorial and create a python script #5

MridulS opened this issue Mar 28, 2022 · 4 comments

Comments

@MridulS
Copy link
Member

MridulS commented Mar 28, 2022

[Everyone can do this task. There is no need to claim/assign this issue]

Please follow our introductory tutorial once you have installed networkx on your machine. This will give applicants a better overview of our codebase and API, which will help the applicant create a strong application.

Once you have gone through the tutorial create a python script (nx_tutorial_script.py) that perform the following operations

  • Create a NetworkX DiGraph graph object
  • Add nodes of multiple types to this graph object, at least one node of each type int, str, tuple. (Maximum 10 nodes)
  • Add multiple edges between these nodes
  • Find the shortest path between all pairs of nodes in this graph and print them.
  • Plot the graph using networkx.draw

Add this file to your folder created in the first task and push the changes to github.

Create a pull request against this repository and add the file 2023-round-2/<your-github-username>/nx_tutorial_script.py with the python script which performs all the operations above.

@peacelovingng

This comment was marked as outdated.

@Sreeyusha

This comment was marked as resolved.

@devotuoma

This comment was marked as resolved.

@Schefflera-Arboricola
Copy link
Member

Hi, A while ago I created this library of resources in which I implemented various social computing models using Networkx and created notes on the same. I thought it could help if you'd like to explore more of Networkx.

Thank you :)

unna97 added a commit to unna97/outreachy that referenced this issue Oct 4, 2023
- Create a NetworkX DiGraph graph object
- Add nodes of multiple types to this graph object, at least one node of each type int, str, tuple. (Maximum 10 nodes)
- Add multiple edges between these nodes
- Find the shortest path between all pairs of nodes in this graph and print them.
- Plot the graph using networkx.draw

Solves: Read through the NetworkX tutorial and create a python script networkx#5
MridulS added a commit that referenced this issue Oct 6, 2023
Read through the NetworkX tutorial and create a python script #5
khushishikhu added a commit to khushishikhu/outreachy that referenced this issue Oct 10, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Development

No branches or pull requests

5 participants