<commit_before>'''
@author: <NAME>
'''
from Edge import Edge
from Node import Node
import sys
from decimal import Decimal

class Graph(object):
    '''
    classdocs
    '''

    # Whether the graph is a directed graph or not
    DIRECTED = True

    def __init__(self):
        '''
        Constructor
        Initializes an empty graph with no neighbors
        '''
        # No nodes or edges at first

        self.node_list = []
        self.edge_list = []

    def get_nodes(self):
        '''
        Returns a list of all of the nodes in the graph
        
        @rtype: list - A standard Python list
        @return: A list of all nodes currently in the graph
        '''
        #return list(self.neighbor_nodes.keys())
        return self.node_list

    def get_edges(self):
        '''
        Returns a list of all the edges in the graph

        @rtype: list - A standard Python list
        @return: A list of all edges currently in the graph
        '''
        return self.edge_list


    def add_node(self, graph_node):
        '''
        Adds a new node to the graph without any connections to
        any other nodes in the graph

        @type graph_node: node - A single node to be added to the graph
        @param graph_node: A node to be added to the graph that isn't in it already

        @type node_data: Dictionary - A Python Dictionary containing the node's data
        @param node_data: Any relevant data about the node that it needs to store
        '''<commit_msg>Fixed a couple of comments.<commit_after>'''
@author: <NAME>
'''
from Edge import Edge
from Node import Node
import sys
from decimal import Decimal

class Graph(object):
    '''
    classdocs
    '''

    # Whether the graph is a directed graph or not
    DIRECTED = True

    def __init__(self):
        '''
        Constructor
        Initializes an empty graph with no neighbors
        '''
        # No nodes or edges at first

        self.node_list = []
        self.edge_list = []

    def get_nodes(self):
        '''
        Returns a list of all of the nodes in the graph
        
        @rtype: list - A standard Python list
        @return: A list of all nodes currently in the graph
        '''
        return self.node_list

    def get_edges(self):
        '''
        Returns a list of all the edges in the graph

        @rtype: list - A standard Python list
        @return: A list of all edges currently in the graph
        '''
        return self.edge_list


    def add_node(self, graph_node):
        '''
        Adds a new node to the graph without any connections to
        any other nodes in the graph

        @type graph_node: node - A single node to be added to the graph
        @param graph_node: A node to be added to the graph that isn't in it already

        @type node_data: Dictionary - A Python Dictionary containing the node's data
        @param node_data: Any relevant data about the node that it needs to store
        '''
{'fraction_non_alphanumeric': 0.06605999325918437, 'fraction_numerical': 0.0, 'mean_word_length': 2.0285714285714285, 'pattern_counts': {'":': 0, '<': 5, '<?xml version=': 0, '>': 5, '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': '3663613', 'n_tokens_mistral': 788, 'n_tokens_neox': 759, 'n_words': 366}