Description: 1 using an arbitrary polynomial chain structure of storage, and the sum of two polynomials. 2 Assuming a hierarchical top-down, from left to right input of each node a triple (D, P, L/R). Where D is an element node, P is the parent node, L indicates D is the left child of P, R indicates D is P' s right child. Try to write a binary tree in memory to establish a double-stranded representation algorithm and achieve first root, the root, root, and layer after traversal algorithms. 3 using adjacency matrix used to achieve network storage, to establish a network and to achieve single-source shortest path algorithm.
To Search:
File list (Check if you may need any files):
上机实验
........\实验一
........\......\main.c
........\实验三
........\......\C语言实现
........\......\C语言实现1
........\......\..........\Graph.c
........\......\.........\exp3.c
........\......\JAVA实现
........\......\........\ComputerTest.java
........\实验二
........\......\ErChaShu.c
........\......\main.c
Download