{"id":4677,"date":"2020-10-25T10:46:18","date_gmt":"2020-10-25T02:46:18","guid":{"rendered":"https:\/\/damogame.cn\/wordpress\/?p=4677"},"modified":"2020-10-25T10:46:18","modified_gmt":"2020-10-25T02:46:18","slug":"%e3%80%90%e6%95%b0%e6%8d%ae%e7%bb%93%e6%9e%84%e3%80%91%e5%8d%81%e5%ad%97%e9%93%be%e8%a1%a8","status":"publish","type":"post","link":"https:\/\/i007.cc\/wordpress\/archives\/4677","title":{"rendered":"\u3010\u6570\u636e\u7ed3\u6784\u3011\u5341\u5b57\u94fe\u8868"},"content":{"rendered":"

\u539f\u6587\u5730\u5740<\/a><\/p>\n

 <\/p>\n

\n

\u4e0a\u7bc7\u6587\u7ae0\u8bb2\u89e3\u4e86\u56fe\u7684\u90bb\u63a5\u8868\u7684\u94fe\u5f0f\u5b58\u50a8\u65b9\u5f0f\uff0c\u8fd9\u7bc7\u6587\u7ae0\u8bb2\u89e3\u56fe\u7684\u5341\u5b57\u94fe\u5b58\u50a8\u65b9\u5f0f\u3002<\/p>\n

<\/a><\/a>\u57fa\u672c\u6982\u5ff5<\/h2>\n

\u5341\u5b57\u94fe\u8868\u662f\u4e3a\u4e86\u4fbf\u4e8e\u6c42\u5f97\u56fe\u4e2d\u9876\u70b9\u7684\u5ea6\uff08\u51fa\u5ea6\u548c\u5165\u5ea6\uff09\u800c\u63d0\u51fa\u6765\u7684\u3002\u5b83\u662f\u7efc\u5408\u90bb\u63a5\u8868\u548c\u9006\u90bb\u63a5\u8868\u5f62\u5f0f\u7684\u4e00\u79cd\u94fe\u5f0f\u5b58\u50a8\u7ed3\u6784\u3002<\/p>\n

\u5728\u5341\u5b57\u94fe\u8868\u5b58\u50a8\u7ed3\u6784\u4e2d\uff0c\u6709\u5411\u56fe\u4e2d\u7684\u9876\u70b9\u7684\u7ed3\u6784\u5982\u4e0b\u6240\u793a\uff1a<\/p><\/div>\n

\"\"<\/div>\n
\n

\u5176\u4e2ddata\u8868\u793a\u9876\u70b9\u7684\u5177\u4f53\u6570\u636e\u4fe1\u606f\uff0c\u800cfirstIn\u5219\u8868\u793a\u6307\u5411\u4ee5\u8be5\u9876\u70b9\u4e3a\u5f27\u5934\u7684\u7b2c\u4e00\u4e2a\u5f27\u8282\u70b9\u3002\u800cfirstOut\u5219\u8868\u793a\u6307\u5411\u4ee5\u8be5\u9876\u70b9\u4e3a\u5f27\u5c3e\u7684\u7b2c\u4e00\u4e2a\u5f27\u8282\u70b9\u3002\u4e3a\u4e86\u8868\u793a\u6709\u5411\u56fe\u4e2d\u6240\u6709\u7684\u9876\u70b9\uff0c\u91c7\u7528\u4e00\u4e2a\u9876\u70b9\u6570\u7ec4\u5b58\u50a8\u6bcf\u4e00\u4e2a\u7ed3\u70b9\uff0c\u5982\u4e0b\u56fe\u6240\u793a\u3002<\/p>\n

\"\"<\/div>\n<\/div>\n
\n

\u53e6\u5916\uff0c\u5728\u5341\u5b57\u94fe\u8868\u5b58\u50a8\u7ed3\u6784\u4e2d\uff0c\u6709\u5411\u56fe\u4e2d\u7684\u6bcf\u4e00\u6761\u5f27\u90fd\u6709\u4e00\u4e2a\u5f27\u7ed3\u70b9\u4e0e\u4e4b\u5bf9\u5e94\uff0c\u5177\u4f53\u7684\u5f27\u7ed3\u70b9\u7ed3\u6784\u5982\u4e0b\u6240\u793a\uff1a<\/p>\n

\"\"<\/p>\n

 <\/p>\n

\u5176\u4e2d\u7684tailVex\u8868\u793a\u8be5\u5f27\u7684\u5f27\u5c3e\u9876\u70b9\u5728\u9876\u70b9\u6570\u7ec4xList\u4e2d\u7684\u4f4d\u7f6e\uff0cheadVex\u8868\u793a\u8be5\u5f27\u7684\u5f27\u5934\u9876\u70b9\u5728\u9876\u70b9\u6570\u7ec4\u4e2d\u7684\u4f4d\u7f6e\u3002hLink\u5219\u8868\u793a\u6307\u5411\u5f27\u5934\u76f8\u540c\u7684\u4e0b\u4e00\u6761\u5f27\uff0ctLink\u5219\u8868\u793a\u6307\u5411\u5f27\u5c3e\u76f8\u540c\u7684\u4e0b\u4e00\u6761\u5f27\u3002<\/p>\n

\u4ece\u5341\u5b57\u94fe\u8868\u7684\u6570\u636e\u7ed3\u6784\u6765\u770b\uff0c\u6bcf\u4e00\u4e2a\u9876\u70b9\u5bf9\u5e94\u4e24\u4e2a\u94fe\u8868\uff1a\u4ee5\u8be5\u9876\u70b9\u4e3a\u5f27\u5c3e\u7684\u5f27\u7ed3\u70b9\u6240\u7ec4\u6210\u7684\u94fe\u8868\u4ee5\u53ca\u4ee5\u8be5\u9876\u70b9\u4e3a\u5f27\u5934\u7684\u5f27\u7ed3\u70b9\u6240\u7ec4\u6210\u7684\u94fe\u8868\u3002<\/p>\n

\u5982\u4e0b\u56fe\u6240\u793a\u7684\u4e00\u4e2a\u6709\u5411\u56fe\uff1a<\/p>\n

\"\"<\/p>\n

\u5176\u5bf9\u5e94\u7684\u9876\u70b9\u4ee5\u53ca\u5f27\u7ed3\u70b9\u5982\u4e0b\u6240\u793a\u3002\u62ff\u7ed3\u70b9A\u8bf4\u660e\uff0c\u8be5\u7ed3\u70b9\u5bf9\u5e94\u4e24\u4e2a\u94fe\u8868\uff08\u7eff\u8272\u548c\u9ec4\u8272\u6807\u8bb0\u7684\uff09\u3002\u7eff\u8272\u94fe\u8868\u8868\u793a\u4ee5\u7ed3\u70b9\uff21\u4e3a\u5f27\u5934\u7684\u5f27\u7ec4\u6210\u7684\u94fe\u8868\u3002\u9ec4\u8272\u94fe\u8868\u8868\u793a\u4ee5\u7ed3\u70b9\uff21\u4e3a\u5f27\u5c3e\u7684\u5f27\u7ec4\u6210\u7684\u94fe\u8868\u3002<\/p>\n

\"\"<\/div>\n

 <\/p>\n

<\/a><\/a>\u57fa\u672c\u64cd\u4f5c<\/h2>\n

 <\/p>\n

1\u3001\u521b\u5efa\u56fe\u7684\u5341\u5b57\u94fe\u8868<\/p>\n

<\/code><\/pre>\n
    \n
  1. \n
    \n
    <\/div>\n<\/div>\n
    \n
    Status createDG<\/span>(OLGraph &G, int<\/span> vexNum, int<\/span> arcNum)<\/span><\/span>{<\/div>\n<\/div>\n<\/li>\n
  2. \n
    \n
    <\/div>\n<\/div>\n
    \n
    G.vexNum = vexNum;<\/div>\n<\/div>\n<\/li>\n
  3. \n
    \n
    <\/div>\n<\/div>\n
    \n
    G.arcNum = arcNum;<\/div>\n<\/div>\n<\/li>\n
  4. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  5. \n
    \n
    <\/div>\n<\/div>\n
    \n
    for<\/span>(int<\/span> i = 0<\/span>; i<G.vexNum; i++){<\/div>\n<\/div>\n<\/li>\n
  6. \n
    \n
    <\/div>\n<\/div>\n
    \n
    cin<\/span>>>G.xList[i].data;<\/div>\n<\/div>\n<\/li>\n
  7. \n
    \n
    <\/div>\n<\/div>\n
    \n
    G.xList[i].firstIn = NULL<\/span>;<\/div>\n<\/div>\n<\/li>\n
  8. \n
    \n
    <\/div>\n<\/div>\n
    \n
    G.xList[i].firstOut = NULL<\/span>;<\/div>\n<\/div>\n<\/li>\n
  9. \n
    \n
    <\/div>\n<\/div>\n
    \n
    }\/\/\u521d\u59cb\u5316<\/span><\/div>\n<\/div>\n<\/li>\n
  10. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  11. \n
    \n
    <\/div>\n<\/div>\n
    \n
    for<\/span>(int<\/span> i = 0<\/span>; i<G.arcNum; i++){<\/div>\n<\/div>\n<\/li>\n
  12. \n
    \n
    <\/div>\n<\/div>\n
    \n
    vexNode node1, node2;<\/div>\n<\/div>\n<\/li>\n
  13. \n
    \n
    <\/div>\n<\/div>\n
    \n
    cout<\/span><<“please input two nodes of “<\/span><<i+1<\/span><<“-th arc”<\/span><<endl<\/span>;<\/div>\n<\/div>\n<\/li>\n
  14. \n
    \n
    <\/div>\n<\/div>\n
    \n
    cin<\/span>>>node1.data>>node2.data;<\/div>\n<\/div>\n<\/li>\n
  15. \n
    \n
    <\/div>\n<\/div>\n
    \n
    <\/div>\n<\/div>\n<\/li>\n
  16. \n
    \n
    <\/div>\n<\/div>\n
    \n
    insertArc(G, node1, node2);<\/div>\n<\/div>\n<\/li>\n
  17. \n
    \n
    <\/div>\n<\/div>\n
    \n
    }<\/div>\n<\/div>\n<\/li>\n
  18. \n
    \n
    <\/div>\n<\/div>\n
    \n
    return<\/span> 1<\/span>;<\/div>\n<\/div>\n<\/li>\n
  19. \n
    \n
    <\/div>\n<\/div>\n
    \n
    }<\/div>\n<\/div>\n<\/li>\n<\/ol>\n
    <\/code><\/pre>\n
    \u6d4b\u8bd5\u7ed3\u679c\uff1a<\/p>\n
    \u5982\u4e0b\u56fe\u6240\u793a\u9996\u5148\u8f93\u5165\u56db\u4e2a\u9876\u70b9\uff1aA\u3001B\u3001C\u3001D\uff0c\u7136\u540e\u8f93\u51657\u6761\u5f27\u3002<\/p>\n
    \"\"<\/div>\n
    \u65e2\u53ef\u4ee5\u6784\u5efa\u5982\u4e0b\u7684\u6709\u5411\u56fe\u3002<\/p>\n
    \"\"<\/div>\n
     <\/p>\n
    2\u3001\u6309\u7167\u5341\u5b57\u94fe\u8868\u5f62\u5f0f\u6253\u5370\u56fe<\/p>\n
    <\/code><\/pre>\n
      \n
    1. \n
      \n
      <\/div>\n<\/div>\n
      \n
      Status printDG<\/span>(OLGraph &G)<\/span><\/span>{<\/div>\n<\/div>\n<\/li>\n
    2. \n
      \n
      <\/div>\n<\/div>\n
      \n
      for<\/span>(int<\/span> i = 0<\/span>; i<G.vexNum; i++){<\/div>\n<\/div>\n<\/li>\n
    3. \n
      \n
      <\/div>\n<\/div>\n
      \n
      arcBox *ptail = G.xList[i].firstOut;<\/div>\n<\/div>\n<\/li>\n
    4. \n
      \n
      <\/div>\n<\/div>\n
      \n
      arcBox *phead = G.xList[i].firstIn;<\/div>\n<\/div>\n<\/li>\n
    5. \n
      \n
      <\/div>\n<\/div>\n
      \n
      <\/div>\n<\/div>\n<\/li>\n
    6. \n
      \n
      <\/div>\n<\/div>\n
      \n
      \/\/\u6253\u5370\u4ee5\u7ed3\u70b9i\u4e3a\u5f27\u5c3e\u7684\u94fe<\/span><\/div>\n<\/div>\n<\/li>\n
    7. \n
      \n
      <\/div>\n<\/div>\n
      \n
      cout<\/span><<“\u4ee5\u7ed3\u70b9”<\/span><<i<<“\u4e3a\u5f27\u5c3e\u7684\u94fe “<\/span><<G.xList[i].data;<\/div>\n<\/div>\n<\/li>\n
    8. \n
      \n
      <\/div>\n<\/div>\n
      \n
      while<\/span>(ptail){<\/div>\n<\/div>\n<\/li>\n
    9. \n
      \n
      <\/div>\n<\/div>\n
      \n
      cout<\/span><<“–>”<\/span><<“|”<\/span><<ptail->tailVex<<“|”<\/span><<ptail->headVex;<\/div>\n<\/div>\n<\/li>\n
    10. \n
      \n
      <\/div>\n<\/div>\n
      \n
      ptail = ptail-> tLink;<\/div>\n<\/div>\n<\/li>\n
    11. \n
      \n
      <\/div>\n<\/div>\n
      \n
      }<\/div>\n<\/div>\n<\/li>\n
    12. \n
      \n
      <\/div>\n<\/div>\n
      \n
      cout<\/span><<“–>NULL”<\/span><<endl<\/span>;<\/div>\n<\/div>\n<\/li>\n
    13. \n
      \n
      <\/div>\n<\/div>\n
      \n
      <\/div>\n<\/div>\n<\/li>\n
    14. \n
      \n
      <\/div>\n<\/div>\n
      \n
      \/\/\u6253\u5370\u4ee5\u7ed3\u70b9i\u4e3a\u5f27\u5934\u7684\u94fe<\/span><\/div>\n<\/div>\n<\/li>\n
    15. \n
      \n
      <\/div>\n<\/div>\n
      \n
      <\/div>\n<\/div>\n<\/li>\n
    16. \n
      \n
      <\/div>\n<\/div>\n
      \n
      cout<\/span><<“\u4ee5\u7ed3\u70b9”<\/span><<i<<“\u4e3a\u5f27\u5934\u7684\u94fe “<\/span><<G.xList[i].data;<\/div>\n<\/div>\n<\/li>\n
    17. \n
      \n
      <\/div>\n<\/div>\n
      \n
      while<\/span>(phead){<\/div>\n<\/div>\n<\/li>\n
    18. \n
      \n
      <\/div>\n<\/div>\n
      \n
      cout<\/span><<“–>”<\/span><<“|”<\/span><<phead->tailVex<<“|”<\/span><<phead->headVex;<\/div>\n<\/div>\n<\/li>\n
    19. \n
      \n
      <\/div>\n<\/div>\n
      \n
      phead = phead->hLink;<\/div>\n<\/div>\n<\/li>\n
    20. \n
      \n
      <\/div>\n<\/div>\n
      \n
      }<\/div>\n<\/div>\n<\/li>\n
    21. \n
      \n
      <\/div>\n<\/div>\n
      \n
      cout<\/span><<“–>NULL”<\/span><<endl<\/span>;<\/div>\n<\/div>\n<\/li>\n
    22. \n
      \n
      <\/div>\n<\/div>\n
      \n
      }<\/div>\n<\/div>\n<\/li>\n
    23. \n
      \n
      <\/div>\n<\/div>\n
      \n
      return<\/span> 1<\/span>;<\/div>\n<\/div>\n<\/li>\n
    24. \n
      \n
      <\/div>\n<\/div>\n
      \n
      }<\/div>\n<\/div>\n<\/li>\n<\/ol>\n
      <\/code><\/pre>\n
      \u6d4b\u8bd5\u7ed3\u679c\uff1a<\/p>\n
      \u6bcf\u4e00\u4e2a\u9876\u70b9\u5bf9\u5e94\u4e24\u4e2a\u94fe\u8868\uff08\u4ee5\u8be5\u7ed3\u70b9\u4e3a\u5f27\u5934\u7684\u94fe\u8868\u548c\u4ee5\u8be5\u7ed3\u70b9\u4f4d\u5f27\u5c3e\u7684\u94fe\u8868\uff09\uff0c\u5206\u522b\u5c06\u5176\u6253\u5370\u51fa\u6765\u3002<\/p>\n
      \"\"<\/div>\n
      3\u3001\u5411\u56fe\u4e2d\u63d2\u5165\u4e00\u4e2a\u7ed3\u70b9<\/p>\n
      <\/code><\/pre>\n
        \n
      1. \n
        \n
        <\/div>\n<\/div>\n
        \n
        Status insertNode<\/span>(OLGraph &G, vexNode node)<\/span><\/span>{<\/div>\n<\/div>\n<\/li>\n
      2. \n
        \n
        <\/div>\n<\/div>\n
        \n
        <\/div>\n<\/div>\n<\/li>\n
      3. \n
        \n
        <\/div>\n<\/div>\n
        \n
        G.xList[G.vexNum].data = node.data;<\/div>\n<\/div>\n<\/li>\n
      4. \n
        \n
        <\/div>\n<\/div>\n
        \n
        G.xList[G.vexNum].firstIn = NULL<\/span>;<\/div>\n<\/div>\n<\/li>\n
      5. \n
        \n
        <\/div>\n<\/div>\n
        \n
        G.xList[G.vexNum].firstOut = NULL<\/span>;<\/div>\n<\/div>\n<\/li>\n
      6. \n
        \n
        <\/div>\n<\/div>\n
        \n
        G.vexNum = G.vexNum + 1<\/span>;<\/div>\n<\/div>\n<\/li>\n
      7. \n
        \n
        <\/div>\n<\/div>\n
        \n
        return<\/span> 1<\/span>;<\/div>\n<\/div>\n<\/li>\n
      8. \n
        \n
        <\/div>\n<\/div>\n
        \n
        }<\/div>\n<\/div>\n<\/li>\n<\/ol>\n
        <\/code><\/pre>\n
        \u6d4b\u8bd5\u7ed3\u679c\uff1a<\/p>\n
        \u5411\u539f\u6765\u7684\u6709\u5411\u56fe\u63d2\u5165\u4e00\u4e2a\u65b0\u7684\u7ed3\u70b9E\u3002\u65b0\u63d2\u5165\u7684\u8282\u70b9\u6ca1\u6709\u4e0e\u4e4b\u524d\u56fe\u4e2d\u7684\u9876\u70b9\u5efa\u7acb\u5f27\uff0c\u56e0\u6b64\u5176\u6253\u5370\u7ed3\u679c\u5982\u4e0b\u6240\u793a\u3002<\/p>\n
        \"\"<\/p>\n
        \u6b64\u65f6\u6709\u5411\u56fe\u53d8\u6210\u4e86\uff1a<\/p>\n
        \"\"<\/div>\n
        4\u3001\u5411\u56fe\u4e2d\u7ed3\u70b9\u4e4b\u95f4\u63d2\u5165\u4e00\u6761\u5f27<\/p>\n
         <\/p>\n
        <\/code><\/pre>\n
          \n
        1. \n
          \n
          <\/div>\n<\/div>\n
          \n
          void<\/span> insertArcAction<\/span>(OLGraph &G, int<\/span> index1, int<\/span> index2)<\/span><\/span>{<\/div>\n<\/div>\n<\/li>\n
        2. \n
          \n
          <\/div>\n<\/div>\n
          \n
          <\/div>\n<\/div>\n<\/li>\n
        3. \n
          \n
          <\/div>\n<\/div>\n
          \n
          arcBox* pArc = new<\/span> arcBox[1<\/span>];<\/div>\n<\/div>\n<\/li>\n
        4. \n
          \n
          <\/div>\n<\/div>\n
          \n
          pArc->tailVex = index1;<\/div>\n<\/div>\n<\/li>\n
        5. \n
          \n
          <\/div>\n<\/div>\n
          \n
          pArc->headVex = index2;<\/div>\n<\/div>\n<\/li>\n
        6. \n
          \n
          <\/div>\n<\/div>\n
          \n
          pArc->info = NULL<\/span>;<\/div>\n<\/div>\n<\/li>\n
        7. \n
          \n
          <\/div>\n<\/div>\n
          \n
          <\/div>\n<\/div>\n<\/li>\n
        8. \n
          \n
          <\/div>\n<\/div>\n
          \n
          arcBox *ptail = G.xList[index1].firstOut;<\/div>\n<\/div>\n<\/li>\n
        9. \n
          \n
          <\/div>\n<\/div>\n
          \n
          arcBox *phead = G.xList[index2].firstIn;<\/div>\n<\/div>\n<\/li>\n
        10. \n
          \n
          <\/div>\n<\/div>\n
          \n
          <\/div>\n<\/div>\n<\/li>\n
        11. \n
          \n
          <\/div>\n<\/div>\n
          \n
          if<\/span>(!ptail){pArc->tLink = NULL<\/span>;}<\/div>\n<\/div>\n<\/li>\n
        12. \n
          \n
          <\/div>\n<\/div>\n
          \n
          else<\/span>{pArc->tLink = ptail;}<\/div>\n<\/div>\n<\/li>\n
        13. \n
          \n
          <\/div>\n<\/div>\n
          \n
          <\/div>\n<\/div>\n<\/li>\n
        14. \n
          \n
          <\/div>\n<\/div>\n
          \n
          if<\/span>(!phead){pArc->hLink = NULL<\/span>;}<\/div>\n<\/div>\n<\/li>\n
        15. \n
          \n
          <\/div>\n<\/div>\n
          \n
          else<\/span>{pArc->hLink = phead;}<\/div>\n<\/div>\n<\/li>\n
        16. \n
          \n
          <\/div>\n<\/div>\n
          \n
          <\/div>\n<\/div>\n<\/li>\n
        17. \n
          \n
          <\/div>\n<\/div>\n
          \n
          G.xList[index1].firstOut = pArc;\/\/\u94fe\u5934\u90e8\u63d2\u5165\u5f27\u7ed3\u70b9<\/span><\/div>\n<\/div>\n<\/li>\n
        18. \n
          \n
          <\/div>\n<\/div>\n
          \n
          G.xList[index2].firstIn = pArc;<\/div>\n<\/div>\n<\/li>\n
        19. \n
          \n
          <\/div>\n<\/div>\n
          \n
          }<\/div>\n<\/div>\n<\/li>\n
        20. \n
          \n
          <\/div>\n<\/div>\n
          \n
          <\/div>\n<\/div>\n<\/li>\n
        21. \n
          \n
          <\/div>\n<\/div>\n
          \n
          Status insertArc<\/span>(OLGraph &G, vexNode node1, vexNode node2)<\/span><\/span>{<\/div>\n<\/div>\n<\/li>\n
        22. \n
          \n
          <\/div>\n<\/div>\n
          \n
          <\/div>\n<\/div>\n<\/li>\n
        23. \n
          \n
          <\/div>\n<\/div>\n
          \n
          int<\/span> index1 = locateVertex(G, node1);<\/div>\n<\/div>\n<\/li>\n
        24. \n
          \n
          <\/div>\n<\/div>\n
          \n
          int<\/span> index2 = locateVertex(G, node2);<\/div>\n<\/div>\n<\/li>\n
        25. \n
          \n
          <\/div>\n<\/div>\n
          \n
          <\/div>\n<\/div>\n<\/li>\n
        26. \n
          \n
          <\/div>\n<\/div>\n
          \n
          insertArcAction(G, index1, index2);<\/div>\n<\/div>\n<\/li>\n
        27. \n
          \n
          <\/div>\n<\/div>\n
          \n
          return<\/span> 1<\/span>;<\/div>\n<\/div>\n<\/li>\n
        28. \n
          \n
          <\/div>\n<\/div>\n
          \n
          }<\/div>\n<\/div>\n<\/li>\n<\/ol>\n
          <\/code><\/pre>\n
           <\/p>\n<\/div>\n
          \n
          \u6d4b\u8bd5\u7ed3\u679c\uff1a<\/p>\n
          \u63d2\u5165\u4e00\u6761\u7ed3\u70b9B\u5230\u7ed3\u70b9C\u7684\u5f27\u3002\u518d\u6b21\u6253\u5370\u8be5\u6709\u5411\u56fe\u65f6\uff0c\u7ed3\u679c\u5982\u4e0b\u6240\u793a\u3002<\/p>\n
          \"\"<\/div>\n<\/div>\n
          \n
          \u6b64\u65f6\u6709\u5411\u56fe\u53d8\u6210\u4e86\uff1a<\/p>\n
          \"\"<\/p>\n
           <\/p>\n
          5\u3001\u5220\u9664\u4e00\u6761\u5f27<\/p>\n
          <\/code><\/pre>\n
            \n
          1. \n
            \n
            <\/div>\n<\/div>\n
            \n
            void<\/span> deleteOutArcAction<\/span>(OLGraph &G, int<\/span> index1, int<\/span> index2)<\/span><\/span>{<\/div>\n<\/div>\n<\/li>\n
          2. \n
            \n
            <\/div>\n<\/div>\n
            \n
            arcBox *cur = G.xList[index1].firstOut;<\/div>\n<\/div>\n<\/li>\n
          3. \n
            \n
            <\/div>\n<\/div>\n
            \n
            arcBox *pre = cur;<\/div>\n<\/div>\n<\/li>\n
          4. \n
            \n
            <\/div>\n<\/div>\n
            \n
            <\/div>\n<\/div>\n<\/li>\n
          5. \n
            \n
            <\/div>\n<\/div>\n
            \n
            int<\/span> count = 0<\/span>;<\/div>\n<\/div>\n<\/li>\n
          6. \n
            \n
            <\/div>\n<\/div>\n
            \n
            if<\/span>(!cur)<\/div>\n<\/div>\n<\/li>\n
          7. \n
            \n
            <\/div>\n<\/div>\n
            \n
            return<\/span>;<\/div>\n<\/div>\n<\/li>\n
          8. \n
            \n
            <\/div>\n<\/div>\n
            \n
            else<\/span>{<\/div>\n<\/div>\n<\/li>\n
          9. \n
            \n
            <\/div>\n<\/div>\n
            \n
            while<\/span>(cur){<\/div>\n<\/div>\n<\/li>\n
          10. \n
            \n
            <\/div>\n<\/div>\n
            \n
            count++;<\/div>\n<\/div>\n<\/li>\n
          11. \n
            \n
            <\/div>\n<\/div>\n
            \n
            if<\/span>(cur->headVex == index2)<\/div>\n<\/div>\n<\/li>\n
          12. \n
            \n
            <\/div>\n<\/div>\n
            \n
            break<\/span>;<\/div>\n<\/div>\n<\/li>\n
          13. \n
            \n
            <\/div>\n<\/div>\n
            \n
            pre = cur;<\/div>\n<\/div>\n<\/li>\n
          14. \n
            \n
            <\/div>\n<\/div>\n
            \n
            cur = cur->tLink;<\/div>\n<\/div>\n<\/li>\n
          15. \n
            \n
            <\/div>\n<\/div>\n
            \n
            }<\/div>\n<\/div>\n<\/li>\n
          16. \n
            \n
            <\/div>\n<\/div>\n
            \n
            }<\/div>\n<\/div>\n<\/li>\n
          17. \n
            \n
            <\/div>\n<\/div>\n
            \n
            if<\/span>(!cur)<\/div>\n<\/div>\n<\/li>\n
          18. \n
            \n
            <\/div>\n<\/div>\n
            \n
            return<\/span>;\/\/\u8be5\u7ed3\u70b9\u6ca1\u6709\u5bf9\u5e94\u7684\u5f27<\/span><\/div>\n<\/div>\n<\/li>\n
          19. \n
            \n
            <\/div>\n<\/div>\n
            \n
            else<\/span> if<\/span>(count <=1<\/span>)<\/div>\n<\/div>\n<\/li>\n
          20. \n
            \n
            <\/div>\n<\/div>\n
            \n
            G.xList[index1].firstOut = pre->tLink;\/\/\u5220\u9664\u7b2c\u4e00\u4e2a\u5f27\u7ed3\u70b9<\/span><\/div>\n<\/div>\n<\/li>\n
          21. \n
            \n
            <\/div>\n<\/div>\n
            \n
            else<\/span><\/div>\n<\/div>\n<\/li>\n
          22. \n
            \n
            <\/div>\n<\/div>\n
            \n
            pre->tLink = cur->tLink;\/\/\u5220\u9664\u975e\u7b2c\u4e00\u4e2a\u5f27\u7ed3\u70b9<\/span><\/div>\n<\/div>\n<\/li>\n
          23. \n
            \n
            <\/div>\n<\/div>\n
            \n
            }<\/div>\n<\/div>\n<\/li>\n
          24. \n
            \n
            <\/div>\n<\/div>\n
            \n
            <\/div>\n<\/div>\n<\/li>\n
          25. \n
            \n
            <\/div>\n<\/div>\n
            \n
            void<\/span> deleteInArcAction<\/span>(OLGraph &G, int<\/span> index1, int<\/span> index2)<\/span><\/span>{<\/div>\n<\/div>\n<\/li>\n
          26. \n
            \n
            <\/div>\n<\/div>\n
            \n
            arcBox *cur = G.xList[index2].firstIn;<\/div>\n<\/div>\n<\/li>\n
          27. \n
            \n
            <\/div>\n<\/div>\n
            \n
            arcBox *pre = cur;<\/div>\n<\/div>\n<\/li>\n
          28. \n
            \n
            <\/div>\n<\/div>\n
            \n
            <\/div>\n<\/div>\n<\/li>\n
          29. \n
            \n
            <\/div>\n<\/div>\n
            \n
            int<\/span> count = 0<\/span>;<\/div>\n<\/div>\n<\/li>\n
          30. \n
            \n
            <\/div>\n<\/div>\n
            \n
            if<\/span>(!cur)<\/div>\n<\/div>\n<\/li>\n
          31. \n
            \n
            <\/div>\n<\/div>\n
            \n
            return<\/span>;<\/div>\n<\/div>\n<\/li>\n
          32. \n
            \n
            <\/div>\n<\/div>\n
            \n
            else<\/span>{<\/div>\n<\/div>\n<\/li>\n
          33. \n
            \n
            <\/div>\n<\/div>\n
            \n
            while<\/span>(cur){<\/div>\n<\/div>\n<\/li>\n
          34. \n
            \n
            <\/div>\n<\/div>\n
            \n
            count++;<\/div>\n<\/div>\n<\/li>\n
          35. \n
            \n
            <\/div>\n<\/div>\n
            \n
            if<\/span>(cur->tailVex == index1)<\/div>\n<\/div>\n<\/li>\n
          36. \n
            \n
            <\/div>\n<\/div>\n
            \n
            break<\/span>;<\/div>\n<\/div>\n<\/li>\n
          37. \n
            \n
            <\/div>\n<\/div>\n
            \n
            pre = cur;<\/div>\n<\/div>\n<\/li>\n
          38. \n
            \n
            <\/div>\n<\/div>\n
            \n
            cur = cur->hLink;<\/div>\n<\/div>\n<\/li>\n
          39. \n
            \n
            <\/div>\n<\/div>\n
            \n
            }<\/div>\n<\/div>\n<\/li>\n
          40. \n
            \n
            <\/div>\n<\/div>\n
            \n
            }<\/div>\n<\/div>\n<\/li>\n
          41. \n
            \n
            <\/div>\n<\/div>\n
            \n
            if<\/span>(!cur)<\/div>\n<\/div>\n<\/li>\n
          42. \n
            \n
            <\/div>\n<\/div>\n
            \n
            return<\/span>;\/\/\u8be5\u7ed3\u70b9\u6ca1\u6709\u5bf9\u5e94\u7684\u5f27<\/span><\/div>\n<\/div>\n<\/li>\n
          43. \n
            \n
            <\/div>\n<\/div>\n
            \n
            else<\/span> if<\/span>(count <=1<\/span>)<\/div>\n<\/div>\n<\/li>\n
          44. \n
            \n
            <\/div>\n<\/div>\n
            \n
            G.xList[index2].firstIn = pre->hLink;<\/div>\n<\/div>\n<\/li>\n
          45. \n
            \n
            <\/div>\n<\/div>\n
            \n
            else<\/span><\/div>\n<\/div>\n<\/li>\n
          46. \n
            \n
            <\/div>\n<\/div>\n
            \n
            pre->hLink = cur->hLink;<\/div>\n<\/div>\n<\/li>\n
          47. \n
            \n
            <\/div>\n<\/div>\n
            \n
            }<\/div>\n<\/div>\n<\/li>\n
          48. \n
            \n
            <\/div>\n<\/div>\n
            \n
            <\/div>\n<\/div>\n<\/li>\n
          49. \n
            \n
            <\/div>\n<\/div>\n
            \n
            Status deleteArc<\/span>(OLGraph &G, vexNode node1, vexNode node2)<\/span><\/span>{<\/div>\n<\/div>\n<\/li>\n
          50. \n
            \n
            <\/div>\n<\/div>\n
            \n
            \/\/\u5220\u9664\u4ece\u7ed3\u70b91\u5230\u7ed3\u70b92\u7684\u5f27\uff08\u6709\u65b9\u5411\uff09<\/span><\/div>\n<\/div>\n<\/li>\n
          51. \n
            \n
            <\/div>\n<\/div>\n
            \n
            int<\/span> index1 = locateVertex(G, node1);<\/div>\n<\/div>\n<\/li>\n
          52. \n
            \n
            <\/div>\n<\/div>\n
            \n
            int<\/span> index2 = locateVertex(G, node2);<\/div>\n<\/div>\n<\/li>\n
          53. \n
            \n
            <\/div>\n<\/div>\n
            \n
            <\/div>\n<\/div>\n<\/li>\n
          54. \n
            \n
            <\/div>\n<\/div>\n
            \n
            deleteOutArcAction(G, index1, index2);\/\/\u5220\u9664\u4e24\u6761\u94fe\u8868\u91cc\u9762\u7684\u503c<\/span><\/div>\n<\/div>\n<\/li>\n
          55. \n
            \n
            <\/div>\n<\/div>\n
            \n
            deleteInArcAction(G, index1, index2);<\/div>\n<\/div>\n<\/li>\n
          56. \n
            \n
            <\/div>\n<\/div>\n
            \n
            <\/div>\n<\/div>\n<\/li>\n
          57. \n
            \n
            <\/div>\n<\/div>\n
            \n
            return<\/span> 1<\/span>;<\/div>\n<\/div>\n<\/li>\n
          58. \n
            \n
            <\/div>\n<\/div>\n
            \n
            }<\/div>\n<\/div>\n<\/li>\n<\/ol>\n
            <\/code><\/pre>\n
            \u6d4b\u8bd5\u7ed3\u679c\uff1a<\/p>\n
            \u5220\u9664\u4ece\u7ed3\u70b9A\u5230\u7ed3\u70b9B\u7684\u5f27\u3002\u91cd\u65b0\u6253\u5370\u8be5\u6709\u5411\u56fe\uff0c\u7ed3\u679c\u5982\u4e0b\u6240\u793a\uff1a<\/p>\n
            \"\"<\/p>\n
            \u6b64\u65f6\u6709\u5411\u56fe\u53d8\u6210\u4e86\uff1a<\/p>\n
            \"\"<\/div>\n
             <\/p>\n
            6\u3001\u5220\u9664\u4e00\u4e2a\u9876\u70b9<\/p>\n
            <\/code><\/pre>\n
              \n
            1. \n
              \n
              <\/div>\n<\/div>\n
              \n
              Status deleteNode<\/span>(OLGraph &G, vexNode node)<\/span><\/span>{<\/div>\n<\/div>\n<\/li>\n
            2. \n
              \n
              <\/div>\n<\/div>\n
              \n
              \/\/\u5220\u9664\u7ed3\u70b9\u540e\uff0c\u8be5xList\u9876\u70b9\u6570\u7ec4\u4e2d\u8be5\u7ed3\u70b9\u540e\u9762\u7684\u7ed3\u70b9\u4e0d\u524d\u79fb\uff0c\u800c\u53ea\u662f\u5c06\u8be5\u88ab\u5220\u9664\u7684\u7ed3\u70b9\u7684data\u8bbe\u7f6e\u6210\u4e3a\u4e00\u4e2a\u8f83\u5927\u7684\u503c<\/span><\/div>\n<\/div>\n<\/li>\n
            3. \n
              \n
              <\/div>\n<\/div>\n
              \n
              int<\/span> index = locateVertex(G, node);<\/div>\n<\/div>\n<\/li>\n
            4. \n
              \n
              <\/div>\n<\/div>\n
              \n
              <\/div>\n<\/div>\n<\/li>\n
            5. \n
              \n
              <\/div>\n<\/div>\n
              \n
              for<\/span>(int<\/span> i = 0<\/span>; i<G.vexNum; i++){<\/div>\n<\/div>\n<\/li>\n
            6. \n
              \n
              <\/div>\n<\/div>\n
              \n
              if<\/span>(i == index)<\/div>\n<\/div>\n<\/li>\n
            7. \n
              \n
              <\/div>\n<\/div>\n
              \n
              continue<\/span>;<\/div>\n<\/div>\n<\/li>\n
            8. \n
              \n
              <\/div>\n<\/div>\n
              \n
              else<\/span>{<\/div>\n<\/div>\n<\/li>\n
            9. \n
              \n
              <\/div>\n<\/div>\n
              \n
              deleteArc(G, G.xList[index], G.xList[i]);\/\/\u5220\u9664\u4ee5\u8be5\u7ed3\u70b9\u4e3a\u5f27\u5c3e\u7684\u5f27<\/span><\/div>\n<\/div>\n<\/li>\n
            10. \n
              \n
              <\/div>\n<\/div>\n
              \n
              deleteArc(G, G.xList[i], G.xList[index]);\/\/\u5220\u9664\u4ee5\u8be5\u7ed3\u70b9\u4e3a\u5f27\u5934\u7684\u5f27<\/span><\/div>\n<\/div>\n<\/li>\n
            11. \n
              \n
              <\/div>\n<\/div>\n
              \n
              }<\/div>\n<\/div>\n<\/li>\n
            12. \n
              \n
              <\/div>\n<\/div>\n
              \n
              }<\/div>\n<\/div>\n<\/li>\n
            13. \n
              \n
              <\/div>\n<\/div>\n
              \n
              G.xList[index].data = ‘0’<\/span>;\/\/\u7f6e’0’\u8868\u793a\u8be5\u7ed3\u70b9\u88ab\u5220\u9664<\/span><\/div>\n<\/div>\n<\/li>\n
            14. \n
              \n
              <\/div>\n<\/div>\n
              \n
              G.xList[index].firstIn = NULL<\/span>;<\/div>\n<\/div>\n<\/li>\n
            15. \n
              \n
              <\/div>\n<\/div>\n
              \n
              G.xList[index].firstOut = NULL<\/span>;<\/div>\n<\/div>\n<\/li>\n
            16. \n
              \n
              <\/div>\n<\/div>\n
              \n
              <\/div>\n<\/div>\n<\/li>\n
            17. \n
              \n
              <\/div>\n<\/div>\n
              \n
              return<\/span> 1<\/span>;<\/div>\n<\/div>\n<\/li>\n
            18. \n
              \n
              <\/div>\n<\/div>\n
              \n
              }<\/div>\n<\/div>\n<\/li>\n<\/ol>\n
              <\/code><\/pre>\n
              \u6d4b\u8bd5\u7ed3\u679c\uff1a<\/p>\n
              \u5220\u9664\u7ed3\u70b9D\uff0c\u91cd\u65b0\u6253\u5370\u8be5\u6709\u5411\u56fe\uff0c\u5176\u7ed3\u679c\u5982\u4e0b\u6240\u793a\uff08\u53ea\u5269\u4e0b3\u6761\u5f27\uff0c4\u4e2a\u6709\u6548\u7ed3\u70b9\uff0c\u7ed3\u70b9D\u88ab\u5220\u9664\u540e\uff0c\u8be5\u7ed3\u70b9\u7684\u5185\u5bb9\u53d8\u4ece\u2018D\u2019\u53d8\u4e3a\u20180\u2019\uff09\uff1a<\/p>\n
              \"\"<\/div>\n
              \u6d4b\u8bd5\u6709\u5411\u56fe\u53d8\u6210\u4e86\uff1a<\/p>\n
              \"\"<\/div>\n<\/div>\n
              \n
              7\u3001\u5168\u90e8\u4ee3\u7801<\/p>\n
              <\/code><\/pre>\n
                \n
              1. \n
                \n
                <\/div>\n<\/div>\n
                \n
                \/\/ \u5341\u5b57\u94fe\u8868.cpp : Defines the entry point for the console application.<\/span><\/div>\n<\/div>\n<\/li>\n
              2. \n
                \n
                <\/div>\n<\/div>\n
                \n
                \/\/<\/span><\/div>\n<\/div>\n<\/li>\n
              3. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              4. \n
                \n
                <\/div>\n<\/div>\n
                \n
                #include<\/span> “stdafx.h”<\/span><\/span><\/div>\n<\/div>\n<\/li>\n
              5. \n
                \n
                <\/div>\n<\/div>\n
                \n
                #include<\/span> <iostream><\/span><\/span><\/div>\n<\/div>\n<\/li>\n
              6. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              7. \n
                \n
                <\/div>\n<\/div>\n
                \n
                using<\/span> namespace<\/span> std<\/span>;<\/div>\n<\/div>\n<\/li>\n
              8. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              9. \n
                \n
                <\/div>\n<\/div>\n
                \n
                #define<\/span> MAX_VERTEX_NUM 20<\/span><\/div>\n<\/div>\n<\/li>\n
              10. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              11. \n
                \n
                <\/div>\n<\/div>\n
                \n
                typedef<\/span> int<\/span> Status;<\/div>\n<\/div>\n<\/li>\n
              12. \n
                \n
                <\/div>\n<\/div>\n
                \n
                typedef<\/span> int<\/span> infoType;<\/div>\n<\/div>\n<\/li>\n
              13. \n
                \n
                <\/div>\n<\/div>\n
                \n
                typedef<\/span> char<\/span> vertexType;<\/div>\n<\/div>\n<\/li>\n
              14. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              15. \n
                \n
                <\/div>\n<\/div>\n
                \n
                typedef<\/span> struct<\/span> arcBox<\/span>{<\/span><\/div>\n<\/div>\n<\/li>\n
              16. \n
                \n
                <\/div>\n<\/div>\n
                \n
                int<\/span> tailVex, headVex;<\/div>\n<\/div>\n<\/li>\n
              17. \n
                \n
                <\/div>\n<\/div>\n
                \n
                struct<\/span> arcBox<\/span> *hLink<\/span>, *tLink<\/span>;<\/span><\/div>\n<\/div>\n<\/li>\n
              18. \n
                \n
                <\/div>\n<\/div>\n
                \n
                infoType *info;<\/div>\n<\/div>\n<\/li>\n
              19. \n
                \n
                <\/div>\n<\/div>\n
                \n
                }arcBox;\/\/\u5f27\u7ed3\u70b9<\/span><\/div>\n<\/div>\n<\/li>\n
              20. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              21. \n
                \n
                <\/div>\n<\/div>\n
                \n
                typedef<\/span> struct<\/span> vexNode<\/span>{<\/span><\/div>\n<\/div>\n<\/li>\n
              22. \n
                \n
                <\/div>\n<\/div>\n
                \n
                vertexType data;<\/div>\n<\/div>\n<\/li>\n
              23. \n
                \n
                <\/div>\n<\/div>\n
                \n
                arcBox *firstIn, *firstOut;<\/div>\n<\/div>\n<\/li>\n
              24. \n
                \n
                <\/div>\n<\/div>\n
                \n
                }vexNode;\/\/\u9876\u70b9\u8282\u70b9<\/span><\/div>\n<\/div>\n<\/li>\n
              25. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              26. \n
                \n
                <\/div>\n<\/div>\n
                \n
                typedef<\/span> struct<\/span>{<\/span><\/div>\n<\/div>\n<\/li>\n
              27. \n
                \n
                <\/div>\n<\/div>\n
                \n
                vexNode xList[MAX_VERTEX_NUM];<\/div>\n<\/div>\n<\/li>\n
              28. \n
                \n
                <\/div>\n<\/div>\n
                \n
                int<\/span> vexNum, arcNum;<\/div>\n<\/div>\n<\/li>\n
              29. \n
                \n
                <\/div>\n<\/div>\n
                \n
                }OLGraph;\/\/\u5341\u5b57\u94fe<\/span><\/div>\n<\/div>\n<\/li>\n
              30. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              31. \n
                \n
                <\/div>\n<\/div>\n
                \n
                int<\/span> locateVertex<\/span>(OLGraph &G, vexNode node)<\/span><\/span>{<\/div>\n<\/div>\n<\/li>\n
              32. \n
                \n
                <\/div>\n<\/div>\n
                \n
                int<\/span> index = -1<\/span>;<\/div>\n<\/div>\n<\/li>\n
              33. \n
                \n
                <\/div>\n<\/div>\n
                \n
                for<\/span>(int<\/span> i = 0<\/span>; i<G.vexNum; i++){<\/div>\n<\/div>\n<\/li>\n
              34. \n
                \n
                <\/div>\n<\/div>\n
                \n
                if<\/span>(node.data == G.xList[i].data){<\/div>\n<\/div>\n<\/li>\n
              35. \n
                \n
                <\/div>\n<\/div>\n
                \n
                index = i;<\/div>\n<\/div>\n<\/li>\n
              36. \n
                \n
                <\/div>\n<\/div>\n
                \n
                break<\/span>;<\/div>\n<\/div>\n<\/li>\n
              37. \n
                \n
                <\/div>\n<\/div>\n
                \n
                }<\/div>\n<\/div>\n<\/li>\n
              38. \n
                \n
                <\/div>\n<\/div>\n
                \n
                }<\/div>\n<\/div>\n<\/li>\n
              39. \n
                \n
                <\/div>\n<\/div>\n
                \n
                return<\/span> index;<\/div>\n<\/div>\n<\/li>\n
              40. \n
                \n
                <\/div>\n<\/div>\n
                \n
                }<\/div>\n<\/div>\n<\/li>\n
              41. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              42. \n
                \n
                <\/div>\n<\/div>\n
                \n
                void<\/span> insertArcAction<\/span>(OLGraph &G, int<\/span> index1, int<\/span> index2)<\/span><\/span>;<\/div>\n<\/div>\n<\/li>\n
              43. \n
                \n
                <\/div>\n<\/div>\n
                \n
                Status insertArc<\/span>(OLGraph &G, vexNode node1, vexNode node2)<\/span><\/span>;<\/div>\n<\/div>\n<\/li>\n
              44. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              45. \n
                \n
                <\/div>\n<\/div>\n
                \n
                Status createDG<\/span>(OLGraph &G, int<\/span> vexNum, int<\/span> arcNum)<\/span><\/span>{<\/div>\n<\/div>\n<\/li>\n
              46. \n
                \n
                <\/div>\n<\/div>\n
                \n
                G.vexNum = vexNum;<\/div>\n<\/div>\n<\/li>\n
              47. \n
                \n
                <\/div>\n<\/div>\n
                \n
                G.arcNum = arcNum;<\/div>\n<\/div>\n<\/li>\n
              48. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              49. \n
                \n
                <\/div>\n<\/div>\n
                \n
                for<\/span>(int<\/span> i = 0<\/span>; i<G.vexNum; i++){<\/div>\n<\/div>\n<\/li>\n
              50. \n
                \n
                <\/div>\n<\/div>\n
                \n
                cin<\/span>>>G.xList[i].data;<\/div>\n<\/div>\n<\/li>\n
              51. \n
                \n
                <\/div>\n<\/div>\n
                \n
                G.xList[i].firstIn = NULL<\/span>;<\/div>\n<\/div>\n<\/li>\n
              52. \n
                \n
                <\/div>\n<\/div>\n
                \n
                G.xList[i].firstOut = NULL<\/span>;<\/div>\n<\/div>\n<\/li>\n
              53. \n
                \n
                <\/div>\n<\/div>\n
                \n
                }\/\/\u521d\u59cb\u5316<\/span><\/div>\n<\/div>\n<\/li>\n
              54. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              55. \n
                \n
                <\/div>\n<\/div>\n
                \n
                for<\/span>(int<\/span> i = 0<\/span>; i<G.arcNum; i++){<\/div>\n<\/div>\n<\/li>\n
              56. \n
                \n
                <\/div>\n<\/div>\n
                \n
                vexNode node1, node2;<\/div>\n<\/div>\n<\/li>\n
              57. \n
                \n
                <\/div>\n<\/div>\n
                \n
                cout<\/span><<“please input two nodes of “<\/span><<i+1<\/span><<“-th arc”<\/span><<endl<\/span>;<\/div>\n<\/div>\n<\/li>\n
              58. \n
                \n
                <\/div>\n<\/div>\n
                \n
                cin<\/span>>>node1.data>>node2.data;<\/div>\n<\/div>\n<\/li>\n
              59. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              60. \n
                \n
                <\/div>\n<\/div>\n
                \n
                insertArc(G, node1, node2);<\/div>\n<\/div>\n<\/li>\n
              61. \n
                \n
                <\/div>\n<\/div>\n
                \n
                }<\/div>\n<\/div>\n<\/li>\n
              62. \n
                \n
                <\/div>\n<\/div>\n
                \n
                return<\/span> 1<\/span>;<\/div>\n<\/div>\n<\/li>\n
              63. \n
                \n
                <\/div>\n<\/div>\n
                \n
                }<\/div>\n<\/div>\n<\/li>\n
              64. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              65. \n
                \n
                <\/div>\n<\/div>\n
                \n
                Status printDG<\/span>(OLGraph &G)<\/span><\/span>{<\/div>\n<\/div>\n<\/li>\n
              66. \n
                \n
                <\/div>\n<\/div>\n
                \n
                for<\/span>(int<\/span> i = 0<\/span>; i<G.vexNum; i++){<\/div>\n<\/div>\n<\/li>\n
              67. \n
                \n
                <\/div>\n<\/div>\n
                \n
                arcBox *ptail = G.xList[i].firstOut;<\/div>\n<\/div>\n<\/li>\n
              68. \n
                \n
                <\/div>\n<\/div>\n
                \n
                arcBox *phead = G.xList[i].firstIn;<\/div>\n<\/div>\n<\/li>\n
              69. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              70. \n
                \n
                <\/div>\n<\/div>\n
                \n
                \/\/\u6253\u5370\u4ee5\u7ed3\u70b9i\u4e3a\u5f27\u5c3e\u7684\u94fe<\/span><\/div>\n<\/div>\n<\/li>\n
              71. \n
                \n
                <\/div>\n<\/div>\n
                \n
                cout<\/span><<“\u4ee5\u7ed3\u70b9”<\/span><<i<<“\u4e3a\u5f27\u5c3e\u7684\u94fe “<\/span><<G.xList[i].data;<\/div>\n<\/div>\n<\/li>\n
              72. \n
                \n
                <\/div>\n<\/div>\n
                \n
                while<\/span>(ptail){<\/div>\n<\/div>\n<\/li>\n
              73. \n
                \n
                <\/div>\n<\/div>\n
                \n
                cout<\/span><<“–>”<\/span><<“|”<\/span><<ptail->tailVex<<“|”<\/span><<ptail->headVex;<\/div>\n<\/div>\n<\/li>\n
              74. \n
                \n
                <\/div>\n<\/div>\n
                \n
                ptail = ptail-> tLink;<\/div>\n<\/div>\n<\/li>\n
              75. \n
                \n
                <\/div>\n<\/div>\n
                \n
                }<\/div>\n<\/div>\n<\/li>\n
              76. \n
                \n
                <\/div>\n<\/div>\n
                \n
                cout<\/span><<“–>NULL”<\/span><<endl<\/span>;<\/div>\n<\/div>\n<\/li>\n
              77. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              78. \n
                \n
                <\/div>\n<\/div>\n
                \n
                \/\/\u6253\u5370\u4ee5\u7ed3\u70b9i\u4e3a\u5f27\u5934\u7684\u94fe<\/span><\/div>\n<\/div>\n<\/li>\n
              79. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              80. \n
                \n
                <\/div>\n<\/div>\n
                \n
                cout<\/span><<“\u4ee5\u7ed3\u70b9”<\/span><<i<<“\u4e3a\u5f27\u5934\u7684\u94fe “<\/span><<G.xList[i].data;<\/div>\n<\/div>\n<\/li>\n
              81. \n
                \n
                <\/div>\n<\/div>\n
                \n
                while<\/span>(phead){<\/div>\n<\/div>\n<\/li>\n
              82. \n
                \n
                <\/div>\n<\/div>\n
                \n
                cout<\/span><<“–>”<\/span><<“|”<\/span><<phead->tailVex<<“|”<\/span><<phead->headVex;<\/div>\n<\/div>\n<\/li>\n
              83. \n
                \n
                <\/div>\n<\/div>\n
                \n
                phead = phead->hLink;<\/div>\n<\/div>\n<\/li>\n
              84. \n
                \n
                <\/div>\n<\/div>\n
                \n
                }<\/div>\n<\/div>\n<\/li>\n
              85. \n
                \n
                <\/div>\n<\/div>\n
                \n
                cout<\/span><<“–>NULL”<\/span><<endl<\/span>;<\/div>\n<\/div>\n<\/li>\n
              86. \n
                \n
                <\/div>\n<\/div>\n
                \n
                }<\/div>\n<\/div>\n<\/li>\n
              87. \n
                \n
                <\/div>\n<\/div>\n
                \n
                return<\/span> 1<\/span>;<\/div>\n<\/div>\n<\/li>\n
              88. \n
                \n
                <\/div>\n<\/div>\n
                \n
                }<\/div>\n<\/div>\n<\/li>\n
              89. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              90. \n
                \n
                <\/div>\n<\/div>\n
                \n
                void<\/span> insertArcAction<\/span>(OLGraph &G, int<\/span> index1, int<\/span> index2)<\/span><\/span>{<\/div>\n<\/div>\n<\/li>\n
              91. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              92. \n
                \n
                <\/div>\n<\/div>\n
                \n
                arcBox* pArc = new<\/span> arcBox[1<\/span>];<\/div>\n<\/div>\n<\/li>\n
              93. \n
                \n
                <\/div>\n<\/div>\n
                \n
                pArc->tailVex = index1;<\/div>\n<\/div>\n<\/li>\n
              94. \n
                \n
                <\/div>\n<\/div>\n
                \n
                pArc->headVex = index2;<\/div>\n<\/div>\n<\/li>\n
              95. \n
                \n
                <\/div>\n<\/div>\n
                \n
                pArc->info = NULL<\/span>;<\/div>\n<\/div>\n<\/li>\n
              96. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              97. \n
                \n
                <\/div>\n<\/div>\n
                \n
                arcBox *ptail = G.xList[index1].firstOut;<\/div>\n<\/div>\n<\/li>\n
              98. \n
                \n
                <\/div>\n<\/div>\n
                \n
                arcBox *phead = G.xList[index2].firstIn;<\/div>\n<\/div>\n<\/li>\n
              99. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              100. \n
                \n
                <\/div>\n<\/div>\n
                \n
                if<\/span>(!ptail){pArc->tLink = NULL<\/span>;}<\/div>\n<\/div>\n<\/li>\n
              101. \n
                \n
                <\/div>\n<\/div>\n
                \n
                else<\/span>{pArc->tLink = ptail;}<\/div>\n<\/div>\n<\/li>\n
              102. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              103. \n
                \n
                <\/div>\n<\/div>\n
                \n
                if<\/span>(!phead){pArc->hLink = NULL<\/span>;}<\/div>\n<\/div>\n<\/li>\n
              104. \n
                \n
                <\/div>\n<\/div>\n
                \n
                else<\/span>{pArc->hLink = phead;}<\/div>\n<\/div>\n<\/li>\n
              105. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              106. \n
                \n
                <\/div>\n<\/div>\n
                \n
                G.xList[index1].firstOut = pArc;\/\/\u94fe\u5934\u90e8\u63d2\u5165\u5f27\u7ed3\u70b9<\/span><\/div>\n<\/div>\n<\/li>\n
              107. \n
                \n
                <\/div>\n<\/div>\n
                \n
                G.xList[index2].firstIn = pArc;<\/div>\n<\/div>\n<\/li>\n
              108. \n
                \n
                <\/div>\n<\/div>\n
                \n
                }<\/div>\n<\/div>\n<\/li>\n
              109. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              110. \n
                \n
                <\/div>\n<\/div>\n
                \n
                Status insertArc<\/span>(OLGraph &G, vexNode node1, vexNode node2)<\/span><\/span>{<\/div>\n<\/div>\n<\/li>\n
              111. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              112. \n
                \n
                <\/div>\n<\/div>\n
                \n
                int<\/span> index1 = locateVertex(G, node1);<\/div>\n<\/div>\n<\/li>\n
              113. \n
                \n
                <\/div>\n<\/div>\n
                \n
                int<\/span> index2 = locateVertex(G, node2);<\/div>\n<\/div>\n<\/li>\n
              114. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              115. \n
                \n
                <\/div>\n<\/div>\n
                \n
                insertArcAction(G, index1, index2);<\/div>\n<\/div>\n<\/li>\n
              116. \n
                \n
                <\/div>\n<\/div>\n
                \n
                return<\/span> 1<\/span>;<\/div>\n<\/div>\n<\/li>\n
              117. \n
                \n
                <\/div>\n<\/div>\n
                \n
                }<\/div>\n<\/div>\n<\/li>\n
              118. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              119. \n
                \n
                <\/div>\n<\/div>\n
                \n
                Status insertNode<\/span>(OLGraph &G, vexNode node)<\/span><\/span>{<\/div>\n<\/div>\n<\/li>\n
              120. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              121. \n
                \n
                <\/div>\n<\/div>\n
                \n
                G.xList[G.vexNum].data = node.data;<\/div>\n<\/div>\n<\/li>\n
              122. \n
                \n
                <\/div>\n<\/div>\n
                \n
                G.xList[G.vexNum].firstIn = NULL<\/span>;<\/div>\n<\/div>\n<\/li>\n
              123. \n
                \n
                <\/div>\n<\/div>\n
                \n
                G.xList[G.vexNum].firstOut = NULL<\/span>;<\/div>\n<\/div>\n<\/li>\n
              124. \n
                \n
                <\/div>\n<\/div>\n
                \n
                G.vexNum = G.vexNum + 1<\/span>;<\/div>\n<\/div>\n<\/li>\n
              125. \n
                \n
                <\/div>\n<\/div>\n
                \n
                return<\/span> 1<\/span>;<\/div>\n<\/div>\n<\/li>\n
              126. \n
                \n
                <\/div>\n<\/div>\n
                \n
                }<\/div>\n<\/div>\n<\/li>\n
              127. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              128. \n
                \n
                <\/div>\n<\/div>\n
                \n
                Status deleteArc<\/span>(OLGraph &G, vexNode node1, vexNode node2)<\/span><\/span>;<\/div>\n<\/div>\n<\/li>\n
              129. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              130. \n
                \n
                <\/div>\n<\/div>\n
                \n
                Status deleteNode<\/span>(OLGraph &G, vexNode node)<\/span><\/span>{<\/div>\n<\/div>\n<\/li>\n
              131. \n
                \n
                <\/div>\n<\/div>\n
                \n
                \/\/\u5220\u9664\u7ed3\u70b9\u540e\uff0c\u8be5xList\u9876\u70b9\u6570\u7ec4\u4e2d\u8be5\u7ed3\u70b9\u540e\u9762\u7684\u7ed3\u70b9\u4e0d\u524d\u79fb\uff0c\u800c\u53ea\u662f\u5c06\u8be5\u88ab\u5220\u9664\u7684\u7ed3\u70b9\u7684data\u8bbe\u7f6e\u6210\u4e3a\u4e00\u4e2a\u8f83\u5927\u7684\u503c<\/span><\/div>\n<\/div>\n<\/li>\n
              132. \n
                \n
                <\/div>\n<\/div>\n
                \n
                int<\/span> index = locateVertex(G, node);<\/div>\n<\/div>\n<\/li>\n
              133. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              134. \n
                \n
                <\/div>\n<\/div>\n
                \n
                for<\/span>(int<\/span> i = 0<\/span>; i<G.vexNum; i++){<\/div>\n<\/div>\n<\/li>\n
              135. \n
                \n
                <\/div>\n<\/div>\n
                \n
                if<\/span>(i == index)<\/div>\n<\/div>\n<\/li>\n
              136. \n
                \n
                <\/div>\n<\/div>\n
                \n
                continue<\/span>;<\/div>\n<\/div>\n<\/li>\n
              137. \n
                \n
                <\/div>\n<\/div>\n
                \n
                else<\/span>{<\/div>\n<\/div>\n<\/li>\n
              138. \n
                \n
                <\/div>\n<\/div>\n
                \n
                deleteArc(G, G.xList[index], G.xList[i]);\/\/\u5220\u9664\u4ee5\u8be5\u7ed3\u70b9\u4e3a\u5f27\u5c3e\u7684\u5f27<\/span><\/div>\n<\/div>\n<\/li>\n
              139. \n
                \n
                <\/div>\n<\/div>\n
                \n
                deleteArc(G, G.xList[i], G.xList[index]);\/\/\u5220\u9664\u4ee5\u8be5\u7ed3\u70b9\u4e3a\u5f27\u5934\u7684\u5f27<\/span><\/div>\n<\/div>\n<\/li>\n
              140. \n
                \n
                <\/div>\n<\/div>\n
                \n
                }<\/div>\n<\/div>\n<\/li>\n
              141. \n
                \n
                <\/div>\n<\/div>\n
                \n
                }<\/div>\n<\/div>\n<\/li>\n
              142. \n
                \n
                <\/div>\n<\/div>\n
                \n
                G.xList[index].data = ‘0’<\/span>;\/\/\u7f6e’0’\u8868\u793a\u8be5\u7ed3\u70b9\u88ab\u5220\u9664<\/span><\/div>\n<\/div>\n<\/li>\n
              143. \n
                \n
                <\/div>\n<\/div>\n
                \n
                G.xList[index].firstIn = NULL<\/span>;<\/div>\n<\/div>\n<\/li>\n
              144. \n
                \n
                <\/div>\n<\/div>\n
                \n
                G.xList[index].firstOut = NULL<\/span>;<\/div>\n<\/div>\n<\/li>\n
              145. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              146. \n
                \n
                <\/div>\n<\/div>\n
                \n
                return<\/span> 1<\/span>;<\/div>\n<\/div>\n<\/li>\n
              147. \n
                \n
                <\/div>\n<\/div>\n
                \n
                }<\/div>\n<\/div>\n<\/li>\n
              148. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              149. \n
                \n
                <\/div>\n<\/div>\n
                \n
                void<\/span> deleteOutArcAction<\/span>(OLGraph &G, int<\/span> index1, int<\/span> index2)<\/span><\/span>{<\/div>\n<\/div>\n<\/li>\n
              150. \n
                \n
                <\/div>\n<\/div>\n
                \n
                arcBox *cur = G.xList[index1].firstOut;<\/div>\n<\/div>\n<\/li>\n
              151. \n
                \n
                <\/div>\n<\/div>\n
                \n
                arcBox *pre = cur;<\/div>\n<\/div>\n<\/li>\n
              152. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              153. \n
                \n
                <\/div>\n<\/div>\n
                \n
                int<\/span> count = 0<\/span>;<\/div>\n<\/div>\n<\/li>\n
              154. \n
                \n
                <\/div>\n<\/div>\n
                \n
                if<\/span>(!cur)<\/div>\n<\/div>\n<\/li>\n
              155. \n
                \n
                <\/div>\n<\/div>\n
                \n
                return<\/span>;<\/div>\n<\/div>\n<\/li>\n
              156. \n
                \n
                <\/div>\n<\/div>\n
                \n
                else<\/span>{<\/div>\n<\/div>\n<\/li>\n
              157. \n
                \n
                <\/div>\n<\/div>\n
                \n
                while<\/span>(cur){<\/div>\n<\/div>\n<\/li>\n
              158. \n
                \n
                <\/div>\n<\/div>\n
                \n
                count++;<\/div>\n<\/div>\n<\/li>\n
              159. \n
                \n
                <\/div>\n<\/div>\n
                \n
                if<\/span>(cur->headVex == index2)<\/div>\n<\/div>\n<\/li>\n
              160. \n
                \n
                <\/div>\n<\/div>\n
                \n
                break<\/span>;<\/div>\n<\/div>\n<\/li>\n
              161. \n
                \n
                <\/div>\n<\/div>\n
                \n
                pre = cur;<\/div>\n<\/div>\n<\/li>\n
              162. \n
                \n
                <\/div>\n<\/div>\n
                \n
                cur = cur->tLink;<\/div>\n<\/div>\n<\/li>\n
              163. \n
                \n
                <\/div>\n<\/div>\n
                \n
                }<\/div>\n<\/div>\n<\/li>\n
              164. \n
                \n
                <\/div>\n<\/div>\n
                \n
                }<\/div>\n<\/div>\n<\/li>\n
              165. \n
                \n
                <\/div>\n<\/div>\n
                \n
                if<\/span>(!cur)<\/div>\n<\/div>\n<\/li>\n
              166. \n
                \n
                <\/div>\n<\/div>\n
                \n
                return<\/span>;\/\/\u8be5\u7ed3\u70b9\u6ca1\u6709\u5bf9\u5e94\u7684\u5f27<\/span><\/div>\n<\/div>\n<\/li>\n
              167. \n
                \n
                <\/div>\n<\/div>\n
                \n
                else<\/span> if<\/span>(count <=1<\/span>)<\/div>\n<\/div>\n<\/li>\n
              168. \n
                \n
                <\/div>\n<\/div>\n
                \n
                G.xList[index1].firstOut = pre->tLink;\/\/\u5220\u9664\u7b2c\u4e00\u4e2a\u5f27\u7ed3\u70b9<\/span><\/div>\n<\/div>\n<\/li>\n
              169. \n
                \n
                <\/div>\n<\/div>\n
                \n
                else<\/span><\/div>\n<\/div>\n<\/li>\n
              170. \n
                \n
                <\/div>\n<\/div>\n
                \n
                pre->tLink = cur->tLink;\/\/\u5220\u9664\u975e\u7b2c\u4e00\u4e2a\u5f27\u7ed3\u70b9<\/span><\/div>\n<\/div>\n<\/li>\n
              171. \n
                \n
                <\/div>\n<\/div>\n
                \n
                }<\/div>\n<\/div>\n<\/li>\n
              172. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              173. \n
                \n
                <\/div>\n<\/div>\n
                \n
                void<\/span> deleteInArcAction<\/span>(OLGraph &G, int<\/span> index1, int<\/span> index2)<\/span><\/span>{<\/div>\n<\/div>\n<\/li>\n
              174. \n
                \n
                <\/div>\n<\/div>\n
                \n
                arcBox *cur = G.xList[index2].firstIn;<\/div>\n<\/div>\n<\/li>\n
              175. \n
                \n
                <\/div>\n<\/div>\n
                \n
                arcBox *pre = cur;<\/div>\n<\/div>\n<\/li>\n
              176. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              177. \n
                \n
                <\/div>\n<\/div>\n
                \n
                int<\/span> count = 0<\/span>;<\/div>\n<\/div>\n<\/li>\n
              178. \n
                \n
                <\/div>\n<\/div>\n
                \n
                if<\/span>(!cur)<\/div>\n<\/div>\n<\/li>\n
              179. \n
                \n
                <\/div>\n<\/div>\n
                \n
                return<\/span>;<\/div>\n<\/div>\n<\/li>\n
              180. \n
                \n
                <\/div>\n<\/div>\n
                \n
                else<\/span>{<\/div>\n<\/div>\n<\/li>\n
              181. \n
                \n
                <\/div>\n<\/div>\n
                \n
                while<\/span>(cur){<\/div>\n<\/div>\n<\/li>\n
              182. \n
                \n
                <\/div>\n<\/div>\n
                \n
                count++;<\/div>\n<\/div>\n<\/li>\n
              183. \n
                \n
                <\/div>\n<\/div>\n
                \n
                if<\/span>(cur->tailVex == index1)<\/div>\n<\/div>\n<\/li>\n
              184. \n
                \n
                <\/div>\n<\/div>\n
                \n
                break<\/span>;<\/div>\n<\/div>\n<\/li>\n
              185. \n
                \n
                <\/div>\n<\/div>\n
                \n
                pre = cur;<\/div>\n<\/div>\n<\/li>\n
              186. \n
                \n
                <\/div>\n<\/div>\n
                \n
                cur = cur->hLink;<\/div>\n<\/div>\n<\/li>\n
              187. \n
                \n
                <\/div>\n<\/div>\n
                \n
                }<\/div>\n<\/div>\n<\/li>\n
              188. \n
                \n
                <\/div>\n<\/div>\n
                \n
                }<\/div>\n<\/div>\n<\/li>\n
              189. \n
                \n
                <\/div>\n<\/div>\n
                \n
                if<\/span>(!cur)<\/div>\n<\/div>\n<\/li>\n
              190. \n
                \n
                <\/div>\n<\/div>\n
                \n
                return<\/span>;\/\/\u8be5\u7ed3\u70b9\u6ca1\u6709\u5bf9\u5e94\u7684\u5f27<\/span><\/div>\n<\/div>\n<\/li>\n
              191. \n
                \n
                <\/div>\n<\/div>\n
                \n
                else<\/span> if<\/span>(count <=1<\/span>)<\/div>\n<\/div>\n<\/li>\n
              192. \n
                \n
                <\/div>\n<\/div>\n
                \n
                G.xList[index2].firstIn = pre->hLink;<\/div>\n<\/div>\n<\/li>\n
              193. \n
                \n
                <\/div>\n<\/div>\n
                \n
                else<\/span><\/div>\n<\/div>\n<\/li>\n
              194. \n
                \n
                <\/div>\n<\/div>\n
                \n
                pre->hLink = cur->hLink;<\/div>\n<\/div>\n<\/li>\n
              195. \n
                \n
                <\/div>\n<\/div>\n
                \n
                }<\/div>\n<\/div>\n<\/li>\n
              196. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              197. \n
                \n
                <\/div>\n<\/div>\n
                \n
                Status deleteArc<\/span>(OLGraph &G, vexNode node1, vexNode node2)<\/span><\/span>{<\/div>\n<\/div>\n<\/li>\n
              198. \n
                \n
                <\/div>\n<\/div>\n
                \n
                \/\/\u5220\u9664\u4ece\u7ed3\u70b91\u5230\u7ed3\u70b92\u7684\u5f27\uff08\u6709\u65b9\u5411\uff09<\/span><\/div>\n<\/div>\n<\/li>\n
              199. \n
                \n
                <\/div>\n<\/div>\n
                \n
                int<\/span> index1 = locateVertex(G, node1);<\/div>\n<\/div>\n<\/li>\n
              200. \n
                \n
                <\/div>\n<\/div>\n
                \n
                int<\/span> index2 = locateVertex(G, node2);<\/div>\n<\/div>\n<\/li>\n
              201. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              202. \n
                \n
                <\/div>\n<\/div>\n
                \n
                deleteOutArcAction(G, index1, index2);\/\/\u5220\u9664\u4e24\u6761\u94fe\u8868\u91cc\u9762\u7684\u503c<\/span><\/div>\n<\/div>\n<\/li>\n
              203. \n
                \n
                <\/div>\n<\/div>\n
                \n
                deleteInArcAction(G, index1, index2);<\/div>\n<\/div>\n<\/li>\n
              204. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              205. \n
                \n
                <\/div>\n<\/div>\n
                \n
                return<\/span> 1<\/span>;<\/div>\n<\/div>\n<\/li>\n
              206. \n
                \n
                <\/div>\n<\/div>\n
                \n
                }<\/div>\n<\/div>\n<\/li>\n
              207. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              208. \n
                \n
                <\/div>\n<\/div>\n
                \n
                int<\/span> _tmain(int<\/span> argc, _TCHAR* argv[])<\/div>\n<\/div>\n<\/li>\n
              209. \n
                \n
                <\/div>\n<\/div>\n
                \n
                {<\/div>\n<\/div>\n<\/li>\n
              210. \n
                \n
                <\/div>\n<\/div>\n
                \n
                int<\/span> vexNum = 4<\/span>;<\/div>\n<\/div>\n<\/li>\n
              211. \n
                \n
                <\/div>\n<\/div>\n
                \n
                int<\/span> arcNum = 7<\/span>;<\/div>\n<\/div>\n<\/li>\n
              212. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              213. \n
                \n
                <\/div>\n<\/div>\n
                \n
                OLGraph G;<\/div>\n<\/div>\n<\/li>\n
              214. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              215. \n
                \n
                <\/div>\n<\/div>\n
                \n
                cout<\/span><<“Try to create a Orthogonal List of a graph…”<\/span><<endl<\/span>;<\/div>\n<\/div>\n<\/li>\n
              216. \n
                \n
                <\/div>\n<\/div>\n
                \n
                createDG(G, vexNum, arcNum);<\/div>\n<\/div>\n<\/li>\n
              217. \n
                \n
                <\/div>\n<\/div>\n
                \n
                cout<\/span><<“Try to print the Orthogonal List of the very graph…”<\/span><<endl<\/span>;<\/div>\n<\/div>\n<\/li>\n
              218. \n
                \n
                <\/div>\n<\/div>\n
                \n
                printDG(G);<\/div>\n<\/div>\n<\/li>\n
              219. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              220. \n
                \n
                <\/div>\n<\/div>\n
                \n
                cout<\/span><<“Try to insert a node into the graph…”<\/span><<endl<\/span>;<\/div>\n<\/div>\n<\/li>\n
              221. \n
                \n
                <\/div>\n<\/div>\n
                \n
                vexNode node;<\/div>\n<\/div>\n<\/li>\n
              222. \n
                \n
                <\/div>\n<\/div>\n
                \n
                cout<\/span><<” please input the data of the node to insert:”<\/span><<endl<\/span>;<\/div>\n<\/div>\n<\/li>\n
              223. \n
                \n
                <\/div>\n<\/div>\n
                \n
                cin<\/span>>>node.data;<\/div>\n<\/div>\n<\/li>\n
              224. \n
                \n
                <\/div>\n<\/div>\n
                \n
                insertNode(G, node);<\/div>\n<\/div>\n<\/li>\n
              225. \n
                \n
                <\/div>\n<\/div>\n
                \n
                printDG(G);<\/div>\n<\/div>\n<\/li>\n
              226. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              227. \n
                \n
                <\/div>\n<\/div>\n
                \n
                cout<\/span><<“Try to insert a arc into the graph…”<\/span><<endl<\/span>;<\/div>\n<\/div>\n<\/li>\n
              228. \n
                \n
                <\/div>\n<\/div>\n
                \n
                vexNode node1, node2;<\/div>\n<\/div>\n<\/li>\n
              229. \n
                \n
                <\/div>\n<\/div>\n
                \n
                cout<\/span><<” please choose two node:”<\/span><<endl<\/span>;<\/div>\n<\/div>\n<\/li>\n
              230. \n
                \n
                <\/div>\n<\/div>\n
                \n
                cin<\/span>>>node1.data>>node2.data;<\/div>\n<\/div>\n<\/li>\n
              231. \n
                \n
                <\/div>\n<\/div>\n
                \n
                insertArc(G, node1, node2);<\/div>\n<\/div>\n<\/li>\n
              232. \n
                \n
                <\/div>\n<\/div>\n
                \n
                printDG(G);<\/div>\n<\/div>\n<\/li>\n
              233. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              234. \n
                \n
                <\/div>\n<\/div>\n
                \n
                cout<\/span><<“Try to delete the arc between two nodes…”<\/span><<endl<\/span>;<\/div>\n<\/div>\n<\/li>\n
              235. \n
                \n
                <\/div>\n<\/div>\n
                \n
                vexNode node3, node4;<\/div>\n<\/div>\n<\/li>\n
              236. \n
                \n
                <\/div>\n<\/div>\n
                \n
                cout<\/span><<” please choose a arc with specifing two nodes:”<\/span><<endl<\/span>;<\/div>\n<\/div>\n<\/li>\n
              237. \n
                \n
                <\/div>\n<\/div>\n
                \n
                cin<\/span>>>node3.data>>node4.data;<\/div>\n<\/div>\n<\/li>\n
              238. \n
                \n
                <\/div>\n<\/div>\n
                \n
                deleteArc(G, node3, node4);<\/div>\n<\/div>\n<\/li>\n
              239. \n
                \n
                <\/div>\n<\/div>\n
                \n
                printDG(G);<\/div>\n<\/div>\n<\/li>\n
              240. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              241. \n
                \n
                <\/div>\n<\/div>\n
                \n
                cout<\/span><<“Try to delete a node of the graph…”<\/span><<endl<\/span>;<\/div>\n<\/div>\n<\/li>\n
              242. \n
                \n
                <\/div>\n<\/div>\n
                \n
                vexNode node5;<\/div>\n<\/div>\n<\/li>\n
              243. \n
                \n
                <\/div>\n<\/div>\n
                \n
                cout<\/span><<” please choose a node:”<\/span><<endl<\/span>;<\/div>\n<\/div>\n<\/li>\n
              244. \n
                \n
                <\/div>\n<\/div>\n
                \n
                cin<\/span>>>node5.data;<\/div>\n<\/div>\n<\/li>\n
              245. \n
                \n
                <\/div>\n<\/div>\n
                \n
                deleteNode(G, node5);<\/div>\n<\/div>\n<\/li>\n
              246. \n
                \n
                <\/div>\n<\/div>\n
                \n
                printDG(G);<\/div>\n<\/div>\n<\/li>\n
              247. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              248. \n
                \n
                <\/div>\n<\/div>\n
                \n
                system(“pause”<\/span>);<\/div>\n<\/div>\n<\/li>\n
              249. \n
                \n
                <\/div>\n<\/div>\n
                \n
                <\/div>\n<\/div>\n<\/li>\n
              250. \n
                \n
                <\/div>\n<\/div>\n
                \n
                return<\/span> 0<\/span>;<\/div>\n<\/div>\n<\/li>\n
              251. \n
                \n
                <\/div>\n<\/div>\n
                \n
                }<\/div>\n<\/div>\n<\/li>\n<\/ol>\n
                <\/code><\/pre>\n<\/div>\n","protected":false},"excerpt":{"rendered":"
                \u539f\u6587\u5730\u5740   \u4e0a\u7bc7\u6587\u7ae0\u8bb2\u89e3\u4e86\u56fe<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"colormag_page_container_layout":"default_layout","colormag_page_sidebar_layout":"default_layout","footnotes":""},"categories":[],"tags":[118],"class_list":["post-4677","post","type-post","status-publish","format-standard","hentry","tag-02-"],"_links":{"self":[{"href":"https:\/\/i007.cc\/wordpress\/wp-json\/wp\/v2\/posts\/4677","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/i007.cc\/wordpress\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/i007.cc\/wordpress\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/i007.cc\/wordpress\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/i007.cc\/wordpress\/wp-json\/wp\/v2\/comments?post=4677"}],"version-history":[{"count":0,"href":"https:\/\/i007.cc\/wordpress\/wp-json\/wp\/v2\/posts\/4677\/revisions"}],"wp:attachment":[{"href":"https:\/\/i007.cc\/wordpress\/wp-json\/wp\/v2\/media?parent=4677"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/i007.cc\/wordpress\/wp-json\/wp\/v2\/categories?post=4677"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/i007.cc\/wordpress\/wp-json\/wp\/v2\/tags?post=4677"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}