public void Construct(FiniteTotalOrderSet <BaseType> fto)
{
finite_total_order = fto;
index_successors_size = finite_total_order.Count() + 1;
data_successors_size = finite_total_order.Count() + 1;
index_successors = new int[index_successors_size];
data_successors = new int[data_successors_size];
index_predecessors_size = finite_total_order.Count() + 1;
data_predecessors_size = finite_total_order.Count() + 1;
index_predecessors = new int[index_predecessors_size];
data_predecessors = new int[data_predecessors_size];
}
public CompressedAdjacencyList()
{
finite_total_order = new FiniteTotalOrderSet <BaseType>();
index_successors_size = 10;
data_successors_size = 10;
index_predecessors_size = 10;
data_predecessors_size = 10;
index_successors = new int[index_successors_size];
data_successors = new int[data_successors_size];
index_predecessors = new int[index_predecessors_size];
data_predecessors = new int[data_predecessors_size];
}
public void SetNameSpace(FiniteTotalOrderSet <BaseType> o)
{
finite_total_order = o;
// Index is alway valid for node# and node# + 1.
index_successors_size = finite_total_order.Count() + 1;
data_successors_size = finite_total_order.Count() + 1;
// Initially, every index is zero, so there are no edges.
index_successors = new int[index_successors_size];
data_successors = new int[data_successors_size];
index_predecessors_size = finite_total_order.Count() + 1;
data_predecessors_size = finite_total_order.Count() + 1;
index_predecessors = new int[index_predecessors_size];
data_predecessors = new int[data_predecessors_size];
}
