https://hal.archives-ouvertes.fr/hal-02398953
Raw File
Tip revision: c33910a29d53f4e137c225b21a8d59e43327cbf9 authored by Software Heritage on 08 December 2019, 12:26:32 UTC
hal: Deposit 351 in collection hal
Tip revision: c33910a
sgraph.h

#ifndef SGRAPH_H
#define SGRAPH_H
 
#include <iostream>
#include <vector>
#include <fstream>

using namespace std;

class sgraph
{

  friend ostream & operator<<(ostream & out, const sgraph &g);

 public:

  sgraph();
  sgraph(vector<vector<int> > list);

  vector<vector<int> > edges;

  vector<int> vertices;
  vector<int> generators;
  vector<int> spanningtree;

  vector<int> new_order;

  void initGraph(vector<int> pair);
  bool addEdge(vector<int> pair);
  bool extendpath(int goal, vector<int> &path);
  vector<int> findpath(int j, int k);
  
  //  vector<vector<int> > fundamental_group(int basept);
  void fundamental_group(int basept, vector<vector<int> > &gens, vector<vector<bool> > &orientation);

  void export_fg_with_relations(int basept, string tag, vector<vector<int> > rels, vector<vector<bool> > orients);

};

#endif
back to top