20162314 Experiment 4 - Graph

Experiment report of Besti

course:《Program Design & Data Structures》

Class: 1623

Student Name: Wang, Yixiao

Student Number:20162314

Tutor:Mr.Lou、Mr.Wang

Experiment date:2017.11.19

Secret level: Unsecretive

Experiment time:60 minutes

Major/Elective:Major

Experiment order:4

Experiment content

  1. Graph implement and apply-1

  1. Graph implement and apply-2

3.Graph implement and apply-3

Experiment situation

Exp1 Graph implement and apply-1

  • It‘s easy to finish this experiment.
  • To start with , import to form a new LinkedBinaryTree to start the experiment.
  • Next , use the method GetRight GetLeft to ealuation.
  • Then , new element "ABC".
  • Last , Assert.assertequals();

Exp2 Graph implement and apply-2

  • To start with , use the number to replace "A B C D ....."
  • Next , new newNode
  • Then, creat BinTree to get left child and right child
  • Use three methods preOrderTraverse,inOrderTraverse,postOrderTraverse.

Exp3 Graph implement and apply-3

  • To start with , creat a class TwentyQuestionsPlayer
  • String the Questions and the answers as the order
  • New them
  • Write a method play(),Yes =Y , No=N .
  • Next , write a function to finish this experiment.

Code hosting

PSP5.1(Personal Software Process)

Steps Time percent
requirement 45minutes 16.7%
design 50minutes 18.5%
coding 1.5hours 32.2%
test 30minutes 11.1%
summary 55minutes 19.2%
时间: 2024-10-31 07:28:46

20162314 Experiment 4 - Graph的相关文章

20162314 《Program Design & Data Structures》Learning Summary Of The Eleventh Week

20162314 2017-2018-1 <Program Design & Data Structures>Learning Summary Of The Eleventh Week Summary of Key Concepts In hashing, elements are stored in a hash table, with their location in thetable determined by a hashing function. The situation

Author name disambiguation using a graph model with node splitting and merging based on bibliographic information

Author name disambiguation using a graph model with node splitting and merging based on bibliographic information 基于文献信息进行节点拆分和合并的图模型消歧方法(GFAD) 论文: https://link.springer.com/article/10.1007/s11192-014-1289-4 这是一篇比较早的文章,将人名消歧过程作为一个系统,主要想学习它对消歧过程中的各个阶段

Graph Regularized Feature Selection with Data Reconstruction

Abstract • 从图正则数据重构方面处理无监督特征选择: • 模型的思想是所选特征不仅通过图正则保留了原始数据的局部结构,也通过线性组合重构了每个数据点: • 所以重构误差成为判断所选特征质量的自然标准. • 通过最小化重构误差,选择最好保留相似性和判别信息的特征: 1  Introduction  • 目前有两大类无监督特征选择算法:Similarity preserving 和 clustering performance maximization:Similarity preserv

Codeforces 841D Leha and another game about graph - 差分

Leha plays a computer game, where is on each level is given a connected graph with n vertices and m edges. Graph can contain multiple edges, but can not contain self loops. Each vertex has an integer di, which can be equal to 0, 1 or  - 1. To pass th

724G - Xor-matic Number of the Graph(线性基)

724G - Xor-matic Number of the Graph 题意: 待补~~ 参考http://www.cnblogs.com/ljh2000-jump/p/6443189.html

[CodeChef - GERALD07 ] Chef and Graph Queries

Read problems statements in Mandarin Chineseand Russian. Problem Statement Chef has a undirected graph G. This graph consists of N vertices and M edges. Each vertex of the graph has an unique index from 1 to N, also each edge of the graph has an uniq

HDOJ 5409 CRB and Graph 无向图缩块

无向图缩块后,以n所在的块为根节点,dp找每块中的最大值. 对于每一个桥的答案为两块中的较小的最大值和较小的最大值加1 CRB and Graph Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 113    Accepted Submission(s): 41 Problem Description A connected, undi

【Lintcode】137.Clone Graph

题目: Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors. How we serialize an undirected graph: Nodes are labeled uniquely. We use # as a separator for each node, and , as a separator for node label and each

133. Clone Graph

题目: Clone an undirected graph. Each node in the graph contains a label and a list of its neighbors. OJ's undirected graph serialization: Nodes are labeled uniquely. We use # as a separator for each node, and , as a separator for node label and each n