NAME
Tutte -
Tutte.h - An implementation of a 3-Connected graph layout.
SYNOPSIS
#include <Tutte.h>
Public Member Functions
Tutte (const tlp::PropertyContext &)
~Tutte ()
bool run ()
bool check (std::string &)
Detailed Description
Tutte.h - An implementation of a 3-Connected graph layout.
This plugin is an implementation of the Tutte layout algorithm first
published as:
W.T. Tutte, ’How to Draw a Graph’, ’Proc. London Math. Soc.’, ’1963’,
pages 743-768.
HISTORY
· 01/12/1999 Verson 0.0.1: Initial release
· 06/11/2002 Verson 0.0.2: Documentation and code clean up
Note:
This algorithm only works on 3 connected graphs.
Author:
David Auber University Bordeaux I France, Email : auber@tulip-
software.org
LICENCE
This program is free software; you can redistribute it and/or modify it
under the terms of the GNU General Public License as published by the
Free Software Foundation; either version 2 of the License, or (at your
option) any later version.
Constructor & Destructor Documentation
Tutte::Tutte (const tlp::PropertyContext &)
Tutte::~Tutte ()
Member Function Documentation
bool Tutte::check (std::string &)
bool Tutte::run ()
Author
Generated automatically by Doxygen for Tulip Plugins Library from the
source code.