Sparksee
6.0.2
|
CommunityDetection class. More...
Public Member Functions | |
virtual | ~CommunityDetection () |
Destructor. | |
virtual void | AddNodeType (sparksee::gdb::type_t type) |
Allows connectivity through nodes of the given type. | |
virtual void | AddAllNodeTypes () |
Allows connectivity through all node types of the graph. | |
virtual void | ExcludeNodes (sparksee::gdb::Objects &nodes) |
Set which nodes can't be used. More... | |
virtual void | ExcludeEdges (sparksee::gdb::Objects &edges) |
Set which edges can't be used. More... | |
virtual void | IncludeNodes (sparksee::gdb::Objects &nodes) |
Set additional nodes that can be used. More... | |
virtual void | IncludeEdges (sparksee::gdb::Objects &edges) |
Set additional edges that can be used. More... | |
virtual void | Run ()=0 |
Runs the algorithm in order to find the connected components. More... | |
Protected Types | |
typedef std::map< sparksee::gdb::type_t, sparksee::gdb::EdgesDirection > | EdgeTypes_t |
A type definition to store allowed edge types. | |
typedef std::vector< sparksee::gdb::type_t > | NodeTypes_t |
A type definition to store allowed node types. | |
Protected Member Functions | |
CommunityDetection (sparksee::gdb::Session &s) | |
Creates a new instance of CommunityDetection. More... | |
void | AddEdgeType (sparksee::gdb::type_t type, sparksee::gdb::EdgesDirection direction) |
Allows connectivity through edges of the given type. More... | |
void | AddAllEdgeTypes (sparksee::gdb::EdgesDirection direction) |
Allows connectivity through all edge types of the graph. More... | |
void | AssertAddedEdges () |
Check that edges had been added. | |
void | AssertAddedNodes () |
Check that nodes had been added. | |
void | AssertNotComputed () |
Check that the connectivity had not been calculated yet. | |
void | SetNodesNotVisited () |
Set all the selected nodes in nodesNotVisited. More... | |
void | AssertComputed () |
Check that the communities had been calculated. | |
void | AssertEdgeType (sparksee::gdb::type_t edgetype) |
Check that the given edge type is valid. | |
void | AssertNodeType (sparksee::gdb::type_t nodetype) |
Check that the given node type is valid. | |
sparksee::gdb::bool_t | IsNodeTypeAllowed (sparksee::gdb::oid_t nodeId) |
Check if the given node has an allowed type. | |
sparksee::gdb::bool_t | IsEdgeTypeAllowed (sparksee::gdb::oid_t edgeId) |
Check if the given edge has an allowed type. | |
sparksee::gdb::bool_t | IsNodeAllowed (sparksee::gdb::oid_t nodeId) |
Check if the given node is allowed (by type or by explicit inclusion). | |
sparksee::gdb::bool_t | IsEdgeAllowed (sparksee::gdb::oid_t edgeId) |
Check if the given edge is allowed (by type or by explicit inclusion). | |
sparksee::gdb::bool_t | IsNodeExcluded (sparksee::gdb::oid_t node) |
Check if the given node is forbidden. | |
sparksee::gdb::bool_t | IsEdgeExcluded (sparksee::gdb::oid_t edge) |
Check if the given edge is forbidden. | |
sparksee::gdb::bool_t | IsNodeIncluded (sparksee::gdb::oid_t node) |
Check if the given node is EXPLICITLY allowed using the include set. | |
sparksee::gdb::bool_t | IsEdgeIncluded (sparksee::gdb::oid_t edge) |
Check if the given edge is EXPLICITLY allowed using the include set. | |
Protected Attributes | |
sparksee::gdb::Session * | sess |
Session. | |
sparksee::gdb::Graph * | graph |
Graph. | |
EdgeTypes_t | edgeTypes |
Allowed edge types. | |
std::vector< sparksee::gdb::type_t > | nodeTypes |
Allowed node types. | |
sparksee::gdb::Objects * | nodesNotVisited |
Identifiers of the nodes not visited. | |
sparksee::gdb::bool_t | computed |
True if the connectivity has been calculated. | |
sparksee::gdb::Objects * | excludedNodes |
The set of excluded nodes. | |
sparksee::gdb::Objects * | excludedEdges |
The set of excluded edges. | |
sparksee::gdb::Objects * | includedNodes |
The set of explicitly included nodes. | |
sparksee::gdb::Objects * | includedEdges |
The set of explicitly included edges. | |
CommunityDetection 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.
|
protected |
Creates a new instance of CommunityDetection.
s | [in] Session to get the graph from and calculate the communities |
|
protected |
Allows connectivity through all edge types of the graph.
d | [in] Edge direction. |
|
protected |
Allows connectivity through edges of the given type.
t | [in] Edge type. |
d | [in] Edge direction. |
|
virtual |
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. |
|
virtual |
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. |
|
virtual |
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.
edges | [in] A set of edge identifiers that must be kept intact until the destruction of the class. |
|
virtual |
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.
nodes | [in] A set of node identifiers that must be kept intact until the destruction of the class. |
|
pure virtual |
Runs the algorithm in order to find the connected components.
This method can be called only once.
Implemented in DisjointCommunityDetection, and CommunitiesSCD.
|
protected |
Set all the selected nodes in nodesNotVisited.
That's all the nodes of the allowed node types but not the excluded ones.