Skip to content

docs: document negative/infinite order neighborhood #815

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

Merged
ntamas merged 2 commits into from
Mar 21, 2025
+5 −3
Merged

docs: document negative/infinite order neighborhood #815

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
47387e6
docs: document negative/infinite order neighborhood
szhorvat Mar 12, 2025
fe3f23b
chore: update C core
szhorvat Mar 12, 2025
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: 4 additions & 2 deletions src/_igraph/graphobject.c
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -15854,7 +15854,8 @@ struct PyMethodDef igraphmodule_Graph_methods[] = {
"@param vertices: a single vertex ID or a list of vertex IDs, or\n"
" C{None} meaning all the vertices in the graph.\n"
"@param order: the order of the neighborhood, i.e. the maximum number of\n"
" steps to take from the seed vertex.\n"
" steps to take from the seed vertex. Negative values are interpreted as\n"
" an infinite order, i.e. no limit on the number of steps.\n"
"@param mode: specifies how to take into account the direction of\n"
" the edges if a directed graph is analyzed. C{\"out\"} means that\n"
" only the outgoing edges are followed, so all vertices reachable\n"
Expand Down Expand Up @@ -15882,7 +15883,8 @@ struct PyMethodDef igraphmodule_Graph_methods[] = {
"@param vertices: a single vertex ID or a list of vertex IDs, or\n"
" C{None} meaning all the vertices in the graph.\n"
"@param order: the order of the neighborhood, i.e. the maximum number of\n"
" steps to take from the seed vertex.\n"
" steps to take from the seed vertex. Negative values are interpreted as\n"
" an infinite order, i.e. no limit on the number of steps.\n"
"@param mode: specifies how to take into account the direction of\n"
" the edges if a directed graph is analyzed. C{\"out\"} means that\n"
" only the outgoing edges are followed, so all vertices reachable\n"
Expand Down
2 changes: 1 addition & 1 deletion vendor/source/igraph
Open in desktop
Submodule igraph updated 257 files
Loading