main.h

Go to the documentation of this file.

#pragma once

#include <vector>
#include <string>
#include <Graph.h>

using namespace std;

void justifyText(const string &text, int pageWidth, int indent);

vector<string> getValues(string option, vector<string> args);

string getFileExtension(string filename);

vector<string> replaceLongWithShortNames(vector<string> args);

vector<string> getUsedOptionsFromArg(const vector<string> &allArgs);

void printv(const char *fstr, ...);

void showHelp(void);

void checkNumberOfRequiredArguments(string option, vector<string> optionValues);

bool hasOnlyDigits(const string s);

vector<string> getAllArgs(int argc, char **argv);

int str2int(string number);

void call_getInDeg(const vector<string> &allArgs, Graph *currentGraph);

void call_getNumberOfNodes(const vector<string> &allArgs, Graph *currentGraph);

void call_getNumberOfEdges(const vector<string> &allArgs, Graph *currentGraph);

void call_hasCycle(const vector<string> &allArgs, Graph *currentGraph);

void call_isComplete(const vector<string> &allArgs, Graph *currentGraph);

void call_isForest(const vector<string> &allArgs, Graph *currentGraph);

void call_isDirected(const vector<string> &allArgs, Graph *currentGraph);

void call_isFreeOfLoops(const vector<string> &allArgs, Graph *currentGraph);

void call_isMultigraph(const vector<string> &allArgs, Graph *currentGraph);

void call_isRegular(const vector<string> &allArgs, Graph *currentGraph);

void call_isSimple(const vector<string> &allArgs, Graph *currentGraph);

void call_getOutDeg(const vector<string> &allArgs, Graph *currentGraph);

void call_areNeighbours(const vector<string> &allArgs, Graph *currentGraph) ;

void call_hasConnectivity(const vector<string> &allArgs, Graph *currentGraph) ;

void call_hasEdge(const vector<string> &allArgs, Graph *currentGraph) ;

void call_hasPath(const vector<string> &allArgs, Graph *currentGraph) ;