Skip to content

Added sequential Kurskal Algorithm #168

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 4 commits into from
Mar 17, 2020

Conversation

czgdp1807
Copy link
Member

References to other Issues or PRs or Relevant literature

#137

Brief description of what is fixed or changed

Other comments

Other than adding Kruskal algorithm, minor changes in graph API have also been done.

@codecov
Copy link

codecov bot commented Mar 17, 2020

Codecov Report

Merging #168 into master will increase coverage by 0.044%.
The diff coverage is 100%.

@@              Coverage Diff              @@
##            master      #168       +/-   ##
=============================================
+ Coverage   98.367%   98.411%   +0.044%     
=============================================
  Files           22        22               
  Lines         1654      1700       +46     
=============================================
+ Hits          1627      1673       +46     
  Misses          27        27
Impacted Files Coverage Δ
pydatastructs/graphs/__init__.py 100% <ø> (ø) ⬆️
pydatastructs/graphs/graph.py 100% <100%> (ø) ⬆️
pydatastructs/graphs/algorithms.py 100% <100%> (ø) ⬆️
pydatastructs/graphs/adjacency_list.py 100% <100%> (ø) ⬆️
pydatastructs/graphs/adjacency_matrix.py 100% <100%> (ø) ⬆️

Impacted file tree graph

@czgdp1807 czgdp1807 merged commit 4845b22 into codezonediitj:master Mar 17, 2020
@czgdp1807 czgdp1807 deleted the mst-kruskal branch March 17, 2020 15:33
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