A graph is a collection of vertices (or nodes) and edges that connect pairs of vertices.
A graph is a function from nodes to paths.
A graph is a connection of paths only.
A graph is a visual representation of numbers.
Vertices, also called nodes, are points in a graph where edges meet.
Vertices are the edges connecting nodes.
Vertices are the weights of the edges.
Vertices are the directed paths in a graph.
Edges are the connections between pairs of vertices in a graph.
Edges are the points where vertices meet.
Edges are the weights assigned to paths.
Edges are the cycles in a graph.
A directed graph is a graph in which the edges have a direction, indicated by an arrow.
A directed graph is a graph with no edges.
A directed graph is a simple path with cycles.
A directed graph is a graph only containing loops.
An undirected graph is a graph especially for weighted graphs.
An undirected graph is a graph in which the edges have no direction.
An undirected graph is just a single vertex.
An undirected graph is a graph with self-loops only.
A weighted graph is a graph in which each edge is assigned a weight or cost.
A weighted graph is a graph where each vertex has a weight.
A weighted graph is a graph with directed paths.
A weighted graph assigns weights to each node.
A simple graph is a graph without loops and multiple edges between any two vertices.
A simple graph is just a single cycle.
A simple graph is a graph with at least one loop.
A simple graph contains only one vertex and no edges.
A complete graph is a graph in which every pair of vertices is connected by an edge.
A complete graph has no edges.
A complete graph only consists of trees.
A complete graph is one that is fully colored.
A path is a sequence of edges that connect a sequence of distinct vertices.
A path is a cycle in a weighted graph.
A path is a sequence of identical vertices.
A path is a single vertex without edges.
A cycle is a path that starts and ends at the same vertex, with all other vertices distinct.
A cycle is a graph with no edges.
A cycle is any two nodes with the same edges.
A cycle is a graph that only contains loops.
A connected graph contains isolated vertices.
A connected graph is a graph with no vertices.
A connected graph is a graph in which there is a path between every pair of vertices.
A connected graph is always a weighted graph.
A subgraph is a graph formed by copying the entire graph.
A subgraph is a cycle within a graph.
A subgraph is a graph formed from a subset of the vertices and edges of another graph.
A subgraph is a single vertex with no edges.
The degree of a vertex is the number of edges incident to it.
The degree of a vertex is the number of vertices in the graph.
The degree of a vertex is the total number of paths connected to it.
The degree of a vertex is the total weight of a graph.
A bipartite graph is a graph with weighted edges only.
A bipartite graph is a graph with all directed cycles.
A bipartite graph is a graph whose vertices can be divided into two disjoint sets such that no two vertices within the same set are adjacent.
A bipartite graph is a graph consisting of only two edges.
A tree is a graph that contains exactly three vertices.
A tree is a graph with self-loops.
A tree is a connected graph with no cycles.
A tree is a single vertex without edges.