输入是10个顶点的邻接矩阵的程序 [英] Program that Input is adjacency matrix of 10 vertices

问题描述

编程输入是10个顶点的邻接矩阵，10个顶点的输出连接矩阵。



我明天需要提交，我不知道如何begin..Pls help

Program that Input is adjacency matrix of 10 vertices ,Output connectivity matrix of 10 vertices.

Pls i need to submit tomorrow and i have no idea on how to begin..Pls help

推荐答案

也许你应该早点开始？



我们不做你的作业：这是有原因的。它就是为了让你思考你被告知的事情，并试着理解它。它也在那里，以便您的导师可以识别您身体虚弱的区域，并将更多的注意力集中在补救措施上。



因此，您的问题可能会更具体相比之下，但从谷歌开始。

Wiki解释了什么是邻接矩阵 [ ^ ]，但是 Wolfram Alpha [ ^ ]说：

邻接矩阵，有时也称为连接矩阵，......

所以你需要看看你的问题要详细解决你应该应用什么样的转型。我们不能为你编码（因为你的作业不会这样做！）



自己尝试一下，你可能会发现它并不困难如您所愿！

Perhaps you should have started earlier?

We do not do your homework: it is set for a reason. It is there so that you think about what you have been told, and try to understand it. It is also there so that your tutor can identify areas where you are weak, and focus more attention on remedial action.

So, your question will probably be rather more specific than that, but start with Google.
Wiki explains what an Adjacency matrix[^] is, but Wolfram Alpha[^] says :
"The adjacency matrix, sometimes also called the connection matrix, of a..."
So you need to look at your question in detail to work out what kind of transformation you should be applying. We can't code it for you (and since it's your homework wouldn't do so anyway!)

Try it yourself, you may find it is not as difficult as you think!

这意味着什么：#define MAX 20

what does this means : #define MAX 20

这篇关于输入是10个顶点的邻接矩阵的程序的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！