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.

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

Merged
merged 4 commits into from
Sep 26, 2020
Merged

Network Flow: Dinic #4

merged 4 commits into from
Sep 26, 2020

Conversation

dotoleeoak
Copy link
Member

close #1

@dotoleeoak dotoleeoak changed the title Create Dinic.cpp Network Flow: Dinic Sep 21, 2020
@dotoleeoak dotoleeoak added the Flow 네트워크 유량 label Sep 21, 2020
@dotoleeoak
Copy link
Member Author

아직 수정 필요

@dotoleeoak
Copy link
Member Author

[IMPORTANT] add_edge에서 중복 edge 안 만들도록 하기 (flow만 추가)

Dinic.cpp Outdated Show resolved Hide resolved
Dinic.cpp Outdated
int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};

void addEdge(int a, int b, int flow) {
Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

edge중복 안되게 하기

Dinic.cpp Outdated Show resolved Hide resolved
@dotoleeoak
Copy link
Member Author

@leesj10147 중복 edge 어떻게 처리하지?

@dotoleeoak
Copy link
Member Author

@leesj10147 중복 edge 어떻게 처리하지?

2차원으로 edge 관리? => 뒤에 시간에서 낭비 있을 듯...

Copy link
Contributor

@leesj10147 leesj10147 left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

lgtm

@dotoleeoak dotoleeoak merged commit d0cd8ba into master Sep 26, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Flow 네트워크 유량
Projects
None yet
Development

Successfully merging this pull request may close these issues.

Network Flow: Dinic
2 participants