graphs#

Graphs are comprised of nodes, which are entities from a model, and edges representing relationships between nodes. The relationalai.std.graphs namespace contains tools constructing and analyzing graphs.

Classes#

• Graph
  • .compute
  • .Edge
  • .fetch()
  • .id
  • .model
  • .Node
  • .undirected
  • .visualize()
• Edge
  • .__call__()
  • .add()
  • .extend()
• EdgeInstance
  • .from_
  • .to
  • .set()
• Compute
  • .adamic_adar()
  • .avg_clustering_coefficient()
  • .avg_degree()
  • .avg_indegree()
  • .avg_outdegree()
  • .betweenness_centrality()
  • .common_neighbor()
  • .cosine_similarity()
  • .degree_centrality()
  • .degree()
  • .diameter_range()
  • .distance()
  • .eigenvector_centrality()
  • .indegree()
  • .is_connected()
  • .is_reachable()
  • .is_triangle()
  • .label_propagation()
  • .local_clustering_coefficient()
  • .louvain()
  • .max_degree()
  • .max_indegree()
  • .max_outdegree()
  • .min_degree()
  • .min_indegree()
  • .min_outdegree()
  • .num_edges()
  • .num_nodes()
  • .num_triangles()
  • .outdegree()
  • .pagerank()
  • .preferential_attachment()
  • .reachable_from()
  • .triangles()
  • .weakly_connected_component()
  • .weighted_distance()
  • .weighted_cosine_similarity()
  • .weighted_degree_centrality()
  • .weighted_jaccard_similarity()