Graph Theory Authors: Adrian Bondy, U.S.R Murty Publisher: Springer; 3rd Corrected Printing edition (Aug 14 2008) ISBN-10: 1846289696 ISBN-13: 978-1846289699 = Product Description = The primary aim of this book is to present a coherent introduction to graph theory, suitable as a textbook for advanced undergraduate and beginning graduate students in mathematics and computer science. It provides a systematic treatment of the theory of graphs without sacrificing its intuitive and aesthetic appeal. Commonly used proof techniques are described and illustrated. The book also serves as an introduction to research in graph theory. = Table of Contents = Graphs - Subgraphs - Connected Graphs - Trees - Separable and Nonseparable Graphs - Tree-Search Algorithms - Flows in Networks - Complexity of Algorithms - Connectivity - Planar Graphs - The Four-Colour Problem - Stable Sets and Cliques - The Probabilistic Method - Vertex Colourings - Colourings of Maps - Matchings - Edge Colourings - Hamilton Cycles - Coverings and Packings in Directed Graphs - Electrical Networks - Integer Flows and Coverings - Unsolved Problems - References - Glossary - Index = Reviews = For more than three decades, the authors' Graph Theory with Applications (1976) has served as perhaps the classic introduction to graph theory. With happy shock, the reader learns that Bondy and Murty have updated the book, doubling its size. Three decades would count as a long time in the life of any active scientific pursuit, but the original year of publication saw the solution to the four-color conjecture that catalyzed a vast revitalization of graph theory. Graph theory, moreover, now has intimate interactions with computer science, practical and theoretical: three decades ago, computer networks barely existed and the founding papers of complexity theory had just appeared. Connections between graph theory and probability have also undergone a revolution. In short, the passage of time has transformed this subject in these and other ways, and the authors have transformed their book accordingly. They do, by choice, largely omit the theory of graph minors (developed by Paul Seymour and Neil Robertson and followers), which certainly now deserves a monographic treatment of its own. Summing up: Recommended. Lower-division undergraduate through professional collections. CHOICE This book is a follow-on to the authors' 1976 text, Graphs with Applications. What began as a revision has evolved into a modern, first-class, graduate-level textbook reflecting changes in the discipline over the past thirty years... This text hits the mark by appearing in Springer’s Graduate Texts in Mathematics series, as it is a very rigorous treatment, compactly presented, with an assumption of a very complete undergraduate preparation in all of the standard topics. While the book could ably serve as a reference for many of the most important topics in graph theory, it fulfills the promise of being an effective textbook. The plentiful exercises in each subsection are divided into two groups, with the second group deemed "more challenging". Any exercises necessary for a complete understanding of the text have also been marked as such. There is plenty here to keep a graduate student busy, and any student would learn much in tackling a selection of the exercises... Not only is the content of this book exceptional, so too is its production. The high quality of its manufacture, the crisp and detailed illustrations, and the uncluttered design complement the attention to the typography and layout. Even in simple black and white with line art, it is a beautiful book. SIAM Book Reviews "A text which is designed to be usable both for a basic graph theory course … but also to be usable as an introduction to research in graph theory, by including more advanced topics in each chapter. There are a large number of exercises in the book … . The text contains drawings of many standard interesting graphs, which are listed at the end." (David B. Penman, Zentralblatt MATH, Vol. 1134 (12), 2008) MathSciNet Reviews "The present volume is intended to serve as a text for "advanced undergraduate and beginning graduate students in mathematics and computer science" (p. viii). It is well suited for this purpose. The writing is fully accessible to the stated groups of students, and indeed is not merely readable but is engaging… Even a complete listing of the chapters does not fully convey the breadth of this book… For researchers in graph theory, this book offers features which parallel the first Bondy and Murty book: it provides well-chosen terminology and notation, a multitude of especially interesting graphs, and a substantial unsolved problems section…One-hundred unsolved problems are listed in Appendix A, a treasure trove of problems worthy of study… (In short) this rewrite of a classic in graph theory stands a good chance of becoming a classic itself." "The present volume is intended to serve as a text for ‘advanced undergraduate and beginning graduate students in mathematics and computer science’ … . The writing is fully accessible to the stated groups of students, and indeed is not merely readable but is engaging. The book has many exercise sets, each containing problems … ." (Arthur M. Hobbs, Mathematical Reviews, Issue 2009 C) "A couple of fantastic features: Proof techniques: I love these nutshelled essences highlighted in bordered frames. They look like pictures on the wall and grab the view of the reader. Exercises: Their style, depth and logic remind me of Lovász’ classical exercise book. Also the fact that the name of the author is bracketed after the exercise…Figures: Extremely precise and high-tech…The book contains very recent results and ideas. It is clearly an up-to-date collection of fundamental results of graph theory…All-in-all, it is a marvelous book." (János Barát, Acta Scientiarum Mathematicarum, Vol. 75, 2009)

城市图建模项目 一个小型 OOP Java 项目，它使用图形对城市的交通网络进行建模。 ================ 项目#1：考虑一个城镇不同位置的有轨电车和公交线路以及相应站点的网络。 在一些地方，为了换线，存在多个车站（有轨电车和公共汽车）。 每条线路都有平均行驶速度和成本。 要求： 对问题的所有相关概念进行建模； 适当地决定接口、抽象类、类； 考虑重用性、数据封装、关注点分离； 提供类图； 假设一个人想从一个特定的地方去另一个地方，为他/她提供所有可用的连接（不考虑时间表限制）； 让系统提供从一个地点到另一个地点的最快、最短和最便宜的方式； 通过显示车站名称并根据当前线路的平均速度在两个车站之间等待来模拟人的旅行。 价值：3p 截止时间：2014 年 11 月 23 日 23:59。 错过最后期限长达一周会使项目价值减少 50%。 错过截止日期超过一周导致该项

Introduction Background and Traditional Approaches Node Embeddings Graph Neural Networks Generative Graph Models

Neo4j 社区版 org.neo4j/neo4j/3.5.22/neo4j-3.5.22.jar

《TF-GNN：Graph Neural Networks》附录《A.2.2 Creating GraphTensors》例程

微软concept graph数据，可以使用neo4j进行使用。原始网站concept.research.microsoft.com已经挂掉，幸好下载保存了一份数据，可以用neo4j进行调用，教程： https://neo4j.com/blog/microsoft-concept-graph-neo4j/

数据结构图投资组合分配 使用邻接矩阵或邻接表和各种算法（例如深度优先搜索，广度优先搜索和Dijkstra算法）存储的无向和有向图抽象数据类型的Python3实现。 该项目在2021年冬季季度完成，在Tim Alcon教授的指导下，在OSU的CS 261数据结构课程中完成。 这两个文件中已经提供了各种测试用例。 只需运行： $ ./d_graph.py 或者 $ ./ud_graph.py

PDG：程序依赖图 由以下规则定义的非常基本的命令性程序的程序依赖关系图创建器。 assignment := x=Aexpr; conditional1 := if(Bexpr){ stmts; } else {stmts; } endif conditional2 := if(Bexpr){ stmts; } endif iterative := while(Bexpr){stmts; } stmt := assignment | conditionsal1 | conditional2 | iterative stmts := stmt | stmts; stmt Aexpr: = constant | variable | Aexpr + Aexpr | Aexpr – Aexpr | Aexpr * Aexpr | Aexpr /

这是一个用C++写的graph cut代码，对分割图像有很好的效果。希望有帮助

Yuri Boykov, Vladimir Kolmogorov的代码