Paket: librw-dev (0.9+ds1-1) [debports]

[ Källkod:  ]

Compute rank-width and rank-decompositions of graphs (development)

Compute rank-width and rank-decompositions of graphs. It is based on ideas from "Computing rank-width exactly" by Sang-il Oum, "Sopra una formula numerica" by Ernesto Pascal, "Generation of a Vector from the Lexicographical Index" by B.P. Buckles and M. Lybanon and "Fast additions on masked integers" by Michael D. Adams and David S. Wise.

This package contains the development files for the library.

Andra paket besläktade med librw-dev

• dep: librw0 (= 0.9+ds1-1)

  Compute rank-width and rank-decompositions of graphs

Hämta librw-dev

Hämtningar för alla tillgängliga arkitekturer

Arkitektur	Paketstorlek	Installerad storlek	Filer
x32 (inofficiell anpassning)	3,9 kbyte	17,0 kbyte	[filförteckning]