Skip to content
RelationalAI Docs

core

relationalai.semantics.reasoners.graph

Core functionality for the Graph library.

Graph construction and unpinned helpers are eligible for SQL. Loopy procedures, including PageRank and betweenness centrality, are automatically routed to logic. Explicit logic pins remain in the following functions and their subset helpers:

  • reachable
  • distance
  • debug_multi_edges
  • weakly_connected_component
  • jaccard_similarity
  • cosine_similarity
  • adamic_adar
  • betweenness_centrality (distance input and diagnostics)
  • infomap
  • louvain
  • label_propagation
  • _primitive_weight_list
  • _primitive_node_count
  • _primitive_edge_count
  • _create_primitive_algorithm_relationship
  • _reachable_from_min_node
  • _visualize_tracker

The reason for each pin is explained in the corresponding function.

Classes

Classes exposed by this module.

GraphA graph defined within a PyRel model, over which graph algorithms can be computed.