KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > edu > umd > cs > findbugs > graph > DFSEdgeTypes


1 /*
2  * Generic graph library
3  * Copyright (C) 2003,2004 University of Maryland
4  *
5  * This library is free software; you can redistribute it and/or
6  * modify it under the terms of the GNU Lesser General Public
7  * License as published by the Free Software Foundation; either
8  * version 2.1 of the License, or (at your option) any later version.
9  *
10  * This library is distributed in the hope that it will be useful,
11  * but WITHOUT ANY WARRANTY; without even the implied warranty of
12  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13  * Lesser General Public License for more details.
14  *
15  * You should have received a copy of the GNU Lesser General Public
16  * License along with this library; if not, write to the Free Software
17  * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
18  */
19
20 package edu.umd.cs.findbugs.graph;
21
22 /**
23  * Edge types in a depth first search.
24  *
25  * @see DepthFirstSearch
26  */
27 public interface DFSEdgeTypes {
28     /**
29      * Unknown DFS edge type. This is for internal use only.
30      */
31     public static final int UNKNOWN_EDGE = -1;
32
33     /**
34      * Tree edge. Basically, and edge that is part of a depth-first search tree.
35      */
36     public static final int TREE_EDGE = 0;
37
38     /**
39      * Back edge. An edge to an ancestor in the same depth-first search tree.
40      */
41     public static final int BACK_EDGE = 1;
42
43     /**
44      * Forward edge. An edge to a descendant in the same depth-first search tree.
45      */
46     public static final int FORWARD_EDGE = 2;
47
48     /**
49      * Cross edge. Edge between unrelated nodes in the same depth-first search tree,
50      * or an edge between nodes in different depth-first search trees.
51      */
52     public static final int CROSS_EDGE = 3;
53 }
54
55 // vim:ts=4
56
Popular Tags