Semantic Graph, Gql, Graph Theory, Knowledge, Ontology.
any two vertices. A tree is a connected simple graph without cycles. A cycle is a sequence of distinctive adjacent vertices that begins and ends at the same vertex. A rooted tree is a tree with one vertex designated as a root . A forest is a graph without cycles. In other words, a forest is a set