ͼ graph
×Óͼ subgraph
ÓÐÏòͼ digraph(directed graph)
ÎÞÏòͼ undigraph(undirected graph)
Íêȫͼ complete graph
Á¬Í¨Í¼ connected graph
·ÇÁ¬Í¨Í¼ unconnected graph
Ç¿Á¬Í¨Í¼ strongly connected graph
ÈõÁ¬Í¨Í¼ weakly connected graph
¼ÓȨͼ weighted graph
ÓÐÏòÎÞ»·Í¼ directed acyclic graph
Ï¡Êèͼ spares graph
³íÃÜͼ dense graph
ÖØÁ¬Í¨Í¼ biconnected graph
¶þ²¿Í¼ bipartite graph
±ß edge
¶¥µã vertex
»¡ arc
·¾¶ path
»Ø·£¨»·£©cycle
»¡Í· head
»¡Î² tail
Ô´µã source
ÖÕµã destination
»ãµã sink
Ȩ weight
Á¬½Óµã articulation point
³õʼ½áµã initial node
Öն˽áµã terminal node
ÏàÁÚ±ß adjacent edge
ÏàÁÚ¶¥µã adjacent vertex
¹ØÁª±ß incident edge
Èë¶È indegree
³ö¶È outdegree
×î¶Ì·¾¶ shortest path
ÓÐÐò¶Ô ordered pair
ÎÞÐò¶Ô unordered pair
¼òµ¥Â·¾¶ simple path
¼òµ¥»Ø· simple cycle
Á¬Í¨·ÖÁ¿ connected component
ÁÚ½Ó¾ØÕó adjacency matrix
ÁÚ½Ó±í adjacency list
ÁÚ½Ó¶àÖرí adjacency multilist
±éÀúͼ traversing graph
Éú³ÉÊ÷ spanning tree
×îС£¨´ú¼Û£©Éú³ÉÊ÷ minimum(cost)spanning tree
Éú³ÉÉÁÖ spanning forest
ʵÓÃÓ¢Ó¼ÆËã»ú-Êý¾Ý½á¹¹»ù±¾Ó¢Óï(3)
ÍøÂç×ÊÔ´ Freekaoyan.com/2008-04-12
Ïà¹Ø»°Ìâ/
ÁìÏÞʱ´ó¶îÓÅ»Ýȯ,Ïí±¾Õ¾Õý°æöλÔÓéÀֵǼÈë¿ÚÏÂÔØöλÔÓéÀÖ¹Ù·½appÏÂÔØ!
ÓÅ»ÝȯÁìÈ¡ºó72СʱÄÚÓÐЧ£¬10ÍòÖÖ×îÐÂöλÔÓéÀֵǼÈë¿ÚÏÂÔØ¿¼Ö¤Ààµç×Ó´òÓ¡öλÔÓéÀÖ¹Ù·½appÏÂÔØÈÎÄãÑ¡¡£º¸ÇÈ«¹ú500ÓàËùԺУöλÔÓéÀÖ¹Ù·½appÏÂÔØöλÔÓéÀֵǼÈë¿ÚÏÂÔؿΡ¢200¶àÖÖÖ°Òµ×ʸñöλÔÓéÀֵǼÈë¿ÚÏÂÔØ¡¢1100¶àÖÖ¾µä½Ì²Ä£¬²úÆ·ÀàÐÍ°üº¬µç×ÓÊé¡¢Ìâ¿â¡¢È«Ì×öλÔÓéÀÖ¹Ù·½appÏÂÔØÒÔ¼°ÊÓƵ£¬ÎÞÂÛÄúÊÇöλÔÓéÀÖ¹Ù·½appÏÂÔظ´Ï°¡¢¿¼Ö¤Ë¢Ì⣬»¹ÊÇ¿¼Ç°³å´ÌµÈ£¬²»Í¬ÀàÐ͵IJúÆ·¿ÉÂú×ãÄúѧϰÉϵIJ»Í¬ÐèÇó¡£ ...öλÔÓéÀֵǼÈë¿ÚÏÂÔØÓÅ»Ýȯ ±¾Õ¾Ð¡±à FreeÒ¼°Û·ÖѧϰÍø 2022-09-19