Package edu.byu.ece.edif.util.graph

Provides a variety of data structures and algorithms for creating and manipulating graphs based on a Edif cell structure

See:
Description

Interface Summary

EdifCellInstanceCollection	A Collection of EdifCellInstances.
EdifPortRefEdge	Represents an edge corresponding between two different EdifPortRef objects.

Class Summary

AbstractEdifGraph	An abstract class that represents an EdifCell as a Graph data structure.
CustomGraphToDotty
EdifCellBadCutGroupings
EdifCellDFS	A depth first search algorithm using the EDIF classes only.
EdifCellInstanceCollectionGraph	A graph view of an EdifCell object in which the graph nodes are collections of instances (EdifCellInstanceCollection objects).
EdifCellInstanceCollectionLink	An EdifLink class used in EdifCellInstanceCollectionGraph to show the connections between nodes (any object).
EdifCellInstanceEdge	Represents a mathematical graph edge between a source EdifPortRef object and a sink EdifPortRef object associated with a single EdifNet object.
EdifCellInstanceGraph	Provides a mathematical graph view of an EdifCell.
EdifCellInstanceGroupings	This class organizes EdifCellInstances into logical groups.
EdifOutputPortRefGraph	Provides a mathematical graph view of an EdifCell that uses EdifPortRef objects as nodes of the graph.
MultipleInstanceCollection
ObjectPortRefMap	Provides a mapping between EdifCellInstance and top-level EdifSingleBitPort objects and EdifPortRef objects
SCCInfo	This class holds the information about the Strongly Connected Components in an EdifCell in String format.
SingleInstanceCollection
SingleInstanceIterator
SourceEPREdge	Allows sink object to be different from sink EPR.

Enum Summary

CustomGraphToDotty.ArrowHead
CustomGraphToDotty.Color
CustomGraphToDotty.Shape
CustomGraphToDotty.Style

Package edu.byu.ece.edif.util.graph Description

Provides a variety of data structures and algorithms for creating and manipulating graphs based on a Edif cell structure

The graphs supported in this package are all based on the Ptolemy graph package. This Java graph package provides a representation of both undirected and directed graphs. In addition, it provides a variety of graph algorithms for analyzing and manipulating graphs.

This package provides the following functionality:

• A variety of graph data structures based on the EdifCell object
• A number of algorithms for analyzing such graphs
• The capability of generating .dot files for visualizing these graphs

The following graphs will be supported in this package:

• DepthFirstSearchGraph This is a DirectedGraph object representing a forest of spanning trees when performing an efficient depth-first search.
• EdifPortConnectivityGraph Represents connectivity between top-level ports of an EdifCell. This graph is created directly from an EdifCell without any other graph structures. The Nodes of this graph have as weights Collections of EdifSingleBitPort objects. The edges represent connectivity between top-level input and output ports.

  TO DO: This class is messy and needs to be cleaned up. Get rid of PortRefCollection objects. Create the connectivity graph from some form of a non-hierarchical topology graph.

Notes

This file, especially the portion below, needs significant revision and updating!

• DGHelper: Need to remove dependencies and move to unused gplk directory
• MinLoopCutSet: Move to gplk
• FeedbackTMR: Move to gplk
• EdifCellFlattenGraph:
  • Nodes = EdifSingleBitPort objects (port), EdifCellInstance, EdifNet
  • Edges = between Nodes of type EdifSingleBitPort and Nodes of type EdifNet
  • To get rid of:
    • Create a new non-hierarchical EdifGraph
    • Create a new byucc.edif.tools.tmr.FlattenTMR
      • Performs flatten without using graphs
      • Creates a EdifGraph object from flattened cell
      • Does all of the cutting in this graph
      • Calls Xilinx TMR
    • Get rid of other related classes
• EdifCellFlattenGraph
  • FlattenHyperEdge
  • GraphFlattenEdifCell
  • EdifCellInstanceNodeWeight
• EdifDirectedGraphToDotty
  • EdifCellNodeWeight
  • GraphEdifCell
  • EdifGraphNodeWeight
  • EdifNetNodeWeight
  • EdifSingleBitPortNodeWeight
  • PortRefCollection
• EdifCellTopologyGraph
  • Nodes:
  • Edges:
  • (need to clean up FeedbackTMR and XilinxTMR with this graph)
• GraphEdifCell