0
I Use This!
Inactive

Commits : Listings

Analyzed about 7 hours ago. based on code collected about 8 hours ago.
Aug 09, 2024 — Aug 09, 2025
Commit Message Contributor Files Modified Lines Added Lines Removed Code Location Date
Revert: Flow has to be set on input graph More... about 13 years ago
Add missing import of base exception More... about 13 years ago
Add missing use statement More... about 13 years ago
Adopt PSR-0 namespace convention More... about 13 years ago
Merge branch 'master' of https://github.com/Flos/graph-php More... about 13 years ago
Use vertex groups and validate groups are actually bipartit More... about 13 years ago
Do not modify the flow of the input graph More... about 13 years ago
Add check whether group is bipartit More... about 13 years ago
Helper to create grouped graph based on biparition colors More... about 13 years ago
Add helper method to count number of matches More... about 13 years ago
Helper algorithm for vertices' groups More... about 13 years ago
copy original edge attributes to cloned edges More... about 13 years ago
Add algorithm to check whether graph is bipartit More... about 13 years ago
Additional helper for connected component of vertex More... about 13 years ago
Merge branch 'master' of https://[email protected]/Flos/graph-php.git More... about 13 years ago
Finished matching with flow More... about 13 years ago
Finished algorithm internal preperation in algorithm MMFlow More... about 13 years ago
Add maximal matching algorithm stubs More... about 13 years ago
TSP can now return a cycle object More... about 13 years ago
Strict type hints More... about 13 years ago
Move cycle logic More... about 13 years ago
Rename getMaxFlowValue() to getFlowMax() More... about 13 years ago
Dedicated Cycle class More... about 13 years ago
Ability to create separate graph clones for each component More... about 13 years ago
Always count loosely connected components More... about 13 years ago
Option to set into which direction to follow adjacent vertices More... about 13 years ago
Improve by using breadth search instead of depth search More... about 13 years ago
Improve check for single by only issuing search once More... about 13 years ago
Minor change in code format More... about 13 years ago
Skip vertices that can not be in a cycle More... about 13 years ago