数据结构之图- 图的表示方法(6)

最新推荐文章于 2024-07-02 16:37:54 发布

猴子数据分析

最新推荐文章于 2024-07-02 16:37:54 发布

阅读量4.1k

点赞数

分类专栏：数据结构和算法数据结构和算法,JAVA语言

本文链接：https://blog.csdn.net/yangzhongblog/article/details/8653784

版权

本文探讨了图数据结构的组成，包括顶点和边，并分析了为什么Java Collections API未包含图的实现。介绍了图的类型，如无连接图、有向无环图、加权图等，以及图的两种常见表示方式：邻接矩阵和邻接列表。邻接矩阵通过二维数组表示，邻接列表则是一个数组或列表的列表，每个列表表示一个顶点的相邻顶点。

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

Graphs is composed by vertices and edges. We can look at Internet as a graph, which webpage are vertices and hyperlinks are edges.

Why doesn't the Java Collections API include a Graph implementation?

I don’t know why there is no graph library within the JDK , but I guess Sun decided to leave this to developers, since most applications that require graphs also require very unique implementations. Also as graphs can have so many different forms and flavours with wildly different characteristics, a general Graph might not turn out to be very useful. But we can use Graph libraries like：JGraphT

0 Graph Types

1) Unconnected graph and connected graph（非连通图和连通图）

2) undirected graph and directed graph(无向图和有向图)

3) graph with cycles and graph without cycles（有环图和无环图）

graph with cycles: a path that ends up where it started. Like the following figure, the path B-C-D-B forms a cycle. (Notice that A-B-C-A is not a cycle because you can’t go from C to A.).