javatools.datatypes

Class DirectedGraph<E extends Comparable<E>>

java.lang.Object

javatools.datatypes.DirectedGraph<E>

Direct Known Subclasses:

UndirectedGraph

public class DirectedGraph<E extends Comparable<E>>
extends Object

Copyright 2016 Fabian M. Suchanek Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in compliance with the License. You may obtain a copy of the License at http://www.apache.org/licenses/LICENSE-2.0 Unless required by applicable law or agreed to in writing, software distributed under the License is distributed on an "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the License for the specific language governing permissions and limitations under the License. This class implements a directed Graph.

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	DirectedGraph.Node<E extends Comparable<E>> Represents a node of in a graph

Field Summary

Fields

Modifier and Type	Field and Description
protected Map<E,DirectedGraph.Node<E>>	nodes Holds the nodes

Constructor Summary

Constructors

Constructor and Description
DirectedGraph() Constructor for subclasses

Method Summary

Modifier and Type	Method and Description
void	addLink(E parent, E child) Adds a link from a parent to a child
boolean	contains(E label) True if that node exists
static DirectedGraph<String>	create(File file, Pattern pattern) Constructs a directed graph from a File.
DirectedGraph.Node<E>	get(E label) Returns the node with the given label (or null)
DirectedGraph.Node<E>	getOrMake(E label) Returns or creates a node
Collection<E>	labels() Computes the set of labels
SortedSet<DirectedGraph.Node<E>>	leaves() Computes the nodes that have no leaves
void	makeClosure() Adds all transitive links
Collection<DirectedGraph.Node<E>>	nodes() Returns all nodes
int	numNodes() Returns the number of nodes
SortedSet<DirectedGraph.Node<E>>	roots() Computes the nodes that have no parents
String	toString()

Methods inherited from class java.lang.Object

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

Field Detail

nodes

protected Map<E extends Comparable<E>,DirectedGraph.Node<E extends Comparable<E>>> nodes

Holds the nodes

Constructor Detail

DirectedGraph

public DirectedGraph()

Constructor for subclasses

Method Detail

addLink

public void addLink(E parent,
                    E child)

Adds a link from a parent to a child

getOrMake

public DirectedGraph.Node<E> getOrMake(E label)

Returns or creates a node

create

public static DirectedGraph<String> create(File file,
                                           Pattern pattern)
                                    throws IOException

Constructs a directed graph from a File. Previously a constructor, but that caused compilation problems

Throws:

IOException

toString

public String toString()

Overrides:

toString in class Object

roots

public SortedSet<DirectedGraph.Node<E>> roots()

Computes the nodes that have no parents

leaves

public SortedSet<DirectedGraph.Node<E>> leaves()

Computes the nodes that have no leaves

nodes

public Collection<DirectedGraph.Node<E>> nodes()

Returns all nodes

numNodes

public int numNodes()

Returns the number of nodes

labels

public Collection<E> labels()

Computes the set of labels

get

public DirectedGraph.Node<E> get(E label)

Returns the node with the given label (or null)

contains

public boolean contains(E label)

True if that node exists

makeClosure

public void makeClosure()

Adds all transitive links