- 博客(3)
- 收藏
- 关注
RSS订阅原创 Minimum Spanning Tree (MST) -- Prim's Algorithm (c++实现)
1. 假设图为无向图，用adjacency matrix表示。Adjacency matrix见Adjacency Matrix -- c++实现2. 链接的中的程序当两节点为相连时将adjacency matrix中相应元素置1。MST问题中需考虑边的权重，因此连接时矩阵相应元素应设为权重值。Prim's algorithm见Prim's Algorithm实现：void Gra
2017-07-17 11:55:02
823
原创 Adjacency List表示下Depth-First-Search(DFS)及Breadth-First-Search(BFS)的c++实现
1. Interface (Graph.h, listQueue.h)#ifndef GRAPH_H_INCLUDED#define GRAPH_H_INCLUDEDclass Graph{private: struct adjListNode{ int node; adjListNode* next; adjListNode(int x, adjListNode* t
2017-07-11 11:39:45
562
原创 Adjacency Matrix -- c++实现
1. Adjacency Matrix (Undirected Graph)i. Header (Graph.h)#ifndef GRAPH_H_INCLUDED#define GRAPH_H_INCLUDEDclass Graph{private: bool** adjMat; // implement the matrix by a 2-D bool array in
2017-07-05 12:08:04
687
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人