目录
要求
- 图的邻接表和邻接矩阵存储
- 建立下图的邻接表或邻接矩阵,并输出之;
- 思路:
- 通过遍历邻接矩阵,采用头插法即可构造邻接表。
- 图的各种遍历算法实现
- 以0结点为起点实现上述图的深度优先和广度优先遍历算法;
- 思路:
- 用堆栈实现深度优先遍历,用队列实现广度优先遍历。
- 最小生成树的算法实现
- 利用普里姆(Prim)算法或克鲁斯卡尔(Kruskal)算法求上图的最小生成树,算法实现代码必需有注释。
- 思路:
- Prim:从0点出发每次取能到达的最小权重边,走完即为一颗最小生成树。
- 最短路径的算法实现
- 利用狄克斯特拉(Dijkstra)算法求上图中0结点到其它结点的最短路径,算法实现代码必须有注释。
- 思路:
- 循环每次计算到每一个点的最小距离并记录,然后取最小距离的那个点合并。
源代码
若以下显示需要登录,请刷新页面或点击此处下载。
思考
若只求带权有向图G中从顶点i到顶点j的最短路径,如何修改Dijkstra 算法来实现这一功能?
void Dijkstra_way(int first_point)
{
int* widget_list = new int[map_size]; //记录距离0的长度
for (int i = map_size; i--;)
{
widget_list[i] = INF;
adjList[i].weight = -1;
}
widget_list[first_point] = 0;
adjList[first_point].weight = 0;
for (int i = 1; i < map_size; ++i)
for (int j = map_size; j--;) //计算距离
if (adjList[j].weight >= 0)
for (node* node_p = adjList[j].next_p; node_p != NULL; node_p = node_p->next_p)
if (widget_list[j] + node_p->weight < widget_list[node_p->data])
{
widget_list[node_p->data] = widget_list[j] + node_p->weight;
adjList[node_p->data].weight = j;
}
cout << "<< Dijkstra 最短路径:" << endl;
coolQueue<int> stack;
for (int i = 0; i < map_size; ++i)
{
for (int j = i; j != first_point;)
{
stack.End_push(j);
j = adjList[j].weight;
}
cout << "<< " << first_point;
for (int pop_int = 0; stack.End_pop(pop_int);)
cout << " -> " << pop_int;
cout << endl;
stack.clear();
}
adjList_reflush();
}
buying prescription drugs in mexico: buying prescription drugs in mexico online – mexican drugstore online
canadian pharmacy no prescription required: pharmacy no prescription – online medication no prescription
online shopping pharmacy india: indian pharmacy paypal – Online medicine home delivery
canadian pharmacy world coupon code online pharmacy prescription canadian pharmacy no prescription needed
п»їbest mexican online pharmacies: buying prescription drugs in mexico online – buying prescription drugs in mexico online
http://pharmindia.online/# india online pharmacy
https://pharmcanada.shop/# trusted canadian pharmacy
indian pharmacies safe top 10 pharmacies in india online pharmacy india
indian pharmacy: pharmacy website india – indian pharmacies safe
reputable indian pharmacies: mail order pharmacy india – buy medicines online in india
canadian family pharmacy: buy prescription drugs from canada cheap – canadian pharmacy checker
mexico drug stores pharmacies buying prescription drugs in mexico medication from mexico pharmacy
https://pharmnoprescription.icu/# canadian pharmacy no prescription required
http://pharmcanada.shop/# pharmacy com canada
international pharmacy no prescription pharm world canadian pharmacy world coupon
order cenforce Purchase Cenforce Online buy cenforce
buy Viagra over the counter: Buy generic 100mg Viagra online – Sildenafil Citrate Tablets 100mg
https://kamagra.win/# buy Kamagra
Generic Cialis price buy cialis overseas buy cialis pill
http://levitrav.store/# Buy Vardenafil 20mg
https://cialist.pro/# Buy Cialis online
https://kamagra.win/# Kamagra tablets
Cialis 20mg price: Cialis 20mg price in USA – Cialis without a doctor prescription
Buy generic Levitra online levitrav.store Levitra tablet price
Cheap Viagra 100mg buy Viagra over the counter generic sildenafil