Uses of Interface
org.episteme.core.mathematics.discrete.WeightedGraph

Packages that use WeightedGraph

Package	Description
org.episteme.core.mathematics.discrete
org.episteme.core.mathematics.discrete.graph.flow
org.episteme.core.mathematics.ml
org.episteme.social.sociology	- social structures, persons, and cultural modeling.

Uses of WeightedGraph in org.episteme.core.mathematics.discrete

Classes in org.episteme.core.mathematics.discrete that implement WeightedGraph

Modifier and Type	Class	Description
class	DirectedWeightedGraph<V,W>	Adjacency list implementation of a directed weighted graph.

Methods in org.episteme.core.mathematics.discrete that return WeightedGraph

Modifier and Type	Method	Description
WeightedGraph<V,W>	WeightedGraphBuilder.build()	Builds and returns the graph.

Methods in org.episteme.core.mathematics.discrete with parameters of type WeightedGraph

Modifier and Type	Method	Description
Optional<Map<V,W>>	BellmanFordShortestPath.findAllPaths(WeightedGraph<V,W> graph, V source)	Computes shortest paths from source to all vertices.
Optional<Map<V,Map<V,W>>>	FloydWarshallShortestPath.findAllPaths(WeightedGraph<V,W> graph)	Computes all-pairs shortest paths.
Set<WeightedEdge<V,W>>	KruskalMinimumSpanningTree.findMST(WeightedGraph<V,W> graph)
Set<WeightedEdge<V,W>>	MinimumSpanningTree.findMST(WeightedGraph<V,W> graph)	Finds the Minimum Spanning Tree of the given graph.
Set<WeightedEdge<V,W>>	PrimMinimumSpanningTree.findMST(WeightedGraph<V,W> graph)
ShortestPathResult<V,W>	AStarSearch.findPath(WeightedGraph<V,W> graph, V source, V goal)	Finds shortest path from source to goal using A* search.
ShortestPathResult<V,W>	BellmanFordShortestPath.findPath(WeightedGraph<V,W> graph, V source, V target)	Computes shortest path from source to target.
static <V> DijkstraShortestPath<V,Double>	DijkstraShortestPath.ofDouble(WeightedGraph<V,Double> graph)	Creates a new Dijkstra algorithm instance for Double weights.
static <V> DijkstraShortestPath<V,Real>	DijkstraShortestPath.ofReal(WeightedGraph<V,Real> graph)	Creates a new Dijkstra algorithm instance for Real weights.

Constructors in org.episteme.core.mathematics.discrete with parameters of type WeightedGraph

Modifier	Constructor	Description
	DijkstraShortestPath(WeightedGraph<V,W> graph, GraphWeightAdapter<W> adapter)	Creates a new Dijkstra algorithm instance.

Uses of WeightedGraph in org.episteme.core.mathematics.discrete.graph.flow

Methods in org.episteme.core.mathematics.discrete.graph.flow with parameters of type WeightedGraph

Modifier and Type	Method	Description
static <V> Real	MaxFlow.edmondsKarp(WeightedGraph<V,Real> graph, V source, V sink)	Edmonds-Karp algorithm (Ford-Fulkerson with BFS).
static <V> Real	MaxFlow.fordFulkerson(WeightedGraph<V,Real> graph, V source, V sink)	Computes maximum flow using Ford-Fulkerson with DFS.

Uses of WeightedGraph in org.episteme.core.mathematics.ml

Classes in org.episteme.core.mathematics.ml that implement WeightedGraph

Modifier and Type	Class	Description
class	BayesianBeliefNetwork	Represents a Bayesian Belief Network (BBN).

Uses of WeightedGraph in org.episteme.social.sociology

Classes in org.episteme.social.sociology that implement WeightedGraph

Modifier and Type	Class	Description
class	SocialNetwork	Represents a social network graph where persons are nodes and relationships are edges.