Introduction - If you have any usage issues, please Google them yourself
Adjacency matrix to build an undirected connected graph (vertex information for characters), respectively dfs (depth-first search), and bfs (breadth-first search) traversal, the output graph vertex information and verification.