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 sequential Prim's algorithm #210

Merged
merged 2 commits into from
Mar 24, 2020

Conversation

czgdp1807
Copy link
Member

References to other Issues or PRs or Relevant literature

#137

Brief description of what is fixed or changed

  • Sequential version of Prim's minimum spanning tree algorithm has been added.
  • BinomialHeap now uses list instead of DynamicOneDimensionalArray for maintaining list of BinomialTree objects.

Other comments

@codecov
Copy link

codecov bot commented Mar 24, 2020

Codecov Report

Merging #210 into master will decrease coverage by 0.014%.
The diff coverage is 100.000%.

@@              Coverage Diff              @@
##            master      #210       +/-   ##
=============================================
- Coverage   96.886%   96.871%   -0.015%     
=============================================
  Files           24        24               
  Lines         1895      1918       +23     
=============================================
+ Hits          1836      1858       +22     
- Misses          59        60        +1     
Impacted Files Coverage Δ
pydatastructs/graphs/algorithms.py 100.000% <100.000%> (ø)
pydatastructs/trees/heaps.py 97.802% <100.000%> (-0.550%) ⬇️

Impacted file tree graph

@czgdp1807 czgdp1807 merged commit 26c0848 into codezonediitj:master Mar 24, 2020
@czgdp1807 czgdp1807 deleted the prim_algorithm_seq branch March 24, 2020 19:12
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.

1 participant