de.cau.cs.kieler.klay.force.graph
Class FGraph

java.lang.Object
  extended by de.cau.cs.kieler.core.properties.MapPropertyHolder
      extended by de.cau.cs.kieler.klay.force.graph.FGraph
All Implemented Interfaces:
IPropertyHolder

public class FGraph
extends MapPropertyHolder

A graph for the force layouter.

Rating red

Constructor Summary
FGraph()
           
 
Method Summary
 void calcAdjacency()
          Calculate the adjacency matrix of the graph.
 List<FBendpoint> getBendpoints()
          Returns the list of bend points for this graph.
 int getConnection(FParticle particle1, FParticle particle2)
          Determines the amount of connection between the two given particles, considering the priority value of the respective edges.
 List<FEdge> getEdges()
          Returns the list of edges for this graph.
 List<FLabel> getLabels()
          Returns the list of labels for this graph.
 List<FNode> getNodes()
          Returns the list of nodes for this graph.
 Iterable<FParticle> getParticles()
          Returns a list of all particles occurring in the graph: vertices, labels, and bend points.
 
Methods inherited from class de.cau.cs.kieler.core.properties.MapPropertyHolder
checkProperties, copyProperties, getAllProperties, getProperty, getProperty, setProperty
 
Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
 

Constructor Detail

FGraph

public FGraph()
Method Detail

getEdges

public List<FEdge> getEdges()
Returns the list of edges for this graph.

Returns:
the edges

getNodes

public List<FNode> getNodes()
Returns the list of nodes for this graph.

Returns:
the nodes

getLabels

public List<FLabel> getLabels()
Returns the list of labels for this graph.

Returns:
the labels

getBendpoints

public List<FBendpoint> getBendpoints()
Returns the list of bend points for this graph.

Returns:
the bend points

getParticles

public Iterable<FParticle> getParticles()
Returns a list of all particles occurring in the graph: vertices, labels, and bend points.

Returns:
iterable over all particles

getConnection

public int getConnection(FParticle particle1,
                         FParticle particle2)
Determines the amount of connection between the two given particles, considering the priority value of the respective edges.

Parameters:
particle1 - first particle
particle2 - second particle
Returns:
the amount of connection

calcAdjacency

public void calcAdjacency()
Calculate the adjacency matrix of the graph.