Timing script for bipartite actually producing bipartite graph#158
Open
gulshan-123 wants to merge 1 commit intonetworkx:mainfrom
Open
Timing script for bipartite actually producing bipartite graph#158gulshan-123 wants to merge 1 commit intonetworkx:mainfrom
gulshan-123 wants to merge 1 commit intonetworkx:mainfrom
Conversation
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.
As suggested by @akshitasure12 in #156 , the change to timing script is in this PR.
Earlier, the bipartite graph part was not actually producing bipartite graph, this was noticed when the graphs were returning error in latapy_clustering tests.
I have used the fact that nx.bipartite.random_graph partitions the nodes into two parts as follows: