Name: 数据结构探险之图篇
Uploaded: 2021-06-29T09:54:29+8:00
Description: 本课程主要以图的存储方式，图的遍历方法，图的最小生成树为内容主体，详细讲述了图的存储方式，图的遍历和最小生成树的编程思路及实现原理，并手把手完成图的深度优先遍历算法和广度优先遍历算法。

本课程主要以图的存储方式，图的遍历方法，图的最小生成树为内容主体，详细讲述了图的存储方式，图的遍历和最小生成树的编程思路及实现原理，并手把手完成图的深度优先遍历算法和广度优先遍历算法。

Difficulty：Elementary

Total of18 chapters

23026 plays

Chapter1Basic concepts of graphs: Course Overview
Chapter2Graph storage structure, traversal method and minimum spanning tree algorithm: Basic concepts and storage methods of graphs (1); Basic concepts and storage methods of graphs (2); Graph traversal and minimum spanning tree
Chapter3Basic operations and traversal of graphs: Graph coding practice - graph coding instructions and display; Practical coding of graphs - basic operations of graphs (1); Practical coding of graphs - basic operations of graphs (2); Graph coding practice - depth-first traversal of graphs; Graph coding practice - breadth-first traversal of graphs; Graph coding practice-graph coding phase detection
Chapter4Minimum Spanning Tree Algorithm for Graphs: Graph coding practice - Prim's algorithm of minimum spanning tree (1); Graph coding practice - Prim's algorithm of minimum spanning tree (2); Graph coding practice - Prim's algorithm of minimum spanning tree (3); Graph coding practice - Prim's algorithm of minimum spanning tree (4); Graph coding practice - Kruskal algorithm of minimum spanning tree (1); Graph coding practice - Kruskal algorithm of minimum spanning tree (2); Graph coding practice - Kruskal algorithm of minimum spanning tree (3); Graph coding practice - Kruskal algorithm of minimum spanning tree (4)

About Instructor

大家讲道理: PHP developer

You will learn:: 1、图的基本概念 2、图的存储方式 3、图的遍历算法 4、图的最小生成树算法 5、图的实际应用

数据结构探险之图篇

About Instructor

php.cn