1.3.7 Generating Graphs

Problem Input | Problem Output 


INPUT                    OUTPUT

Input Description: Parameters describing the desired graph, such as the number of vertices n , the number of edges m , or the edge probability p .

Problem: Generate (1) all, or (2) a random, or (3) the next graph satisfying the parameters.

Implementations

  • The Stanford GraphBase (C) (rating 10)
  • Combinatorica (Mathematica) (rating 8)
  • Frank Ruskey's Combinatorial Generation Resources (Pascal) (rating 7)
  • LEDA - A Library of Efficient Data Types and Algorithms (C++) (rating 5)
  • Nijenhuis and Wilf: Combinatorial Algorithms (FORTRAN) (rating 4)

    Related Problems

  • Generating Permutations
  • Graph Isomorphism

    Go to the corresponding chapter in the book
    About the Book
    Send us Mail
    Go to Main Page

    This page last modified on Tue Jun 03, 1997 .