SparkseePython
6.0.2
|
Depth-First Search (DFS) implementation of Traversal. More...
Public Member Functions | |
def | add_edge_type (self, type, dir) |
Allows for traversing edges of the given type. More... | |
def | exclude_nodes (self, nodes) |
Set which nodes can't be used. More... | |
def | add_all_edge_types (self, dir) |
Allows for traversing all edge types of the graph. More... | |
def | add_node_type (self, type) |
Allows for traversing nodes of the given type. More... | |
def | exclude_edges (self, edges) |
Set which edges can't be used. More... | |
def | next (self) |
Gets the next object of the traversal. More... | |
def | has_next (self) |
Gets if there are more objects to be traversed. More... | |
def | get_current_depth (self) |
Returns the depth of the current node. More... | |
def | __init__ (self, session, node) |
Creates a new instance. More... | |
def | add_all_node_types (self) |
Allows for traversing all node types of the graph. | |
def | set_maximum_hops (self, maxhops) |
Sets the maximum hops restriction. More... | |
def | __iter__ (self) |
Gets a new TraversalIterator. More... | |
def | __next__ (self) |
Used in next() More... | |
def | close (self) |
Closes the Traversal instance. More... | |
def | is_closed (self) |
Gets if Traversal has been closed or not. More... | |
Depth-First Search (DFS) implementation of Traversal.
Starting from a source or root node, it visits as far as possible along each branch before backtracking.
Check out the 'Algorithms' section in the SPARKSEE User Manual for more details on this.
def sparksee.TraversalDFS.__init__ | ( | self, | |
session, | |||
node | |||
) |
Creates a new instance.
session | [in] Session to get the graph from and perform traversal. |
node | [in] Node to start traversal from. |
|
inherited |
Gets a new TraversalIterator.
|
inherited |
Used in next()
def sparksee.TraversalDFS.add_all_edge_types | ( | self, | |
dir | |||
) |
Allows for traversing all edge types of the graph.
dir | [in] Edge direction. |
def sparksee.TraversalDFS.add_edge_type | ( | self, | |
type, | |||
dir | |||
) |
Allows for traversing edges of the given type.
type | [in] Edge type. |
dir | [in] Edge direction. |
def sparksee.TraversalDFS.add_node_type | ( | self, | |
type | |||
) |
Allows for traversing nodes of the given type.
type | The node type to add |
|
inherited |
Closes the Traversal instance.
It must be called to ensure the integrity of all data.
def sparksee.TraversalDFS.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.
edges | [in] A set of edge identifiers that must be kept intact until the destruction of the class. |
def sparksee.TraversalDFS.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.
nodes | [in] A set of node identifiers that must be kept intact until the destruction of the class. |
def sparksee.TraversalDFS.get_current_depth | ( | self | ) |
Returns the depth of the current node.
That is, it returns the depth of the node returned in the last call to Next().
def sparksee.TraversalDFS.has_next | ( | self | ) |
Gets if there are more objects to be traversed.
|
inherited |
def sparksee.TraversalDFS.next | ( | self | ) |
Gets the next object of the traversal.
def sparksee.TraversalDFS.set_maximum_hops | ( | self, | |
maxhops | |||
) |
Sets the maximum hops restriction.
All paths longer than the maximum hops restriction will be ignored.
maxhops | [in] The maximum hops restriction. It must be positive or zero. Zero, the default value, means unlimited. |