数据结构与算法-看得见的算法 课程设计报告.docxVIP

信息工程系综合课程设计报告 题 目: 班 级: 学 号: 姓 名: 指导老师: 数据结构与算法.看得见的算法软件与信息服务四班林诗睿 四、附件核心代码，图 一：koch雪花分形public AlgoVisualizer(int depth, int side){A8 * v data = new FractalData(depth);int scenewidth = 3*side+3; int sceneHeight = side; EventQueue.invokeLater(() - {-frame = new AlgoFrame( title： Fractal Visualizer1, scenewidth、sceneHeiqht): frame.addKeyListener(new AlgoKeyListenerO);二 new Thread(() - { run(); ?).start(); ?)； ? private void run(){ setData(data.depth); ? private void setData(int depth){ data.depth = depth; frame.render(data); AlgoVisHelper.pause(DEL^y); throw new IllegalArgumentException(Text is null in drawText function!);FontMetrics metrics = g.getFontMetricsO; int w = metrics.stringWidth(text);int h = metrics.getDescentO; g.drawstring(text, x： centerx - w/2, y： centery + h); ? public static void fillTriangle(Graphics2D g, int xl, int yl, int x2, int y2, int x3GeneralPath path = new GeneralPathO; path.moveToCxl, yl);path.lineTo(x2r y2); path.lineToCxS, y3);path.closePathO; g.filKpath); } public static void drawLine(Graphics2D g, double xl, double yl, double x2, double y2： Line2D line = new Line2D.Double(xlr yl, x2, y2);g.draw(line); }Fractal Visualizer 二：扫雷 23477071727374 2 3 4 7 70 71 72 73 74 75 76 77 78 79 name= + name +,,age= + age + ,gender= + gender + ,id=H + id + public static void main(String[] args) {ListPerson personList = new ArrayList( initialcapacity： 3);- Scanner scanner = new Scanner(System.in); int n = scamuer.nextlntO;-for (int i = 0; i n; i++) { scanner = new Scanner(System.in); String personStr = scanner.nextLineO; String[] s = personStr.split( regex：); Person person = new Person(s[0], Integer.porselnt(s[l]), Boolean.parseBoolec personList.add(person); scanner.closeO;personList.forEach(person - System. out. printin (person. toStringO)); 10 6789 ie ii121314 6 7 8 9 ie ii 12 13 14 15 16 17 18 19 26 21 22 23 24 25 26 27 28 29 private static int blockside = 32;private MineSweeperData data; private AlgoFrame frame;private static final int d[