当前位置：
首页 资源下载
搜索资源 - graph representation
搜索资源列表
-
0下载：
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
-
-
0下载：
一个基于图形的高效图像分割算法，包括论文及相应的源代码。-This paper addresses the problem of segmenting an image into regions. We define a predicate for
measuring the evidence for a boundary between two regions using a graph-based representation of the image. We
then develo
-
-
0下载：
图的邻接表存储表示法 源码 这是进行计算机图论算法的基础 如最基本算法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 li
-
-
0下载：
这编码帮着展示图像代表情况，每年学生报告附带图片-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.
-
-
0下载：
采用邻接矩阵表示法创建有向图，是用c编写的 -Adjacency matrix representation used to create directed graph is prepared with c
-
-
0下载：
一个邻接矩阵表示的图型结构，可帮助了解图的数组表示法，理清很多基本概念。可以用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.
-
-
0下载：
在一个图形中分别用四种图形表示，矩形，杆型，等-In a graph with four kinds of graphical representation, respectively, rectangular, rod type, and so on
-
-
0下载：
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 ed
-
-
0下载：
本程序描述图的算法的表述，可以通过该程序学习图的程序设计-This procedure describes the graph algorithm representation, you can learn through the process of program design plan
-
-
2下载：
采用邻接矩阵表示无向图，完成图的创建、图的深度优先遍历、图的广度优先遍历操作。其中图的顶点信息是字符型，图中顶点序号按字符顺序排列。本输入样例中所用的图如下所示：
Input Format:
第一行输入两个值，第一个是图中顶点的个数，第二个是图中边的条数
第二行输入各顶点的信息，即输入每个顶点字符
第三行开始输入每条边，每条边的形式为两个顶点的序号，中间以空格隔开，输入完一条边换行
Output format:
首先输出图的顶点信息，输出完毕换行
接着输出图的邻
-
-
0下载：
树的邻接表表示和邻接矩阵表示，以及图的广度优先和深度优先遍历。-Tree adjacency list representation and adjacency matrix representation, and the graph breadth-first and depth-first traversal.
-
-
0下载：
LCD graph representation information with microcontroller
-
-
0下载：
运用单链表和邻接矩阵实现图的表示、图的运算以及图的遍历-Used to achieve a single list and adjacency matrix graph representation, graph operations and graph traversal
-
-
0下载：
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 segment
-
-
0下载：
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 storag
-
-
0下载：
a graph representation by jfreechart
-
-
0下载：
• 实施一个工程计划时，若将整个工程分成若干个工序，有些工序可以同时实施，有些工序必须在完成另一些工序之后才能实施，工序之间的次序关系可用有向图表示。一个工程的完成时间可分为：最早完成时间和最晚完成时间。
• 关键路径的算法主要是通过计算工程的各个工序的缓冲时间（即：最晚完成时间减去最早完成时间的差），若某些工序的缓冲时间为零，这些工序即为关键路径，而缓冲时间不为零的工序就不是关键路径。
-• Implement a project plan, if
-
-
0下载：
利用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 ord
-
-
0下载：
1.从学校的平面图中选取有代表性的景点，抽象成一个无向带权图。以图中顶点表示校内各景点，存放景点名称、代号、简介等信息；以边表示路径，存放路径长度等信息。
2.为来访客人提供图中任意景点相关信息的查询。
3.为来访客人提供图中任意景点的问路查询，即查询任意两景点之间的一条最短的简单路径。-1. Choose a plan view of a representative the school s interest in the abstract as an undirected wei
-
-
0下载：
The basis of the presented methods for the visualization and clustering of graphs is a novel similarity and distance metric, and the matrix describing the similarity of the nodes in the graph. This matrix represents the type of connections between th
-
