1.1.4 Graph Data Structures

Problem Input | Problem Output 


INPUT                    OUTPUT

Input Description: A graph G .

Problem: Give an efficient, flexible data structure to represent G .

Implementations

  • LEDA - A Library of Efficient Data Types and Algorithms (C++) (rating 10)
  • GraphEd -- Graph Editor and Layout Program (C) (rating 8)
  • Combinatorica (Mathematica) (rating 6)
  • The Stanford GraphBase (C) (rating 6)
  • LINK -- Programming and Visualization Environment for Hypergraphs (C++) (rating 6)
  • Moret and Shapiro's Algorithms P to NP (Pascal) (rating 4)

    Related Problems

  • Graph Partition
  • Set Data Structures

    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 .