Vertex.h

#pragma once
#include "GraphNode.h"
#include <list>
#include <algorithm>
#include <string>
#include <iostream>
using namespace std;

class Vertex
{
private:
	int vertexName;
	list<GraphNode>* l;
public:
	Vertex() : vertexName(-1), l(new list<GraphNode>{}) {};
	Vertex(int vertexName, list<GraphNode>* l);
	list<GraphNode>::iterator findEdge(int v) const;
	list<int> getAdjList() const;
	list<GraphNode> getAdjFullList() const;
	void removeEdge(int v);
	void addEdge(int v, int c);
	void addFlow(int v, int f);
	void printAdjList() const;
	int getVertexName() const;
	friend bool operator==(const Vertex& a, const Vertex& b);
	int getCapacity(int v) const;
	int getFlow(int v) const;
	Vertex& operator=(const Vertex& a);
	bool checkIfEdgeExists(int v) const;
};