Search - Java Node

Search - Java Node - List

[JSP/Java] BestWay1 DL : 0: 最短路径算法的一种高效实现。适合在节点密集的环境中找两点之间的最短路径。-shortest path algorithm to achieve a highly efficient. Suitable for the node-intensive environment between 2:00 find the shortest path.
Date : 2025-12-16 Size : 3kb User :
[JSP/Java] xmlconfig DL : 0: XML API,将XML结点返回HASHMAP,对于一般配置性XML解析比较方便,也实用-XML API, the XML node to return HASHMAP, the general configuration of XML for Analysis of more convenient, but also practical
Date : 2025-12-16 Size : 156kb User : xinsoft
[JSP/Java] B-A-smallworld-java-code DL : 0: 生成BA 小世界网络java 源程序，里面涉及到结点类RipplePeer可以另行自己实现，主要就是几个成员变量id，neighbors数组（与之连接的结点）和degree度数-BA small-world networks generated java source code, which relates to node can be its own category RipplePeer realize, the main variable is the number of members of id, neighbors array (connected nodes) and degree degrees
Date : 2025-12-16 Size : 1kb User :
[JSP/Java] 31165127184 DL : 0: 是数据一次性加载，客户端节点异步展示的WEB脚本树。MzTreeView 1.0 的理论节点数设计上限为十万节点，在节点数三万的情况下页面打开时间小于 3 秒。无限层次无限节点的数的层级组成方式：id parentId。即每个节点除本身的节点id之外还有它的父层节点id，通过这种方式就可以组合成无限层级的树了。-Is a one-time load data, the client node to display the WEB asynchronous script tree. MzTreeView 1.0 theoretical maximum number of nodes in the design of hundreds of thousands of nodes, number of nodes in the case of 30,000 pages open time of less than 3 seconds. Unlimited levels of unlimited number of node-level composition: id parentId. That is, each node in addition to its own node id in addition to its parent layer node id, in this way can be combined into an unlimited level of the tree.
Date : 2025-12-16 Size : 836kb User : floy
[JSP/Java] JTree DL : 0: 一个很好的jTree的例子，把JTree嵌在了网页上面，通过XML读取树的节点-JTree a good example of the JTree embedded in the page above, read through the XML tree node
Date : 2025-12-16 Size : 18kb User : yue
[JSP/Java] HTMLParser DL : 0: java编写的可以对HTML文件进行过滤和分析，可以把文件分析成节点组成的树型结构 -java can be prepared by filtering HTML documents and analysis, document analysis can be composed into a node tree structure
Date : 2025-12-16 Size : 2.17mb User : liudehe
[JSP/Java] javatip97 DL : 0: 鼠标拖拽的例子，jtree拖转节点到jtree的另一个节点-Drag the mouse example, jtree drag turn jtree node to another node
Date : 2025-12-16 Size : 5kb User : edward
[JSP/Java] SimpleRouter DL : 0: 使用Java语言编写模拟路由器程序，通过不同的IP端口（port），使用多线程模拟不同的路由器，路由器之间通过UDP协议交换路由信息，根据Bellman-ford算法确定下一条的路由节点。-The use of Java language router simulation procedures, through different IP port (port), the use of multi-threaded simulation of different routers, through the UDP protocol between routers exchange routing information, according to Bellman-ford algorithm to determine the next a routing node.
Date : 2025-12-16 Size : 42kb User : 邓瑞龙
[JSP/Java] Node DL : 0: Binary Expression Tree show in SVG
Date : 2025-12-16 Size : 1kb User : wanchat
[JSP/Java] Node DL : 0: 链表的创建，可以很方便的删除、插入和寻找。-List creation, you can insert and delete the search for freedom.
Date : 2025-12-16 Size : 3kb User : 屈善强
[JSP/Java] E3TREE DL : 0: 一个功能较全面的树，可自由加减树的节点，展示树的各级节点-A function of a more comprehensive tree, free tree node addition and subtraction to demonstrate at all levels of the tree node
Date : 2025-12-16 Size : 8.19mb User : 刘博文
[JSP/Java] node DL : 0: node communication using java
Date : 2025-12-16 Size : 12kb User : bala
[JSP/Java] Node DL : 0: 这是一个结点的操作，用java作为开发环境，用线性表作为数据结构-This is a node of the operation, using java as a development environment, using a linear form as a data structure
Date : 2025-12-16 Size : 1kb User : 周祥
[JSP/Java] test DL : 0: 弹簧模型算法，可以自动生成“点-线”图的布局，-Generate node-link layout automatically
Date : 2025-12-16 Size : 6kb User : 张宁
[JSP/Java] QuadTree DL : 0: 从文件读取四叉树结点，按照morton码对四叉树进行编码-Read from the file quadtree node, in accordance with morton yards on the quad-tree coding
Date : 2025-12-16 Size : 6kb User : sunhao
[JSP/Java] Parking DL : 0: 有一个停车场，有m个进口，n个出口，k个空车位。要求每一刻只能有一个进口有车进入。停车场内没有一个集中的管理者，采用分布式的算法实现。能够动态的增加一个进口节点。-There is a parking lot, there are m-imported, n outlet, k empty parking spaces. Requires that every moment there can be only one import a car to enter. Car park does not have a centralized manager, using distributed algorithms. Be able to dynamically add a node imports.
Date : 2025-12-16 Size : 28kb User : 秦佳佳
[JSP/Java] trietreeJava DL : 0: trie的原理是利用字符串集合中字符串的公共前缀来降低时间开销以达到提高效率的目的。它具有以下性质:1,根结点不包含任何字符信息 2,如果字符的种数为n,则每个结点的出度为n(这样必然会导致浪费很多空间,这也是trie的缺点,我还没有想到好点的办法避免) 3,查找，插入复杂度为O(n),n为字符串长度。-The principle is the use of a string trie collection of string prefix to reduce the time overhead of public view to increasing efficiency. It has the following properties: 1, root node does not contain any character information 2, if the number of kinds of characters n, then each node of the out-degree of n (this will inevitably lead to waste a lot of space, this is also the shortcomings of trie , I have not thought a good way to avoid points) 3, find, insert the complexity is O (n), n for the length of the string.
Date : 2025-12-16 Size : 2kb User : 李庆文
[JSP/Java] LinkedList(Book) DL : 0: 实现一个链表称为循环链表的变化。链表应该能够被用来保留任何对象类型的数据。在一个循环链表的最后一个节点相连字段不为空，而是指回第一个节点。你的执行应当至少包括以下操作： 1.添加到列表的末尾 2.删除指定项从列表 3.检索一个指定的项目从列表 4.使用Iterator遍历列表 5.退出程序. 您可能包括其他必要操作。你已使用链表实施以上操作，编写一个应用程序代码来测试您的链表。选择一个对象（如图书，工人，零售项目等），定义为对象类，并创建一个列表在这些对象。允许您的应用程序代码来演示的所有链表定义的操作使用。-required to implement a variation of the linked list ADT called a circular linked list. The linked list should be able to be used to keep any Object type data. The linked field of the last node of a circular linked list is not NULL, instead it points back to the first node. Your implementation should at least include the following operations:  Add to the end of the list  Remove a specified item from the list  Retrieve a specified item from the list  Traverse the list using an Iterator You may include other operations deemed necessary. Using the Linked List ADT that you have implemented above, write an application code to test your ADT. Choose an object (such as Book, Worker, Retail Item, etc), define the class for the object, and create a list to work on these objects. Allow your application code to demonstrate the use of all the operations defined in the Linked List ADT.
Date : 2025-12-16 Size : 9kb User : jamison
[JSP/Java] LinkedList DL : 0: 自己写的LinkedList，node可以是任意种类对象的数据类型，用指针类来读取链表的节点-LinkedlList
Date : 2025-12-16 Size : 1kb User : wuyuwei
[JSP/Java] cuongtv_53_hw01 DL : 0: Write a program using Java language has the duty to read a text file and statistics of the words in the file. Programs need to use dynamic data structures (eg binary tree or linked list). Information about each word stored in a node in the structure. Data into a text file containing text. Each word is a continuous chain letters a.. Z, A.. Z, all the characters remaining is considered as the separation character between the words (for example, command-line will be counted as two words ). When counting the number of occurrences of the words singular and plural, eg book and books, are considered different words. Words capitalized or lower, for example, book and Book is considered the same word.
Date : 2025-12-16 Size : 3kb User : cuongtv

« 12 3 4 5 »