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.

Sign up for GitHub

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

Jump to bottom

Improve Algorithm\MinimumSpanningTree #73

Merged
merged 12 commits into from
Sep 11, 2013
Merged

Improve Algorithm\MinimumSpanningTree #73

merged 12 commits into from
Sep 11, 2013

Conversation

clue
Copy link
Member

@clue clue commented Sep 11, 2013

  • Fix throwing UnexpectedValueException for unconnected Graphs
  • Consistently support undirected and mixed Graphs
  • Support edges with null weight (default), consider it the same as (int)0 weight.
  • Add Algorithm\MinimumSpanningTree\Base::getWeight()
  • 100% code coverage
  • Documentation / changelog

Also refs #72

clue added a commit that referenced this pull request Sep 11, 2013
@clue
Merge pull request #73 from clue/improve-minimumspanningtree
3e61948 
Improve Algorithm\MinimumSpanningTree
@clue clue merged commit 3e61948 into master Sep 11, 2013
@clue clue deleted the improve-minimumspanningtree branch September 11, 2013 12:27
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Reviewers
No reviews
Assignees
No one assigned
Labels
bug new feature
Projects
None yet
Milestone
No milestone
Development

Successfully merging this pull request may close these issues.
1 participant
@clue