正在加载图片...
3.2 Graph Theory 1. vertex顶点 2.edge边 3. graph图 If any two nodes in a graph can be connected by a path along edges, the graph is said to be connected.如果图中任意两 个结点间都能够用一条路径沿着边线连接起来,那么该 图则被称为连通的。3 3.2 Graph Theory 1. vertex 顶点 2. edge 边 3. graph 图 If any two nodes in a graph can be connected by a path along edges, the graph is said to be connected. 如果图中任意两 个结点间都能够用一条路径沿着边线连接起来,那么该 图则被称为连通的
<<向上翻页向下翻页>>
©2008-现在 cucdc.com 高等教育资讯网 版权所有