Inheritance diagram for sparksee.WeakConnectivityDFS:

Collaboration diagram for sparksee.WeakConnectivityDFS:

## Public Member Functions | |

def | add_edge_type |

Allows connectivity through edges of the given type. | |

def | add_all_node_types |

Allows connectivity through all node types of the graph. | |

def | add_all_edge_types |

Allows connectivity through all edge types of the graph. | |

def | exclude_nodes |

Set which nodes can't be used. | |

def | run |

Executes the algorithm. | |

def | add_node_type |

Allows connectivity through nodes of the given type. | |

def | set_materialized_attribute |

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. | |

def | exclude_edges |

Set which edges can't be used. | |

def | __init__ |

Creates a new instance of WeakConnectivityDFS. | |

def | get_connected_components |

Returns the results generated by the execution of the algorithm. | |

def | is_closed |

Gets if Connectivity has been closed or not. | |

def | close |

Closes the Connectivity instance. |

This 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. This implementation is based on the Depth-First Search (DFS) algorithm.

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.

After the execution, we can retrieve the results stored in an instance of the ConnectedComponents class using the getConnectedComponents method.

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

def sparksee.WeakConnectivityDFS.add_edge_type | ( | self, |
||

type | ||||

) |

Allows connectivity through edges of the given type.

In a weak connectivity the edges can be used in Any direction.

**Parameters:**-
*type*[in] Edge type.

Reimplemented from sparksee.WeakConnectivity.

def sparksee.WeakConnectivityDFS.add_all_edge_types | ( | self |
) |

Allows connectivity through all edge types of the graph.

In a weak connectivity the edges can be used in Any direction.

Reimplemented from sparksee.WeakConnectivity.

def sparksee.WeakConnectivityDFS.exclude_nodes | ( | self, |
||

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.

Reimplemented from sparksee.WeakConnectivity.

def sparksee.WeakConnectivityDFS.add_node_type | ( | self, |
||

t | ||||

) |

Allows connectivity through nodes of the given type.

**Parameters:**-
*t*null

Reimplemented from sparksee.WeakConnectivity.

def sparksee.WeakConnectivityDFS.set_materialized_attribute | ( | self, |
||

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.

**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.

Reimplemented from sparksee.WeakConnectivity.

def sparksee.WeakConnectivityDFS.exclude_edges | ( | self, |
||

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.

Reimplemented from sparksee.WeakConnectivity.

def sparksee.WeakConnectivityDFS.__init__ | ( | self, |
||

session | ||||

) |

Creates a new instance of WeakConnectivityDFS.

After creating this instance is required to indicate the set of edge types and the set of node types which will be navigated through while traversing the graph in order to find the weak connected components.

**Parameters:**-
*session*[in] Session to get the graph from and calculate the connectivity

def sparksee.WeakConnectivityDFS.get_connected_components | ( | self |
) |

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.

**Returns:**- Returns an instance of the class ConnectedComponents which contain information related to the connected components found.

Reimplemented from sparksee.WeakConnectivity.

def sparksee.Connectivity.is_closed | ( | self |
) | ` [inherited]` |

Gets if Connectivity has been closed or not.

**See also:**- close()

**Returns:**- TRUE if the Connectivity instance has been closed, FALSE otherwise.

def sparksee.Connectivity.close | ( | self |
) | ` [inherited]` |

Closes the Connectivity instance.

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

Generated on Tue Jun 2 16:12:19 2015 for SparkseePython by 1.5.6