fi.uef.cs.tra

Class Graph

java.lang.Object

fi.uef.cs.tra.AbstractGraph

fi.uef.cs.tra.Graph

All Implemented Interfaces:

java.lang.Iterable

public class Graph
extends AbstractGraph
implements java.lang.Iterable

A Graph or an undirected graph is an ordered pair G := (V, E) with

• V, a set of vertices and
• E, a set of undirected edges.

Graph is simply a subclass of the abstract class AbstractGraph that sets it up in undirected mode.

Example:

     boolean isConnected(Graph graph) {

       colorAllVertices(graph, Graph.WHITE);
       dfsColor(graph.firstVertex, Graph.BLACK);

       for (Vertex vertex : graph.vertices())
         if (vertex.getColor() == Graph.WHITE) 
           return false;
       return true;
     }
 

See DiGraph documentation for dfsColor(...)

See Also:

Vertex, Edge, DiGraph, AbstractGraph

Nested Class Summary

Nested classes/interfaces inherited from class fi.uef.cs.tra.AbstractGraph

AbstractGraph.EdgeIteratorWrapper, AbstractGraph.VertexIteratorWrapper

Field Summary

Fields inherited from class fi.uef.cs.tra.AbstractGraph

BLACK, BLUE, GRAY, GREEN, GREY, NaN, RED, WHITE

Constructor Summary

Constructors

Constructor and Description
Graph()

Method Summary

Methods inherited from class fi.uef.cs.tra.AbstractGraph

addVertex, addVertex, addVertex, addVertex, addVertex, addVertex, addVertex, addVertex, addVertex, addVertex, addVertex, addVertex, edgeIterator, edges, firstVertex, isDiGraph, iterator, removeVertex, size, toString, vertexCount, vertexIterator, vertices

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface java.lang.Iterable

forEach, iterator, spliterator

Constructor Detail

Graph

public Graph()