<commit_before>#ifndef GRAPH_HPP
#define GRAPH_HPP

/*
 * P4
 * Graph.hpp
 * Header file for Graph class
 *
 * Author: <NAME> cs100vaj
 * Author: <NAME> cs100vbc
 */

#include <string>
#include <vector>
#include "Edge.hpp"
#include "Vertex.hpp"

using namespace std;

class Graph
{
  private:
    vector<Vertex *> vList;		/* list of vertices */
    bool cycle;				/* cycle detection flag */

  public:
    /* Constructor */
    Graph()
    {
      cycle = false;
    }

    /* Destructor */
    ~Graph()
    {
      for (int i=0; i<vList.size(); i++)
        delete vList[i];

      vList.clear();
    }

    /* find min spanning tree */
    Graph* MST();

    /* Dijkstra's shortest path method */
    Graph* dijkstra();
    
    /* print list of vertices and connected edges */
    void displayGraph();		

    /* total cost of graph */
    int totalCost();

    /* clear visited flags for all vertices */
    void reset();


    void addVertex( Vertex * newV );
    Vertex* findVertex( string name );
};

#endif //GRAPH_HPP<commit_msg>snails<commit_after>#ifndef GRAPH_HPP
#define GRAPH_HPP

/*
 * P4
 * Graph.hpp
 * Header file for Graph class
 *
 * Author: <NAME> cs100vaj
 * Author: <NAME> cs100vbc
 */

#include <string>
#include <vector>
#include "Edge.hpp"
#include "Vertex.hpp"

using namespace std;

class Graph
{
  private:
    vector<Vertex *> vList;		/* list of vertices */
    bool cycle;				/* cycle detection flag */

  public:
    /* Constructor */
    Graph()
    {
      cycle = false;
    }

    /* Destructor */
    ~Graph()
    {
      vList.clear();
    }

    /* find min spanning tree */
    Graph* MST();

    /* Dijkstra's shortest path method */
    Graph* dijkstra();
    
    /* print list of vertices and connected edges */
    void displayGraph();		

    /* total cost of graph */
    int totalCost();

    /* clear visited flags for all vertices */
    void reset();


    void addVertex( Vertex * newV );
    Vertex* findVertex( string name );
};

#endif //GRAPH_HPP
{'fraction_non_alphanumeric': 0.134, 'fraction_numerical': 0.0075, 'mean_word_length': 2.301980198019802, 'pattern_counts': {'":': 0, '<': 14, '<?xml version=': 0, '>': 13, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
{'dir': 'git-commits-cleaned', 'id': '5121240', 'n_tokens_mistral': 693, 'n_tokens_neox': 641, 'n_words': 194}