matlab dagnn,图论工具箱(来源于matlab-fileexchange)

本文介绍了从matlab-fileexchange下载的图论工具箱MATLAB BGL,包括其功能、核心代码结构以及部分关键算法如最短路径、最大流等。提供了详细的目录结构,帮助理解工具箱的组织方式和使用方法。
摘要由CSDN通过智能技术生成

【实例简介】

这是我从matlab的文件共享中心下载的图论工具箱,matlabBGL

【实例截图】

【核心代码】

matlab_bgl-4.0.1

└── matlab_bgl

├── @inplace

│   ├── assign.m

│   ├── display.m

│   ├── double.m

│   ├── end.m

│   ├── inplace.m

│   ├── size.m

│   ├── subsasgn.m

│   └── subsref.m

├── @ipdouble

│   └── ipdouble.m

├── @ipint32

│   └── ipint32.m

├── Contents.m

├── all_shortest_paths.m

├── astar_search.m

├── bellman_ford_sp.m

├── betweenness_centrality.m

├── bfs.m

├── biconnected_components.m

├── boyer_myrvold_planarity_test.m

├── breadth_first_search.m

├── chrobak_payne_straight_line_drawing.m

├── circle_graph_layout.m

├── clique_graph.m

├── clustering_coefficients.m

├── combine_visitors.m

├── components.m

├── core_numbers.m

├── custom

│   ├── dijkstra_all_sp.m

│   └── path_histogram.m

├── cycle_graph.m

├── dag_sp.m

├── depth_first_search.m

├── dfs.m

├── dijkstra_sp.m

├── doc

│   ├── changed.txt

│   ├── html

│   │   ├── changes.html

│   │   ├── core_numbers_example

│   │   │   ├── core_numbers_example.html

│   │   │   ├── core_numbers_example.png

│   │   │   ├── core_numbers_example_01.png

│   │   │   └── core_numbers_example_02.png

│   │   ├── faq.html

│   │   ├── images

│   │   │   └── matlab-bgl-header.png

│   │   ├── index.html

│   │   ├── new_in_3

│   │   │   ├── new_in_3_0.html

│   │   │   ├── new_in_3_0.png

│   │   │   ├── new_in_3_0_01.png

│   │   │   ├── new_in_3_0_02.png

│   │   │   └── new_in_3_0_03.png

│   │   ├── new_in_4

│   │   │   ├── new_in_4_0.html

│   │   │   ├── new_in_4_0.png

│   │   │   ├── new_in_4_0_01.png

│   │   │   ├── new_in_4_0_02.png

│   │   │   ├── new_in_4_0_03.png

│   │   │   └── new_in_4_0_04.png

│   │   ├── old.html

│   │   ├── planar_graphs

│   │   │   ├── planar_graphs.html

│   │   │   ├── planar_graphs.png

│   │   │   ├── planar_graphs_01.png

│   │   │   ├── planar_graphs_02.png

│   │   │   ├── planar_graphs_03.png

│   │   │   ├── planar_graphs_04.png

│   │   │   ├── planar_graphs_05.png

│   │   │   ├── planar_graphs_06.png

│   │   │   ├── planar_graphs_07.png

│   │   │   └── planar_graphs_08.png

│   │   ├── record_alg

│   │   │   └── record_alg.html

│   │   ├── red_black

│   │   │   ├── red_black.html

│   │   │   ├── red_black.png

│   │   │   ├── red_black_01.png

│   │   │   ├── red_black_02.png

│   │   │   ├── red_black_03.png

│   │   │   └── red_black_04.png

│   │   ├── reweighted_graphs

│   │   │   └── reweighted_graphs.html

│   │   ├── site.css

│   │   └── style.css

│   ├── mxdom2mbgl-html.xsl

│   └── write_examples_html.m

├── edge_weight_index.m

├── edge_weight_vector.m

├── edmonds_maximum_cardinality_matching.m

├── edmunds_karp_max_flow.m

├── erdos_reyni.m

├── examples

│   ├── approx_multiway_cut.m

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、付费专栏及课程。

余额充值