博弈论的Matlab工具箱

相似文件 换一批

是 否 +2 论坛币

k人 参与回答

经管之家送您一份

应届毕业生专属福利!

求职就业群

赵安豆老师微信：zhaoandou666

经管之家联合CDA

送您一个全额奖学金名额~ !

立即领取

感谢您参与论坛问题回答

经管之家送您两个论坛币！

+2 论坛币

《博弈论》的诞生是个传说，这个传说造就了多位诺贝尔经济学奖。现在它的发展还远远未了，每一次进步都会让全世界的数学家、经济家激动不已。

提供博弈论的Matlab算法工具箱，全都用matlab编写，下面包中的函数列表。
把这个直接解压到matlab的应用文件夹下，就可以当作自身的工具一样应用它。



Matlab算法工具箱函数列表

---

%
% 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;
% 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;
% grTravSale - solve the nonsymmetrical traveling salesman problem;
% grValidation - auxiliary function (the data validation);
%
% grTheoryTest - test program for all functions.
%
% Author: Sergiy Iglin

1. % Functions:
   
2. % grBase         - find all bases of digraph;
   
3. % grCoBase       - find all contrabases of digraph;
   
4. % grCoCycleBasis - find all independent cut-sets for a connected graph;
   
5. % grColEdge      - solve the color problem for graph edges;
   
6. % grColVer       - solve the color problem for graph vertexes;
   
7. % grComp         - find all components of graph;
   
8. % grCycleBasis   - find all independent cycles for a connected graph;
   
9. % grDecOrd       - solve the problem about decomposition of the digraph to the sections with mutually accessed vertexes (strongly connected components);
   
10. % grDistances    - find the distances between any vertexes of graph;
    
11. % grEccentricity - find the (weighted) eccentricity of all vertexes,radius, diameter, center vertexes and the periphery vertexes;
    
12. % grIsEulerian   - find the Eulerian cycle of graph;
    
13. % grMaxComSu     - solve the maximal complete sugraph problem for the graph;
    
14. % grMaxFlows     - solve the maximal flow problem for the digraph;
    
15. % grMaxMatch     - solve the maximal matching problem for the graph;
    
16. % grMaxStabSet   - solve the maximal stable set problem for the graph;
    
17. % grMinAbsEdgeSet- solve the minimal absorbant set problem for the graph edges;
    
18. % grMinAbsVerSet - solve the minimal absorbant set problem for the graph vertexes;
    
19. % grMinCutSet    - solve the minimal cut-set problem for the digraph;
    
20. % grMinEdgeCover - solve the minimal edge cover problem for the graph;
    
21. % grMinSpanTree  - solve the minimal spanning tree problem for the graph;
    
22. % grMinVerCover  - solve the minimal vertex cover problem for the graph;
    
23. % grPERT         - solve the project evaluation research task;
    
24. % grPlot         - draw the plot of the graph (digraph);
    
25. % grShortPath    - solve the shortest path problem for the digraph;
    
26. % grTravSale     - solve the nonsymmetrical traveling salesman problem;
    
27. % grValidation   - auxiliary function (the data validation);
    
28. % grTheoryTest   - test program for all functions.
    
29. %
    
30. % Author: Sergiy Igli

复制代码

扫码加我 拉你入群

请注明：姓名-公司-职位

以便审核进群资格，未注明则拒绝

分享0 收藏15 回帖

关键词：MATLAB工具箱 MATLAB matla atlab 工具箱 MATLAB 博弈论 Game 算法 工具箱

谢         谢

好好好好好好好好 好好好好发

一样的不 学

   先收藏了

满怀欣喜的进来了，结果还是图论的程序，唉！！！

恩，不错。多谢。

介绍很详细，谢啦

对呀，哪个是博弈论的呢

谢谢LZ，这太有用啦