DisjointCommunityDetection class. More...

Inheritance diagram for com.sparsity.sparksee.algorithms.DisjointCommunityDetection:

Collaboration diagram for com.sparsity.sparksee.algorithms.DisjointCommunityDetection:

Public Member Functions
void	IncludeNodes (com.sparsity.sparksee.gdb.Objects nodes)
	Set additional nodes that can be used.

void	AddNodeType (int type)
	Allows connectivity through nodes of the given type.

void	AddEdgeType (int type)
	Allows connectivity through edges of the given type.

void	AddAllNodeTypes ()
	Allows connectivity through all node types of the graph.

void	AddAllEdgeTypes ()
	Allows connectivity through all edge types of the graph.

void	IncludeEdges (com.sparsity.sparksee.gdb.Objects edges)
	Set additional edges that can be used.

void	ExcludeNodes (com.sparsity.sparksee.gdb.Objects nodes)
	Set which nodes can't be used.

void	Run ()
	Runs the algorithm in order to find the communities.

void	SetMaterializedAttribute (System.String attributeName)
	Creates a new common attribute type for all node types in the graph in order to store, persistently, the results related to the disjoint communities found while executing this algorithm.

com.sparsity.sparksee.algorithms.DisjointCommunities	GetCommunities ()
	Returns the results generated by the execution of the algorithm.

void	ExcludeEdges (com.sparsity.sparksee.gdb.Objects edges)
	Set which edges can't be used.

boolean	IsClosed ()
	Gets if CommunityDetection instance has been closed or not.

void	Close ()
	Closes the CommunityDetection instance.

Detailed Description

DisjointCommunityDetection class.

Any class implementing this abstract class can be used to solve a problem related to graph connectivity as finding the strongly connected components, finding the weakly connected components.

Check out the 'Algorithms' section in the SPARKSEE User Manual for more details on this.

Author: Sparsity Technologies http://www.sparsity-technologies.com

Member Function Documentation

void com.sparsity.sparksee.algorithms.DisjointCommunityDetection.AddAllEdgeTypes ( )

Allows connectivity through all edge types of the graph.

The edges can be used in Any direction.

void com.sparsity.sparksee.algorithms.DisjointCommunityDetection.AddEdgeType ( int type )

Allows connectivity through edges of the given type.

The edges can be used in Any direction.

Parameters

type	[in] Edge type.

void com.sparsity.sparksee.algorithms.DisjointCommunityDetection.AddNodeType ( int type )

Allows connectivity through nodes of the given type.

Parameters

type null

void com.sparsity.sparksee.algorithms.CommunityDetection.Close ( )

inherited

Closes the CommunityDetection instance.

It must be called to ensure the integrity of all data.

void com.sparsity.sparksee.algorithms.DisjointCommunityDetection.ExcludeEdges ( com.sparsity.sparksee.gdb.Objects edges )

Set which edges can't be used.

This will replace any previously specified set of excluded edges. Should only be used to exclude the usage of specific edges from allowed edge types because it's less efficient than not allowing an edge type.

Parameters

edges [in] A set of edge identifiers that must be kept intact until the destruction of the class.

void com.sparsity.sparksee.algorithms.DisjointCommunityDetection.ExcludeNodes ( com.sparsity.sparksee.gdb.Objects nodes )

Set which nodes can't be used.

This will replace any previously specified set of excluded nodes. Should only be used to exclude the usage of specific nodes from allowed node types because it's less efficient than not allowing a node type.

Parameters

nodes [in] A set of node identifiers that must be kept intact until the destruction of the class.

com.sparsity.sparksee.algorithms.DisjointCommunities com.sparsity.sparksee.algorithms.DisjointCommunityDetection.GetCommunities ( )

Returns the results generated by the execution of the algorithm.

These results contain information related to the disjoint communities found as the number of different components, the set of nodes contained in each component or many other data.

Returns: Returns an instance of the class DisjointCommunities which contain information related to the disjoint communities found.

void com.sparsity.sparksee.algorithms.DisjointCommunityDetection.IncludeEdges ( com.sparsity.sparksee.gdb.Objects edges )

Set additional edges that can be used.

This will replace any previously specified set of include edges. Using this optional method adds valid edges to the edges of any edge type explicitly set as a valid type. Should only be used to include specific small sets of edges because it's less efficient than just using an edge type. For any edge to be used, both nodes must be also valid.

Parameters

edges [in] A set of edge identifiers that must be kept intact until the destruction of the class.

void com.sparsity.sparksee.algorithms.DisjointCommunityDetection.IncludeNodes ( com.sparsity.sparksee.gdb.Objects nodes )

Set additional nodes that can be used.

This will replace any previously specified set of include nodes. Using this optional method adds valid nodes to the nodes of any node type explicitly set as a valid type. Should only be used to include specific small sets of nodes because it's less efficient than just using a node type.

Parameters

nodes [in] A set of node identifiers that must be kept intact until the destruction of the class.

boolean com.sparsity.sparksee.algorithms.CommunityDetection.IsClosed ( )

inherited

Gets if CommunityDetection instance has been closed or not.

See Also: Close()

Returns: TRUE if the CommunityDetection instance has been closed, FALSE otherwise.

void com.sparsity.sparksee.algorithms.DisjointCommunityDetection.Run ( )

Runs the algorithm in order to find the communities.

This method can be called only once.

void com.sparsity.sparksee.algorithms.DisjointCommunityDetection.SetMaterializedAttribute ( System.String attributeName )

Creates a new common attribute type for all node types in the graph in order to store, persistently, the results related to the disjoint communities found while executing this algorithm.

Whenever the user wants to retrieve the results, even when the graph has been closed and opened again, it is only necessary to create a new instance of the class DisjointCommunities indicating the graph and the name of the common attribute type which stores the results. This instance will have all the information related to the disjoint communities found in the moment of the execution of the algorithm that stored this data.

It is possible to run the algorithm without specifying this parameter in order to avoid materializing the results of the execution.

Parameters

attributeName [in] The name of the common attribute type for all node types in the graph which will store persistently the results generated by the execution of the algorithm.

Public Member Functions

Detailed Description

Member Function Documentation