FindSeparator.h

/*
 * FindSeparator.h
 *
 *   Created on: Nov 23, 2010
 *       Author: nikai
 *  Description: find the separator of bisectioning for a given graph
 */
 
#pragma once
 
#include <map>
#include <vector>
#include <gtsam/inference/Key.h>
#include <gtsam/inference/Symbol.h>
 
#include "PartitionWorkSpace.h"
 
namespace gtsam { namespace partition {
 
//  typedef std::map<size_t, size_t> PartitionTable; // from the key to the partition: 0 - separator, > 1: submap id

  struct MetisResult {
    std::vector<size_t> A, B;  // frontals
    std::vector<size_t> C;     // separator
  };

  template<class GenericGraph>
  std::optional<MetisResult> separatorPartitionByMetis(const GenericGraph& graph, const std::vector<size_t>& keys,
      WorkSpace& workspace, bool verbose);

  template<class GenericGraph>
  int findSeparator(const GenericGraph& graph, const std::vector<size_t>& keys,
      const int minNodesPerMap, WorkSpace& workspace, bool verbose, const std::optional<std::vector<Symbol> >& int2symbol,
      const bool reduceGraph, const int minNrConstraintsPerCamera, const int minNrConstraintsPerLandmark);
 
}} //namespace