Shulou(Shulou.com)06/03 Report--

This article will explain in detail the storage of java programming undirected graph structure and the example analysis of DFS operation code. The editor thinks it is very practical, so I share it with you for reference. I hope you can get something after reading this article.

The concept of graph

The graph is the extension of the tree in the algorithm, the tree is a top-down data structure, and all nodes have a parent node (except the root node), which is arranged from top to bottom. While the graph does not have the concept of parent-child nodes, the nodes in the graph are all equal, and the result is more complex.

Undirected graph

Graph G = (V∈ E), where V denotes vertex Vertex,E denotes edge edge, and an edge is a fixed-point pair (uMagin v), where (umeno v) edge V.

In the past two days, I encountered an algorithm about graphs. I searched the Internet for a long time and did not find the java version of the storage and related operations of graphs in the data structure. So I found a java version of the data structure book to take a look, the following is based on the explanation in the book about the storage of undirected graphs and depth-first traversal of the graph. However, this traversal can only traverse connected graphs, and it needs to be modified in order to traverse unconnected graphs. It is hoped that sharing the code here will be helpful to those in need.

Package com.homework;/** * define stack class * / class StackX {private final int size = 20; private int [] st; private int top; / / initialize stack public StackX () {st = new int [size]; top =-1 } / / enter public void push (int j) {st[ + + top] = j;} / / exit stack public int pop () {return st [top--];} / / return the top stack element public int peak () {return st [top] } / / determine whether the stack is empty public Boolean isEmpty () {return (top==-1);}} / * define the node class in the graph * @ author Administrator * * / class Vertex {public char label; public Boolean wasVisited; public Vertex (char lab) {label = lab; wasVisited = false }} / * define graph class * @ author Administrator * * / class Graph {private final int num = 20; private Vertex vertexList []; / / Node array private int adjMat [] []; / / Node matrix private int nVerts; / / current number of nodes private StackX theStack / / define the structure of a stack / / initialize the graph public Graph () {vertexList = new Vertex [num]; adjMat = new int [num] [num]; nVerts = 0; for (int igraph 0; I)

Welcome to subscribe "Shulou Technology Information " to get latest news, interesting things and hot topics in the IT industry, and controls the hottest and latest Internet news, technology news and IT industry trends.