private ListD <Vertex <T> > GetListSuccessorNotVisited(string pVertice)
{
int index = VerticesGroup.GetIndex(pVertice);
if (index >= 0)
{
ListD <Vertex <T> > ListVerticesSuce = new ListD <Vertex <T> >();
for (int i = 0; i < AdjacencMatrix.GetLength(1); i++)
{
if (AdjacencMatrix[index, i] != null && !AdjacencMatrix[index, i].GetVertB().IsVisit)
{
ListVerticesSuce.InsertarAlFinal(AdjacencMatrix[index, i].GetVertB());
}
}
return(ListVerticesSuce);
}
return(null);
}
public ListD <Vertex <T> > GetListPreSuce(string pVertice)
{
int index = VerticesGroup.GetIndex(pVertice);
if (index >= 0)
{
ListD <Vertex <T> > ListVerticesPreSuc = new ListD <Vertex <T> >();
for (int i = 0; i < AdjacencMatrix.GetLength(1); i++)
{
if (AdjacencMatrix[index, i] != null)
{
ListVerticesPreSuc.InsertarAlFinal(AdjacencMatrix[i, index].GetVertA());
}
}
return(ListVerticesPreSuc);
}
return(null);
}
public ListD <Vertex <T> > GetListaSuccessors(string pVertice)
{
int index = VerticesGroup.GetIndex(pVertice);
if (index >= 0)
{
ListD <Vertex <T> > ListVerticesSuccessors = new ListD <Vertex <T> >();
for (int i = 0; i < AdjacencMatrix.GetLength(1); i++)
{
if (AdjacencMatrix[index, i] != null)
{
ListVerticesSuccessors.InsertarAlFinal(AdjacencMatrix[index, i].GetVertB());
}
}
return(ListVerticesSuccessors);
}
return(null);
}
