说明：  这是数据结构的一个C++编程。在邻接矩阵上实现带权图、不带权图的初始化，搜索、插入、删除边，宽度遍历、深度遍历。邻接矩阵用模板类实现。
(This is a programming data structure C++. Achieve a weighted graph in the adjacency matrix, with no right of map initialization, search, insert, delete edge, traversing the width and depth traversal. Adjacency matrix is ​ ​ implemented with a template class.)