mazematrixD2createmaze< T > Class Template Reference

Create maze given mazematrixD2 data structure. More...

#include <mazematrixD2createmaze.h>

Collaboration diagram for mazematrixD2createmaze< T >:

List of all members.

Public Member Functions
	mazematrixD2createmaze (mazematrixD2< T > &mz_)
	Constructor.
void	buildpropermaze ()
	Build the maze, the data structure holds the dimensions.
void	impropermaze01 (doublec deletewall)
	Given maze, visit each cell and randomly delete walls on delwall ratio.
Public Attributes
mazematrixD2< T > &	mz
	Maze data structure.
deque< point2< T > >	process
	Process queue where from and to links are added.

---

Detailed Description

template<typename T>
class mazematrixD2createmaze< T >

Create maze given mazematrixD2 data structure.

Definition at line 16 of file mazematrixD2createmaze.h.

---

Constructor & Destructor Documentation

template<typename T>

mazematrixD2createmaze< T >::mazematrixD2createmaze

(

mazematrixD2< T > &

mz_

)

[inline]

Constructor.

Definition at line 27 of file mazematrixD2createmaze.h.

    : mz(mz_) {}

---

Member Function Documentation

template<typename T >

void mazematrixD2createmaze< T >::buildpropermaze

(

)

[inline]

Build the maze, the data structure holds the dimensions.

Definition at line 44 of file mazematrixD2createmaze.h.

References mazematrixD2createmaze< T >::mz, mazematrixD2createmaze< T >::process, point2< T >::x, and point2< T >::y.

Referenced by mazegameD2state01::game01(), maze003::maze003(), and mazematrixD2test::unittest02().

{
  T m=mz.dim[0];
  T n=mz.dim[1];

  T i;
  T j;

  i=1+(rand()%(m*n));

  process.clear();
  vector< T > unvisited;

  mz.neighboursunvisited(unvisited,i);
  random_shuffle(unvisited.begin(),unvisited.end());
  assert(unvisited.size()!=0);
  process.push_back( point2<T>(i,unvisited[0]) );

  point2<T> current;

  bool res;
  for ( ; !process.empty(); )
  {
    current = process.front();
    process.pop_front();

    i = current.x;
    j = current.y;
//cout << "(" << i << "," << j << ")" << endl;

    if (mz.vi[j].unvisited())
    {
      mz.linkadjacent(res,i,j);
      assert(res);

      mz.neighboursunvisited(unvisited,j);
      random_shuffle(unvisited.begin(),unvisited.end());

/*
cout << j << ": ";
for (uint k=0; k<unvisited.size(); ++k)
  cout << unvisited[k] << " ";
cout << endl;
*/

      //random_shuffle(unvisited.begin(),unvisited.end());
      if (unvisited.size()!=0)
      {
        process.push_front( point2<T>(j,unvisited[0]) );
        for (uint k=1; k<unvisited.size(); ++k)
          process.push_back( point2<T>(j,unvisited[k]) );
      }
    }

/*
cout << "process: ";
typename deque< point2<T> >::iterator i2;
i2=process.begin();
for ( ; i2!=process.end(); ++i2)
  cout << *i2 << " ";
cout << endl;
*/

  }

}

template<typename T >

void mazematrixD2createmaze< T >::impropermaze01

(

doublec

deletewall

)

[inline]

Given maze, visit each cell and randomly delete walls on delwall ratio.

Definition at line 113 of file mazematrixD2createmaze.h.

References mazematrixD2createmaze< T >::mz, and r.

Referenced by mazegameD2state01::game01(), and maze003::maze003().

{
  assert(deletewall<1.0);
  assert(deletewall >= 0.0);

  T m=mz.dim[0];
  T n=mz.dim[1];
  T mn=m*n;

  vector<T> ki(mn);

  for (T i=0; i<mn; ++i)
    ki[i]=i+1;

  // Help randomize things a bit, may not matter.
  random_shuffle(ki.begin(),ki.end());

  T k2;
  bool res;
 
  random11<> r;

  for (T i=0; i<mn; ++i)
  {

    for (uint j=0; j<4; ++j)
    {
      if (mz.vi[ki[i]].ni[j]!=0)
        continue;

      mz.move(res,k2,j,ki[i]);
      if (res==false)
        continue;
      
      if (r()<deletewall)
      {
        mz.linkadjacent(res,k2,ki[i]);
        assert(res==true);
      }
    }
  }
}

---

Member Data Documentation

template<typename T>

mazematrixD2<T>& mazematrixD2createmaze< T >::mz

Maze data structure.

Definition at line 21 of file mazematrixD2createmaze.h.

Referenced by mazematrixD2createmaze< T >::buildpropermaze(), and mazematrixD2createmaze< T >::impropermaze01().

template<typename T>

deque< point2<T> > mazematrixD2createmaze< T >::process

Process queue where from and to links are added.

Definition at line 24 of file mazematrixD2createmaze.h.

Referenced by mazematrixD2createmaze< T >::buildpropermaze().

---

The documentation for this class was generated from the following file:

• maze/mazematrixD2createmaze.h