Created A java file for GraphX library#17
Open
Aditya24Kashyap wants to merge 2 commits intophpduke:masterfrom
Open
Created A java file for GraphX library#17Aditya24Kashyap wants to merge 2 commits intophpduke:masterfrom
Aditya24Kashyap wants to merge 2 commits intophpduke:masterfrom
Conversation
(Memory-safe Solution) N=5,000,000 nodes is inefficient and can cause memory overflow in Java due to high object overhead. Therefore, instead of allocating all possible nodes in advance, we dynamically create graph nodes only for the states that actually occur using hashing and lazy adjacency construction. This significantly reduces memory usage while preserving the same BFS logic.
(Memory-safe Solution) N=5,000,000 nodes is inefficient and can cause memory overflow in python due to high object overhead. Therefore, instead of allocating all possible nodes in advance, we dynamically create graph nodes only for the states that actually occur using hashing and lazy adjacency construction. This significantly reduces memory usage while preserving the same BFS logic.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
(Memory-safe Solution)
N=5,000,000 nodes is inefficient and can cause memory overflow in Java due to high object overhead. Therefore, instead of allocating all possible nodes in advance, we dynamically create graph nodes only for the states that actually occur using hashing and lazy adjacency construction. This significantly reduces memory usage while preserving the same BFS logic.