Examples of ptolemy.graph.analysis.SingleSourceLongestPathAnalysis

ptolemy.graph.analysis.SingleSourceLongestPathAnalysis
An analysis to find the longest path from a single source to all the other nodes in a directed graph. In a graph with multiple edges between two nodes the one with the largest associated value is being considered for the longest path.
@since Ptolemy II 4.0 @Pt.ProposedRating Red (shahrooz) @Pt.AcceptedRating Red (ssb) @author Shahrooz Shahparnia @version $Id: SingleSourceLongestPathAnalysis.java,v 1.17 2005/07/08 19:59:02 cxh Exp $

                } else {
                    delayGraphProfitMap.put(edge, edgeProfitsMap.get(edge));
                }
            }


            SingleSourceLongestPathAnalysis longestPath = null;
            longestPath = new SingleSourceLongestPathAnalysis(thisRoundGraph,
                    delayNode, new ToDoubleMapMapping(delayGraphProfitMap));
            D.put(delayNode, longestPath);
        }


        _makeFirstOrderLongestPathMatrix(D, graphPlusDelaysAsNodes,

View Full Code Here

TOP

Related Classes of ptolemy.graph.analysis.SingleSourceLongestPathAnalysis

ptolemy.graph.analysis.strategy.AllEdgeSingleSourceLongestPathStrategy

ptolemy.graph.analysis.strategy.ParhiMaximumProfitToCostRatioStrategy

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.