Description: DAGON Approach
Object of this exercise:
Given a subject graph and a set of pattern graph in canonical representation (2-input
NAND and INV), implement the second step of DAGON approach. (Both the subject
graph and the pattern graphs are trees.) Platform: |
Size: 40091 |
Author:林力宏 |
Hits:
Description: < 聚类收集大量的生物医学文献基于本体富硒图代表性和相互细化策略>>-<Clustering large collection of biomedical literature based on ontology-enriched graph representation and mutual refinement Strategies> Platform: |
Size: 212992 |
Author:汤佩 |
Hits:
Description: DAGON Approach
Object of this exercise:
Given a subject graph and a set of pattern graph in canonical representation (2-input
NAND and INV), implement the second step of DAGON approach. (Both the subject
graph and the pattern graphs are trees.) Platform: |
Size: 39936 |
Author:林力宏 |
Hits:
Description: 图的邻接表存储表示法 源码 这是进行计算机图论算法的基础 如最基本算法DFS BFS
图的邻接表存储表示法 源码 这是进行计算机图论算法的基础 如最基本算法DFS BFS-Adjacency list graph representation of source storage This is a computer algorithm based on graph theory such as the basic algorithm DFS BFS graph adjacency list representation storage source This is a computer algorithm based on graph theory such as the basic algorithm DFS BFS Platform: |
Size: 880640 |
Author:cuiyuzheng |
Hits:
Description: 这编码帮着展示图像代表情况，每年学生报告附带图片-This code helps you to show graphical representation for situations like generating annual report for student with its graph. This code creates Pie Chart likewise we can also create Bar Chart.
Platform: |
Size: 152576 |
Author:衡云翰 |
Hits:
Description: 采用邻接矩阵表示法创建有向图，是用c编写的 -Adjacency matrix representation used to create directed graph is prepared with c Platform: |
Size: 1024 |
Author:huliang |
Hits:
Description: 一个邻接矩阵表示的图型结构，可帮助了解图的数组表示法，理清很多基本概念。可以用VC直接编译运行。-An adjacency matrix representation of the map structure, can help to understand the array graph representation, clarifying many of the basic concepts. VC can be directly translated to run. Platform: |
Size: 9216 |
Author:LIZHENG |
Hits:
Description: 在一个图形中分别用四种图形表示，矩形，杆型，等-In a graph with four kinds of graphical representation, respectively, rectangular, rod type, and so on Platform: |
Size: 2048 |
Author:hate |
Hits:
Description: This article presents one of the most famous hierarchical graph drawing algorithms. Starting from a hierarchical graph we create a population of chromozoms that will be used in a Genetic Algorithm to get the best subjective representation: minimal edge crossing. Minimal esge crossing is the most important aspect in aesthetic graph drawing(planar drawing). Hierarchical graph with a hierarchical drawin using multiple layer has a great importnace in data mining software solution. Platform: |
Size: 135168 |
Author:mihi64 |
Hits:
Description: 本程序描述图的算法的表述，可以通过该程序学习图的程序设计-This procedure describes the graph algorithm representation, you can learn through the process of program design plan Platform: |
Size: 4096 |
Author:于孟磊 |
Hits:
Description: 运用单链表和邻接矩阵实现图的表示、图的运算以及图的遍历-Used to achieve a single list and adjacency matrix graph representation, graph operations and graph traversal Platform: |
Size: 1119232 |
Author:周规劝 |
Hits:
Description: This paper addresses the problem of segmenting an image into regions. We defi ne a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then develop an effi cient segmentation algorithm based on this predicate, and show that although this algorithm makes greedy decisions it produces segmentations that satisfy global properties. We apply the al-gorithm to image segmentation using two diff erent kinds of local neighborhoods in constructing the graph, and illustrate the results with both real and synthetic images. The algorithm runs in time nearly linear in the number of graph edges and is also fast in practice. An important characteristic of the method is its ability to preserve detail in low-variability image regions while ignoring detail in high-variability regions. Platform: |
Size: 7799808 |
Author:1 |
Hits:
Description: 1、创建一个无向图，采用邻接矩阵存储，顶点采用单个字符表示，边采用邻接矩阵表示；
2、输出该图的存储示意图；
3、对该图进行深度优先遍历和广度优先遍历并输出遍历的结果。
-1, create an undirected graph adjacency matrix storage vertex edges using adjacency matrix representation with a single character 2, the output of the storage schematic 3, depth-first and breadth-first traversal of the graph and output traversal results. Platform: |
Size: 3801088 |
Author:Tracy |
Hits:
Description: • 实施一个工程计划时，若将整个工程分成若干个工序，有些工序可以同时实施，有些工序必须在完成另一些工序之后才能实施，工序之间的次序关系可用有向图表示。一个工程的完成时间可分为：最早完成时间和最晚完成时间。
• 关键路径的算法主要是通过计算工程的各个工序的缓冲时间（即：最晚完成时间减去最早完成时间的差），若某些工序的缓冲时间为零，这些工序即为关键路径，而缓冲时间不为零的工序就不是关键路径。
-• Implement a project plan, if the entire project is divided into several steps, some steps can be implemented simultaneously, some process must be completed before the implementation of some other process, process an order relation between the directed graph representation available. A project completion time can be divided into: earliest completion time and the latest finish time. • Critical path algorithm works mainly through the various steps of calculating buffer time (namely: the latest finish time minus the earliest completion time difference), if certain processes buffering time is zero, these processes is the critical path, and buffer time is not zero step is not critical path. Platform: |
Size: 2048 |
Author:Bingo |
Hits:
Description: 利用Java实现的图的不同表示方法的转换器，从文件读入一个有向图的权矩阵表示(含有矩阵阶数)，输出这个图的关联矩阵、边列表、逆向表、邻接表表示。可作为图论的学习材料。-Using Java to achieve different graph representation of the converter, the file is read from a directed graph represents the weight matrix (containing a matrix of order), the output of this correlation matrix, the edge list, reverse the table, adjoining table. Graph theory can be used as learning materials. Platform: |
Size: 10240 |
Author:Paul |
Hits:
Description: 1.从学校的平面图中选取有代表性的景点，抽象成一个无向带权图。以图中顶点表示校内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等信息。
2.为来访客人提供图中任意景点相关信息的查询。
3.为来访客人提供图中任意景点的问路查询，即查询任意两景点之间的一条最短的简单路径。-1. Choose a plan view of a representative the school s interest in the abstract as an undirected weighted graph. Vertex to map the school attractions representation, storage attractions names, code names, profiles and other information Edge said the path to the storage path length and other information.
2. provide visitors attractions FIG query any relevant information.
3. Provide any figure attractions for visiting guests ask queries that query an attraction between any two shortest simple path. Platform: |
Size: 4096 |
Author:min zou |
Hits:
Search - graph representation