某田径运动会共有七个项目的比赛，分别为100米、200米、跳高、跳远、铅球、铁饼和标枪。每个选手最多参加3个项目，现有六名选手参赛，他们选择的项目已知。根据选手所选项目，进行各项目比赛时间的安排。本实验将满足每个选手参加的各个项目不能同时进行，使运动会在尽可能短的时间内完成

中国邮递员问题 一位邮递员从邮局选好邮件去投递，然后返回邮局，当然他必须经过他负责投递的每条街道至少一次，为他设计一条投递路线，使得他行程最短。 上述中国邮递员问题的数学模型是：在一个赋权连通图上求一个含所有边的回路，且使此回路的权最小。 显然，若此连通赋权图是Euler图，则可用Fleury算法求Euler回路，此回路即为所求。

B站录课资源网址： https://space.bilibili.com/609703132/channel/detail?cid=142579&ctype=0

作者: Jeremy Kepner / John Gilbert 出版社: Society for Industrial & Applied Mathematics 出版年: 2011-7-14 页数: 389 定价: USD 110.00 装帧: Hardcover ISBN: 9780898719901 Graphs are among the most important abstract data types in computer science, and the algorithms that operate on them are critical to modern life. Graphs have been shown to be powerful tools for modeling complex problems because of their simplicity and generality. Graph algorithms are one of the pillars of mathematics, informing research in such diverse areas as combinatorial optimization, complexity theory, and topology. Algorithms on graphs are applied in many ways in today s world - from Web rankings to metabolic networks, from finite element meshes to semantic graphs. The current exponential growth in graph data has forced a shift to parallel computing for executing graph algorithms. Implementing parallel graph algorithms and achieving good parallel performance have proven difficult. This book addresses these challenges by exploiting the well-known duality between a canonical representation of graphs as abstract collections of vertices and edges and a sparse adjacency matrix representation. This linear algebraic approach is widely accessible to scientists and engineers who may not be formally trained in computer science. The authors show how to leverage existing parallel matrix computation techniques and the large amount of software infrastructure that exists for these computations to implement efficient and scalable parallel graph algorithms. The benefits of this approach are reduced algorithmic complexity, ease of implementation, and improved performance. Graph Algorithms in the Language of Linear Algebra is the first book to cover graph algorithms accessible to engineers and scientists not trained in computer science but having a strong linear algebra background, enabling them to quickly understand and apply graph algorithms. It also covers array-based graph algorithms, showing readers how to express canon

基于Matlab平台的图论模型的仿真实验.pdf

J.A.Bondy__图论及其应用.pdfJ.A.Bondy__图论及其应用.pdfJ.A.Bondy__图论及其应用.pdfJ.A.Bondy__图论及其应用.pdfJ.A.Bondy__图论及其应用.pdfJ.A.Bondy__图论及其应用.pdfJ.A.Bondy__图论及其应用.pdf

三、Fleury算法的Matlab程序 设图是连通无向图，如果所有顶点都是偶点，则该图是欧拉图，必然存在欧拉巡回，如果恰好有两个奇次顶点，则称该图为半欧拉图，必然存在起点在奇点（两个奇点中的一个）且终点在另一个奇点的欧拉道路。这两种情况下都可用fleury算法确定一条欧拉巡回或者欧拉道路。

图论导引 中文版 第二版.pdf

图论及其应用习题解答 图论及其应用习题解答 图论及其应用习题解答 图论及其应用习题解答 图论及其应用习题解答 图论及其应用习题解答 图论及其应用习题解答

计算欧拉回路的c语言程序，适合于学习数据结构的同学参考