net.sf.tweety.commons.util

Class Digraph<T>

java.lang.Object

net.sf.tweety.commons.util.Digraph<T>

Type Parameters:

T - type of the nodes' labels

All Implemented Interfaces:

java.lang.Iterable<DigraphNode<T>>

Direct Known Subclasses:

DerivationGraph

public class Digraph<T>
extends java.lang.Object
implements java.lang.Iterable<DigraphNode<T>>

Author:

Nils Geilen An representation of directed, unweighted Graphs

Field Summary

Fields

Modifier and Type	Field and Description
private java.util.Collection<DigraphNode<T>>	nodes the grsph's nodes
private boolean	uniq if uniq is true there can only be one single node labelled with the same instance of T

Constructor Summary

Constructors

Constructor and Description
Digraph()
Digraph(boolean unique)

Method Summary

Modifier and Type	Method and Description
DigraphNode<T>	addNode(T val)
java.util.Collection<DigraphNode<T>>	getLeafs() leaves are nodes with an outdegree of 0
java.util.Collection<DigraphNode<T>>	getRoots() roots are nodes with an indegree of 0
java.util.Collection<T>	getValues()
java.util.Iterator<DigraphNode<T>>	iterator()
int	numberOfEdges()
int	numberOfNodes()
private void	printNode(java.io.PrintStream os, DigraphNode<T> node, int tab) prints a node
void	printTree(java.io.OutputStream os, DigraphNode<T> root) prints a tree
void	printTrees(java.io.OutputStream os) prints a tree for every root node in the graph

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Field Detail

nodes

private java.util.Collection<DigraphNode<T>> nodes

the grsph's nodes

uniq

private final boolean uniq

if uniq is true there can only be one single node labelled with the same instance of T

Constructor Detail

Digraph

public Digraph()

Digraph

public Digraph(boolean unique)

Method Detail

addNode

public DigraphNode<T> addNode(T val)

numberOfNodes

public int numberOfNodes()

Returns:

the number of nodes in this graph

numberOfEdges

public int numberOfEdges()

Returns:

the number of Edges in the graph

getLeafs

public java.util.Collection<DigraphNode<T>> getLeafs()

leaves are nodes with an outdegree of 0

Returns:

list of all leaves

getRoots

public java.util.Collection<DigraphNode<T>> getRoots()

roots are nodes with an indegree of 0

Returns:

list of all roots

getValues

public java.util.Collection<T> getValues()

Returns:

a list of all nodes' values

printTrees

public void printTrees(java.io.OutputStream os)

prints a tree for every root node in the graph

Parameters:

os -

printTree

public void printTree(java.io.OutputStream os,
                      DigraphNode<T> root)

prints a tree

Parameters:

os -

root - the root of the tree

printNode

private void printNode(java.io.PrintStream os,
                       DigraphNode<T> node,
                       int tab)

prints a node

Parameters:

os -

node - to be printed

tab - indention level

iterator

public java.util.Iterator<DigraphNode<T>> iterator()

Specified by:

iterator in interface java.lang.Iterable<DigraphNode<T>>