Graph theory 500 Questions!

Life and death to see the light Gan, this is the lives!

============================= below is the minimum spanning tree + and check set ======================================
"HDU"
1213 how many Tables Foundation and check SET ★
1272 Little Nozomi's Maze Foundation and check SET ★
1325&&poj1308 is It A Tree? Base and check Set ★
1856 More is better foundation and check set ★
1102 constructing Roads Base minimum spanning tree ★
1232 Smooth Engineering Foundation and check SET ★
1233 or smooth Engineering foundation minimum spanning tree ★
1863 Smooth Engineering Foundation minimum spanning tree ★
1875 Smooth Works Renewal Foundation minimum spanning tree ★
1879 continue unimpeded Engineering Foundation minimum spanning tree ★
3371 Connect The Cities simple minimal spanning tree ★
1301 Jungle Roads Base minimum spanning tree ★
1162 Eddy ' s Picture Foundation minimum spanning tree ★
1198 Farm Irrigation Base minimum Spanning tree ★
1598 find the most comfortable road enumeration + min spanning tree ★
1811 rank of Tetris and search set + topology sort ★
3926 Hand in Hand with composition ★
3938 Portal offline + and check set ★
2489 Minimal Ratio Tree DFS enumeration combination case + minimum spanning trees ★
4081 Qin Shi Huang ' s national Road System minimum spanning tree +dfs★★
4126 Genghis Khan the Conqueror enumeration + minimum spanning tree +dfs (difficult) ★★★★

1829&&poj2492 A Bug ' s life base category and check set ★
1558 Segment Set compute geometry + and check set ★
3461 Code Lock and check set (a little hard to think) ★
3367 pseudoforest max Spanning tree ★
2473 Junk-mail Filter and set + Set virtual parent node (VEST) ★
3172 Virtual Friends with right and check set ★
3635 Dragon Balls take right and check set ★
3047 Zjnu Stadium take right and check set ★
3038 How many Answers is wrong species and check set ★
2818 Building Block with right and check set ★
3234 Exclusive-or/Ji (difficult) ★
2121 Ice_cream ' s World II minimum tree shape (to output roots a bit disgusting) ★
4009 Transfer Water min Tree Chart (template title) ★
3311 Dig the Wells eectilinear (Shape pressure dp) (template title) ★
4085 Peach Blossom Spring eectilinear (like pressure DP) (probably forest ...) ¡ï ★

2586 How far away? lca★
2874 Connections between Cities lca★
3486 Interviewe rmq★
2888 Check Corners Two-dimensional rmq★
3183 a Magic Lamp RMQ (a little hard to think, a little difficult to contact RMQ) ★

"POJ"
1258 the most classic mst★
1789 Truck History minimum Spanning tree ★
1287 Networking Simple ★
2349 Arctic Network Simple ★
1611 the Suspects and check set ★
2377 kruskal★
2524 Ubiquitous Religions and check set ★
2236 Wireless Network and search set + computational geometry ★
2560 Kruskal and check set ★
1861 kruskal★
3625 prim★
1679–the unique MST (base) to determine if MST is unique ★
3522–slim Span (base) for a spanning tree, minimizing the minimum edge difference of the maximum edge ★
2485 Highways MST in the longest side ★
2395 longest side of the minimum spanning tree ★
1751 highways to find out the solution ★
POJ-1182 food chain category and find out ★
POJ 1456 Supermarket greedy + Zone merge ★
POJ-1703 category and check set ★
POJ-1988 category and check set ★
POJ-1733 Parity game category and check set, first to discretization, do not affect the results of ★
POJ-1417 True Liars (difficult) and check set +DP type and check set ★
POJ-2912 Rochambeau (difficult) Baidu's problem, very good ... is an enhanced version of the food chain. Judging the referee is more difficult to think. ★
POJ 2728 Desert King (medium) Best rate spanning tree ★
POJ 1639 Picnic Planning (more difficult) vertex degree limited minimum spanning tree ★
POJ 3164 Command Network (difficult) min Tree Chart ★

poj3723 Good question!!! ★
poj3228 a good question!!! ★

"ZOJ"
ZOJ-3261 Reverse and check set ★

=============================== below is the shortest Circuit series ====================================
"HDU"
1548 A Strange lift base shortest (or BFS) ★
2544 Shortest circuit basis shortest circuit ★
3790 Shortest Path problem basic Short Circuit ★
20,661 people travel based shortest circuit (multi-source multi-sinks, can establish super source point and end point) ★
2112 HDU Today Basic Shortest circuit ★
1874 unblocked Project continued Foundation shortest circuit ★
1217 Arbitrage Currency exchange Floyd (or Bellman-ford award ring) ★
1245 Saving James Bond compute geometry + Shortest circuit ★
1317 Xyzzy Bellman-ford Award ring, a negative right ★
1535 Invitation Cards-to-back shortest way, (reverse build) ★
1546 idiomatic phrases Game shortest circuit ★
2680 Choose the best route short circuit ★
2923 Einbahnstrasse Shortest Circuit ★
3339 in Action shortest circuit + Backpack ★
2224 the shortest path two-tone travel quotient question ★
2807 the shortest Path matrix operation + Shortest Path (FLOYD) ★
1595 find the longest of the shortest enumeration + Shortest path (delete the longest short circuit of any one side) ★
3986 Harry Potter and the Final Battle enumeration + Shortest Path (delete the longest short circuit of any one side) ★
1599 Find the Mincost Route Floyd find the smallest ring ★
1839 Delay Constrained ... Min. lower limit + Shortest path (with short limit) ★
3631 shortest Path Floyd insertion point method ★
4114 Disney's FastPass shortest circuit + two-dimensional pressure DP (difficult) ★
3832 Earth Hour Three-point connectivity (EECTILINEAR) ★
3873 invade the Mars Dij variant (Good question!, with limit shortest) ★
4063 Aircraft geometric composition + Shortest path ★★★★

hdu4179 difficult Routes dis[][] open two-dimensional state shortest circuit (with limit shortest) ★

18,696 degree Separation Floyd shortest possible ★
1385 Minimum Transport Cost shortest circuit + output path (output dictionary order minimum path, a bit disgusting) ★
1224 free DIY Tour shortest circuit + output path ★
1142 A Walk Through The Forest shortest circuit + Memory search ★
1596 Find the safest road product smallest shortest possible ★
1598 find the most comfortable road binary speed difference + most Short-circuit (with limit shortest) ★
2722 here We Go (Relians) Again Shortest-circuit ★
2962 Trucking Two-min. (with short-circuit limit) ★ ¡ï
1690 Bus System shortest circuit ★
2433 Tra Vel Delete edge + shortest path and (pre-processing Bridge) ★ ¡ï
2363 Cycling two min. (with short-circuit limit) ★ ☆
2377 Bus Pass Shortest path (look for a point of the longest minimum short-circuit min) ★ +
2833 WuKong shortest circuit + memory search (ask for two shortest short-circuiting of the most common points) ¡ï ★
1688 Sightseeing minimum number of short-circuit bars ★
3191 How many Paths is there number of short-circuit strips ★
2482 Transit Search Shortest Way ★
3768 Shopping Shortest Path +dfs (or short circuit + pressure DP) ★
3035 War Floor plan min cut (build trouble) ★ ☆
3870 Catch the theves floor plan min cut (build trouble) ★
3860 Circuit Board Floor plan min cut (build trouble) ★ ☆

"POJ"
1062 expensive dowry can be linked with the shortest way ★
1094 sorting It all out Floyd Award ring + topology sort ★
1125 stockbroker Grapevine floyd★
1135 Domino Effect Shortest way, more interesting ★ ☆
1161 Walls Shortest way (figure too disgusting) ★ ☆
1502 MPI Maelstrom floyd★
1511 invitation Cards back to shortest way ★
1556 the Doors compute geometry + Shortest WAY ★
1724 ROADS with limited short-circuit, dis[][] open two-dimensional to record information (or wide search) ¡ï ★
1734 sightseeing trip Floyd minimum ring path ★
1797 Heavy Transportation Binary Enumeration + shortest circuit ★
1847 Tram Simple shortest circuit ★
1860 Currency Exchange currency conversion ★
1949 Chores Reverse build side, find the longest road ★
2139 Six Degrees of Cowvin Bacon floyd★
2240 Arbitrage Currency exchange ★
2253 Frogger two points + shortest circuit ★
2312 Tank Wars SPFA Shortest-circuiting nature deformation –> Wide search ★
23 The Cows Come Home Foundation shortest circuit ★
2394 Checking an Alibi shortest circuit ★
2449 remmarguts ' Date A * for K short-circuiting ★
2457 Part Acquisitio N Shortest way (output path) ★
2472 106 miles to Chicago product Shortest path (log, multiply add) ★

2502 Subway
2570 Fiber Network Floyd
3013 Christmas Tree
3037 Skiing
3072 Robot
3114 countries in War strong Unicom + shortest circuit
3160 Father Christmas Flymouse Strong Unicom + Longest road
3255 Roadblock
3259 wormholes (looking for negative power loops)
3268 Silver Cow Part
3311 Hie with the Pie floyd+-shaped pressure
3328 Cliff Climbing
3439 Server Relocation
3463 Sightseeing number of short-circuit strips
3159
3521 geometric Map compute geometry + shortest circuit
3549 GSM Phone compute geometry + shortest circuit
3594 Escort of Dr.
3613 Cow Relays the shortest way through n edges//Floyd + binary Matrix
3615 Cow Hurdles
3621 optimal ratio ring
3635 Full tank?
3660 Delivery Closure
3662 Telephone Lines
============================ The following is a Differential constraint series ============================
"HDU"
1384 intervals
1529 Cashier Employment
1531 King
1534 Schedule problem
3440 House Mans
3592 World Exhibition
3666 the MATRIX problem

"POJ"
1201
1275
1364
1716
2949
2983
3159
3169
3687

============================ The following is a binary matching series ============================
Common match, multiple match

"HDU"

1068 Girls and Boys
1150 Machine Schedule
1151 Air Raid
1179 ollivanders:makers of Fine wands since 382 BC.
1281 Board Games
1498, years, colors
1507 Uncle Tom ' s inherited land*
1528 Card Game Cheater
1845 Jimmy ' s assignment
2063 Roller coaster
2119 Matrix
2444 the accomodation of Students
2768 Cat vs. Dog
3081 Marriage Match II
3360 National Treasures
1045 can also search
1350 Minimum Path Overlay
3118 similar two-part matching
3729
2389
1054
2819 Exact Match
16,682 points + multiple matches
3,605 Multi-match
3861 Strong connectivity + binary matching
2236 Untitled II

hdu3468
hdu4185 Parity Matching

"POJ"
1087 A Plug for UNIX
1274 the Perfect Stall
1469 COURSES
1486 sorting Slides the necessary side of the two-part diagram
1548 Robots
1698 Alice ' s chance
1719 Shooting Contest
1904 King's Quest to find all possible matching edges of the binary chart
2060 Taxi Cab Scheme minimum path coverage
2112 Optimal Milking two points + multiple matches
2226 Muddy Fields
2239 Selecting Courses
2289 Jamie's contact Groups two points + multiple matches
2446 Chessboard
2536 Gopher II
2584 T-shirt Gumbo
2594 Treasure Exploration intersect minimum path overlay
2672 hotkeys
2724 Purifying Machine
3020 Antenna Placement
3041 asteroids simple row and column matching
3189 Steady Cow Assignment two points + multiple matches
3207 Ikki ' s story Iv–panda ' s Trick
3216 Repairing Company
3343 against Mammoths
3692 Kindergarten
2771 Maximum Independent set
============================ The following is the KM algorithm series ============================
"HDU"
2255 Ben-Off make money
1533 going Home
1853 Cyclic Tour
3488 Tour
3435 A New Graph Game
2426 Interesting Housing problem
2853 Assignment
3718 Similarity
3722 Card Game
3395 Special Fish
2282 Chocolate
2813 One FIHGT One
2448 Mining Station on the Sea
3315 My Brute
3523 Image Copy Detection

"POJ"
2195 going Home min weight matching
2400 Supervisor, Supervisee output all minimum weights matched
2516 Minimum cost minimum weight matching or minimum charge flow
3565 Ants
3686 The windy ' s minimum weight matching

============================ The following is the largest group & stable marriage series ============================
"HDU"

1530 Maximum Clique
1435 Stable Match
3585 Maximum shortest distance two points + Max Group
1522 marriage is Stable
1914 The Stable marriage problem

"POJ"

Coloring problem of 11,294 color theorem
1419 Maximum independent set
2989 Great Regiment
3487 The Stable marriage problem stable marriage
============================ The following is the strong double Unicom series ============================
"HDU"
Strong connectivity:
1269 Maze Castle Judging whether it is a strong connected
2767 proving equivalences At least add a few edges to make the whole graph strong connected.
3836 equivalent sets at least add a few edges to make the whole graph strong connected.
1827 Summer Holiday minimum cost of delivery
3072 minimum cost for Intelligence System delivery
3861 the King ' s problem strong connectivity + binary matching
3639 Hawk-and-chicken Strong Connected indent + Tree DP (total weight of accumulated child nodes)
3594 Cactus Cactus Diagram

Dual Connectivity:
2242 Entrance Examination Road boundless--air-conditioning classroom double-link pinch + tree dp
2460 Network Side Dual Connectivity
3849 by recognizing these Guys, We find social Networks useful dual connectivity Bridge
3896 Greatest TC Dual connectivity
4005 the war side double connected

Lca:
2586 How far away?
2874 Connections between cities
3078 Network lca+ Sort
3830 Checkers Two-point +lca

"POJ"
Strong connectivity:
1236 Network of schools
2553 the Bottom of a Graph good question! Find a collection of degrees 0
2186 Popular cows Good question! Find the degree 0, the other component points to its collection
2375 Cow Ski Area Strong connectivity
2762 going from U to V or from V to u? Indent + topology Ordering
3160 Father Christmas Flymouse Strong connectivity + shortest circuit
3180 the Cow Prom judges several rings, the number of elements in the component is greater than 1
3114 countries in War strong connectivity + shortest circuit
3592 instantaneous transference Strong connected component + longest road
1904 King's Quest strong connectivity + and check set

Dual Connectivity:
3694 Network Side dual connectivity (same as hdu2460)
3177 redundant Paths structural side double connectivity
3352 Road construction structural side double connectivity
2942 Knights of the Round Table (point double connected classic)
1515 Street Directions (non-direction graph change to map)
1438 one-way traffic (mixed graph change to map)

Lca:
1330 Nearest Common Ancestors
1470 Closest Common Ancestors
1986 Distance Queries
3417 Network
3728 The Merchant lca+ collection, update inquiry
2763 Housewife Wind lca+ tree-like array
============================ The following is the 2-sat series ============================
"HDU"
3062 Party
1824 let ' s go home
3622 Bomb Game
3715 Go Deeper
1815 Building Roads
2723 Get Luffy out
1816 Get Luffy Out *
1814 Peaceful Commission
4115 Eliminate the Conflict

"POJ"
2296 Map Labeler
2723 Get Luffy out
2749 Building Roads
3207 Ikki ' s story Iv–panda ' s Trick
3648 Wedding
3678 Katu Puzzle
3683 priest John ' s busiest day
3905 Perfect Election
============================ The following is the Euler Circuit series ============================
"HDU"
1878 Euro-Pull loop judgment
3018 Ant Trip a stroke problem
1116
2894-Drum Euler circuit
1956
3472 mixed Euler

"POJ"
2513 Euro-La route
1041 John ' s trip Euler circuit
1386 Play on Words word Solitaire
2230 Watchcow Euler circuit
2513 colored Sticks non-Tuola road
2337 catenyms Euler path
1392 Ouroboros Snake Drum Euler circuit
1780 code
1637 mixed Euler

"Zoj"
1992
============================ The following is the topological sort series ============================
"HDU"
1285 determining the tournament position
2094 Generation of Champions
2647 reward
3342 Legal or not
1811 Rank of Tetris topology + and check set
32,313-D topology

"POJ"
1094 sorting It all out floyd+ topology
2367 Genealogical Tree
3660 Cow Contest
3687 Labeling Balls Magical topology
1128 Frame Stacking DFS edition topology
1270 following Orders topology + backtracking
1420 Spreadsheet Analog Topologies
2762 going from U to V or from V to u? Strong Connectivity + Topology
3553 Task Schedule
============================ The following is the competition chart series ============================
Hamilton problems under the competition chart

Strange Country II ZOJ-3332
Task sequences POJ-1776
The book SGU-122
Tour Route POJ-3780
Tour Route HDOJ-3414
============================ The following is the network flow series ============================
"HDU"

1532 drainage ditches (base) [Maximum flow]
3549 flow problem (base) [Maximum flow]
3572 task Schedule [Max Stream] assignment, judging full stream
2732 Leapin ' lizards (difficult) [Maximum flow]
3338 Kakuro Extension [Max Stream] [number and] Magic Max pop-in list
2883 kebab [maximum flow] judgment full stream
3605 Escape [Maximum flow] (multiple matches
3081 Marriage Match II [two-point maximum flow]+ and check set
3277 marriage Match III [two-point maximum flow] Ibid.
3416 marriage Match IV [Max Stream] Shortest path + maximum flow
2485 destroying the bus stations [maximum flow] shortest circuit + maximum flow
3468 Treasure hunting [max Flow] (binary match) + shortest
3551 Hard Problem [max Flow]
3998 Sequence (difficult) [dp+ maximum flow] longest ascending subsequence
3917 Road Constructions [maximum weight closure]
3879 Base Station [maximum weight closure]
3061 Battle [Maximum weight closure]
3996 Gold Mine [maximum weight closure]
3472 HS BDC [mixed Euler]
hdu4183 a network stream that does not repeat points back and forth.
————————-
1533 going Home (basic) [fee flow]
3488 Tour [fee flow] Circle
3435 A New Graph Game [expense flow] Circle
1853 Cyclic Tour [fee flow] Circle
2686 Matrix [Expense flow]
3376 Matrix Again [cost Flow]
3667 transportation [cost flow] split edge
3315 My Brute [cost Flow] (available miles)
3395 special Fish [cost Flow] (available km matching)
2448 Mining Station on the Sea [cost flow] (shortest path +km match available)
4067 Random Maze (difficult) [cost flow]
3947 River Problem (difficult) [cost flow] magical cost flow, traffic inequality mapping
3046 pleasant sheep and Big big Wolf [min Cut]
1565 squares Fetch (1) [Min. Cut]
1569 squares Fetch (2) [min. Cut]
3820 Golden Eggs [min Cut] grid enhancement
3491 thieves [min Cut] min. cut set
3657 Game [min Cut] Maximum point weight independent set
3313 Key Vertex [min Cut]
3251 Being a Hero [min Cut]
3157 Crazy circuits [Upper and lower flow]
3002 King of Destruction [Global min Cut]
3691 Nubulsa Expo [global minimum Cut]
"POJ"
1087 A Plug for UNIX [Max Stream] (binary match available)
1274 the Perfect Stall [maximum flow] (binary match available)
1325 machine Schedule [maximum flow] (binary match available)
1698 Alice's chance [maximum flow] (binary match available)
2239 Selecting Courses [maximum flow] (binary match available)
2446 chessboard [Maximum flow] (binary match available) good question.
2536 Gopher II [maximum flow] (binary match available)
2771 Guardian of decency [maximum flow] binary matching maximum independent set
3041 asteroids [Maximum flow] (simple two-part matching)
2584 T-shirt Gumbo [maximum flow] (multiple matches)
3189 Steady Cow Assignment (medium) [two-part maximum flow] (multiple match)
1149 PIGS [max Flow] Absolute Classic composition problem
1273 drainage ditches [maximum flow] (base)
1459 Power Network (base) [Maximum flow]
3281 Dining [Max Flow]
2112 Optimal Milking (base) [two-part maximum flow]
2289 Jamie's Contact Groups [two-point maximum flow]
2391 ombrophobic bovines (medium) [two-point maximum flow]
2455 Secret Milking Machine (base) [two-part maximum flow]
3228 Gold Transportation [two-point maximum flow] (and set)
2699 the Maximum number of strong Kings (more difficult) [Enumerator + max Flow]
3498 March of the Penguins (medium) [maximum flow] Enumerate meeting points, network flows that meet the point capacity limits
2987 firing (more difficult) [Maximum weight closure]
1637 Sightseeing Tour (Crazy) [mixed Euler]
2135 Farm Tour [cost flow] (shortest circuit back and forth)
2175 evacuation Plan (medium) [expense flow] extinction circle
2195 going Home [fee flow]
2516 Minimum cost [fee flow]
3422 Kaka ' s Matrix travels (medium) [expense flow] Split
3680 intervals (more difficult) [cost flow] classic, cost flow + discretization
3686 the windy ' s [fee flow] (km matching)
3762 the Bonus salary! [Fee Flow]
1815 Friendship (medium) [min Cut] min. cut set
1966 Cable TV Network (medium) [min Cut] min. cut set
2125 destroying the Graph (difficult) [min Cut] minimum point weight coverage
3084 Panic Room (medium, Good topic) [min Cut] edge connectivity
3204 Ikki's Story i–road Reconstruction (Basic) [min Cut] seek critical edge
3308 paratroopers (more difficult) [min Cut] product take logarithm, minimum point weight coverage
3436 ACM computer Factory [min Cut] collection flow, residue collection find edges
3469 Dual Core CPU (medium) [min Cut] Collection stream
3921 destroying the bus stations [min Cut] point connectivity
2396 Budget (medium) [Yuanhui feasible flow with upper and lower bounds]
3155 Hard Life (very challenging) [Maximum density sub-chart]
2914 Minimum cut [no diagram min Cut]
============================ The following is the dancing Links series ============================
1001 Easy Finding POJ-3740
1002 Power Stations HDOJ-3663
1003 Treasure Map ZOJ-3209
1004 Lamp HDOJ-2828
1005 Whosyourdaddy HDOJ-3498
1006 Bomberman–just search! HDOJ-3529
1007 Square Destroyer POJ-1084
1008 Matrix HDOJ-2119
1009 Divisibility HDOJ-3335
1010 Radar HDOJ-2295
1011 Fire Station HDOJ-3656
1012 Repair Depots HDOJ-3156
1013 Dominoes HDOJ-2518
1014 Street Fighter HDOJ-3957
1015 Sudoku Killer HDOJ-1426
1016 Sudoku POJ-2676
1017 Sudoku POJ-3074
1018 Sudoku POJ-3076
1019 Su-su-sudoku HDOJ-2780
1020 Sudoku HDOJ-3111
1021 Sudoku HDOJ-3909
1022 squiggly Sudoku HDOJ-4069
1023 Triangle War II ZOJ-3038
1024x768 A puzzling Problem HDOJ-1603
1025 Maximum Clique HDOJ-1530
hust1017 accurate coverage.
fzu1686,nuaa1507 repeat overlay.
hit2199,2882,2959 precise coverage (Sudoku).
SPOJ1771 Accurate coverage (n Queen problem).
poj3435

Graph theory 500 Questions!