01: /* Soot - a J*va Optimization Framework
02: * Copyright (C) 1999 Patrice Pominville, Raja Vallee-Rai
03: *
04: * This library is free software; you can redistribute it and/or
05: * modify it under the terms of the GNU Lesser General Public
06: * License as published by the Free Software Foundation; either
07: * version 2.1 of the License, or (at your option) any later version.
08: *
09: * 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: package soot.toolkits.graph;
27:
28: import java.util.*;
29:
30: /**
31: * Defines the notion of a directed graph.
32: * @param N node type
33: */
34: public interface DirectedGraph<N> extends Iterable<N> {
35: /**
36: * Returns a list of entry points for this graph.
37: */
38: public List<N> getHeads();
39:
40: /** Returns a list of exit points for this graph. */
41: public List<N> getTails();
42:
43: /**
44: * Returns a list of predecessors for the given node in the graph.
45: */
46: public List<N> getPredsOf(N s);
47:
48: /**
49: * Returns a list of successors for the given node in the graph.
50: */
51: public List<N> getSuccsOf(N s);
52:
53: /**
54: * Returns the node count for this graph.
55: */
56: public int size();
57:
58: /**
59: * Returns an iterator for the nodes in this graph. No specific ordering
60: * of the nodes is guaranteed.
61: */
62: public Iterator<N> iterator();
63: }
|