<commit_before>/*
Write a program using C++ to find the minimal spanning tree of a graph. The graph is 
represented by an adjacency matrix.
*/

#include <string>
#include <iostream>
#include <fstream>
using namespace std;

int main(){
	fstream inFile;
	string filePath;
	int numVertices=0, startVertex=0;
//-	Prompt user for input filepath name.
	cout << "Where is the file located?" << endl;
	cin >> filePath;
	cin.get();
	inFile.open(filePath, ios::in);

	if(!inFile){
		cout << "Error! Missing File! Please enter a proper filepath.";
		return 0;
	}
	else{
		inFile >> numVertices;
		inFile >> startVertex;
		int adjMatrix[numVertices][numVertices]; //fix this later/ask linh about max bound for matrices
		inFile.get(); //grabs rest of the line.
		/*scores = new StudentTestScores[numStudents];
		for(int i = 0; i < numStudents; i++){
			inFile >> scores[i];
			inFile.get();
		}*/
	}
	cin.get();
	return 0;
}<commit_msg>Update MinSpanTree.cpp<commit_after>/*
Write a program using C++ to find the minimal spanning tree of a graph. The graph is 
represented by an adjacency matrix.
*/

#include <string>
#include <iostream>
#include <fstream>
using namespace std;

int main(){
	fstream inFile;
	string filePath;
	int adjMatrix[10][10]; //will not have matrix bigger than 10x10
	int numVertices=0, startVertex=0;
//-	Prompt user for input filepath name.
	cout << "Where is the file located?" << endl;
	cin >> filePath;
	cin.get();
	inFile.open(filePath, ios::in);

	if(!inFile){
		cout << "Error! Missing File! Please enter a proper filepath.";
		return 0;
	}
	else{
		inFile >> numVertices;
		inFile >> startVertex;
		inFile.get(); //grabs rest of the line.
		/*scores = new StudentTestScores[numStudents];
		for(int i = 0; i < numStudents; i++){
			inFile >> scores[i];
			inFile.get();
		}*/
	}
	cin.get();
	return 0;
}
{'fraction_non_alphanumeric': 0.13815789473684212, 'fraction_numerical': 0.009868421052631578, 'mean_word_length': 3.9191374663072778, 'pattern_counts': {'":': 0, '<': 23, '<?xml version=': 0, '>': 25, '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': '1636835', 'n_tokens_mistral': 683, 'n_tokens_neox': 625, 'n_words': 215}