[软件构造]Lab 2

wimirong的奇妙旅程

已于 2022-05-10 16:37:25 修改

阅读量209

点赞数

分类专栏：软件构造文章标签： java

于 2022-04-29 20:22:14 首次发布

8 篇文章 0 订阅

订阅专栏

星期五的晚上

Graph：
labeled vertices 结点有标记
mutable weighted directed graphs 可变权有向图
mutable graph可变图:顶点和边可以被add和remove from the graph
directed edges有向边 : edge from a source vertex to a target vertxt 边从源顶点到目标顶点
weighted edges带权边：edges are associated with a positive integer weight 一个边与一个正整数相关联（二元组）
labeled vertices有名点：vertices are distinguished by a label of some immutable t
ype.fo顶点通过immutable type相区分

Graph 是一个generic type（类属性）类似于List或Map<K,V>,
in the specification of List,E is a placeholder for the types of the element in the list.E是个类型的占位符，
in Map,K and V are placeholders for the types of keys and values,在映射里，K和V是关键字类型和值类型的占位符。
Only later does the client of List or Map choose patticular types for theses place holder by constructing只是到了后来，甲方才会用type改成占位符
The specification of a genetic type is written in terms of the placeholders,genetic type的规约依据（in terms of）占位符来写。Map<K,V>里头，K在规约里头就得说是immutable…
in our spectification for Graph 我们对L的immutability作除一样的要求，mutable vertex是violate the precondition 违反前置条件的。
要实现两次Graph ，，用两种不同的reps(represent 应该就是ADT interface里的实现翻译为表述),练习选择抽象函数，防止内部量泄露

with our graph datatype in hand,we will implement GraphPoet ,a class for generating poetry using a word affinity graph. 用我们在手边的graph类型，我们来实现GraphPoet,一个类生成诗，通过词汇吸引图。
*（awesome 像那么回事了）
input: 来自Tolkien的phrase短语
They spoke no more of the small news of the Shire far away, nor of the dark shadows and perils that encompassed them, but of the fair things they had seen in the world together
（他们不再提及遥远Shire的小事，不再提及黑夜的阴影和笼罩他们的危险，而是那些他们共度的golden时光）（信达雅!!!）
output:
他们的言语/
凌越那些远处的细碎世事/
不见黑夜的影子和周遭暗流/
而又光热/
三千世界未睹/
的绵绵光热/
（长短句结合一代文豪！！！！）

Devise,document,and implement tests for Graph
For now,我们只test有String label的Graph,一会我们扩label
为了运行我们的test关于mutiple的Graph interface，here is the setup 这就是设置(mmp !too much!fuc…k shi…t)
static Graph.empty() 的测试策略和测试在 Grapf…里头有。。。。。。。。。。。。。
…
2022/5/10 先开始做吧
具体的要求什么的边看编写参考ppt的写法吧。

关注

专栏目录