SimpleOrientedGraph

```
public class SimpleOrientedGraph<T>
extends java.lang.Object
```
a class which represents a simple oriented graph, with no specified edge

Constructors
Constructor and Description
`SimpleOrientedGraph()`
`SimpleOrientedGraph(java.util.Map<T,java.util.List<T>> graph)`

All Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`void`	`addNode(T node, T neighbour)`
`boolean`	`containsACycle(T aNode, java.util.Set<T> visitedNodes)` detect a cycle in the graph
`java.util.Map<T,java.util.List<T>>`	`getGraph()`
`java.util.Set<T>`	`getNotOrientedNeighbours(T node)`
`java.util.Set<T>`	`getSourceNodes()`
`boolean`	`isAConnectedGraph()`
`boolean`	`isEmpty()`
`boolean`	`isValid()`

Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

public SimpleOrientedGraph(java.util.Map<T,java.util.List<T>> graph)

public java.util.Set<T> getNotOrientedNeighbours(T node)

public void addNode(T node,
                    T neighbour)

public java.util.Set<T> getSourceNodes()

public boolean containsACycle(T aNode,
                              java.util.Set<T> visitedNodes)

detect a cycle in the graph

public java.util.Map<T,java.util.List<T>> getGraph()

Class SimpleOrientedGraph<T>