Package org.graph4j
package org.graph4j
The main interfaces and classes for representing and using graphs.
-
ClassDescriptionDigraph<V,
E> Represents a directed graph.Abstract class for algorithms that accept only directed graphs as input.DirectedMultigraph<V,E> Multiple (parallel) edges are allowed.DirectedPseudograph<V,E> Multiple (parallel) edges are allowed.Edge<E>An edge is a pair of vertices.EdgeIterator<E>An iterator over all the edges of a graph.Graph<V,E> The base data type for all graphs: directed or not, weighted or not, labeled or not, allowing self loops and multiple edges or not.Represents an algorithm that accepts any graph as input, directed or not.Support class for creating a graph of any type.Static utility methods that operate on or return graphs, either directed or undirected.Multigraph<V,E> Multiple (parallel) edges are allowed.Enables iteration over the edges incident with a source vertex, returning one by one the neighbors of the source along with information regarding the corresponding edge.Network<V,E> Represents a single commodity transportation (flow) network.Support class for creating transportation (flow) networks.Enables iteration over the edges incident to a target vertex, returning one by one the predecessors of the target along with information regarding the corresponding edge.Pseudograph<V,E> Self loops and multiple (parallel) edges are allowed.Abstract class for algorithms that accept only simple graphs as input.Enables iteration over the edges incident from a source vertex, returning one by one the successors of the source along with information regarding the corresponding edge.Abstract class for algorithms that accept only undirected graphs as input.An iterator over all the vertices of a graph.