lib-puc-icpc's People
lib-puc-icpc's Issues
Implement incremental max-flow and min-cost flow
It should be easy, we only need to add one subroutine, to compute new potential by bellman-ford after adding new arcs or expand capacities of existing arcs.
bug of mincostflow for maximum weight matching
graph g(4);
g.imb[0] = 1;
g.imb[1] = g.imb[2] = g.imb[3] = -1;
g.mincostflow();
is wrong!
rep, fu and sz,pb
Why there are both rep and fu?
I'm not sure but I also feel the gain by using sz, pb is not much, so how about removing this?
Change graph to vector<vector<...>>
Do your work!
Recommend Projects
-
React
A declarative, efficient, and flexible JavaScript library for building user interfaces.
-
Vue.js
๐ Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.
-
Typescript
TypeScript is a superset of JavaScript that compiles to clean JavaScript output.
-
TensorFlow
An Open Source Machine Learning Framework for Everyone
-
Django
The Web framework for perfectionists with deadlines.
-
Laravel
A PHP framework for web artisans
-
D3
Bring data to life with SVG, Canvas and HTML. ๐๐๐
-
Recommend Topics
-
javascript
JavaScript (JS) is a lightweight interpreted programming language with first-class functions.
-
web
Some thing interesting about web. New door for the world.
-
server
A server is a program made to process requests and deliver data to clients.
-
Machine learning
Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.
-
Visualization
Some thing interesting about visualization, use data art
-
Game
Some thing interesting about game, make everyone happy.
Recommend Org
-
Facebook
We are working to build community through open source technology. NB: members must have two-factor auth.
-
Microsoft
Open source projects and samples from Microsoft.
-
Google
Google โค๏ธ Open Source for everyone.
-
Alibaba
Alibaba Open Source for everyone
-
D3
Data-Driven Documents codes.
-
Tencent
China tencent open source team.