Skip to content

Commit e1f518b

Browse files
Mats-SXFlorentinD
andcommitted
Remove unnecessary docline
Co-authored-by: Florentin Dörre <[email protected]>
1 parent 68c233b commit e1f518b

File tree

1 file changed

+0
-3
lines changed

1 file changed

+0
-3
lines changed

graphdatascience/procedure_surface/api/centrality/articulationpoints_endpoints.py

Lines changed: 0 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -26,7 +26,6 @@ def mutate(
2626
Runs the Articulation Points algorithm and stores the results in the graph catalog as a new node property.
2727
2828
Given a graph, an articulation point is a node whose removal increases the number of connected components in the graph.
29-
The Neo4j GDS Library provides an efficient linear time sequential algorithm to compute all articulation points in a graph.
3029
3130
Parameters
3231
----------
@@ -71,7 +70,6 @@ def stats(
7170
Runs the Articulation Points algorithm and returns result statistics without storing the results.
7271
7372
Given a graph, an articulation point is a node whose removal increases the number of connected components in the graph.
74-
The Neo4j GDS Library provides an efficient linear time sequential algorithm to compute all articulation points in a graph.
7573
7674
Parameters
7775
----------
@@ -158,7 +156,6 @@ def write(
158156
Runs the Articulation Points algorithm and stores the result in the Neo4j database as a new node property.
159157
160158
Given a graph, an articulation point is a node whose removal increases the number of connected components in the graph.
161-
The Neo4j GDS Library provides an efficient linear time sequential algorithm to compute all articulation points in a graph.
162159
163160
Parameters
164161
----------

0 commit comments

Comments
 (0)