Skip to content

fix: Add a new graph traversal that allows more than one edges out of a graph #250

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.

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
May 15, 2024

Conversation

mayurdb
Copy link
Contributor

@mayurdb mayurdb commented May 15, 2024

The current graph traversal is very sub-optimal and confusing. We were iterating throught all the nodes and then looking for the edges out of this. Also, it was constrained that one node could be connected to another node

For usecases such as n-level deep search, there would be a requirement to add more than child nodes out of the node. For example, pipeline for n-level deep search would look like:
Screenshot 2024-05-15 at 1 53 42 PM

@VinciGit00 VinciGit00 changed the base branch from main to pre/beta May 15, 2024 12:13
@VinciGit00 VinciGit00 merged commit 42d2ab1 into ScrapeGraphAI:pre/beta May 15, 2024
2 checks passed
Copy link

🎉 This PR is included in version 1.2.0-beta.1 🎉

The release is available on:

Your semantic-release bot 📦🚀

Copy link

🎉 This PR is included in version 1.3.0-beta.1 🎉

The release is available on:

Your semantic-release bot 📦🚀

Copy link

🎉 This PR is included in version 1.4.0-beta.1 🎉

The release is available on:

Your semantic-release bot 📦🚀

Copy link

🎉 This PR is included in version 1.5.0-beta.1 🎉

The release is available on:

Your semantic-release bot 📦🚀

Copy link

🎉 This PR is included in version 1.5.0 🎉

The release is available on:

Your semantic-release bot 📦🚀

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants