| Package | Description |
|---|---|
| net.sf.tweety.commons.util |
| Modifier and Type | Method and Description |
|---|---|
DigraphNode<T> |
Digraph.addNode(T val) |
DigraphNode<T> |
DigraphNode.getParent()
a parent is a node n, that has an edge leading from n to this node
|
| Modifier and Type | Method and Description |
|---|---|
Collection<DigraphNode<T>> |
DigraphNode.getChildren()
a child is a node n, that has an edge leading from this node to n
|
Collection<DigraphNode<T>> |
Digraph.getLeafs()
leaves are nodes with an outdegree of 0
|
Collection<DigraphNode<T>> |
DigraphNode.getParents()
a parent is a node n, that has an edge leading from n to this node
|
Collection<DigraphNode<T>> |
Digraph.getRoots()
roots are nodes with an indegree of 0
|
Iterator<DigraphNode<T>> |
Digraph.iterator() |
| Modifier and Type | Method and Description |
|---|---|
void |
DigraphNode.addEdge(DigraphNode<T> to)
adds an edge from this node to another node
|
void |
Digraph.printTree(OutputStream os,
DigraphNode<T> root)
prints a tree
|
Copyright © 2018. All rights reserved.