Graph Theory

Tree definition If you already know that a binary tree is not a general tree but a binary tree, binary trees are not a special case of secondary tree general tree, so pay close attention. I use tree definition in textbooks, but please remember that other definitions are also possible. The definition tree consists of a series of (possibly empty) nodes. If it is not empty, it consists of an individual node r called root and zero or more nonempty subtrees T1, T2, ..., Tk, and each route from r to T1, T2 is as follows . Beside, ..., Tk.Definition.

Recall from the basics of graph theory that graphs can have undirected or directed edges. Depending on whether the edge is displayed once or twice in the adjacency list representation of the breadth - first search graph so that the execution time of the undirected graph is slightly different from that of the directed graph, whether or not they are similar is different. In fact, we can apply DFS in exactly the same way we have worked so far. The only major difference is that considering the next "access" vertex during DFS execution is considered to double each side of the graph.

In graph theory, charts are irrelevant to charts plotting data (such as stock market progress). In graph theory, "graphic" is a collection of points that may or may not be connected to each other by lines. Regardless of the size of the point, the length of the line, the length of the straight line, it does not matter whether it is a curve or a wave shape. "Points" should not be round. Moebius's ring - Have you heard of one side or one side? Half a single sheet of paper, then attach both ends. It is called "Mobius Belt". Cool Facts: When an ant crawls along the length of the strip, it returns to the starting point and passes the full length of the strip (both sides of the base paper) without crossing the edge. It is a side and side boundary with a pleasant character for mathematicians (obviously). Found interesting in mathematics!

Understanding the basics of graph theory is important to solve the most complex and well-known computer science problem. But it is in vain to understand all these theories, if you can not apply it! Fortunately, there are a number of excellent resources to show you how to graphically represent graphics. If you want to know more, you'd better start here.

Through the series, we are slowly building on a knowledge base of different data structure. In addition to learning various graph scanning algorithms, I also learned about the fundamentals of graph theory and the practical aspects of representing graphs with code. We already know that charts have directionality, no directionality or even cycles. We also learned how to use breadth - first search and depth - first search to scan them in two different ways.