【C++ 程序】最长路径矩阵（LPM）算法求迭代边界

最新推荐文章于 2022-07-26 14:26:53 发布

Teddy van Jerry

最新推荐文章于 2022-07-26 14:26:53 发布

阅读量660

点赞数

分类专栏：【数字信号处理】【C++】自编程序文章标签： c++ 数字信号处理

本文链接：https://blog.csdn.net/weixin_50012998/article/details/109441600

版权

【C++】自编程序同时被 2 个专栏收录

52 篇文章 15 订阅

订阅专栏

【数字信号处理】

9 篇文章 2 订阅

订阅专栏

这是SEU新生研讨课自学内容。

书本例题

程序

Updated: 2021/03/02

/*
 * Project: LPM
 * File: Source.cpp
 * ------------------
 * 
 * @author: Teddy van Jerry
 * 
 * @version 2021/03/02
 * - add validity check
 * - modify the loop range
 * 
 * @version 2020/11/02
 * - initial version
 * 
 * -------------------
 * @acknowledgement
 * The bug which was fixed on 2021/03/02
 * was found thanks to
 * "North London is Red!"
 * in CSDN.
 * (2021/03/02)
 * 
 */

#include <iostream>
#include <deque>
using namespace std;

int main()
{
	unsigned n = 0;
	double max_t = 0;
	deque<deque<deque<int>>> L_all;
	deque<deque<int>> L;

	cout << "Please input L(1):" << endl;
	int num;

	// input
	while (1)
	{
		deque<int> row;
		while (cin >> num)
		{
			row.push_back(num);
			if (getchar() == '\n') break;
		}
		L.push_back(row);
		n = (row.size() > n) ? row.size() : n;
		if (L.size() >= n) break;
	}
	L_all.push_back(L);

	// calculate L(2) to L(m)
	for (int m = 2; m <= n; m++)
	{
		for (int i = 1; i <= n; i++)
		{
			for (int j = 1; j <= n; j++)
			{
				int max_now = -1;
				// The line below used to be line 38.
				for (int k = 1; k <= n; k++)
				{
					// check the validity
					// If any of them is -1, there exists no valid path.
					if (L_all[0][i - 1][k - 1] == -1 || L_all[m - 2][k - 1][j - 1] == -1) continue;
					// The line below used to be line 40.
					max_now = max(max_now, L_all[0][i - 1][k - 1] + L_all[m - 2][k - 1][j - 1]);
				}
				L[i - 1][j - 1] = max_now;
			}
		}
		L_all.push_back(L);
	}

	// find the maximum
	for (int m = 1; m <= n; m++)
		for (int i = 0; i != n; i++)
			max_t = max(max_t, L_all[m - 1][i][i] / static_cast<double>(m));

	//print
	cout << "\nT∞ = " << max_t << endl;

	return 0;
}