Skip to content
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

Added note of caution in minimum_spanning_tree(_parallel) #199

Merged
merged 2 commits into from
Mar 23, 2020

Conversation

sar99
Copy link
Contributor

@sar99 sar99 commented Mar 23, 2020

References to other Issues or PRs or Relevant literature

Fixes #185

Brief description of what is fixed or changed

A note of caution was added in 'minimum_spanning_tree()' mentioning that the function will only produce desirable results in case of connected and undirected graphs because the algorithm used is designed so.

Other comments

@codecov
Copy link

codecov bot commented Mar 23, 2020

Codecov Report

Merging #199 into master will not change coverage by %.
The diff coverage is n/a.

@@            Coverage Diff            @@
##            master      #199   +/-   ##
=========================================
  Coverage   96.933%   96.933%           
=========================================
  Files           24        24           
  Lines         1859      1859           
=========================================
  Hits          1802      1802           
  Misses          57        57           
Impacted Files Coverage Δ
pydatastructs/graphs/algorithms.py 100.000% <ø> (ø)

Impacted file tree graph

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.

Add note of caution in minimum_spanning_tree(_parallel)
2 participants