We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
The length of the shortest path between nodes 12 and 15 in the Karate network should be:
len(networkx.shortest_path(Graph_Karate, 12, 15)) - 1
because the output of shortest_path includes both the starting and ending nodes. However, the notebooks Introduction_to_Networks_Karate.ipynb and Introduction_to_Networks_clean.ipynb show, instead:
shortest_path
len(networkx.shortest_path(Graph_Karate, 12,15))
The text was updated successfully, but these errors were encountered:
No branches or pull requests
The length of the shortest path between nodes 12 and 15 in the Karate network should be:
because the output of
shortest_path
includes both the starting and ending nodes. However, the notebooks Introduction_to_Networks_Karate.ipynb and Introduction_to_Networks_clean.ipynb show, instead:The text was updated successfully, but these errors were encountered: