Graph

All Known Implementing Classes:: AbstractGraph, AdjacencyListGraph, AdjacencyMatrixGraph

public interface Graph

An undirected graph.

Method Summary

Modifier and Type

Method

Description

Iterable<Vertex>

adjacentVertices(Vertex v)

boolean

areAdjacent(Vertex v, Vertex w)

Vertex

aVertex()

int

degree(Vertex v)

Iterable<Edge>

edges()

Vertex[]

endVertices(Edge e)

Iterable<Edge>

incidentEdges(Vertex v)

Edge

insertEdge(Vertex v, Vertex w, Object obj)

Vertex

insertVertex(Object obj)

int

numEdges()

int

numVertices()

Vertex

opposite(Vertex v, Edge e)

void

removeEdge(Edge e)

void

removeVertex(Vertex v)

Iterable<Vertex>

vertices()

Method Details
- numVertices
  
  int numVertices()
- numEdges
  
  int numEdges()
- vertices
  
  Iterable<Vertex> vertices()
- edges
  
  Iterable<Edge> edges()
- aVertex
  
  Vertex aVertex()
- degree
  
  int degree(Vertex v)
- adjacentVertices
  
  Iterable<Vertex> adjacentVertices(Vertex v)
- incidentEdges
  
  Iterable<Edge> incidentEdges(Vertex v)
- endVertices
  
  Vertex[] endVertices(Edge e)
- opposite
  
  Vertex opposite(Vertex v, Edge e)
- areAdjacent
  
  boolean areAdjacent(Vertex v, Vertex w)
- insertEdge
  
  Edge insertEdge(Vertex v, Vertex w, Object obj)
- insertVertex
  
  Vertex insertVertex(Object obj)
- removeVertex
  
  void removeVertex(Vertex v)
- removeEdge
  
  void removeEdge(Edge e)