Graph (discrete mathematics)

「已注销」

已于 2022-12-09 14:18:40 修改

阅读量270

点赞数

分类专栏： Reference 文章标签：算法

于 2022-11-27 09:56:10 首次发布

本文链接：https://blog.csdn.net/qq_66485519/article/details/128060923

版权

Reference 专栏收录该内容

581 篇文章 5 订阅

订阅专栏

图论是数学的一个分支，主要研究对象是图，由顶点和边组成。图可以是无向的，如社交网络中两人之间的朋友关系，也可以是有向的，如债务关系。边可以附带权重，表示关系的强度或其他属性。图的类型包括完全图、有限图、连通图、二分图等，每种图都有其特定的性质和应用。

摘要由CSDN通过智能技术生成

In mathematics, and more specifically in graph theory, a graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense “related”. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line).[1] Typically, a graph is depicted in diagrammatic form as a set of dots or circles for the vertices, joined by lines or curves for the edges. Graphs are one of the objects of study in discrete mathematics.

The edges may be directed or undirected. For example, if the vertices represent people at a party, and there is an edge between two people if they shake hands, then this graph is undirected because any person A can shake hands with a person B only if B also shakes hands with A. In contrast, if an edge from a person A to a person B means that A owes money to B, then this graph is directed, because owing money is not necessarily reciprocated.

Graphs are the basic subject studied by graph theory. The word “graph” was first used in this sense by J. J. Sylvester in 1878 due to a direct relation between mathematics and chemical structure (what he called a chemico-graphical image).[2][3]

在这里插入图片描述