Graph_IO
Class LoadGraph

java.lang.Object
  Graph_IO.LoadGraph

public class LoadGraph
extends java.lang.Object

Title: GraphDrawing

Description: Bangladesh University of engineering and technology

Copyright: Copyright (c) 2008

Company: Bangladesh University of engineering and technology

Constructor Summary

LoadGraph()

Method Summary

GraphNode[]	getAdjList(java.lang.String filename) This function implements simple one way adjacent list (not circular).
GraphNode[]	getNodeList(GraphNode[] graphNode) get node list from planar adjacent list Nodelist[i] contains node i
GraphNode[]	getPlanarAdjList(java.lang.String filename) This function implements fig 3.5 fo the book planar graph drawing.
void	setAdjList(java.lang.String filename, GraphNode[] graphNode) This function outputs a graph in txt file.
void	writePlanarGraph(java.lang.String filename, GraphNode[] graphNode, GraphNode[] nodelist)
void	writeSchnyder(java.lang.String filename, GraphNode[] graphNode, GraphNode[] nodelist, int[][] array)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

LoadGraph

public LoadGraph()

Method Detail

getAdjList

public GraphNode[] getAdjList(java.lang.String filename)

This function implements simple one way adjacent list (not circular). Any index of the returned GraphNode[] indicates the adj list is of that particular node. The right node in a list can be accessed by getnextNode().

Parameters:

filename - String

Returns:

GraphNode[]

getPlanarAdjList

public GraphNode[] getPlanarAdjList(java.lang.String filename)

This function implements fig 3.5 fo the book planar graph drawing. Any index of the returned GraphNode[] indicates the adj list is of that particular node. The right node in a list can be accessed by getnextNode(). The left node in a list can be accessed by getpreviousNode(). The interlinked node in a list can be accessed by getbottomNode(). The duble circular loob back node in a list can be accessed by gettopNode().

Parameters:

filename - String

Returns:

GraphNode[]

getNodeList

public GraphNode[] getNodeList(GraphNode[] graphNode)

get node list from planar adjacent list Nodelist[i] contains node i

Parameters:

graphNode - GraphNode[]

Returns:

GraphNode[]

setAdjList

public void setAdjList(java.lang.String filename,
                       GraphNode[] graphNode)

This function outputs a graph in txt file. the first line is total node number and next the traditional adj list follows.

Parameters:

filename - String

graphNode - GraphNode[]

writePlanarGraph

public void writePlanarGraph(java.lang.String filename,
                             GraphNode[] graphNode,
                             GraphNode[] nodelist)

writeSchnyder

public void writeSchnyder(java.lang.String filename,
                          GraphNode[] graphNode,
                          GraphNode[] nodelist,
                          int[][] array)