frodo2.algorithms.RandGraphFactory.Graph Class Reference

A graph. More...

Public Member Functions
	Graph (List< String > nodes, Edge[] edges, List< List< String > > components, Map< String, Set< String > > neighborhoods, HashMap< String, List< String > > clusters)
	Constructor.
String	toString ()
double	computeDensity ()
int	computeMaxDeg ()

Public Attributes
List< String >	nodes
	List of nodes.
Edge[]	edges
	List of edges.
List< List< String > >	components
	Components of the graph.
HashMap< String, Integer >	componentOf
	For each node, the index of its connected component.
Map< String, Set< String > >	neighborhoods
	For each node, the set of its neighbors.
HashMap< String, List< String > >	clusters
	Node clusters, indexed by their names.
Map< String, String >	clusterOf
	The name of the cluster each node belongs to.

Detailed Description

A graph.

Nodes are represented by Integers, starting at 0, prefixed with the letter "x".

Constructor & Destructor Documentation

Graph()

frodo2.algorithms.RandGraphFactory.Graph.Graph	(	List< String >	nodes,
		Edge[]	edges,
		List< List< String > >	components,
		Map< String, Set< String > >	neighborhoods,
		HashMap< String, List< String > >	clusters )

Constructor.

Parameters

nodes	list of nodes
edges	list of edges
components	components of the graph
neighborhoods	for each node, the list of its neighbors
clusters	list of node clusters

References clusterOf, clusters, components, edges, neighborhoods, and nodes.

Member Function Documentation

computeDensity()

double frodo2.algorithms.RandGraphFactory.Graph.computeDensity

(

)

Returns

the p1 density, computed as the number of edges divided by the maximum possible number of edges

Referenced by frodo2.benchmarks.maxdiscsp.MaxDisCSPProblemGenerator.generateProblem().

computeMaxDeg()

int frodo2.algorithms.RandGraphFactory.Graph.computeMaxDeg

(

)

Returns

the highest degree (i.e. number of neighbors) of any given node

Referenced by frodo2.benchmarks.maxdiscsp.MaxDisCSPProblemGenerator.generateProblem().

toString()

String frodo2.algorithms.RandGraphFactory.Graph.toString

(

)

Returns

DOT representation of the graph

References clusters, edges, and nodes.

Member Data Documentation

clusterOf

Map<String, String> frodo2.algorithms.RandGraphFactory.Graph.clusterOf

The name of the cluster each node belongs to.

Referenced by frodo2.algorithms.test.AllTests.generateProblem(), and Graph().

clusters

HashMap< String, List <String> > frodo2.algorithms.RandGraphFactory.Graph.clusters

Node clusters, indexed by their names.

Referenced by frodo2.algorithms.test.AllTests.generateProblem(), frodo2.algorithms.RandGraphFactory.getNiceRandGraph(), Graph(), and toString().

componentOf

HashMap<String, Integer> frodo2.algorithms.RandGraphFactory.Graph.componentOf

For each node, the index of its connected component.

Referenced by frodo2.algorithms.RandGraphFactory.getNiceRandGraph().

components

List< List<String> > frodo2.algorithms.RandGraphFactory.Graph.components

Components of the graph.

Referenced by frodo2.benchmarks.maxdiscsp.MaxDisCSPProblemGenerator.generateProblem(), frodo2.algorithms.RandGraphFactory.getChordalGraph(), and Graph().

edges

Edge [] frodo2.algorithms.RandGraphFactory.Graph.edges

List of edges.

Referenced by frodo2.algorithms.test.AllTests.generateProblem(), frodo2.benchmarks.maxdiscsp.MaxDisCSPProblemGenerator.generateProblem(), frodo2.algorithms.RandGraphFactory.getChordalGraph(), Graph(), and toString().

neighborhoods

Map< String, Set <String> > frodo2.algorithms.RandGraphFactory.Graph.neighborhoods

For each node, the set of its neighbors.

Referenced by frodo2.algorithms.test.AllTests.generateProblem(), frodo2.benchmarks.party.PartyGame.generateProblem(), frodo2.algorithms.RandGraphFactory.getChordalGraph(), and Graph().

nodes

List<String> frodo2.algorithms.RandGraphFactory.Graph.nodes

List of nodes.

Referenced by frodo2.algorithms.test.AllTests.generateProblem(), frodo2.benchmarks.maxdiscsp.MaxDisCSPProblemGenerator.generateProblem(), frodo2.benchmarks.party.PartyGame.generateProblem(), frodo2.algorithms.test.AllTests.generateSizedProblem(), frodo2.algorithms.RandGraphFactory.getChordalGraph(), Graph(), frodo2.benchmarks.graphcoloring.GraphColoring.GraphColoring(), toString(), and frodo2.benchmarks.graphcoloring.GraphColoring.toXCSP().

---

The documentation for this class was generated from the following file:

• src/frodo2/algorithms/RandGraphFactory.java