Skip to content

Corrected typo in configuration section of README.md #8

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
Apr 8, 2025
Merged

Corrected typo in configuration section of README.md #8

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
2 changes: 1 addition & 1 deletion README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -57,7 +57,7 @@ The visualization layout can be customized by modifying the `layoutConfig` objec
|--------|---------|-----------------|-------------|
| edgeType | `default` | `default`, `straight`, `smoothstep`, `step` | Shape of the edge connecting nodes. `default` is a bezier curve. |
| alignment | `DL` | `UL`, `UR`, `DL`, `DR` | Node alignment within ranks. `UL` = up-left, `UR` = up-right, `DL` = down-left, `DR` = down-right |
| rankDirection | `TB` | `TB`, `LR` | Direction of the graph layout. `TB` = top to bottom, `RL` = left to right |
| rankDirection | `TB` | `TB`, `LR` | Direction of the graph layout. `TB` = top to bottom, `LR` = left to right |
| ranker | `network-simplex` | `network-simplex`, `tight-tree`, `longest-path` | Algorithm used for ranking nodes. Network-simplex generally gives the best results |
| acyclicer | `none` | `greedy`, `none` | Method to handle cyclic relationships. `greedy` attempts to minimize edge crossings and may result in a more compact graph. |
| nodeSeparation | 60 | number (pixels) | Horizontal spacing between nodes at the same rank |
Expand Down
Loading