public void StackX_Positive()
{
var stack = new StackX <int>();
Assert.IsTrue(stack.IsEmpty());
stack.Push(1);
stack.Push(3);
stack.Push(5);
stack.Push(7);
stack.Push(9);
Assert.AreEqual(5, stack.Size());
Assert.AreEqual(9, stack.Peek());
Assert.AreEqual(9, stack.Pop());
Assert.AreEqual(7, stack.Pop());
Assert.AreEqual(3, stack.Size());
Assert.AreEqual(5, stack.Peek());
stack.Push(66);
var list = new List <int> {
66, 5, 3, 1
};
int index = 0;
foreach (var i in stack)
{
Assert.AreEqual(list[index++], i);
}
}
public Graph()
{
_vertexList = new Vertex[MAX_VERTS];
_adjMat = RectangularArr.ReturnRectangularIntArray(MAX_VERTS, MAX_VERTS);
_nVerts = 0;
for (int j = 0; j < MAX_VERTS; j++)
{
for (int k = 0; k < MAX_VERTS; k++)
{
_adjMat[j][k] = 0;
}
}
_theStack = new StackX();
}
// ------------------
public Graph() // constructor
{
vertexList = new Vertex[MAX_VERTS];
// adjacency matrix
//ORIGINAL LINE: adjMat = new int[MAX_VERTS][MAX_VERTS];
adjMat = RectangularArrays.ReturnRectangularIntArray(MAX_VERTS, MAX_VERTS);
nVerts = 0;
for (int j = 0; j < MAX_VERTS; j++) // set adjacency
{
for (int k = 0; k < MAX_VERTS; k++) // matrix to 0
{
adjMat[j][k] = 0;
}
}
theStack = new StackX();
} // end constructor
