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.

Sign up for GitHub

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

Update index.md #124

Merged
merged 2 commits into from
Jan 5, 2024
Merged

Update index.md #124

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
bde33fb
Update index.md
squenson1 Dec 25, 2023
57e8b0c
indegree -> in-degree.
rossbar Jan 5, 2024
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
6 changes: 3 additions & 3 deletions content/algorithms/dag/index.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -228,11 +228,11 @@ This procedure is implemented in the `topological_generations()` function, on wh

Let's see how the `topological_generations()` function is implemented in NetworkX step by step.

#### Step 1. Initialize indegrees.
#### Step 1. Initialize in-degrees.

Since in Kahn's algorithm we are only interested in the indegrees of the vertices,
Since in Kahn's algorithm we are only interested in the in-degrees of the vertices,
in order to preserve the structure of the graph as it is passed in,
instead of removing the edges, we will decrease the indegree of the corresponding vertex.
instead of removing the edges, we will decrease the in-degree of the corresponding vertex.
Therefore, we will save these values in a separate _dictionary_ `indegree_map`.

```
Expand Down
Loading