Package dsa.lab10.solutions

Class DirectedGraph<Vertex,Weight>

java.lang.Object

dsa.lab10.solutions.DirectedGraph<Vertex,Weight>

Type Parameters:

Vertex - the vertex type

Weight - the weight type (on the edges)

All Implemented Interfaces:

Container<Vertex>, Iterable<Vertex>

public class DirectedGraph<Vertex,Weight>
extends Object
implements Container<Vertex>

A directed graph implemented using adjacency lists.

Constructor Summary

Constructors

Constructor	Description
DirectedGraph()	Construct an empty directed graph.
DirectedGraph(Iterable<Vertex> vertices, Iterable<Edge<Vertex,Weight>> edges)	Construct a directed graph containing the given vertices and edges.

Method Summary

Modifier and Type	Method	Description
Iterable<Edge<Vertex,Weight>>	adjacencyList(Vertex source)
boolean	contains(Edge<Vertex,Weight> edge)
boolean	contains(Vertex vertex)	Check if the given item is equal to any of those contained.
int	degree(Vertex vertex)
Edge<Vertex,Weight>	edge(Vertex source, Vertex target)
Iterable<Edge<Vertex,Weight>>	edges()
Iterable<Vertex>	items()	Get an iterable that yields each item once.
Iterable<Vertex>	neighbours(Vertex source)
int	size()	Get the number of contained items.

Methods inherited from class java.lang.Object

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

Methods inherited from interface dsa.lab02.base.Container

isEmpty, iterator

Methods inherited from interface java.lang.Iterable

forEach, spliterator

Constructor Details

DirectedGraph

public DirectedGraph()

Construct an empty directed graph.

DirectedGraph

public DirectedGraph(Iterable<Vertex> vertices,
 Iterable<Edge<Vertex,Weight>> edges)
              throws IllegalArgumentException

Construct a directed graph containing the given vertices and edges.

Parameters:

vertices - the vertices

edges - the edges

Throws:

IllegalArgumentException - if a source/target vertex of an edge isn't in vertices, or if multiple edges are between the same pair of source and target vertices

Method Details

size

public int size()

Description copied from interface: Container

Get the number of contained items.

Specified by:

size in interface Container<Vertex>

Returns:

the size

contains

public boolean contains(Vertex vertex)

Description copied from interface: Container

Check if the given item is equal to any of those contained.

Specified by:

contains in interface Container<Vertex>

Parameters:

vertex - the item to check for membership

Returns:

whether such an item is contained

contains

public boolean contains(Edge<Vertex,Weight> edge)

degree

public int degree(Vertex vertex)
           throws NoSuchElementException

Throws:

NoSuchElementException

edge

public Edge<Vertex,Weight> edge(Vertex source,
 Vertex target)

items

public Iterable<Vertex> items()

Description copied from interface: Container

Get an iterable that yields each item once.

Specified by:

items in interface Container<Vertex>

Returns:

an iterable over the items

edges

public Iterable<Edge<Vertex,Weight>> edges()

adjacencyList

public Iterable<Edge<Vertex,Weight>> adjacencyList(Vertex source)
                                            throws NoSuchElementException

Throws:

NoSuchElementException

neighbours

public Iterable<Vertex> neighbours(Vertex source)
                            throws NoSuchElementException

Throws:

NoSuchElementException