Location:
Search - graph
Search list
Description: 基于图方法的图像分割C++源码，详细内容参见Efficient Graph-Based Image Segmentation一文。-graph-based methods of image segmentation C source code, See details Efficient Graph - Based Image Segmentat ion a text.
Platform: |
Size: 21343 |
Author: liufu |
Hits:
Description: Make a graph from database record and either send it to a printer
directly selecting many print options or copy it in any file on disc.
This project also gives you print preview option for A4 size paper and
you can set your graph anywhere on the page.Also if you want to change
graph s height or width you can change.Zooming effect is also given
using hsrollbar.
Platform: |
Size: 23477 |
Author: David |
Hits:
Description: 用于图模型算法的一些简单程序graph.zip
Platform: |
Size: 52729 |
Author: yan |
Hits:
Description: A good material about Graph-based image segmentation,hope it is useful for those who need it
Platform: |
Size: 5475777 |
Author: 姬宝金 |
Hits:
Description: graph是一款linux/unix下绘制数据曲线图形的程序，用C++编写。
Platform: |
Size: 42628 |
Author: 阿商 |
Hits:
Description: 图论算法库，包括以下算法：
单源最短路径 Dijkstra 算法
单源最短路径 Bellman-Ford 算法
最小生成树 Prim 算法
每对节点间最短路径 Flod-Warshall 算法
程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。
该算法是为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。
该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。
Platform: |
Size: 10025 |
Author: lllstar |
Hits:
Description: 学习graph cuts的必读papers。-Learning graph cuts-read papers.
Platform: |
Size: 7279616 |
Author: Alice |
Hits:
Description: 具体详细的说明了CCS中graph工具的使用和一个实例;(Specific details of the use of graph tools in CCS and an example;)
Platform: |
Size: 1278976 |
Author: paulwww
|
Hits:
Description: 非常好的图论学习教材，可作为数学专业的本科教材(graph theory and combinatics)
Platform: |
Size: 3372032 |
Author: 纪夕颜
|
Hits:
Description: S7 GRAPH 中文编程手册 实用手册，初学者的学习资料(S7 GRAPH Chinese programming manual, practical manuals, learning materials for beginners)
Platform: |
Size: 893952 |
Author: pastime
|
Hits:
Description: 有向图结构设计以及插入节点等图的操作实现(The design of the directed graph structure and the operation of inserting nodes and other graphs)
Platform: |
Size: 1024 |
Author: D_O_dora
|
Hits:
Description: 图论应用的说明理论。本书能教予我们如何应用图论的基础去编程，去作为每个数据结构的框架。(Explanation theory of graph theory application.This book teaches us how to apply graph theory as a basis for programming as a framework for each data structure.)
Platform: |
Size: 7320576 |
Author: kkburp
|
Hits:
Description: 高随祥的图论与网络流理论，介绍在网络里如何利用图论进行问题的分析，对于庞大的网络流有相当的帮助。(Gao Suixiang's graph theory and network flow theory, introduced in the network how to use graph theory to analyze the problem, for a large network flow quite helpful.)
Platform: |
Size: 78843904 |
Author: kkburp
|
Hits:
Description: Flipper Graph Control库文件()
Platform: |
Size: 375808 |
Author: 九月桃
|
Hits:
Description: Coursera Graph Theory Course .. assignments' solutions to pass the course in cplus plus
Platform: |
Size: 8586 |
Author: sigsegv22 |
Hits:
Description: IT'S A SOURCE CODE FOR VARIOUS GRAPH ALGORITHM IN C++
Platform: |
Size: 2048 |
Author: candyman123 |
Hits:
Description: a virtual instrument than shows the graph of a multiply of a pair numbers
Platform: |
Size: 7168 |
Author: Joze0115 |
Hits:
Description: 基于slam的matlab工具箱，包含EKF-SLAM and graph-SLAM两部分，可用于熟悉SLAM的仿真代码。(slam Toolbox, This toolbox considers these objects as the only existing data for SLAM.
They are de ned as structures holding a variety of felds.)
Platform: |
Size: 4220928 |
Author: Bearcsu |
Hits:
Description: 运用graph；寻找最短路径（最短时间/最少换乘）(Suppose following weighted directed graph representing a local subway route network, the vertices in the graph represent the important sites in the area, the arcs represents the existing subway routs, and the weight represent the time duration from one site to another one. Try to design a subway route query system to help the users find
(a) the way to go from one site to another one in shortest time(weighted shortest path)
(b) the way to go from one site to another one with minimal transfer(unweighted shortest path), for the routes with same transfer times choose the one costing shortest time.)
Platform: |
Size: 106496 |
Author: durian27 |
Hits:
Description: (1)使用邻接矩阵表示图，定义相应的抽象数据类型。
(2)实现两个图ADTs的上述函数。
(3)从空图开始，生成图形对象表示图1所示的图形，将顶点和边逐一插入。
(4)以BFS方式遍历图。((1) Use adjacency matrix to represent graphs and define the corresponding abstract data type.
(2) Realize all the above functions for the two graph ADTs.
(3) Starting from an empty graph, generate a graph object represent the graph shown in Fig. 1 by inserting the vertices and edges one by one.
(4) Traverse the graph in BFS manner.)
Platform: |
Size: 13312 |
Author: mia_shao |
Hits:
«
1
2
34
5
6
7
8
9
10
...
50
»