Ëã·¨³£ÓÃÊõÓïÖÐÓ¢¶ÔÕÕ

（¼ÆËã»ú±à³ÌÓ¢Óï´Ê»ã）
<br>
<br>
<br> Ëã·¨³£ÓÃÊõÓïÖÐÓ¢¶ÔÕÕ
<br> Data Structures »ù±¾Êý¾Ý½á¹¹
<br> Dictionaries ×Öµä
<br> Priority Queues ¶Ñ
<span style="white-space:pre"> </span>
<br> Graph Data Structures ͼ
<br> Set Data Structures ¼¯ºÏ
<br> Kd-Trees Ï߶ÎÊ÷
<br> Numerical Problems ÊýÖµÎÊÌâ
<br> Solving Linear Equations ÏßÐÔ·½³Ì×é
<br> Bandwidth Reduction ´ø¿íѹËõ
<br> Matrix Multiplication ¾ØÕó³Ë·¨
<br> Determinants and Permanents ÐÐÁÐʽ
<br> Constrained and Unconstrained Optimization ×îÖµÎÊÌâ
<br> Linear Programming ÏßÐԹ滮
<br> Random Number Generation Ëæ»úÊýÉú³É
<br> Factoring and Primality Testing Òò×Ó·Ö½â/ÖÊÊýÅж¨
<br> Arbitrary Precision Arithmetic ¸ß¾«¶È¼ÆËã
<br> Knapsack Problem ±³°üÎÊÌâ
<br> Discrete Fourier Transform ÀëÉ¢Fourier ±ä»»
<br> Combinatorial Problems ×éºÏÎÊÌâ
<br> Sorting ÅÅÐò
<br> Searching ²éÕÒ
<br> Median and Selection ÖÐλÊý
<br> Generating Permutations ÅÅÁÐÉú³É
<br> Generating Subsets ×Ó¼¯Éú³É
<br> Generating Partitions »®·ÖÉú³É
<br> Generating Graphs ͼµÄÉú³É
<br> Calendrical Calculations ÈÕÆÚ
<br> Job Scheduling ¹¤³Ì°²ÅÅ
<br> Satisfiability ¿ÉÂú×ãÐÔ
<br> Graph Problems -- polynomial ͼÂÛ-¶àÏîʽËã·¨
<br> Connected Components Á¬Í¨·ÖÖ§
<br> Topological Sorting ÍØÆËÅÅÐò
<br> Minimum Spanning Tree ×îСÉú³ÉÊ÷
<br> Shortest Path ×î¶Ì·¾¶
<br> Transitive Closure and Reduction ´«µÝ±Õ°ü
<br> Matching Æ¥Åä
<br> Eulerian Cycle / Chinese Postman Euler »Ø·/ÖйúÓÊ·
<br> Edge and Vertex Connectivity ¸î±ß/¸îµã
<br> Network Flow ÍøÂçÁ÷
<br> Drawing Graphs Nicely ͼµÄÃè»æ
<br> Drawing Trees Ê÷µÄÃè»æ
<br> Planarity Detection and Embedding ƽÃæÐÔ¼ì²âºÍǶÈë
<br> Graph Problems -- hard ͼÂÛ-NP ÎÊÌâ
<br> Clique ×î´óÍÅ
<br> Independent Set ¶ÀÁ¢¼¯
<br> Vertex Cover µã¸²¸Ç
<br> Traveling Salesman Problem ÂÃÐÐÉÌÎÊÌâ
<br> Hamiltonian Cycle Hamilton »Ø·
<br> Graph Partition ͼµÄ»®·Ö
<br> Vertex Coloring µãȾɫ
<br> Edge Coloring ±ßȾɫ
<br> Graph Isomorphism ͬ¹¹
<br> Steiner Tree Steiner Ê÷
<br> Feedback Edge/Vertex Set ×î´óÎÞ»·×Óͼ
<br> Computational Geometry ¼ÆË㼸ºÎ
<br> Convex Hull ͹°ü
<br> Triangulation Èý½ÇÆÊ·Ö
<br> Voronoi Diagrams Voronoi ͼ
<br> Nearest Neighbor Search ×î½üµã¶Ô²éѯ
<br> Range Search ·¶Î§²éѯ
<br> Point Location λÖòéѯ
<br> Intersection Detection Åöײ²âÊÔ
<br> Bin Packing ×°ÏäÎÊÌâ
<br> Medial-Axis Transformation ÖÐÖá±ä»»
<br> Polygon Partitioning ¶à±ßÐηָî
<br> Simplifying Polygons ¶à±ßÐλ¯¼ò
<br> Shape Similarity ÏàËƶà±ßÐÎ
<br> Motion Planning Ô˶¯¹æ»®
<br> Maintaining Line Arrangements ƽÃæ·Ö¸î
<br> Minkowski Sum Minkowski ºÍ
<br> Set and String Problems ¼¯ºÏÓë´®µÄÎÊÌâ
<br> Set Cover ¼¯ºÏ¸²¸Ç
<br> Set Packing ¼¯ºÏÅäÖÃ
<br> String Matching ģʽƥÅä
<br> Approximate String Matching Ä£ºýÆ¥Åä
<br> Text Compression ѹËõ
<br> Cryptography ÃÜÂë
<br> Finite State Machine Minimization ÓÐÇî×Ô¶¯»ú¼ò»¯
<br> Longest Common Substring ×¹«¹²×Ó´®
<br> Shortest Common Superstring ×î¶Ì¹«¹²¸¸´®
<br> DP¡ª¡ªDynamic Programming¡ª¡ª¶¯Ì¬¹æ»®
<br> recursion ¡ª¡ªµÝ¹é
<br>
<br>
<br>
<br>
<br> ±à³Ì´Ê»ã
<br> A2A integration A2A ÕûºÏ
<br> abstract ³éÏóµÄ
<br> abstract base class (ABC)³éÏó»ùÀà
<br> abstract class ³éÏóÀà
<br> abstraction ³éÏó¡¢³éÏóÎï¡¢³éÏóÐÔ
<br> access ´æÈ¡¡¢·ÃÎÊ
<br> access level ·ÃÎʼ¶±ð
<br> access function ·ÃÎʺ¯Êý
<br> account ÕË»§
<br> action ¶¯×÷
<br> activate ¼¤»î
<br> active »î¶¯µÄ
<br> actual parameter ʵ²Î
<br> adapter ÊÊÅäÆ÷
<br> add-in ²å¼þ
<br> address µØÖ·
<br> address space µØÖ·¿Õ¼ä
<br> address-of operator È¡µØÖ·²Ù×÷·û
<br> ADL (argument-dependent lookup)
<br> ADO(ActiveX Data Object)ActiveX Êý¾Ý¶ÔÏó
<br> advanced ¸ß¼¶µÄ
<br> aggregation ¾ÛºÏ¡¢¾Û¼¯
<br> algorithm Ëã·¨
<br> alias ±ðÃû
<br> align ÅÅÁС¢¶ÔÆë
<br> allocate ·ÖÅä¡¢ÅäÖÃ
<br> allocator ·ÖÅäÆ÷¡¢ÅäÖÃÆ÷
<br> angle bracket ¼âÀ¨ºÅ
<br> annotation ×¢½â¡¢ÆÀ×¢
<br> API (Application Programming Interface)Ó¦ÓÃ(³ÌÐò)±à³Ì½Ó¿Ú
<br> app domain (application domain)Ó¦ÓÃÓò
<br> application Ó¦Óá¢Ó¦ÓóÌÐò
<br> application framework Ó¦ÓóÌÐò¿ò¼Ü
<br> appearance Íâ¹Û
<br> append ¸½¼Ó
<br> architecture ¼Ü¹¹¡¢Ìåϵ½á¹¹
<br> archive file ¹éµµÎļþ¡¢´æµµÎļþ
<br> argument ÒýÊý(´«¸øº¯Ê½µÄÖµ)¡£²Î¼ûparameter
<br> array Êý×é
<br> arrow operator ¼ýÍ·²Ù×÷·û
<br> ASP(Active Server Page)»î¶¯·þÎñÆ÷Ò³Ãæ
<br> ASP.NET worker process ASP.NET ¹¤×÷Õß½ø³Ì
<br> assembly ×°Åä¼þ¡¢Åä¼þ
<br> assembly language »ã±àÓïÑÔ
<br> assembly manifest ×°Åä¼þÇåµ¥
<br> assert(ion)¶ÏÑÔ
<br> assign ¸³Öµ
<br> assignment ¸³Öµ¡¢·ÖÅä
<br> assignment operator ¸³Öµ²Ù×÷·û
<br> associated Ïà¹ØµÄ¡¢Ïà¹ØÁªµÄ
<br> associative container ¹ØÁªÊ½ÈÝÆ÷(¶ÔÓ¦sequential container)
<br> asynchronous Òì²½µÄ
<br> atomic Ô­×ÓµÄ
<br> atomic operation Ô­×Ó²Ù×÷
<br> attribute ÌØÐÔ¡¢ÊôÐÔ
<br> authentication service ÑéÖ¤·þÎñ
<br> authorization ÊÚȨ
<br> audio 񙮵
<br> A.I. È˹¤ÖÇÄÜ
<br> B2B integration B2B ÕûºÏ¡¢B2B ¼¯³É(business-to-business integration)
<br> background ±³¾°¡¢ºǫ́(½ø³Ì)
<br> backward compatible Ïòºó¼æÈÝ¡¢ÏòϼæÈÝ
<br