Graph traversal of the presentation (c language data structure, curriculum design issues) /* definition of map*/typedef struct (int V [M] int R [M] [M] int vexnum) Graph /* create the map*/void creatgraph (Graph* g, int n) (int i, j, r1, r2 g-> vexnum = n /* vertex with i said*/for (i = 1 i < = n i++) (g-> V [i] = i ) /* initialize the R*/for (i = 1 i < = n i++) for (j = 1 j < = n j++) (g-> R [i] [j] = 0) /* input R*/printf (" Please input R (0,0 END): \ n" ) scanf (" d, d" , & r1, & r2) while (r1! = 0 & & r2! = 0) (g-> R [r1] [r2] = 1 g-> R [r2] [r1] = 1 scanf (" d, d" , & r1, & r2)))-graph traversal of the display (c language curriculum design data structures that) /* definition of the map*/typedef s truct V (int int [M] R [M] [M]) int vexnum Graph /* create map*/void creatgraph (Graph* g, int n) (int i, j, r1 , r2 g-

图遍历的演示\1.TXT
............\2.TXT
............\GTraverse.CPP
............\GTraverse.EXE
............\图遍历的演示实习报告.doc
............\说明.txt
图遍历的演示

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．