final String Definition$1="\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$A sequence of vertices that are connected by edges.";

final String Definition$2="\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$The points where edges meet in a graph,can represent a physical object, concept, or abstract entity.";

final String Definition$3="\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$can be assigned to an edge, representing the cost or distance between two vertices.";

final String Definition$4="\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$The connections between vertices are known as edges. They can be undirected $($bidirectional$)$ or directed $($unidirectional$)."$;

final String Definition$5="\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$Represents the number of edges connected to a Vertex";

final String Definition$6="\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$is a path that starts and ends at the same vertex.";

final String Definition$7="\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$means an Edge is connected to a Vertex";

final String Definition$8="\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$is a directed graph with no directed cycles $"$;

final String Definition$9="\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$is a graph with no Cycles";

final String Definition$10="\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_$This graph implementation has the worst performance when trying to insert a new vertex";