Introduction - If you have any usage issues, please Google them yourself
Complete the diagram with adjacent matrix storage diagram, depth-first search and breadth-first search.
Algorithm is suitable for the undirected graph (network) and directed graph (network).