//从某个顶点出发进行深度优先遍历(递归)
public void DFSAL(int i)
{
visited[i] = 1;
adjListNode <T> p = adjList[i].FirstAdj;
while (p != null)
{
if (visited[p.Adjvex] == 0)
{
DFSAL(p.Adjvex);
}
p = p.Next;
}
}
//获取边的数目
public int GetNumOfEdge()
{
int i = 0;
//遍历邻接表数组
foreach (VexNode <T> nd in adjList)
{
adjListNode <T> p = nd.FirstAdj;
while (p != null)
{
++i;
p = p.Next;
}
}
return(i / 2);
}
//在顶点v1和v2之间添加权值为v的边
public void SetEdge(Node <T> v1, Node <T> v2, int v)
{
if (!IsNode(v1) || !IsNode(v2))
{
Console.WriteLine("Node is not belong to Graph !");
return;
}
//权值不对(不是无向图)
if (v != 1)
{
Console.WriteLine("Weight is not right!");
return;
}
//处理顶点v1的邻接表
adjListNode <T> p = new adjListNode <T>(GetIndex(v2));
//顶点v1没有邻接顶点
if (adjList[GetIndex(v1)].FirstAdj == null)
{
adjList[GetIndex(v1)].FirstAdj = p;
}
//顶点v1有邻接顶点
else
{
//插入邻接表的头部
p.Next = adjList[GetIndex(v1)].FirstAdj;
adjList[GetIndex(v1)].FirstAdj = p;
}
//处理顶点v2的邻接表
p = new adjListNode <T>(GetIndex(v1));
//顶点v2没有邻接顶点
if (adjList[GetIndex(v2)].FirstAdj == null)
{
adjList[GetIndex(v2)].FirstAdj = p;
}
else
{
p.Next = adjList[GetIndex(v2)].FirstAdj;
adjList[GetIndex(v2)].FirstAdj = p;
}
}
//删除顶点v1和v2之间的边
public void DelEdge(Node <T> v1, Node <T> v2)
{
//v1或v2不是图的顶点
if (!IsNode(v1) || !IsNode(v2))
{
Console.WriteLine("Node is not belong to Graph!");
return;
}
//顶点v1，v2之间有边
if (IsEdge(v1, v2))
{
//处理顶点v1的邻接表中的顶点v2的邻接表结点
adjListNode <T> p = adjList[GetIndex(v1)].FirstAdj;
adjListNode <T> pre = null;
while (p != null)
{
if (p.Adjvex != GetIndex(v2))
{
pre = p;
p = p.Next;
}
else
{
break;
}
}
pre.Next = p.Next;
//处理顶点v2的邻接表中的顶点v1的邻接表结点
p = adjList[GetIndex(v2)].FirstAdj;
pre = null;
while (p != null)
{
if (p.Adjvex != GetIndex(v1))
{
pre = p;
p = p.Next;
}
}
pre.Next = p.Next;
}
}
//判断v1和v2之间是否存在边
public bool IsEdge(Node <T> v1, Node <T> v2)
{
//v1或v2不是图的顶点
if (!IsNode(v1) || !IsNode(v2))
{
Console.WriteLine("Node is not belong to Graph!");
return(false);
}
adjListNode <T> p = adjList[GetIndex(v1)].FirstAdj;
while (p != null)
{
if (p.Adjvex == GetIndex(v2))
{
return(true);
}
p = p.Next;
}
return(false);
}
//从某个顶点出发进行广度优先遍历
public void BFSAL(int i)
{
visited[i] = 1;
CSeqQueue1 <int> cq = new CSeqQueue1 <int>(visited.Length);
cq.In(i);
while (!cq.IsEmpty())
{
int k = cq.GetOut();
adjListNode <T> p = adjList[k].FirstAdj;
while (p != null)
{
if (visited[p.Adjvex] == 0)
{
visited[p.Adjvex] = 1;
cq.In(p.Adjvex);
}
p = p.Next;
}
}
}
public VexNode(Node <T> nd, adjListNode <T> alNode)
{
data = nd;
firstAdj = alNode;
}
public VexNode(Node <T> p)
{
data = p;
firstAdj = null;
}
//构造
public VexNode()
{
data = null;
firstAdj = null;
}
public adjListNode(int vex)
{
adjvex = vex;
next = null;
}