ragraph.analysis.comparison.utils#

Module Contents#

Functions#

get_unique_leafs(→ List[ragraph.node.Node])

Get unique leafs in graph a.

get_common_leafs(→ List[ragraph.node.Node])

Get common leafs in graph a and b

check_edge_equality(→ bool)

Checks if two edges are equal based on source, target, kind, labels.

get_unique_edges(→ List[ragraph.edge.Edge])

Get unique edges in graph a.
ragraph.analysis.comparison.utils.get_unique_leafs(a: ragraph.graph.Graph, b: ragraph.graph.Graph) → List[ragraph.node.Node]#

Get unique leafs in graph a.

Parameters:

  • a – Graph object.

  • b – Graph object.

Returns:

List of unique leafs in Graph a.

ragraph.analysis.comparison.utils.get_common_leafs(a: ragraph.graph.Graph, b: ragraph.graph.Graph, ue: List[ragraph.edge.Edge]) → List[ragraph.node.Node]#

Get common leafs in graph a and b

Parameters:

  • a – Graph object.

  • b – Graph object.

  • ue – List of unique edges.

Returns:

List of common leafs in graphs a and b.

ragraph.analysis.comparison.utils.check_edge_equality(a: ragraph.edge.Edge, b: ragraph.edge.Edge) → bool#

Checks if two edges are equal based on source, target, kind, labels.

Parameters:

  • a – Edge a.

  • b – Edge b

Returns:

Whether edges are considered equal.

ragraph.analysis.comparison.utils.get_unique_edges(a: ragraph.graph.Graph, b: ragraph.graph.Graph) → List[ragraph.edge.Edge]#

Get unique edges in graph a.

Parameters:

  • a – Graph object.

  • b – Graph object.

Returns:

List of unique edges in a.