Search - h.3 - CodeBus

Search - h.3 - List

[JSP] Java-HowToProgram6thEdition DL : 0: Java How to Program Sixth Edition By H. M. Deitel - Deitel and Associates Inc. P. J. Deitel - Deitel and Associates Inc. -Java How to Program Sixth Edition By H. M. Deitel- Deitel and Associates Inc. P. J. Deitel- Deitel and Associates Inc.
Date : 2025-12-16 Size : 15.82mb User : Ali
[JSP] Discrete-Event-Simulation-in-Java DL : 0: Roskilde大学的一篇关于Java离散事件仿真的PDF文章，共105页，第65-105页是Java source code, 目录如下： A. The simset package B. Source code of the simset package C. The random package D. Source code of the random package E. Source code of the simulation.event package F. Car wash simulation with simulation.event G. Source code of the simulation.activity package H. Car wash simulation with simulation.activity I. Source code of the simulation.events package J. Car wash simulation with simulation.events K. Source code of javaSimulation L. Process-based car wash simulation with javaSimulation M. Event-based car wash simulation with javaSimulation N. Activity-based car wash simulation with javaSimulation O. Source code of the javaCoroutine package P. Test program for javaCoroutine-英文说明： A literature title" Discrete Event Simulation in Java", writen by Keld Helsgaun of department of Computer Science Roskilde University. Contents: 1 introduction 2 Discrete event simulation in Java 3 A package for coroutine sequencing in Java 4 Implementation of Java Simulation 5 Evaluation of Java Simulation 6 Conclusions
Date : 2025-12-16 Size : 209kb User : lijuan
[JSP] spider.pdf.tar DL : 0: 度优先爬虫就是这样一个爬虫，爬走在这个有向图上，从根节点开始一层一层往外爬取新的节点的数据。宽度遍历算法如下所示： (1) 顶点 V 入队列。 (2) 当队列非空时继续执行，否则算法为空。 (3) 出队列，获得队头节点 V，访问顶点 V 并标记 V 已经被访问。 (4) 查找顶点 V 的第一个邻接顶点 col。 (5) 若 V 的邻接顶点 col 未被访问过，则 col 进队列。 (6) 继续查找 V 的其他邻接顶点 col，转到步骤(5)，若 V 的所有邻接顶点都已经被访问过，则转到步骤(2)。按照宽度遍历算法，上图的遍历顺序为：A->B->C->D->E->F->H->G->I，这样一层一层的遍历下去。-java spider
Date : 2025-12-16 Size : 27.43mb User : tuxedo