-
Notifications
You must be signed in to change notification settings - Fork 0
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
Network Flow: Dinic #4
Conversation
아직 수정 필요 |
[IMPORTANT] add_edge에서 중복 edge 안 만들도록 하기 (flow만 추가) |
Dinic.cpp
Outdated
int dy[] = {1, 0, -1, 0}; | ||
int dx[] = {0, 1, 0, -1}; | ||
|
||
void addEdge(int a, int b, int flow) { |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
edge중복 안되게 하기
@leesj10147 중복 edge 어떻게 처리하지? |
2차원으로 edge 관리? => 뒤에 시간에서 낭비 있을 듯... |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
lgtm
close #1