Paket: bliss-doc (0.73-2)

[ Källkod: bliss  ]

suite to compute graph automorphisms and labelings -- doc

Bliss is a backtracking algorithm for computing automorphism groups and canonical forms of graphs, based on individualization and refinement. Its data structures, subroutines, and pruning heuristics are specially designed for fast handling of large and sparse graphs.

This package provides the API documentation.

Andra paket besläktade med bliss-doc

• dep: libjs-jquery

  JavaScript library for dynamic web applications

• sug: bliss (= 0.73-2)

  tool to compute graph automorphisms and labelings -- bin

• sug: pdf-viewer

  virtuellt paket som tillhandahålls av atril, evince, gv, mupdf, okular, viewpdf.app, xpdf, zathura-pdf-poppler

• sug: www-browser

  virtuellt paket som tillhandahålls av chromium, dillo, edbrowse, elinks, epiphany-browser, falkon, firefox-esr, hv3, konqueror, links, links2, lynx, midori, netrik, sugar-browse-activity, surf, w3m, xemacs21-mule, xemacs21-mule-canna-wnn, xemacs21-nomule

Hämta bliss-doc

Hämtningar för alla tillgängliga arkitekturer

Arkitektur	Paketstorlek	Installerad storlek	Filer
all	267,8 kbyte	669,0 kbyte	[filförteckning]