Uses of Interface
org.episteme.core.mathematics.discrete.WeightedGraph
Packages that use WeightedGraph
Package
Description
- social structures, persons, and cultural modeling.
-
Uses of WeightedGraph in org.episteme.core.mathematics.discrete
Classes in org.episteme.core.mathematics.discrete that implement WeightedGraphModifier and TypeClassDescriptionclassAdjacency list implementation of a directed weighted graph.Methods in org.episteme.core.mathematics.discrete that return WeightedGraphMethods in org.episteme.core.mathematics.discrete with parameters of type WeightedGraphModifier and TypeMethodDescriptionBellmanFordShortestPath.findAllPaths(WeightedGraph<V, W> graph, V source) Computes shortest paths from source to all vertices.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) Finds shortest path from source to goal using A* search.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 WeightedGraphModifierConstructorDescriptionDijkstraShortestPath(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 WeightedGraphModifier and TypeMethodDescriptionstatic <V> RealMaxFlow.edmondsKarp(WeightedGraph<V, Real> graph, V source, V sink) Edmonds-Karp algorithm (Ford-Fulkerson with BFS).static <V> RealMaxFlow.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 WeightedGraphModifier and TypeClassDescriptionclassRepresents a Bayesian Belief Network (BBN). -
Uses of WeightedGraph in org.episteme.social.sociology
Classes in org.episteme.social.sociology that implement WeightedGraphModifier and TypeClassDescriptionclassRepresents a social network graph where persons are nodes and relationships are edges.