KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > soot > toolkits > graph > DirectedGraph


1 /* Soot - a J*va Optimization Framework
2  * Copyright (C) 1999 Patrice Pominville, Raja Vallee-Rai
3  *
4  * This library is free software; you can redistribute it and/or
5  * modify it under the terms of the GNU Lesser General Public
6  * License as published by the Free Software Foundation; either
7  * version 2.1 of the License, or (at your option) any later version.
8  *
9  * This library is distributed in the hope that it will be useful,
10  * but WITHOUT ANY WARRANTY; without even the implied warranty of
11  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12  * Lesser General Public License for more details.
13  *
14  * You should have received a copy of the GNU Lesser General Public
15  * License along with this library; if not, write to the
16  * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
17  * Boston, MA 02111-1307, USA.
18  */
19
20 /*
21  * Modified by the Sable Research Group and others 1997-1999.
22  * See the 'credits' file distributed with Soot for the complete list of
23  * contributors. (Soot is distributed at http://www.sable.mcgill.ca/soot)
24  */
25
26
27 package soot.toolkits.graph;
28
29
30 import java.util.*;
31 import soot.*;
32
33
34 /**
35  * Defines the notion of a directed graph.
36  */
37 public interface DirectedGraph
38 {
39     /**
40      * Returns a list of entry points for this graph.
41      */
42     public List getHeads();
43
44     /** Returns a list of exit points for this graph. */
45     public List getTails();
46
47     /**
48      * Returns a list of predecessors for the given node in the graph.
49      */
50     public List getPredsOf(Object JavaDoc s);
51
52     /**
53      * Returns a list of successors for the given node in the graph.
54      */
55     public List getSuccsOf(Object JavaDoc s);
56
57     /**
58      * Returns the node count for this graph.
59      */
60     public int size();
61
62     /**
63      * Returns an iterator for the nodes in this graph. No specific ordering
64      * of the nodes is guaranteed.
65      */
66     public Iterator iterator();
67 }
68
69  
70
Popular Tags