Skip navigation links
A B C D E F G H I M N O P R S T U V W X 

A

AbstractAdjacencyGraph<V> - Class in org.jgraphl.graph
 
AbstractAdjacencyGraph() - Constructor for class org.jgraphl.graph.AbstractAdjacencyGraph
 
addEdge(V, V) - Method in class org.jgraphl.graph.MutableDirectedAdjacencyGraph
 
addEdge(V, V) - Method in class org.jgraphl.graph.MutableUndirectedAdjacencyGraph
 
addEdge(V, V) - Method in interface org.jgraphl.MutableGraph
Inserts the edge (u,v) into the graph, and returns an edge descriptor pointing to the new edge.
addEdge(Edge<V>) - Method in interface org.jgraphl.MutableGraph
Insert edge e into the graph.
addVertex(V) - Method in class org.jgraphl.graph.MutableDirectedAdjacencyGraph
 
addVertex(V) - Method in class org.jgraphl.graph.MutableUndirectedAdjacencyGraph
 
addVertex(V) - Method in interface org.jgraphl.MutableGraph
 
AdjacencyGraph<V> - Interface in org.jgraphl
The AdjacencyGraph provides interface for efficient access of the adjacent vertices to a vertex in a graph.
adjacentVertices(V) - Method in interface org.jgraphl.AdjacencyGraph
 
adjacentVertices(V) - Method in class org.jgraphl.graph.AbstractAdjacencyGraph
 
adjacentVertices(V) - Method in class org.jgraphl.graph.ImplicitGraph
 
append(char) - Method in class org.jgraphl.xml.IndentedWriter
Append a character.
append(String) - Method in class org.jgraphl.xml.IndentedWriter
Append a string.
asDirectedAdjacencyGraph(V...) - Static method in class org.jgraphl.graph.Graphs
 
asUndirectedAdjacencyGraph(T...) - Static method in class org.jgraphl.graph.Graphs
 

B

BfsIterator<V> - Class in org.jgraphl.graph.traversal
http://www.boost.org/libs/graph/doc/breadth_first_search.html
BfsIterator(Graph<V>, V) - Constructor for class org.jgraphl.graph.traversal.BfsIterator
 
BidirectionalGraph<V> - Interface in org.jgraphl
The BidirectionalGraph concept refines IncidenceGraph and adds the requirement for efficient access to the in-edges of each vertex.
build() - Method in class org.jgraphl.graph.ImplicitGraph.Builder
 
builder() - Static method in class org.jgraphl.graph.ImplicitGraph
 

C

close() - Method in class org.jgraphl.xml.IndentedWriter
Close the wrapped Writer.
complete(Collection<V>) - Static method in class org.jgraphl.graph.Graphs.Examples
 
contains(V) - Method in class org.jgraphl.graph.AbstractAdjacencyGraph
 
contains(V) - Method in interface org.jgraphl.Graph
 
containsEdge(V, V) - Method in class org.jgraphl.graph.AbstractAdjacencyGraph
 
containsEdge(Edge<V>) - Method in class org.jgraphl.graph.AbstractAdjacencyGraph
 
containsEdge(V, V) - Method in interface org.jgraphl.Graph
 
containsEdge(Edge<V>) - Method in interface org.jgraphl.Graph
 
containsEdge(V, V) - Method in class org.jgraphl.graph.UndirectedAdjacencyGraph
 
containsEdge(Edge<V>) - Method in class org.jgraphl.graph.UndirectedAdjacencyGraph
 
cr() - Method in class org.jgraphl.xml.IndentedWriter
Insert a newline followed by the current indentation (inserting one tab per indentation increment).
create(Graph<V>, Writer, boolean) - Method in interface org.jgraphl.export.ExportFormat.Factory
 
cycle(int) - Static method in class org.jgraphl.graph.Graphs.Examples
 

D

DefaultDirectedEdge<V> - Class in org.jgraphl.edge
 
DefaultDirectedEdge(V, V) - Constructor for class org.jgraphl.edge.DefaultDirectedEdge
 
DefaultUndirectedEdge<V> - Class in org.jgraphl.edge
 
DefaultUndirectedEdge(V, V) - Constructor for class org.jgraphl.edge.DefaultUndirectedEdge
 
degree(V) - Method in interface org.jgraphl.BidirectionalGraph
 
DfsIterator<V> - Class in org.jgraphl.graph.traversal
 
DfsIterator(Graph<V>, V) - Constructor for class org.jgraphl.graph.traversal.DfsIterator
 
directed(boolean) - Method in class org.jgraphl.graph.ImplicitGraph.Builder
 
DirectedAdjacencyGraph<V> - Class in org.jgraphl.graph
 
DirectedAdjacencyGraph(Map<V, Collection<V>>) - Constructor for class org.jgraphl.graph.DirectedAdjacencyGraph
 
DirectedEdge<V> - Interface in org.jgraphl.edge
 
DirectedGraph<V> - Interface in org.jgraphl
 
Dot<V> - Class in org.jgraphl.export.dot
DOT format (see http://www.graphviz.org/doc/info/lang.html).

E

Edge<V> - Interface in org.jgraphl.edge
 
edges() - Method in interface org.jgraphl.Graph
 
edgeStream() - Method in interface org.jgraphl.Graph
 
edgeSupplier() - Method in interface org.jgraphl.Graph
 
equals(Object) - Method in class org.jgraphl.edge.DefaultDirectedEdge
 
equals(Object) - Method in class org.jgraphl.edge.DefaultUndirectedEdge
 
equalsEdge(Object) - Method in interface org.jgraphl.edge.Edge
 
Examples() - Constructor for class org.jgraphl.graph.Graphs.Examples
 
export() - Method in class org.jgraphl.export.dot.Dot
 
export() - Method in class org.jgraphl.export.ExportFormat
 
export() - Method in class org.jgraphl.export.graphml.GraphML
 
ExportFormat<V> - Class in org.jgraphl.export
An XmlExportFormat describes how to export a Graph to a file in a specific XML based format.
ExportFormat.Factory<V> - Interface in org.jgraphl.export
 
ExportFormat.LabelProvider<V> - Interface in org.jgraphl.export
 

F

factory() - Static method in class org.jgraphl.export.dot.Dot
 
factory(ExportFormat.LabelProvider<V>) - Static method in class org.jgraphl.export.dot.Dot
 
factory() - Static method in class org.jgraphl.export.graphml.GraphML
 
forEachAdjacentEdge(V, Consumer<? super Edge<V>>) - Method in class org.jgraphl.graph.AbstractAdjacencyGraph
 
forEachAdjacentEdge(V, Consumer<? super Edge<V>>) - Method in interface org.jgraphl.IncidenceGraph
Iterator over out-edges incident to vertex u.
forEachAdjacentVertex(V, Consumer<? super V>) - Method in interface org.jgraphl.AdjacencyGraph
 
forEachAdjacentVertex(V, Consumer<? super V>) - Method in class org.jgraphl.graph.AbstractAdjacencyGraph
 
forEachEdge(BiConsumer<V, V>) - Method in interface org.jgraphl.Graph
 
forEachVertex(Consumer<? super V>) - Method in interface org.jgraphl.Graph
 

G

getEdge(V, V) - Method in interface org.jgraphl.Graph
 
getGraph() - Method in class org.jgraphl.graph.traversal.GraphVisitor
 
getLabel(V) - Method in interface org.jgraphl.export.ExportFormat.LabelProvider
 
getStartvertex() - Method in class org.jgraphl.graph.traversal.TraversalIterator
 
Graph<V> - Interface in org.jgraphl
 
GraphML<V> - Class in org.jgraphl.export.graphml
GraphML format (see http://graphml.graphdrawing.org/specification.html).
Graphs - Class in org.jgraphl.graph
 
Graphs.Examples - Class in org.jgraphl.graph
 
GraphVisitor<V> - Class in org.jgraphl.graph.traversal
 
GraphVisitor(Graph<V>) - Constructor for class org.jgraphl.graph.traversal.GraphVisitor
 

H

hash() - Method in interface org.jgraphl.edge.Edge
 
hashCode() - Method in class org.jgraphl.edge.DefaultDirectedEdge
 
hasNext() - Method in class org.jgraphl.graph.traversal.BfsIterator
 
hasNext() - Method in class org.jgraphl.graph.traversal.DfsIterator
 
hasNext() - Method in class org.jgraphl.graph.traversal.TraversalIterator
 

I

ImplicitGraph<V> - Class in org.jgraphl.graph
 
ImplicitGraph(Supplier<Stream<V>>, Function<V, Stream<V>>, boolean) - Constructor for class org.jgraphl.graph.ImplicitGraph
 
ImplicitGraph.Builder<W> - Class in org.jgraphl.graph
 
IncidenceGraph<V> - Interface in org.jgraphl
An IncidenceGraph provides efficient access to the out-edges of each vertex in the graph.
inDegree(V) - Method in interface org.jgraphl.BidirectionalGraph
 
indented(IndentedWriter.WriteAction) - Method in class org.jgraphl.xml.IndentedWriter
Indent while running the IndentedWriter.WriteAction.
IndentedWriter - Class in org.jgraphl.xml
Simple wrapper for Writer with indentation and hiding of IOException in append methods (to make the IndentedWriter easily usable from within lambdas).
IndentedWriter(Writer) - Constructor for class org.jgraphl.xml.IndentedWriter
Create an IndentedWriter by wrapping a Writer.
IndentedWriter.WriteAction - Interface in org.jgraphl.xml
Write action.
IndentedWriter.WriteException - Exception in org.jgraphl.xml
Wrapper for IOException because checked exceptions break lambdas.
inEdges(V) - Method in interface org.jgraphl.BidirectionalGraph
Returns a stream providing access to the in-edges (for directed graphs) or incident edges (for undirected graphs) of vertex u in graph g.
isDirected() - Method in interface org.jgraphl.DirectedGraph
 
isDirected() - Method in interface org.jgraphl.edge.Edge
 
isDirected() - Method in interface org.jgraphl.edge.UndirectedEdge
 
isDirected() - Method in class org.jgraphl.graph.ImplicitGraph
 
isDirected() - Method in interface org.jgraphl.Graph
 
isDirected() - Method in interface org.jgraphl.UndirectedGraph
 
isUndirected() - Method in interface org.jgraphl.edge.Edge
 
iterator() - Method in class org.jgraphl.graph.AbstractAdjacencyGraph
 
iterator() - Method in class org.jgraphl.graph.ImplicitGraph
 

M

MutableDirectedAdjacencyGraph<V> - Class in org.jgraphl.graph
 
MutableDirectedAdjacencyGraph(Map<V, Collection<V>>, Supplier<Collection<V>>) - Constructor for class org.jgraphl.graph.MutableDirectedAdjacencyGraph
 
MutableDirectedAdjacencyGraph(Map<V, Collection<V>>) - Constructor for class org.jgraphl.graph.MutableDirectedAdjacencyGraph
 
MutableDirectedAdjacencyGraph() - Constructor for class org.jgraphl.graph.MutableDirectedAdjacencyGraph
 
MutableGraph<V> - Interface in org.jgraphl
A MutableGraph can be changed via the addition or removal of edges and vertices.
MutableUndirectedAdjacencyGraph<V> - Class in org.jgraphl.graph
 
MutableUndirectedAdjacencyGraph(Map<V, Collection<V>>, Supplier<Collection<V>>) - Constructor for class org.jgraphl.graph.MutableUndirectedAdjacencyGraph
 
MutableUndirectedAdjacencyGraph(Map<V, Collection<V>>) - Constructor for class org.jgraphl.graph.MutableUndirectedAdjacencyGraph
 
MutableUndirectedAdjacencyGraph() - Constructor for class org.jgraphl.graph.MutableUndirectedAdjacencyGraph
 

N

neighborIterator(Function<W, Stream<W>>) - Method in class org.jgraphl.graph.ImplicitGraph.Builder
 
newEdgeSupplier() - Method in class org.jgraphl.edge.DefaultDirectedEdge
 
newEdgeSupplier() - Method in class org.jgraphl.edge.DefaultUndirectedEdge
 
newEdgeSupplier() - Method in interface org.jgraphl.edge.Edge
 
next() - Method in class org.jgraphl.graph.traversal.TraversalIterator
 
noOfEdges() - Method in interface org.jgraphl.Graph
 
noOfVertices() - Method in class org.jgraphl.graph.AbstractAdjacencyGraph
 
noOfVertices() - Method in interface org.jgraphl.Graph
 

O

org.jgraphl - package org.jgraphl
 
org.jgraphl.edge - package org.jgraphl.edge
 
org.jgraphl.export - package org.jgraphl.export
 
org.jgraphl.export.dot - package org.jgraphl.export.dot
 
org.jgraphl.export.graphml - package org.jgraphl.export.graphml
 
org.jgraphl.graph - package org.jgraphl.graph
 
org.jgraphl.graph.traversal - package org.jgraphl.graph.traversal
 
org.jgraphl.xml - package org.jgraphl.xml
 
outDegree(V) - Method in interface org.jgraphl.IncidenceGraph
 
outEdges(V) - Method in interface org.jgraphl.DirectedGraph
 
outEdges(V) - Method in class org.jgraphl.graph.AbstractAdjacencyGraph
 
outEdges(V) - Method in interface org.jgraphl.IncidenceGraph
Returns an stream providing access to the out-edges (for directed graphs) or incident edges (for undirected graphs) of vertex u in this graph.

P

partite(int, int) - Static method in class org.jgraphl.graph.Graphs.Examples
 

R

removeEdge(V, V) - Method in class org.jgraphl.graph.MutableDirectedAdjacencyGraph
 
removeEdge(V, V) - Method in class org.jgraphl.graph.MutableUndirectedAdjacencyGraph
 
removeEdge(V, V) - Method in interface org.jgraphl.MutableGraph
Remove the edge(u,v) from the graph.
removeEdge(Edge<V>) - Method in interface org.jgraphl.MutableGraph
Remove the edge e from the graph.
removeVertex(V) - Method in class org.jgraphl.graph.MutableDirectedAdjacencyGraph
 
removeVertex(V) - Method in class org.jgraphl.graph.MutableUndirectedAdjacencyGraph
 
removeVertex(V) - Method in interface org.jgraphl.MutableGraph
Remove u from the vertex set of the graph.
reverse() - Method in interface org.jgraphl.edge.DirectedEdge
 

S

setBackEdgeListener(BiConsumer<V, V>) - Method in class org.jgraphl.graph.traversal.GraphVisitor
 
setExamineEdgeListener(BiConsumer<V, V>) - Method in class org.jgraphl.graph.traversal.GraphVisitor
 
setExamineVertexListener(Consumer<V>) - Method in class org.jgraphl.graph.traversal.GraphVisitor
 
setForwardEdgeListener(BiConsumer<V, V>) - Method in class org.jgraphl.graph.traversal.GraphVisitor
 
setLabelProvider(ExportFormat.LabelProvider<V>) - Method in class org.jgraphl.export.ExportFormat
 
setTreeEdgeListener(BiConsumer<V, V>) - Method in class org.jgraphl.graph.traversal.GraphVisitor
 
sortedEdgeStreamToString() - Method in interface org.jgraphl.Graph
 
source() - Method in class org.jgraphl.edge.DefaultDirectedEdge
 
source() - Method in interface org.jgraphl.edge.Edge
 
str() - Method in interface org.jgraphl.edge.Edge
 
str() - Method in interface org.jgraphl.Graph
 
stream() - Method in class org.jgraphl.graph.ImplicitGraph
 
stream() - Method in interface org.jgraphl.Graph
 
stream() - Method in class org.jgraphl.graph.traversal.GraphVisitor
 

T

target() - Method in class org.jgraphl.edge.DefaultDirectedEdge
 
target() - Method in interface org.jgraphl.edge.Edge
 
toDirectedAdjacenyGraph(Graph<V>) - Static method in class org.jgraphl.graph.Graphs
 
toMutableDirectedAdjacencyGraph(Graph<V>) - Static method in class org.jgraphl.graph.Graphs
 
toMutableUndirectedAdjacencyGraph(Graph<V>) - Static method in class org.jgraphl.graph.Graphs
 
toString() - Method in class org.jgraphl.edge.DefaultDirectedEdge
 
toString() - Method in class org.jgraphl.graph.AbstractAdjacencyGraph
 
toString() - Method in class org.jgraphl.graph.ImplicitGraph
 
toStringDelimiter() - Method in interface org.jgraphl.edge.Edge
 
toStringDelimiter() - Method in interface org.jgraphl.edge.UndirectedEdge
 
toUndirected() - Method in class org.jgraphl.edge.DefaultDirectedEdge
 
toUndirected() - Method in interface org.jgraphl.edge.DirectedEdge
 
toUndirectedAdjacencyGraph(Graph<V>) - Static method in class org.jgraphl.graph.Graphs
 
TraversalIterator<V> - Class in org.jgraphl.graph.traversal
 
TraversalIterator(Graph<V>, V) - Constructor for class org.jgraphl.graph.traversal.TraversalIterator
 

U

UndirectedAdjacencyGraph<V> - Class in org.jgraphl.graph
 
UndirectedAdjacencyGraph(Map<V, Collection<V>>) - Constructor for class org.jgraphl.graph.UndirectedAdjacencyGraph
 
UndirectedEdge<V> - Interface in org.jgraphl.edge
 
UndirectedGraph<V> - Interface in org.jgraphl
 

V

vertexIterator(Supplier<Stream<W>>) - Method in class org.jgraphl.graph.ImplicitGraph.Builder
 
vertices() - Method in interface org.jgraphl.Graph
 

W

write() - Method in interface org.jgraphl.xml.IndentedWriter.WriteAction
 
writeElement(String, IndentedWriter.WriteAction) - Method in class org.jgraphl.xml.XmlWriter
 
writeElement(String, Map<String, String>) - Method in class org.jgraphl.xml.XmlWriter
 
writeElement(String, Map<String, String>, IndentedWriter.WriteAction) - Method in class org.jgraphl.xml.XmlWriter
 
WriteException(IOException) - Constructor for exception org.jgraphl.xml.IndentedWriter.WriteException
 
writeFile(String, Graph<V>, boolean, ExportFormat.Factory<V>) - Static method in class org.jgraphl.export.ExportFormat
Write given graph in given format into a file with the given name.
writeOn(Writer, Graph<V>, boolean, ExportFormat.Factory<V>) - Static method in class org.jgraphl.export.ExportFormat
Write given graph in the given format on given writer.

X

XmlWriter - Class in org.jgraphl.xml
Simple lightweight XML writer.
XmlWriter(Writer) - Constructor for class org.jgraphl.xml.XmlWriter
 
A B C D E F G H I M N O P R S T U V W X 
Skip navigation links

Copyright © 2014–2015. All rights reserved.