/**
 *
 * This file is part of Tulip (http://tulip.labri.fr)
 *
 * Authors: David Auber and the Tulip development Team
 * from LaBRI, University of Bordeaux
 *
 * Tulip is free software; you can redistribute it and/or modify
 * it under the terms of the GNU Lesser General Public License
 * as published by the Free Software Foundation, either version 3
 * of the License, or (at your option) any later version.
 *
 * Tulip is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
 * See the GNU General Public License for more details.
 *
 */

#include <tulip/BiconnectedTest.h>
#include <tulip/GraphTest.h>
#include <tulip/Edge.h>

class BiconnectedTest : public tlp::GraphTest {
public:
  PLUGININFORMATION("Biconnected", "Tulip team", "18/04/2012",
                    "Tests whether a graph is biconnected or not.", "1.0", "Topological Test")
  BiconnectedTest(const tlp::PluginContext *context) : tlp::GraphTest(context) {}

  bool test() override {
    return tlp::BiconnectedTest::isBiconnected(graph);
  }
};
PLUGIN(BiconnectedTest)

class MakeBiconnected : public tlp::Algorithm {
public:
  PLUGININFORMATION("Make Biconnected", "Tulip team", "18/04/2012", "Makes a graph biconnected.",
                    "1.0", "Topology Update")
  MakeBiconnected(const tlp::PluginContext *context) : tlp::Algorithm(context) {}

  bool run() override {
    std::vector<tlp::edge> edges;
    tlp::BiconnectedTest::makeBiconnected(graph, edges);
    return true;
  }
};
PLUGIN(MakeBiconnected)
