// Copyright (C) 1996 DIMACS Center, Rutgers, The State University of New Jersey
// Author(s): Jonathan Berry

// This software is copyrighted by the DIMACS Center at Rutgers, The State
// University of New Jersey.  IT IS PROVIDED AS IS, AND THE AUTHORS, DIMACS, AND
// RUTGERS, THE STATE UNIVERSITY OF NEW JERSEY  DISCLAIM
// ALL LIABILITY FOR DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL
// DAMAGES ARISING OUT OF THE USE OF THIS SOFTWARE, ITS DOCUMENTATION, OR ANY
// DERIVATIVES THEREOF, EVEN IF THE AUTHORS HAVE BEEN ADVISED OF THE
// POSSIBILITY OF SUCH DAMAGE.

// THE AUTHORS AND DISTRIBUTORS SPECIFICALLY DISCLAIM ANY WARRANTIES,
// INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE, AND NON-INFRINGEMENT.  THIS SOFTWARE
// IS PROVIDED ON AN "AS IS" BASIS, AND THE AUTHORS AND DISTRIBUTORS HAVE
// NO OBLIGATION TO PROVIDE MAINTENANCE, SUPPORT, UPDATES, ENHANCEMENTS, OR
// MODIFICATIONS.

// The authors hereby grant permission to use, copy, modify, distribute,
// and license this software and its documentation for any purpose, provided
// that existing copyright notices are retained in all copies and that this
// notice is included verbatim in any distributions. No written agreement,
// license, or royalty fee is required for any of the authorized uses.
// Modifications to this software may be copyrighted by their authors
// and need not follow the licensing terms described here, provided that
// the new terms are clearly indicated on the first page of each file where
// they apply.

// Last File Update: 31-Jul-1996
// 

#include <LINK/algorithm/Algorithms.h>
#include <LINK/graph/Attribute.h>
#include <LINK/graph/Graph.h>
#include <LINK/graph/Edge.h>
#include <LINK/layout/Layouts.h>


void HyperSpringLayout(Graph *h)
{
    int i;
    Graph *g = bipartiteRepresentation(h);
    Edge *e = g->edge(0);
    double w;
    getAttribute((GraphObject*) e, "weight", w);
    cout << "w: " << w << endl;
    SpringLayout(g);
    int order = h->order();
    const SortedArray<Vertex*>& vertices = h->vertices();
    const MSet<Edge*>& edges = h->edges();

    for (i=0; i<order; i++) {
	Vertex *gv = g->findVertexByName(vertices[i]->name());
	double gx, gy;
        getAttribute((GraphObject*) gv, "x", gx);
        getAttribute((GraphObject*) gv, "y", gy);
        setAttribute((GraphObject*) vertices[i], "x", gx);
        setAttribute((GraphObject*) vertices[i], "y", gy);
    }
    Iterator<Edge*> get_edge(&edges);
    Edge *he;
    while (get_edge(he)) {
	Vertex *gv = g->findVertexByName(he->name());
        double gx, gy;
        getAttribute((GraphObject*) gv, "x", gx);
        getAttribute((GraphObject*) gv, "y", gy);
        setAttribute((GraphObject*) he, "x", gx);
        setAttribute((GraphObject*) he, "y", gy);
   }
   delete g;
}