Skip to content

docs: add Wherobots CTA to 0.11.0 release post #823

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
james-willis merged 3 commits into from
Apr 2, 2026
Merged

docs: add Wherobots CTA to 0.11.0 release post #823

Changes from all commits
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
40982ae
docs: add Wherobots call to action to 0.11.0 release post
james-willis Apr 1, 2026
271a66d
docs: move Wherobots CTA to top of post
james-willis Apr 1, 2026
ea42e35
docs: tighten CTA wording
james-willis Apr 1, 2026
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: 2 additions & 0 deletions docs/src/05-blog/997-graphframes-011-release.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -4,6 +4,8 @@
- **Title:** GraphFrames 0.11.0 release
- **Summary:** This release brings a new Connected Components algorithm based on Randomized Contraction, automatic Pregel optimization that skips unnecessary joins, graph embeddings via random walks with Word2Vec and Hash2Vec, a PySpark Property Graph API, approximate triangle counting with DataSketches, and various improvements.

Want to try these features now? [Wherobots](https://www.wherobots.com/) is the only cloud platform shipping a modern version of GraphFrames. Sign up and start running graph algorithms right away — no setup required.

## Connected Components: new algorithm

The Connected Components API now offers three algorithm choices:
Expand Down
Loading