Harsh-7300/dataset huggingface dataset:
Question: What is a simple graph?
Reference answer: A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.

Student answer: if a graph does not have any self loop or any parallel edges it is called a simple graph
Score: 2.0

Student answer: A simple graph is a graph which don't contains cycles and every vertex is connected by any other vertex. 
Score: 2.0

Student answer: A simple graph is a connection of edges and vertices.\nEach node in the graph is known as a Vertex and the line between any two vertex is known as edge.
Score: 2.0

Student answer: a simple graph is a graph in which there is no self loop and no cycle.
Score: 2.0

Student answer: a simple graph has no self loops and no parallel edges.
Score: 2.0

Student answer: a graph in which all the nodes are connected to each other directly on indirectly through a path and it has no cycles and no of the edges is 1 less than the vertices
Score: 2.0

Student answer: A simple graph is number of nodes of vertex connected to each other \ngraph is of 2 types \ndirected graph \nundirected graph 
Score: 2.0

Student answer: a simple graph is if a graph has  no self loop and no parallel edges 
Score: 2.0

Student answer: Biconnected graph is a graph in which two disjoint graphs are connected via  single edge
Score: 2.0

Student answer: Simple graph is  graph that is undirected and does not have any loops or multiple edges.
Score: 2.0

Student answer: A simple graph - nodes that are connected to other nodes with the help of edges. There need not be any fixed number of edges or nodes or any special pattern.
Score: 2.0

Student answer: A simple graph have some vertices/nodes and have edges which connects the vertices of the graph.
Score: 2.0

Student answer: It is a type of graph in which each vertices have a vertex connected to it with an edge.
Score: 2.0

Student answer: A simple graph is a set of edges and vertices,wherein two vertices are connected by an edge.
Score: 2.0

Student answer: In this every vertices has an edge connected to it and is a part of graph.
Score: 2.0

Student answer: We can use heaps to implement the priority queue. Such kind of heap will take O(log N) time to insert and delete each element in the priority queue. Based on heap structure, priority queue also has two types max- priority queue and min - priority queue which need to be used along with min-heap and max-heap.\n
Score: 2.0

Student answer: simple graph is a graph in which we have no directions or weight or anything just edges connected to one another , no disconnected edges.
Score: 2.0

Student answer: each vertex has an edge connected to it
Score: 0.0

Student answer: A biconnected graph is a graph in which 2 graphs are connected by 1 edge.
Score: 2.0

Student answer: in simple graph there are no disconnected edges. all the vertices of the graph are connected.
Score: 2.0

Student answer: Simple graph is a graph which contains  a link between each vertices i.e. path exists between each pair of vertices.
Score: 2.0
Question: What is a simple graph?
Reference answer: A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.

Student answer: a simple graph is a graph having atleast 1 link in each pair.,i.e. the graph is connected in atleast 1 way.
Score: 1.0

Student answer: graphs in which nodes are connected only once in only one direction
Score: 0.0

Student answer: A graph which is make up of array.
Score: 0.0

Student answer: The graph is represent the nodes with connectivity to each other and helping to finding the shortest path with minimum costing.
Score: 1.0

Student answer: a graph with no directional edges.
Score: 0.0

Student answer: A simple graph is like a tree , where each and every nodes are connected without following any conditions.
Score: 0.0

Student answer: simple graph is a graph with a set of vertices and edges
Score: 0.5

Student answer: Graph is representation of cost of visiting one from the other node it is a connection of nodes which represents various paths connecting multiple edges to each other via nodes.
Score: 1.0

Student answer: A simple graph is a graph in which there is a root node and every parent has 2 child nodes associated to it
Score: 0.0

Student answer: a simple graph is a type of data strucutre represented  in a graph form which consists of m  no. of trees
Score: 0.0

Student answer: A type of tree in which  nodes are conected to other nodes . 
Score: 0.0

Student answer: A simple graph is a collection of nodes that contain a particular data. In which every node is conncted to some or the other node.
Score: 0.0

Student answer: simple graph is a graph in which a node can have any no. of child nodes
Score: 0.0

Student answer: it is a graph without any loops and parallel edges
Score: 2.5

Student answer: A simple graph is a graph which is not bidirectional and just directed or even non directed.
Score: 0.0

Student answer: Graph that is bidirectional and has no weights attached to the edges is known as a simple graph.
Score: 0.0

Student answer: contains no loop
Score: 2.5

Student answer: A graph in which only a single edge at max can be connected between two nodes is a simple graph.
Score: 2.0

Student answer: a graph which is not weighted  and has edges and vertices 
Score: 0.0

Student answer:  unidirected, does not have any loops and multiple edges
Score: 2.5

Student answer: simple graph means the closed graph with each vertex having a single edge passing to the other vertex 
Score: 1.0

Student answer: A simple graph is such a graph in which a parent has its both child
Score: 0.0

Student answer: Simple graph is a type of graph in which edge between the 2 vertices is not associated with any weight.
Score: 0.0

Student answer: simple graph are the graph  which are represent in form vertices are connected by the edges.
Score: 0.0

Student answer: no loop present
Score: 2.5

Student answer: A simple graph is any data structure which is denoted in the form of tree rather is not in an up-to-down or one way flow. It has vertex and edges where vertex are the elements of the structure while edges are the connections between them.
Score: 0.0
Question: What is a simple graph?
Reference answer: A simple graph is a graph, which has not more than one edge between a pair of nodes than such a graph is called a simple graph.

Student answer: a graph having e edges and v vertices  is known as simple graph
Score: 0.0

Student answer: the garph have 'e' edges and 'v' vertex is call simple graph.
Score: 0.0

Student answer: a graph is and linear data structure which is used to represent the data and plot points 
Score: 0.0

Student answer: a simple graph or graph is a collection of elements which can be either arranged in a sorted , reversed sorted or distorted  manner.
Score: 0.0

Student answer: A simple graph has Vertices (V) and Edges (E).
Score: 0.0

Student answer: simple graph is a graph which does not have any directional edges.
Score: 0.0

Student answer: does not have bidiectional edges
Score: 0.0

Student answer: simple graph is a type of graph which is having no loop
Score: 2.5

Student answer: A simple graph is a graph in which all nodes are connected and the edges are bi-directional
Score: 0.0

Student answer: Simple Graph is a undirected graph .It does not have any direction .
Score: 0.0

Student answer: a simple graph is basically a directed graph that point one node to other in specific direction
Score: 0.0

Student answer: the graph which has elements connected to each other by direcctions also 
Score: 0.0

Student answer: graph in which there are\nNo loops\nNo cycles\n
Score: 2.5

Student answer: simple graph is having node and edge and connect the node 
Score: 1.0

Student answer:  A simple graph is -\n1) with all its nodes connected.\n2) with no pendant vertex or any abandoned vertex.\n3) with no looping.
Score: 2.5

Student answer: non deterministic problem that not determine problem in which there is no prior knowledge of any kind when executing a program or the output in unknown
Score: 0.0

Student answer: G(V,E).
Score: 0.0

Student answer: simple graph is set of vertices and edges which have no parallel edges and self loops 
Score: 2.5

Student answer: simple graph consist of a graph where there are equal number of vertices and edges.
Score: 0.0