Performance Optimization

• Example: storing neighbors

Moore

Von Neumann

Vector

Graph

• neighbors = new Cell[8];

• For dx = -1 to 1

  • For dy = -1 to 1

    • …
  • End For

• End For

• neighbors = new Cell[4];

• neighbors[0] = getCellAt(x + 1, y);

• neighbors[1] = getCellAt(x - 1, y);

• neighbors[2] = getCellAt(x, y + 1);

• neighbors[3] = getCellAt(x, y - 1);

• Edges = getEdges();

• For Each edge in edges

  • edge.getVertice()

• End For

• neighbors = new Cell[2];

• neighbors[0] = getCellAt(x + 1);

• neighbors[1] = getCellAt(x - 1);

Previous slide

Next slide

Back to first slide

View graphic version