【源码】图论工具箱——在图形上执行计算的MATLAB工具箱

在这里插入图片描述

此工具箱包含处理图形和三角测量的有用函数。

This toolbox contains useful functions to deal with graph and triangulation.

具有n个顶点的图形的基本表示是邻接矩阵A,如果顶点 i 连接到顶点 j,则A(i,j)=1。

The basic representation of a graph of n vertices is the adjacency matrix A where A(i,j)=1 if vertex i is linked to vertex j.

图形通常在R^d中具备一种几何实现形式,即(d,n)矩阵,其中vertex(:,i)是第 i 个顶点的位置。

A graph often comes with a geometric realization in R^d which an (d,n) matrix where vertex(:,i) is the position of the ith vertex.

对于m面和n个顶点的三角测量通过以下方式表示:

A triangulation of m faces and n vertex is represented through:

*一组面,由一个(3,m)矩阵表示,其中face(:,i)是第 i 个面的顶点索引。

  • a set of faces which is a (3,m) matrix where face(:,i) are the vertices indexes of the ith face.

*一组顶点,由一个(d,n)矩阵表示。

  • a set of vertex which is a (d,n) matrix.

该工具箱包含更容易处理三角测量数据结构的功能,允许检索顶点和面1环,并在相邻面之间切换。

The toolbox contains function to deal more easily with a triangulation data structure, and allows to retrieve vertex and face 1-ring and switch from adjacency to faces.

工具箱的图部分包含创建合成图和计算最短路径的函数(dijkstra和isomap算法)。

The graph part of the toolbox contains function to creates synthetic graph and compute shortest path (dijkstra and isomap algorithm).

工具箱包含许多处理三角测量光谱理论的函数。

This toolbox contains a lot of function to deal with spectral theory of triangulation.

可以从文件加载三角测量数据,然后显示生成的网格。

You can load triangulations from files and then display the resulting mesh.

允许计算各种拉普拉斯算子,并使用谱分解、谐波映射、自由边界谐波映射和等值线图计算参数。

It allows to compute various laplacian operator, and the to compute parameterization using spectral decomposition, harmonic mapping, free boundary harmonic mapping, and isomap.

源码下载地址:

http://page2.dfpan.com/fs/3lcjb22182914694ea2/

更多精彩文章请关注微信号:在这里插入图片描述

GrTheory - Graph Theory Toolbox. 内含40个图论问题的matlab代码,包括最短径问题等。对数学建模,2012美赛ICM的帮助尤其大。欢迎下载。 Functions: grBase - find all bases of digraph; grCoBase - find all contrabases of digraph; grCoCycleBasis - find all independent cut-sets for a connected graph; grColEdge - solve the color problem for graph edges; grColVer - solve the color problem for graph vertexes; grComp - find all components of graph; grCycleBasis - find all independent cycles for a connected graph; grDecOrd - solve the problem about decomposition of the digraph to the sections with mutually accessed vertexes (strongly connected components); grDistances - find the distances between any vertexes of graph; grEccentricity - find the (weighted) eccentricity of all vertexes, radius, diameter, center vertexes and the periphery vertexes; grIsEulerian - find the Eulerian cycle of graph; grIsomorph - solve the problem about isomorphism for two graphs; grMaxComSu - solve the maximal complete sugraph problem for the graph; grMaxFlows - solve the maximal flow problem for the digraph; grMaxMatch - solve the maximal matching problem for the graph; grMaxStabSet - solve the maximal stable set problem for the graph; grMinAbsEdgeSet - solve the minimal absorbant set problem for the graph edges; grMinAbsVerSet - solve the minimal absorbant set problem for the graph vertexes; grMinCutSet - solve the minimal cut-set problem for the digraph; grMinEdgeCover - solve the minimal edge cover problem for the graph; grMinSpanTree - solve the minimal spanning tree problem for the graph; grMinVerCover - solve the minimal vertex cover problem for the graph; grPERT - solve the project evaluation research task; grPlot - draw the plot of the graph (digraph); grShortPath - solve the shortest path problem for the digraph; grShortVerPath - for digraph with weighted vertexes solve the problem about the path with minimal weight of verticies; grTranClos - built the transitive closure for the digraph; grTravSale - solve
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值