package ocamlgraph

  1. Overview
  2. Docs
A generic graph library for OCaml

Install 

dune-project
 Dependency

github.com Readme Changelog Edit opam file Versions (4)

Authors

  1. S
    Sylvain Conchon
  2. J
    Jean-Christophe Filliâtre
  3. J
    Julien Signoles

Maintainers

  1. J
    jean-christophe.filliatre@cnrs.fr

Sources

ocamlgraph-2.0.0.tbz
sha256=20fe267797de5322088a4dfb52389b2ea051787952a8a4f6ed70fcb697482609
sha512=c4973ac03bdff52d1c8a1ed01c81e0fbe2f76486995e57ff4e4a11bcc7b1793556139d52a81ff14ee8c8de52f1b40e4bd359e60a2ae626cc630ebe8bccefb3f1

doc/ocamlgraph/Graph/Strat/index.html

Module Graph.StratSource

Strategies

Implementation of a winning strategy of a graph: the graph represents a two players game, each vertex belongs to either player (whose turn it is to play) and describes a configuration of the game. The algorithm computes the winning strategy of a player, if any; i.e. the moves to play (which vertex to go to) so that for all possible moves of the other player, the game goes through a final state.

  • author Nicolas Ayache
Sourcemodule type G = sig ... end

Signature for graphs

Sourcemodule type PLAYER = sig ... end

Signature for graph add-ons: an initial vertex, final vertices and membership of vertices to either true or false, i.e. first or second player

Sourcemodule type STRAT = sig ... end

Signature for strategies: for a given state, the strategy tells which state to go to

Sourcemodule Algo (G : G) (P : PLAYER with type vertex = G.vertex) (S : STRAT with type vertex = G.vertex) : sig ... end

Implements strategy algorithms on graphs