pub fn betweenness(
  db_state: state.DbState,
  edge: String,
  entity_var: String,
  score_var: String,
  ctx: dict.Dict(String, fact.Value),
) -> List(dict.Dict(String, fact.Value))

pub fn connected_components(
  db_state: state.DbState,
  edge: String,
  entity_var: String,
  component_var: String,
  ctx: dict.Dict(String, fact.Value),
) -> List(dict.Dict(String, fact.Value))

pub fn cycle_detect(
  db_state: state.DbState,
  edge: String,
  cycle_var: String,
  ctx: dict.Dict(String, fact.Value),
) -> List(dict.Dict(String, fact.Value))

pub fn neighbors(
  db_state: state.DbState,
  from: ast.Part,
  edge: String,
  depth: Int,
  node_var: String,
  ctx: dict.Dict(String, fact.Value),
) -> List(dict.Dict(String, fact.Value))

pub fn pagerank(
  db_state: state.DbState,
  entity_var: String,
  edge: String,
  rank_var: String,
  damping: Float,
  iterations: Int,
  ctx: dict.Dict(String, fact.Value),
) -> List(dict.Dict(String, fact.Value))

pub fn reachable(
  db_state: state.DbState,
  from: ast.Part,
  edge: String,
  node_var: String,
  ctx: dict.Dict(String, fact.Value),
) -> List(dict.Dict(String, fact.Value))

pub fn shortest_path(
  db_state: state.DbState,
  from: ast.Part,
  to: ast.Part,
  edge: String,
  path_var: String,
  cost_var: option.Option(String),
  max_depth: option.Option(Int),
  ctx: dict.Dict(String, fact.Value),
) -> List(dict.Dict(String, fact.Value))

pub fn strongly_connected(
  db_state: state.DbState,
  edge: String,
  entity_var: String,
  component_var: String,
  ctx: dict.Dict(String, fact.Value),
) -> List(dict.Dict(String, fact.Value))

pub fn topological_sort(
  db_state: state.DbState,
  edge: String,
  entity_var: String,
  order_var: String,
  ctx: dict.Dict(String, fact.Value),
) -> List(dict.Dict(String, fact.Value))