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

Packages that use Graph

Package	Description
org.episteme.core.mathematics.discrete
org.episteme.core.mathematics.discrete.generators
org.episteme.core.mathematics.discrete.graph	Provides pluggable traversal algorithms for graphs with optional
org.episteme.core.mathematics.discrete.graph.providers
org.episteme.core.mathematics.geometry.polyhedra
org.episteme.core.mathematics.ml
org.episteme.natural.chemistry
org.episteme.social.philosophy.storytelling	Provides the org.episteme.social.philosophy.storytelling module.
org.episteme.social.sociology	- social structures, persons, and cultural modeling.

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

Subinterfaces of Graph in org.episteme.core.mathematics.discrete

Modifier and Type	Interface	Description
interface	Tree<V>	Represents a tree data structure - a connected acyclic graph.
interface	WeightedGraph<V,W>	A graph with weighted edges.

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

Modifier and Type	Class	Description
class	DirectedWeightedGraph<V,W>	Adjacency list implementation of a directed weighted graph.
final class	NetworkGraph<V>	High-level graph implementation optimized for network visualization and social analysis.
class	RootedTree<V>	A mutable implementation of a rooted tree.
class	UndirectedGraph<V>	Adjacency list implementation of an undirected graph.

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

Modifier and Type	Method	Description
static <V> List<V>	GraphAlgorithms.breadthFirstSearch(Graph<V> graph, V start)	Performs breadth-first search from a starting vertex.
static <V> List<V>	GraphAlgorithms.depthFirstSearch(Graph<V> graph, V start)	Performs depth-first search from a starting vertex.
static <V> Map<V,Integer>	CommunityDetection.detectCommunities(Graph<V> graph, int maxIterations)	Detects communities using the best available provider.
static <V> boolean	GraphAlgorithms.isConnected(Graph<V> graph)	Checks if the graph is connected (for undirected graphs).
static <V> List<V>	GraphAlgorithms.shortestPath(Graph<V> graph, V start, V end)	Finds shortest path using Dijkstra's algorithm (unweighted = BFS).

Uses of Graph in org.episteme.core.mathematics.discrete.generators

Methods in org.episteme.core.mathematics.discrete.generators that return Graph

Modifier and Type	Method	Description
static Graph<Natural>	ScaleFreeGenerator.generate(int n, int m0, int m)	Generates a scale-free network.
static Graph<Natural>	SmallWorldGenerator.generate(int n, int k, double beta)	Generates a small-world network.

Uses of Graph in org.episteme.core.mathematics.discrete.graph

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

Modifier and Type	Method	Description
<V> Map<V,Integer>	GraphAlgorithmProvider.detectCommunities(Graph<V> graph, int maxIterations)	Detects communities in a graph.
void	BFSTraversal.traverse(Graph<V> graph, V start, VertexVisitor<V> visitor)
void	DFSTraversal.traverse(Graph<V> graph, V start, VertexVisitor<V> visitor)
void	GraphTraversalStrategy.traverse(Graph<V> graph, V start, VertexVisitor<V> visitor)	Traverses the graph starting from the given vertex.
default void	GraphTraversalStrategy.traverse(Graph<V> graph, V start, VertexVisitor<V> visitor, ComputeBackend backend)	Traverses the graph using a specific backend.

Uses of Graph in org.episteme.core.mathematics.discrete.graph.providers

Methods in org.episteme.core.mathematics.discrete.graph.providers with parameters of type Graph

Modifier and Type	Method	Description
<V> Map<V,Integer>	MulticoreGraphAlgorithmProvider.detectCommunities(Graph<V> graph, int maxIterations)
<V> Map<V,Integer>	StandardGraphAlgorithmProvider.detectCommunities(Graph<V> graph, int maxIterations)

Uses of Graph in org.episteme.core.mathematics.geometry.polyhedra

Classes in org.episteme.core.mathematics.geometry.polyhedra that implement Graph

Modifier and Type	Class	Description
class	Polyhedron	Represents a convex polyhedron in 3D space.

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

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

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

Uses of Graph in org.episteme.natural.chemistry

Classes in org.episteme.natural.chemistry that implement Graph

Modifier and Type	Class	Description
class	MolecularGraph	Represents a molecule as a graph of atoms and bonds.

Uses of Graph in org.episteme.social.philosophy.storytelling

Classes in org.episteme.social.philosophy.storytelling that implement Graph

Modifier and Type	Class	Description
class	Story	A class representing a continuous and logical flow of events as a graph G = (V, E).

Uses of Graph in org.episteme.social.sociology

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

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

Constructors in org.episteme.social.sociology with parameters of type Graph

Modifier	Constructor	Description
	AxelrodModel(Graph<Person> network, int numFeatures, int numTraits)	Creates a new Axelrod model simulation.