// Copyright (C) 1996 DIMACS Center, Rutgers, The State University of New Jersey
// Author(s): John MacCuish (Los Alamos Nat. Lab.),

// 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>


//
// layout the vertices of the graph parallel to the hyperedge vertices
// in a bipartite-like layout
//
void 
HyperBipartiteLayout(Graph *g)
{
     
    const double 	top = 0.9;
    const double	bottom = 0.1;
    int         order = g->order();
    int         v_regions = order + 1;
    int         e_regions =   g->size() + 1;
    double x, y;

    SortedArray<Vertex*> vgs = g->vertices(); 

    y = top;

    int i = 1;
    for (i=1; i<=order; i++) {
        x = (double)i/(double)v_regions;
        setAttribute((GraphObject*) vgs[i-1], "x", x);
        setAttribute((GraphObject*) vgs[i-1], "y", y);
    }

    MSet<Edge*> egs = g->edges();
    Iterator<Edge*> get_edge(&egs);
    Edge* edge;
    i = 1;
    y = bottom;
    while(get_edge(edge)){
        x = (double)i/(double)e_regions;
        setAttribute((GraphObject*) edge, "x", x);
        setAttribute((GraphObject*) edge, "y", y);
	i++;
    }
}