Most recent pastes (filtered)

#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

class graph {
public:
  graph(int count)
    : _paths(0)
    , _accessibility(count)
  {
    for (int i = 0; i < count; i++) {
      _accessibility.push_back(vector<bool>(count));
      _accessibility[i].resize(count);
      fill(_accessibility[i].begin(), _accessibility[i].end(), false);
    }

    _used.resize(count);
    fill(_used.begin(), _used.end(), false);

#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

class graph {
public:
  graph(int count)
    : _paths(0)
    , _accessibility(count)
  {
    for (int i = 0; i < count; i++) {
      _accessibility.push_back(vector<bool>(count));
      _accessibility[i].resize(count);
      fill(_accessibility[i].begin(), _accessibility[i].end(), false);
    }

    _used.resize(count);
    fill(_used.begin(), _used.end(), false);