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

Jump to bottom

algorithm add encodeId #2208

Merged
merged 1 commit into from
Aug 4, 2023
Merged

algorithm add encodeId #2208

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
6 changes: 3 additions & 3 deletions docs-2.0/graph-computing/nebula-algorithm.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -28,9 +28,7 @@ Before using the NebulaGraph Algorithm, users need to confirm the following info

## Limitations

- For non-integer String data, it is recommended to use the algorithm interface. You can use the `dense_rank` function of SparkSQL to encode the data as the Long type instead of the String type.

- Graph computing outputs vertex datasets, and the algorithm results are stored in DataFrames as the properties of vertices. You can do further operations such as statistics and filtering according to your business requirements.
Graph computing outputs vertex datasets, and the algorithm results are stored in DataFrames as the properties of vertices. You can do further operations such as statistics and filtering according to your business requirements.

!!!

Expand Down Expand Up @@ -239,13 +237,15 @@ The `lib` repository provides 10 common graph algorithms.
pagerank: {
maxIter: 10
resetProb: 0.15
encodeId:false # Configure true if the VID is of string type.
}

# Louvain
louvain: {
maxIter: 20
internalIter: 10
tol: 0.5
encodeId:false # Configure true if the VID is of string type.
}

# ...
Expand Down