A B D E G H O P R S T V W

A

addEdge(int, int) - Method in class smile.graph.AdjacencyList

addEdge(int, int, double) - Method in class smile.graph.AdjacencyList

addEdge(int, int) - Method in class smile.graph.AdjacencyMatrix

addEdge(int, int, double) - Method in class smile.graph.AdjacencyMatrix

addEdge(int, int) - Method in interface smile.graph.Graph

Creates a new edge in this graph, going from the source vertex to the target vertex, and returns the created edge.

addEdge(int, int, double) - Method in interface smile.graph.Graph

Creates a new edge in this graph, going from the source vertex to the target vertex, and returns the created edge.

AdjacencyList - Class in smile.graph

An adjacency list representation of a graph.

AdjacencyList(int) - Constructor for class smile.graph.AdjacencyList

Constructor.

AdjacencyList(int, boolean) - Constructor for class smile.graph.AdjacencyList

Constructor.

AdjacencyMatrix - Class in smile.graph

An adjacency matrix representation of a graph.

AdjacencyMatrix(int) - Constructor for class smile.graph.AdjacencyMatrix

Constructor.

AdjacencyMatrix(int, boolean) - Constructor for class smile.graph.AdjacencyMatrix

Constructor.

B

bfs() - Method in class smile.graph.AdjacencyList

bfs(Visitor) - Method in class smile.graph.AdjacencyList

bfs() - Method in class smile.graph.AdjacencyMatrix

bfs(Visitor) - Method in class smile.graph.AdjacencyMatrix

bfs() - Method in interface smile.graph.Graph

Breadth-first search connected components of graph.

bfs(Visitor) - Method in interface smile.graph.Graph

BFS search on graph and performs some operation defined in visitor on each vertex during traveling.

D

dfs() - Method in class smile.graph.AdjacencyList

dfs(Visitor) - Method in class smile.graph.AdjacencyList

dfs() - Method in class smile.graph.AdjacencyMatrix

dfs(Visitor) - Method in class smile.graph.AdjacencyMatrix

dfs() - Method in interface smile.graph.Graph

Depth-first search connected components of graph.

dfs(Visitor) - Method in interface smile.graph.Graph

DFS search on graph and performs some operation defined in visitor on each vertex during traveling.

dijkstra(int) - Method in class smile.graph.AdjacencyList

dijkstra(int) - Method in class smile.graph.AdjacencyMatrix

dijkstra(int, boolean) - Method in class smile.graph.AdjacencyMatrix

Calculates the shortest path by Dijkstra algorithm.

dijkstra(int) - Method in interface smile.graph.Graph

Calculate the shortest path from a source to all other vertices in the graph by Dijkstra algorithm.

dijkstra() - Method in interface smile.graph.Graph

Calculates the all pair shortest path by Dijkstra algorithm.

E

Edge(int, int, double) - Constructor for class smile.graph.Graph.Edge

Constructor.

G

getDegree(int) - Method in class smile.graph.AdjacencyList

getDegree(int) - Method in class smile.graph.AdjacencyMatrix

getDegree(int) - Method in interface smile.graph.Graph

Returns the degree of the specified vertex.

getEdge(int, int) - Method in class smile.graph.AdjacencyList

getEdge(int, int) - Method in class smile.graph.AdjacencyMatrix

getEdge(int, int) - Method in interface smile.graph.Graph

Returns an edge connecting source vertex to target vertex if such edge exist in this graph.

getEdges() - Method in class smile.graph.AdjacencyList

getEdges(int) - Method in class smile.graph.AdjacencyList

getEdges(int, int) - Method in class smile.graph.AdjacencyList

getEdges() - Method in class smile.graph.AdjacencyMatrix

getEdges(int) - Method in class smile.graph.AdjacencyMatrix

getEdges(int, int) - Method in class smile.graph.AdjacencyMatrix

getEdges() - Method in interface smile.graph.Graph

Returns a set of the edges contained in this graph.

getEdges(int) - Method in interface smile.graph.Graph

Returns a set of all edges from the specified vertex.

getEdges(int, int) - Method in interface smile.graph.Graph

Returns a set of all edges connecting source vertex to target vertex if such vertices exist in this graph.

getIndegree(int) - Method in class smile.graph.AdjacencyList

getIndegree(int) - Method in class smile.graph.AdjacencyMatrix

getIndegree(int) - Method in interface smile.graph.Graph

Returns the in-degree of the specified vertex.

getNumVertices() - Method in class smile.graph.AdjacencyList

getNumVertices() - Method in class smile.graph.AdjacencyMatrix

getNumVertices() - Method in interface smile.graph.Graph

Returns the number vertices.

getOutdegree(int) - Method in class smile.graph.AdjacencyList

getOutdegree(int) - Method in class smile.graph.AdjacencyMatrix

getOutdegree(int) - Method in interface smile.graph.Graph

Returns the out-degree of the specified vertex.

getWeight(int, int) - Method in class smile.graph.AdjacencyList

getWeight(int, int) - Method in class smile.graph.AdjacencyMatrix

getWeight(int, int) - Method in interface smile.graph.Graph

Returns the weight assigned to a given edge.

Graph - Interface in smile.graph

A graph is an abstract representation of a set of objects where some pairs of the objects are connected by links.

Graph.Edge - Class in smile.graph

Graph edge.

H

hasEdge(int, int) - Method in class smile.graph.AdjacencyList

hasEdge(int, int) - Method in class smile.graph.AdjacencyMatrix

hasEdge(int, int) - Method in interface smile.graph.Graph

Returns true if and only if this graph contains an edge going from the source vertex to the target vertex.

O

of(SparseMatrix) - Static method in class smile.graph.AdjacencyList

Converts the sparse matrix to a graph.

P

pushRelabel(double[][], int, int) - Method in class smile.graph.AdjacencyMatrix

Push-relabel algorithm for maximum flow

R

removeEdge(int, int) - Method in class smile.graph.AdjacencyList

removeEdge(Graph.Edge) - Method in class smile.graph.AdjacencyList

removeEdge(int, int) - Method in class smile.graph.AdjacencyMatrix

removeEdge(Graph.Edge) - Method in class smile.graph.AdjacencyMatrix

removeEdge(int, int) - Method in interface smile.graph.Graph

In a simple graph, removes and returns the edge going from the specified source vertex to the specified target vertex.

removeEdge(Graph.Edge) - Method in interface smile.graph.Graph

Removes the specified edge from the graph.* Returns true if the graph contained the specified edge.

removeEdges(Collection<Graph.Edge>) - Method in class smile.graph.AdjacencyList

removeEdges(Collection<Graph.Edge>) - Method in class smile.graph.AdjacencyMatrix

removeEdges(Collection<Graph.Edge>) - Method in interface smile.graph.Graph

Removes a set of edges from the graph.

S

setWeight(int, int, double) - Method in class smile.graph.AdjacencyList

setWeight(int, int, double) - Method in class smile.graph.AdjacencyMatrix

setWeight(int, int, double) - Method in interface smile.graph.Graph

Sets the weight assigned to a given edge.

smile.graph - package smile.graph

Graphs are mathematical structures used to model pairwise relations between objects from a certain collection.

sortbfs() - Method in class smile.graph.AdjacencyList

sortbfs() - Method in class smile.graph.AdjacencyMatrix

sortbfs() - Method in interface smile.graph.Graph

Topological sort digraph by breadth-first search of graph.

sortdfs() - Method in class smile.graph.AdjacencyList

sortdfs() - Method in class smile.graph.AdjacencyMatrix

sortdfs() - Method in interface smile.graph.Graph

Reverse topological sort digraph by depth-first search of graph.

subgraph(int[]) - Method in class smile.graph.AdjacencyList

subgraph(int[]) - Method in class smile.graph.AdjacencyMatrix

subgraph(int[]) - Method in interface smile.graph.Graph

Returns a subgraph containing all given vertices.

T

toArray() - Method in class smile.graph.AdjacencyMatrix

Returns the adjacency matrix.

toMatrix() - Method in class smile.graph.AdjacencyList

toMatrix() - Method in class smile.graph.AdjacencyMatrix

toMatrix() - Method in interface smile.graph.Graph

Returns the (dense or sparse) matrix representation of the graph.

V

v1 - Variable in class smile.graph.Graph.Edge

The id of one vertex connected by this edge.

v2 - Variable in class smile.graph.Graph.Edge

The id of the other vertex connected by this edge.

visit(int) - Method in interface smile.graph.Visitor

Performs some operations on the currently-visiting vertex during DFS or BFS.

Visitor - Interface in smile.graph

A visitor is encapsulation of some operation on graph vertices during traveling graph (DFS or BFS).

W

weight - Variable in class smile.graph.Graph.Edge

The weight of edge.

A B D E G H O P R S T V W