算法系列15天速成——第十五天 图【下】（大结局）

for (int i = 0; i < graph.vertexNum; i++)
            {
                Console.Write("n第" + (i + 1) + "个顶点为:");

var single = Console.ReadLine();

//顶点信息加入集合中
                graph.vertex[i] = single;
            }

Console.WriteLine("n请输入构成两个顶点的边和权值，以逗号隔开。n");

for (int i = 0; i < graph.edgeNum; i++)
            {
                Console.Write("第" + (i + 1) + "条边:t");

initData = Console.ReadLine().Split(',').Select(j => int.Parse(j)).ToList();

int start = initData[0];
                int end = initData[1];
                int weight = initData[2];

//给矩阵指定坐标位置赋值
                graph.edges[start - 1, end - 1] = weight;

//如果是无向图，则数据呈“二，四”象限对称
                if (graph.graphType == 1)
                {
                    graph.edges[end - 1, start - 1] = weight;
                }
            }

return graph;
        }
        #endregion

#region 输出矩阵数据
        /// <summary>
/// 输出矩阵数据
/// </summary>
/// <param></param>
        public void OutMatrix(MatrixGraph graph)
        {
            for (int i = 0; i < graph.vertexNum; i++)
            {
                for (int j = 0; j < graph.vertexNum; j++)
                {
                    if (graph.edges[i, j] == short.MaxValue)
                        Console.Write("∽t");
                    else
                        Console.Write(graph.edges[i, j] + "t");
                }
                //换行
                Console.WriteLine();
            }
        }
        #endregion

#region 广度优先
        /// <summary>
/// 广度优先
/// </summary>
/// <param></param>
        public void BFSTraverse(MatrixGraph graph)
        {
            //访问标记默认初始化
            for (int i = 0; i < graph.vertexNum; i++)
            {
                graph.isTrav[i] = false;
            }

（编辑：焦作站长网）

【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容!