Graph Theory 500

Source: Internet
Author: User

Reprinted from: http://blog.csdn.net/ffq5050139/article/details/7832991

================================== The following is the minimum spanning tree + query set === ========================================== [HDU] 1213 how many tables basics and query Sets★1272 xiaoxi's maze basics and query Sets★1325 & poj1308 is it a tree? Basic and query set★1856 more is better basic and query set★1102 constructing roads basic minimal spanning tree★1232 smooth engineering foundation and query★1233 or smooth engineering basic least Spanning Tree★1863 smooth engineering basic least Spanning Tree★1875 smooth engineering rebuild basic minimal spanning tree★1879 continue to smooth the basic generation tree of the project★3371 connect the cities simple and minimal spanning tree★1301 jungle roads basic minimal spanning tree★1162 Eddy's picture basic minimal spanning tree★1198 farm irrigation basic minimal spanning tree★1598 find the most comfortable road enumeration + Minimum Spanning Tree★★1811 rank of Tetris and query set + topological sorting★★3926 Hand in Hand same diagram★3938 portal offline + query set★★2489 minimal ratio tree DFS enumeration combination + Minimum Spanning Tree★4081 Qin Shi Huang's national road system Minimum Spanning Tree + DFS★★4126 Genghis Khan the Conqueror enumeration + minimal spanning tree + DFS (difficult)★★★★1829 & poj2492 A Bug's Life basic types and query Sets★1558 Segment Set Calculation ry + query set★3461 code lock and query set (difficult to think)★★3367 maximum Spanning Tree of pseudo★2473 junk-Mail Filter and query set + set up virtual parent node (vest)★★3172 virtual friends with permission and query set★3635 dragon bils with permission and query set★3047 zjnu stadium with permission and query set★3038 how many answers are wrong types and query Sets★★2818 building block with permission and query set★3234 exclusive-or exclusive or parallel query set (difficult)★★★2121 ice_cream's World II least tree structure (it's disgusting to output the root)★★4009 Transfer Water minimum tree structure (Template)★3311 dig the wells stanna tree (pressure DP) (template question)★★4085 Peach Blossom Spring stanna tree (pressure DP) (may be forest ...)★★★2586 how far away? LCA★2874 connections between citieslca★3486 interviewermq★2888 check corners two-dimensional rmq★3183a magic lamprmq (difficult to think about, difficult to contact rmq)★★[Poj] 1258 most classic MST★1789 truck history Minimum Spanning Tree★1287 networking is simple★2349 simple Arctic Network★1611 the suspects and query the set★2377 Kruskal★2524 ubiquitous religions and query set★2236 wireless network and query set + computational ry★2560 Kruskal and query set★1861 Kruskal★3625 prim★1679-the unique MST (basic) determines whether the MST is unique★3522-slim span (basic) calculates a spanning tree to minimize the difference between the smallest edge and the smallest edge★The longest edge in 2485 highways MST★2395 longest edge of the Minimum Spanning Tree★1751 highways find the solution★Types of POJ-1182 food chain★★Poj 1456 supermarket greedy + interval merge★POJ-1703 type and query set★POJ-1988 type and query set★POJ-1733 parity game type and query set, first need to discretization, does not affect the results★POJ-1417 true liars (hard) and query set + dp type and query set★★POJ-2912 rochambeau (difficult) Baidu question, very good... is the enhanced version of the food chain. It is difficult to judge the referee.★★★Poj 2728 desert King (medium) optimal rate Spanning Tree★★Poj 1639 picnic planning (difficult) Minimum Spanning Tree with limited vertex degrees★★Poj 3164 Command Network (difficult) minimum tree structure★★Poj3723 Good question !!!★★Poj3228 good questions !!!★★[Zoj] Reverse ZOJ-3261 and query set★★===============================================Below are the most short-circuit series ==== ================================== [HDU] 1548 a strange lift Basics shortest Path (or BFS)★2544 minimum short-circuit basis minimum short-circuit★3790 Shortest Path★2066 the shortest path of a person's travel infrastructure (multi-source Multi-sink, super source points and endpoints can be established)★2112 HDU today basic Short Circuit★1874 maximum Short Circuit★1217 arbitrage currency exchange Floyd (or Bellman-Ford judgment ring)★1245 saving James Bond calculation ry + Shortest Path★1317 xyw.bellman-Ford judgment ring, with negative authority★1535 invitation cards: returns the shortest path of a directed graph (reverse graph)★1546 idiomatic phrases game Short Circuit★2680 choose the best route Short Circuit★2923 einbahnstrasse Short Circuit★3339 in action short circuit + backpack★2224 the Shortest Path dual-tuning Traveling Salesman Problem★★2807 the Shortest Path matrix operation + Floyd)★★1595 find the longest of the shortest enumeration + shortest (delete the longest and shortest short circuits of any side)★★3986 Harry Potter and the final battle enumeration + Shortest Path (delete the shortest path of any side)★★1599 find the mincost routefloyd to find the smallest Ring★1839 Delay Constrained... minimum limit of two points + minimum short circuit (with maximum short circuit)★★3631 Shortest Path Floyd Insertion Method★★4114disney's Fastpass short circuit + two-dimensional pressure dp (difficult)★★★3832 Earth Hour three-point connectivity (Stanner tree)★3873 invade the marsdij variant (Good question !, With limit)★★★4063 aircraft geometric diagram + Shortest Path★★★★Hdustm9difficult routesdis [] [] returns the shortest path of a two-dimensional state (with limited Shortest Path)★★1869 six-degree separation Floyd shortest★1385 minimum transport cost shortest path + output path (minimum output path in Lexicographic Order)★★1224 free DIY tour Shortest Path + output path★1142 a walk through the forest short circuit + Memory search★★1596 find the least short circuit of the safest road Product★1598 find the most comfortable road binary speed difference + Shortest Path (with limited Shortest Path)★★2722 Here We Go (relians) again Short Circuit★2962 trucking binary + Shortest Path (with limited Shortest Path)★★1690 bus system★2433 sum of travel edge deletion + Shortest Path (pre-processing bridge edge)★★★2363 sort ing binary + shortest short circuit (with limited shortest)★★2377 bus pass (find the longest, shortest, and shortest path of a point)★★2833 Wukong Shortest Path + Memory search (find the two shortest points with the shortest path)★★1688 sightseeing★★3191 how many paths are there number of short circuits★★2482 most short-circuited transit search★★★3768 shopping short circuit + DFS (or short circuit + pressure DP)★★3035 war floor plan minimal cut (difficult to create a map)★★3870 catch the theves floor plan least cut (difficult to create a graph)★★3860 minimal cut of the circuit board (difficult to create a picture)★★[Poj] 1062 expensive dowry can be associated with the shortest circuit.★★1094 sorting it all outfloyd judgment ring + topological sorting★1125 stockbroker grapevinefloyd★1135 domino effect short circuit, interesting★★1161 Wils short-circuited path (the figure is disgusting)★★1502 MPI maelstromfloyd★1511 invitation cards★1556the doors calculation ry + Shortest Path★★1724 the maximum short circuit with restrictions on roads. Dis [] [] enables two-dimensional recording of information (or extensive search)★★1734 sightseeing tripfloyd minimum ring path★1797 Heavy Transportation bipartite enumeration + Shortest Path★1847 tram simple and shortest Short Circuit★1860 currency exchange★1949 chores reverse edge construction to find the longest path★★2139 Six Degrees of cowvin baconfloyd★2240arbitrage currency exchange★2253frogger binary + Shortest Path★2312 tank war spfa short circuit essential deformation --> Guang Suo★2387 til the cows come home basic Short Circuit★2394 checking an alibi shortest Circuit★2449remmarguts 'datea * calculates the K Short Circuit★★2457 part acquisition (output path)★★2472 106 miles to Chicago product shortest circuit (log down, multiplication, transformation, and addition)★★2502subway2570 fiber network floyd3013 Christmas tree 3037skiing3072 robot3114 countries in war strong Unicom + minimum short circuit 3160 Father Christmas flymouse strong Unicom + longest road 3255 roadblock3259 wormholes (search for negative weight loop) 3268 silver cow part3311 HIE with the pie Floyd + pressure 3328 Cliff climbing3439 server relocation3463 sightseeing number of short circuits 31593521 geometric map calculation ry + shortest 3549gsm phone calculation + shortest 3594 escort of Dr. who how3613 cow relays goes through the shortest circuit of n edges // Floyd + binary matrix 3615 Cow hurdles3621 optimal rate ring 3635 full tank? 3660 pass closure 3662 telephone lines =====================================below is a series of differential constraints = ==================== [HDU] 1384 intervals1529 cashier employment1531 king1534 schedule problem3440 house man3592 world exhibition3666 the matrix problem [poj] 120112751364171629492983315931693687 = series ============================== normal match, multi-Match [HDU] 1068 girls and boys1150machine schedule1151air raid1179oll Ivanders: makers of fine wands since 382 bc.1281 board game 149850 years, 50 colors1507uncle Tom's inherited land * 1528 card game cheater1845jimmy's assignment2063 roller coaster named accomodation of choice. dog3081marriage match ii3360national treasures1045 can also be searched for 1350 min path coverage 3118 similar to binary match 3729238910542819 exact match 1668 binary + multiple match 3605 multiple match 3861 strong connectivity + 2236 N-binary match no question iihdu1_hdu4185 parity match] 1087a plug for unix1274 the perfe CT stall1469courses1486 sorting slides bipartite graph must side 1548robots1698alice's chance1719shooting contest1904 King's quest evaluate all possible matching edges of the Bipartite Graph 2060 taxi cab Scheme minimum path overwrite 2112 optimal milking binary + Multiple matching 2226 muddy fields row and column coverage 2239 selecting courses2289 Jamie's contact groups binary + Multi-match 2446 chessboard2536 gopher II2584T-Shirt gumbo2594 treasure configuration intersection minimum path coverage purifying machine3020 antenna placement3041 Asteroids simple row and column matching 3189 steady cow assignment binary + Multiple matching 3207 Ikki's Story IV-panda's trick3216 repairing company3343 against sort kindergarten2771 Maximum Independent Set ============== ========================== below are the KM algorithm series ========================== ============= [HDU] 2255 Ben Xiaokang makes a lot of money 1533 going home1853cyclic tour3488tour3435a New Graph game2426interesting housing %game3395special fish2282chocolate2813one Fihgt one2448mining station on the sea3315my brute3523image copy detection [poj] 2195 going home minimum weight matching 2400 supervisor, supervisee outputs all minimum weight matching 2516 minimum cost minimum weight matching or minimum cost flow 3565ants3686 the Windy's minimum weight matching ============ =================below is the largest group & stable marriage series ============================ ========= [HDU] 1530 maximum clique1435stable match3585maximum shortest distance binary + the largest 1522 marriage is stable1914the stable marriage problem [Po J] 1129 four color theorem coloring problem 1419 Maximum Independent Set 2989 extremely large group 3487 the stable marriage problem stable marriage ================== ======== the following are the strong and double Unicom series ============================ = [HDU: the 1269 maze Castle determines whether a strongly connected 2767 proving equivalences should add at least a few sides to make the entire graph become strongly connected 3836 equivalent sets add at least a few sides to make the entire graph become strongly connected 1827 Summer Holiday Pass the minimum cost: 3072 minimum fee passed by intelligence system: 1The King's problem strong connectivity + binary matching 3639hawk-and-chicken strong connectivity contraction point + tree-like dp (total weight of sub-nodes) 3594 cactus diagram dual Connectivity: 2242 Postgraduate Entrance Exam Middleware-air-conditioning classroom dual-connection deflation point + tree dp2460network edge dual-connection 3849by recognizing these guys, we find social networks useful dual-Connection Bridge 3896 greatest TC dual-connection 4005 the war edge dual-connection LCA: 2586how far away? 2874 connections between cities3078network LCA + sorting 3830 checkers binary + LCA [poj] strong connectivity: 1236 network of schools2553 the bottom of a graph Good question! Find a set of 2186 popular cows with a degree of 0! If the degree is 0, all other components point to its set 2375cow ski area, which is strongly connected with 2762 going from u to V or from V to u? Point Reduction + topological sorting 3160 Father Christmas flymouse strong connectivity + minimum circuit 3180 the cow prom judges there are several loops, the number of elements greater than 1 in the component is 3114 countries in war strong connectivity + the shortest path is 3592 instantaneous transference strong connectivity component + the longest route 1904king's quest strong connectivity + and the query set dual Connectivity: 3694 network edge dual-connectivity (same as hdu2460) 3177 redundant paths construct edge dual-connectivity 3352 road construction construct edge dual-connectivity 2942 knights of the Round Table) 1515 street directions ctions (undirected graph-Directed Graph) 1438 one-way traffic (hybrid graph-Directed Graph) LCA: 1330 nearest common ancestors14 70 closest common ancestors1986distance queries3417network3728the merchant LCA + and query the set, update the query 2763 housewife wind LCA + tree array ===================================== The following is 2 -Sat series ======================== [HDU] 3062 party1824 Let's go home3622 bomb game3715 go deeper1815 building roads2723 get Luffy out1816 get Luffy out * 1814 peaceful commission4115 eliminate the conflict [poj] 2296 map labeler2723 get Luffy out27building Roads3207 Ikki's Story IV-panda's trick3648 wedding3678 Katu puzzle3683 priest John's busiest day3905 perfect election ================ = = [HDU] 1878 Euler's loop judgment 3018ant trip stroke problem 11162894 Z-drum Euler's circuit 19563472 hybrid Euler [poj] 2513 Euler's road 1041 John's trip Euler's circuit 1386 play on words solitaire 2230 watchcow Euler's circuit 2513 colored sticks undirected Euler's path 2337 catenyms Euler's path 1392 Ouroboros snake Z drum Euler's circuit 1780 code 1637 hybrid Euler [zoj] 1992 ============================= The following are Topology Sorting Series ======================================= [HDU] 1285 determine the rankings of the Competition 2094 generate the championship 2647reward3342legal or not1811rank of RIS topology + query set 3231 3D topology [poj] 1094 sorting it all out Floyd + topology 2367 genealogical tree3660 cow contest3687 labeling bils magic topology 1128 frame stacking DFS topology 1270 following orders topology + backtracking 1420 spreadsheet simulation topology 2762 going from u to V or from V to u? Strongly Connected + topology 3553 task schedule =============================below is the competition chart Series = routeHDOJ-3414 = =============================== [HDU] 1532 drainage ditches (basic) [maximum stream] 3549 Flow Problem (basic) [maximum stream] 3572 task schedule [maximum stream] task allocation, judge whether the full stream is 2732leapin 'lizards (difficult) [maximum stream] 3338 Kakuro extension [maximum Large stream] [number and] Magic maximum popularity in listing 2883 kebab [maximum stream] Judging full stream 3605 escape [maximum stream] (Multiple matching 3081 marriage match II [maximum stream of two points] + and query set 3277 marriage match III [Dual maximum stream] Same as above, remove point 3416 marriage match IV [maximum stream] Shortest Path + maximum stream 2485 destroying the bus stations [maximum stream] Shortest Path + maximum stream 3468 treasure hunting [maximum stream] (Binary matching) + up to 3551 hard problem [maximum stream] 3998 sequence (difficult) [DP + Max stream] Longest ascending sub-sequence 3917 road constructions [max weight closure] 3879 base station [max weight closure] 3061 battle [max weight closure] 3996 gold mine [max weight Closure] ipv2hs BDC [hybrid Euler] hdu4183 does not go back and forth The network stream of the repeat. ------------------------- 1533 going home (basic) [billing flow] 3488 tour [billing flow] Circle 3435a New Graph game [billing flow] Circle 1853 cyclic tour [billing flow] Circle 2686 matrix [billing flow] 3376 matrix again [billing Flow] 3667 transportation [fee stream] split edge 3315my brute [fee stream] (available km) 3395 special fish [fee stream] (available km matching) 2448 mining station on the sea [fee stream] (available Shortest Path + km matching) 4067 random maze (difficult) [billing flow] 3947 River Problem (difficult) [billing flow] Magic billing flow, traffic inequality fig 3046 pleasant sheep and big wolf [minimum cut] 1565 square fetch (1) [minimum cut] 1569 square meters Number (2) [minimum cut] 3820 golden eggs [minimum cut] square strengthen 3491 thieves [minimum cut] minimum cut set 3657 game [minimum cut] maximum Point Weight independence set 3313key vertex [minimum cut] 3251 being A hero [minimum cut] 3157 crazy circuits [upstream and downstream] 3002 king of destruction [global minimum cut] 3691 nubulsa Expo [global minimum cut] [poj] 1087a plug for Unix [maximum stream] (binary matching is available) 1274the perfect stall [maximum stream] (binary matching available) 1325 Machine Schedule [maximum stream] (binary matching available) 1698alice's chance [maximum stream] (binary matching available) 2239 selecting courses [maximum stream] (binary matching available) 2446 chessboard [maximum stream] (binary matching available) Good question 2536gop Her II [maximum stream] (binary matching available) 2771 guardian of decency [maximum stream] binary matching Maximum Independent Set 3041 asteroids [maximum stream] (simple binary matching) 2584 T-shirt gumbo [maximum stream] (Multiple matching) 3189 steady cow assignment (medium) [maximum stream of two points] (Multiple matching) 1149 pigs [maximum stream] Absolute classical architecture question 1273 drainage ditches [maximum stream] (basic) 1459 Power Network (basic) [maximum stream] 3281 dining [maximum stream] 2112 optimal milking (basic) [maximum stream of two points] 2289 Jamie's contact groups [maximum stream of two points] 2391 ombrophobic bovines (medium) [maximum binary stream] 2455 secret milking machine (basic) [maximum binary stream] 32 28 gold transportation [binary maximum stream] (query set) 2699 the maximum number of strong kings (difficult) [enumeration count + maximum stream] 3498 March of the Penguins (moderate) [maximum stream] enumeration of collection points. network stream 2987 firing (difficult) meeting the point capacity limit [maximum weight closure] 1637 Sightseeing Tour (crazy) [hybrid Euler] 2135 farm tour [cost stream] (Back and Forth shortest) 2175 evacuation plan (moderate) [billing flow] 2195 going home [billing flow] 2516 minimum cost [billing flow] 3422 Kaka's matrix travels (medium) [billing flow] splitting point 3680 intervals (difficult) [billing flow] Classic, billing flow + discretization listen 6The Windy's [billing flow] (km matching) 3762the bonus salary! [Cost stream] 1815 friendship (medium) [minimum cut] minimum point cut set 1966 cable TV network (medium) [minimum cut] minimum point cut set 2125 destroying the graph (difficult) [minimum cut] minimum point weight covers 3084 panic room (medium, good question) [minimum cut] edge connectivity 3204 Ikki's story I-road reconstruction (basic) [minimum cut] obtain the key edge 3308 paratroopers (difficult) [minimum cut] product to obtain the logarithm. The minimum point weight covers the 3436acm computer factory [minimum cut] collection stream, residual search edge 3469 dual core CPU (medium) [minimum cut] Collect stream 3921 destroying the bus stations [minimum cut] Point connect 2396 budget (medium) [upstream and downstream feasible streams with source sink] 3155 hard life (challenging) [maximum density Sub-graph] 2914 minimum cut [undirected graph least cut] ===========================below is dancing links series ============================== 1001 easy FindingPOJ-37401002Power StationsHDOJ-36631003Treasure MapZOJ-32091004LampHDOJ-28281005whosyourdaddyHDOJ-34981006Bomberman-Just search! HDOJ-35291007Square DestroyerPOJ-10841008MatrixHDOJ-21191009DivisibilityHDOJ-33351010RadarHDOJ-22951011Fire stationHDOJ-36561012Repair DepotsHDOJ-31561013DominoesHDOJ-25181014Street FighterHDOJ-39571015Sudoku KillerHDOJ-14261016SudokuPOJ-26761017SudokuPOJ-30741018SudokuPOJ-30761019Su-Su-SudokuHDOJ-27801020SudokuHDOJ-31111021SudokuHDOJ-39091022Squiggly SudokuHDOJ-40691023Triangle war IIZOJ-30381024A Puzzling ProblemHDOJ-16031025Maximum CliqueHDOJ-1530hust1017 precise coverage. Fzu1686 and nuaa1507 are overwritten. Hit2199, 2882,2959 precise coverage (Sudoku ). Spoj1771 precise coverage (n queen problem ). Poj3435

Contact Us

The content source of this page is from Internet, which doesn't represent Alibaba Cloud's opinion; products and services mentioned on that page don't have any relationship with Alibaba Cloud. If the content of the page makes you feel confusing, please write us an email, we will handle the problem within 5 days after receiving your email.

If you find any instances of plagiarism from the community, please send an email to: info-contact@alibabacloud.com and provide relevant evidence. A staff member will contact you within 5 working days.

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.