-
大小: 4KB文件類型: .cpp金幣: 1下載: 0 次發(fā)布日期: 2021-01-09
- 標(biāo)簽: 圖??數(shù)據(jù)結(jié)構(gòu)??圖的遍歷??
資源簡(jiǎn)介
繪制基于本人的關(guān)系網(wǎng)(結(jié)點(diǎn)不少于 6),注:邊的權(quán)值代表關(guān)系緊密程度;分
析關(guān)系網(wǎng)的物理存儲(chǔ)類型;
2. 實(shí)現(xiàn)關(guān)系網(wǎng)的創(chuàng)建;
3. 按照深度遍歷和廣度遍歷算法輸出結(jié)點(diǎn)信息;
4. 實(shí)現(xiàn)從本人到某人的最可靠關(guān)系路徑
代碼片段和文件信息
#include?
#include?
#include?
#include?
#include?
#include
#include
#define?MaxInt?65535
#define?MaxVex?100
#define?MVNum?100
#define?OK?1
#define?ERROR?0
typedef?char?VerTexType;
typedef?int?ArcType;
typedef?int?Status;
typedef?int?Bool;
using?namespace?std;
typedef?struct
{
???VerTexType?vexs[MVNum];
???ArcType?arcs[MVNum][MVNum];
???int?vexnumarcnum;
}AMGraph;
typedef?struct?{
????int????data[MaxVex];
????int????front?rear;
}Queue;
void?InitQueue(Queue?*Q)
{
????Q->front?=?Q->rear?=?0;
}
void?EnQueue(Queue?*Q?int?e)
{
????if?((Q->rear+1)%MaxVex?==?Q->front)
????????return?;
????Q->data[Q->rear]?=?e;
????Q->rear?=?(Q->rear+1)%MaxVex;
}
int?QueueEmpty(Queue?*Q)
評(píng)論
共有 條評(píng)論