Tags:
tag this topic
create new tag
view all tags
This page is dedicated to UBC ACM ICPC Teams to discuss stuff that should normally be incomprehensible to normal beings. ---+ Code orders Please place your order here. Assignments are not welcomed. It is better if you can cite the problem you are solving, or provide pseudo codes and reference, so that the potential author can edit it. %SEARCH{ "CodeOrder" scope="topic" nosearch="on" nototal="on" web="Main" format=" * [[$topic]]" }% ---+ Problem Discussion ---++ Euler Circuit (10735) Basically, we need to do a Maximum Flow to assign as much undirected edges as possible. Then we run the normal recursive/backtracking-like euler circuit algorithm to get the path. ---+ Code archive * Maximim Flow - short version [[Code_MaximumFlowShort]] * Maximim Bipartite Matching - short version (also fast) [[Code_BPTShort]] * Euler Circuit - [[Code_EulerCircuit]] ------- * Set ALLOWTOPICCHANGE = DuckySherwood, MatthewChan, YuryKholondyrev, SapphireJay
E
dit
|
A
ttach
|
Watch
|
P
rint version
|
H
istory
: r7
<
r6
<
r5
<
r4
<
r3
|
B
acklinks
|
V
iew topic
|
Ra
w
edit
|
M
ore topic actions
Topic revision: r7 - 2005-11-18
-
MatthewChan
Home
Site map
BETA web
Communications web
Faculty web
Imager web
LCI web
Main web
SPL web
Sandbox web
TWiki web
TestCases web
Main Web
Users
Groups
Index
Search
Changes
Notifications
RSS Feed
Statistics
Preferences
View
Raw View
Print version
Find backlinks
History
More topic actions
Edit
Raw edit
Attach file or image
Edit topic preference settings
Set new parent
More topic actions
Account
Log In
Register User
E
dit
A
ttach
Copyright © 2008-2024 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki?
Send feedback