Skip to content

harmonic estimaton endpoints #894

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
merged 1 commit into from
Jun 4, 2025
Merged

harmonic estimaton endpoints #894

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
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
32 changes: 32 additions & 0 deletions doc/sphinx/algorithms.json
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1534,6 +1534,14 @@
},
"description": "Harmonic centrality is a way of detecting nodes that are able to spread information\nvery efficiently through a graph."
},
{
"function": {
"name": "gds.closeness.harmonic.mutate.estimate",
"signature": "G: Graph, **config: Any",
"return_type": "Series[Any]"
},
"description": "Returns an estimation of the memory consumption for that procedure."
},
{
"function": {
"name": "gds.closeness.harmonic.stats",
Expand All @@ -1542,6 +1550,14 @@
},
"description": "Harmonic centrality is a way of detecting nodes that are able to spread information\nvery efficiently through a graph."
},
{
"function": {
"name": "gds.closeness.harmonic.stats.estimate",
"signature": "G: Graph, **config: Any",
"return_type": "Series[Any]"
},
"description": "Returns an estimation of the memory consumption for that procedure."
},
{
"function": {
"name": "gds.closeness.harmonic.stream",
Expand All @@ -1550,6 +1566,14 @@
},
"description": "Harmonic centrality is a way of detecting nodes that are able to spread information\nvery efficiently through a graph."
},
{
"function": {
"name": "gds.closeness.harmonic.stream.estimate",
"signature": "G: Graph, **config: Any",
"return_type": "Series[Any]"
},
"description": "Returns an estimation of the memory consumption for that procedure."
},
{
"function": {
"name": "gds.closeness.harmonic.write",
Expand All @@ -1558,6 +1582,14 @@
},
"description": "Harmonic centrality is a way of detecting nodes that are able to spread information\nvery efficiently through a graph."
},
{
"function": {
"name": "gds.closeness.harmonic.write.estimate",
"signature": "G: Graph, **config: Any",
"return_type": "Series[Any]"
},
"description": "Returns an estimation of the memory consumption for that procedure."
},
{
"function": {
"name": "gds.collapsePath.mutate",
Expand Down
16 changes: 16 additions & 0 deletions doc/sphinx/source/algorithms.rst
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -873,21 +873,37 @@ These all assume that an object of :class:`.GraphDataScience` is available as `g
Harmonic centrality is a way of detecting nodes that are able to spread information
very efficiently through a graph.

.. py:function:: gds.closeness.harmonic.mutate.estimate(G: Graph, **config: Any) -> Series[Any]

Returns an estimation of the memory consumption for that procedure.

.. py:function:: gds.closeness.harmonic.stats(G: Graph, **config: Any) -> DataFrame

Harmonic centrality is a way of detecting nodes that are able to spread information
very efficiently through a graph.

.. py:function:: gds.closeness.harmonic.stats.estimate(G: Graph, **config: Any) -> Series[Any]

Returns an estimation of the memory consumption for that procedure.

.. py:function:: gds.closeness.harmonic.stream(G: Graph, **config: Any) -> DataFrame

Harmonic centrality is a way of detecting nodes that are able to spread information
very efficiently through a graph.

.. py:function:: gds.closeness.harmonic.stream.estimate(G: Graph, **config: Any) -> Series[Any]

Returns an estimation of the memory consumption for that procedure.

.. py:function:: gds.closeness.harmonic.write(G: Graph, **config: Any) -> Series[Any]

Harmonic centrality is a way of detecting nodes that are able to spread information
very efficiently through a graph.

.. py:function:: gds.closeness.harmonic.write.estimate(G: Graph, **config: Any) -> Series[Any]

Returns an estimation of the memory consumption for that procedure.

.. py:function:: gds.collapsePath.mutate(G: Graph, **config: Any) -> Series[Any]

Collapse Path algorithm is a traversal algorithm capable of creating relationships between the start
Expand Down