src/cplib/graph/namori_graph

  Source   Edit

Procs

proc dist(namori: NamoriGraph; u, v: int): (int, int) {....raises: [], tags: [].}
u,v間の距離を二通り返します (小さいほう,大きいほう) ただし、一通りしか存在しない場合二つ目のintはINF64を返します。   Source   Edit
proc incycle(namori: NamoriGraph; x: int): bool {....raises: [], tags: [].}
  Source   Edit
proc initNamoriGraph(graph: UnWeightedUnDirectedGraph): NamoriGraph {.
    ...raises: [], tags: [].}
  Source   Edit
proc root(namori: NamoriGraph; x: int): int {....raises: [], tags: [].}
  Source   Edit
proc same_tree(namori: NamoriGraph; x, y: int): bool {....raises: [], tags: [].}
  Source   Edit