DexNet 4.7.0

WeakConnectivity class. More...
Public Member Functions  
void  AddAllNodeTypes () 
Allows connectivity through all node types of the graph.  
void  AddAllEdgeTypes () 
Allows connectivity through all edge types of the graph.  
void  Run () 
Runs the algorithm in order to find the connected components.  
void  ExcludeNodes (com.sparsity.dex.gdb.Objects nodes) 
Set which nodes can't be used.  
void  AddEdgeType (int t) 
Allows connectivity through edges of the given type.  
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 connected components found while executing this algorithm.  
void  AddNodeType (int t) 
Allows connectivity through nodes of the given type.  
com.sparsity.dex.algorithms.ConnectedComponents  GetConnectedComponents () 
Returns the results generated by the execution of the algorithm.  
void  ExcludeEdges (com.sparsity.dex.gdb.Objects edges) 
Set which edges can't be used.  
boolean  IsClosed () 
Gets if Connectivity instance has been closed or not.  
void  Close () 
Closes the Connectivity instance. 
WeakConnectivity class.
Any class implementing this abstract class can be used to solve the problem of finding weakly connected components in an undirected graph or in a directed graph which will be considered as an undirected one.
It consists in finding components where every pair (u,v) of nodes contained in it has a path from u to v and from v to u.
It is possible to set some restrictions after constructing a new instance of this class and before running it in order to limit the results. Those restrictions are:
(i) The set of edge types which will be navigated through while traversing the graph. The method is AddEdgeType for adding one edge type and AddAllEdgeTypes for adding all edge types.
(ii) The set of node types which will be navigated through while traversing the graph. The method is AddNodeType for adding one node type and AddAllNodeTypes for adding all node types.
void com::sparsity::dex::algorithms::WeakConnectivity::AddAllEdgeTypes  (  ) 
Allows connectivity through all edge types of the graph.
In a weak connectivity the edges can be used in Any direction. d[in] Edge direction.
Reimplemented in com::sparsity::dex::algorithms::WeakConnectivityDFS.
void com::sparsity::dex::algorithms::WeakConnectivity::AddEdgeType  (  int  t  ) 
Allows connectivity through edges of the given type.
In a weak connectivity the edges can be used in Any direction. d[in] Edge direction.
t  [in] Edge type. 
Reimplemented in com::sparsity::dex::algorithms::WeakConnectivityDFS.
void com::sparsity::dex::algorithms::WeakConnectivity::AddNodeType  (  int  t  ) 
Allows connectivity through nodes of the given type.
t  null 
Reimplemented from com::sparsity::dex::algorithms::Connectivity.
Reimplemented in com::sparsity::dex::algorithms::WeakConnectivityDFS.
void com::sparsity::dex::algorithms::Connectivity::Close  (  )  [inherited] 
Closes the Connectivity instance.
It must be called to ensure the integrity of all data.
void com::sparsity::dex::algorithms::WeakConnectivity::ExcludeEdges  (  com.sparsity.dex.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.
edges  [in] A set of edge identifiers that must be kept intact until the destruction of the class. 
Reimplemented from com::sparsity::dex::algorithms::Connectivity.
Reimplemented in com::sparsity::dex::algorithms::WeakConnectivityDFS.
void com::sparsity::dex::algorithms::WeakConnectivity::ExcludeNodes  (  com.sparsity.dex.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.
nodes  [in] A set of node identifiers that must be kept intact until the destruction of the class. 
Reimplemented from com::sparsity::dex::algorithms::Connectivity.
Reimplemented in com::sparsity::dex::algorithms::WeakConnectivityDFS.
com.sparsity.dex.algorithms.ConnectedComponents com::sparsity::dex::algorithms::WeakConnectivity::GetConnectedComponents  (  ) 
Returns the results generated by the execution of the algorithm.
These results contain information related to the connected components found as the number of different components, the set of nodes contained in each component or many other data.
Reimplemented from com::sparsity::dex::algorithms::Connectivity.
Reimplemented in com::sparsity::dex::algorithms::WeakConnectivityDFS.
boolean com::sparsity::dex::algorithms::Connectivity::IsClosed  (  )  [inherited] 
Gets if Connectivity instance has been closed or not.
void com::sparsity::dex::algorithms::WeakConnectivity::Run  (  ) 
Runs the algorithm in order to find the connected components.
This method can be called only once.
Reimplemented from com::sparsity::dex::algorithms::Connectivity.
Reimplemented in com::sparsity::dex::algorithms::WeakConnectivityDFS.
void com::sparsity::dex::algorithms::WeakConnectivity::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 connected components 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 ConnectedComponents 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 connected components 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.
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. 
Reimplemented from com::sparsity::dex::algorithms::Connectivity.
Reimplemented in com::sparsity::dex::algorithms::WeakConnectivityDFS.