搜索资源列表
QuadTree
- 从文件读取四叉树结点，按照morton码对四叉树进行编码-Read from the file quadtree node, in accordance with morton yards on the quad-tree coding
left_M
- 内含摇曳的递归分形树源代码。双击Leaf_M.html文件，程序运行；双击Leaf_M.java文件，进入编辑环境。-Recursive includes swaying fractal source code tree. Double-click Leaf_M.html files, program run Leaf_M.java double-click the file, enter the editing environment.
新建 WinZip File
- 二叉树算法(java)-Binary Tree Algorithm (java)
WinExplorer
- 树状目录结构，带有源码。分为不同的类，可独自运行，也可插入其它框架中，代码实现了文件路径以string存取-Tree structure, with source code. Divided into different categories, can be run independently, can also be inserted into other frameworks, the code achieved a string file path to access
Explorer
- Java资源管理器，基于MVC实现，代码结构清析、规范。在功能上完全实现了资源管理器核心的浏览功能以及列表双击与目录树的同步展开和添加/删除文件时的同步刷新,另外增加了右键菜单功能！ 查找、删除含有子目录的文件夹和重命名功能实现类是FileViewImpl.java，不过功能没有真正实现，有兴趣的朋友可以继续完善。 -Java Explorer, based on the MVC realization, code structure analysis of clearance,
HuffmanTree
- 根据huffman树的一个压缩程序，可以压缩和解压单个文件，压缩率80 左右-Huffman tree in accordance with a compression program, you can compress and decompress a single file, the compression rate of 80
AFR
- A system that takes CAD drawings as input and apply automatic feature recognition methods on them to identify different features present in them. The feature will then populate in a tree in the system s UI (and selecting them highlight them in the pa
VKX.java
- This sample read file xml and creater tree -This is sample read file xml and creater tree
DtreeTest
- 生成动态树，可以添加节点，删除节点，数据库是mysql，sql文件在应用路径下文件名为tree_table.sql。解压后可直接放在myeclipse里-Generate dynamic tree, you can add nodes, delete nodes, the database is mysql, sql file path in the application file name is tree_table.sql. Decompression can be placed dire
WindowsExplorer.0
- 实现windows资源管理器的部分功能。如文件树和文件列表-Explorer windows to achieve some functionality. If the document tree and file list
14160_1243297151FXTK
- Java资源管理器，基于MVC实现，代码结构清析、规范。在功能上完全实现了资源管理器核心的浏览功能以及列表双击与目录树的同步展开和添加/删除文件时的同步刷新,另外增加了右键菜单功能！ -Java Explorer, based on the MVC achieved clearance code analysis of the structure, norms. Functions fully achieved Explorer browsing, as well as the core
112-TreeSumming
- A solution in java (includes a .txt file of test cases) to the Tree Summing Problem under Volume I of the Problem Set Volumes of the UVA Online Judge. The problem is available at http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&ca
tree.java.tar
- ID3 Algorithm. This program needs an input file in.txt.
cuongtv_53_hw01
- 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.
filebrowser
- 文件管理系统 对整个系统的文件进行统一管理 目录树方式 可以删除 添加修改文件 很强大 -Document management system document the entire system for unified management approach to delete the directory tree is a powerful add modify the file
23tree
- 2-3 树插入，查找，删除，排序，从文件txt读入插入，查找，删除，排序等指令-two three tree, including insert, search,order,delete, you can read command for txt file
JSP_and_Ajax_tree_menu
- 一款JSP+MySQL的Ajax无刷新树形菜单完整示例，包含JAVA源文件和项目文件，配置好MYSQL连接，导入.war项目文件即可运行-The Ajax a JSP+ MySQL tree menu without refreshing the full sample, including the JAVA source files and project files, configured MYSQL connection, to import. War file to run the pr
kyotocabinet-java-1.14.tar
- 这是 kyoko cabinet C 代码有关 Java 的绑定接口。 kyoko cabinet 是一个管理数据库的库。该数据库是一个单一的数据文件，每个记录为关键字和值。每个关键字和值是可变长度的字节序。二进制数据和字符串都可作为关键字或值。每个关键字必须唯一。没有数据表和数据类型的概念。记录以哈希表和b树组织。 -Kyoto Cabinet is a library of routines for managing a database. The database is a
tokyocabinet-java-1.24.tar
- Tokyo cabinet C 库代码的Java绑定接口。 Tokyo cabinet 是一个管理数据库的库。该数据库是一个单一的数据文件，每个记录为关键字和值。每个关键字和值是可变长度的字节序。二进制数据和字符串都可作为关键字或值。每个关键字必须唯一。没有数据表和数据类型的概念。记录以哈希表、b树和定长数据组织。-The Tokyo Cabinet C libaray s Java binding. Tokyo Cabinet is a library of routine
XML
- 使用DOM解析XML文件 Dom解析是将xml文件全部载入，组装成一颗dom树，然后通过节点以及节点之间的关系来解析xml文件。对于特别大的文档，解析和加载整个文档可能很慢且很耗资源 http://www.iteye.com/topic/763926 -Dom XML file using DOM parser to parse the xml file is all loaded, assembled into a dom tree, then the relationship b