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

DOC-1935-move-Weisfeiler-Lehman #45

Merged
merged 1 commit into from
Dec 10, 2023
Merged

DOC-1935-move-Weisfeiler-Lehman #45

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
3 changes: 2 additions & 1 deletion modules/classification-algorithms/nav.adoc
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,4 +3,5 @@
** xref:k-nearest-neighbors.adoc[]
** xref:k-nearest-neighbors-batch.adoc[]
** xref:k-nearest-neighbors-cross-validation.adoc[]
** xref:maximal-independent-set.adoc[]
** xref:maximal-independent-set.adoc[]
** xref:weisfeiler-lehman.adoc[]
9 changes: 5 additions & 4 deletions ...e-embeddings/pages/weisfeiler-lehman.adoc → ...n-algorithms/pages/weisfeiler-lehman.adoc
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,4 +1,5 @@
= Weisfeiler-Lehman
:page-aliases: node-embeddings:weisfeiler-lehman.adoc
:description: Overview of the Weisfeiler-Lehman for detecting isomorphic graphs.
:fn-iso-article: footnote:[David Bieber, The Weisfeiler-Lehman Isomorphism Test, https://davidbieber.com/post/2019-05-10-weisfeiler-lehman-isomorphism-test/]

Expand Down Expand Up @@ -33,14 +34,14 @@ It finds the isomorphic subgraphs, and gives every vertex in the isomorphic subg
[,gsql]
----
CREATE QUERY tg_weisfeiler_lehman(STRING v_type,STRING e_type,
INT depth, INT out_put_limit, BOOL print_results = TRUE,
INT depth, INT output_limit, BOOL print_results = TRUE,
STRING result_attribute = "",STRING file_path = "")
----
=== Parameters


|===
|Parameter |Descriptiono
|Parameter |Description

|`STRING v_type`
|Vertex type to consider.
Expand All @@ -51,8 +52,8 @@ CREATE QUERY tg_weisfeiler_lehman(STRING v_type,STRING e_type,
|`INT depth`
|Number of hops to consider

|`INT out_put_limit`
|If `print_results` is set to true, print a maximum of this number of vertices..
|`INT output_limit`
|If `print_results` is set to true, print a maximum of this number of vertices.

|`BOOL print_results`
|If true, print JSON to standard output.
Expand Down
2 changes: 1 addition & 1 deletion modules/intro/pages/index.adoc
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -44,6 +44,7 @@ Classification algorithms label vertices to sort them into various defined class
* xref:classification-algorithms:k-nearest-neighbors-batch.adoc[]
* xref:classification-algorithms:k-nearest-neighbors-cross-validation.adoc[]
* xref:classification-algorithms:maximal-independent-set.adoc[]
* xref:classification-algorithms:weisfeiler-lehman.adoc[]

a|
=== xref:community-algorithms:index.adoc[Community]
Expand Down Expand Up @@ -86,7 +87,6 @@ Node embeddings are vector representations of vertex properties in a graph.

* xref:node-embeddings:node2vec.adoc[]
* xref:node-embeddings:fast-random-projection.adoc[]
* xref:node-embeddings:weisfeiler-lehman.adoc[]

a|
=== xref:pathfinding-algorithms:index.adoc[Pathfinding]
Expand Down
3 changes: 1 addition & 2 deletions modules/node-embeddings/nav.adoc
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,4 +1,3 @@
* xref:index.adoc[]
** xref:fast-random-projection.adoc[]
** xref:node2vec.adoc[]
** xref:weisfeiler-lehman.adoc[]
** xref:node2vec.adoc[]
Loading