Package util

Class ScheduleGrph

java.lang.Object

grph.Grph

grph.in_memory.InMemoryGrph

util.ScheduleGrph

Direct Known Subclasses:

PartialScheduleGrph

public class ScheduleGrph
extends grph.in_memory.InMemoryGrph

This extends the InMemoryGrph to provide additional fields, such as the properties we need for this particular problem.This extends the InMemoryGrph to provide additional fields, such as the properties we need for this particular problem

Author:

Eugene

See Also:

Serialized Form

Nested Class Summary

Nested classes/interfaces inherited from class grph.Grph

grph.Grph.DIRECTION, grph.Grph.MaxIndependentSetAlgorithm, grph.Grph.MinVertexCoverAlgorithm, grph.Grph.TYPE

Field Summary

Fields inherited from class grph.Grph

adjacencyMatrixAlgo, allClusteringCoefficientsAlgorithm, avgClusteringCoefficientAlgorithm, avgDegreeAlgorithm, bfsAlgorithm, bipartiteAlgorithm, branchingMinimumVertexCoverAlgorithm, bruteForceMinimumVertexCoverAlgorithm, centerAlgorithm, chordalAlgo, COMPILATION_DIRECTORY, complementAlgorithm, completenessAlgorithm, connectedComponentsAlg, connectednessAlgorithm, densityAlgorithm, diameterAlgorithm, FominGrandoniKratschMaximumindependentSetAlgorithm, girthAlgorithm, HOSTS, inacessibleVertices, incidenceMatrixAlgo, inNeighborsAlgorithm, inOutNeighborsAlgorithm, irreflexiveAlgorithm, isCyclicAlgorithm, isolatedVerticesAlgorithm, lineGraphAlg, logger, LPMaximumindependentSetAlgorithm, LPMaxMatchingAlgorithm, LPMinVertexCoverAlgorithm, maxInEdgeDegreeAlgorithm, maxInVertexDegreeAlgorithm, maxOutEdgeDegreeAlgorithm, maxOutVertexDegreeAlgorithm, minInEdgeDegreeAlgorithm, minInVertexDegreeAlgorithm, minOutEdgeDegreeAlgorithm, minOutVertexDegreeAlgorithm, multigraphnessAlgorithm, NiedermeierMinimumVertexCoverAlgorithm, outNeighborsAlgorithm, radiusAlgorithm, reflexivityAlgorithm, regularityAlgorithm, simplenessAlgorithm, tarjanSCC, topologicalSortingAlg, treenessAlgorithm, trianglesAlgorithm, twoSweepDiameterAlg, unweightedDistanceMatrixAlgorithm, unweightedPredecessorMatrixAlgorithm, useCache, vertexAdjacenciesAsIDSetsAlgorithm, vertexListAlgorithm

Constructor Summary

Constructors

Constructor	Description
ScheduleGrph()	No arg constructor for ScheduleGrph, initializes with empty weights, task starts and processor assignments

Method Summary

Modifier and Type	Method	Description
ScheduleGrph	cloneSelf()	Clone this ScheduleGrph
boolean	dependenciesValid(ScheduleGrph input)	Check if this ScheduleGraph is valid with regards to tasks only starting after their dependencies and dependency transfer (if on diff processors) are finished.
int	getBottomLevel()	Get the bottomLevel time of this ScheduleGraph
grph.properties.NumericalProperty	getEdgeWeightProperty()	Get the NumericalProperty containing assigned edge weights
grph.properties.NumericalProperty	getVertexProcessorProperty()	Get the NumericalProperty containing assigned task processors
grph.properties.NumericalProperty	getVertexStartProperty()	Get the NumericalProperty containing assigned task starts
grph.properties.NumericalProperty	getVertexWeightProperty()	Get the NumericalProperty containing assigned task weights
it.unimi.dsi.fastutil.ints.IntSet	getVerticesForProcessor(int i)	Get a set of all the tasks assigned to a processor
void	setEdgeWeightProperty(grph.properties.NumericalProperty edgeWeights)	Set the NumericalProperty containing assigned edge weights
void	setVertexProcessorProperty(grph.properties.NumericalProperty vertProcs)	Set the NumericalProperty containing assigned task processors
void	setVertexStartProperty(grph.properties.NumericalProperty vertStarts)	Set the NumericalProperty containing assigned vertex starts
void	setVertexWeightProperty(grph.properties.NumericalProperty vertWeights)	Set the NumericalProperty containing assigned vertex weight
java.lang.String	toDot()	Return a string containing the .dot representation of this schedule

Methods inherited from class grph.Grph

addDirectedSimpleEdge, addGraph, addHyperEdge, addNVertices, addSimpleEdge, addSimpleEdge, addUndirectedSimpleEdge, addVertex, addVertices, areEdgesAdjacent, areVerticesAdjacent, bfs, bfs, bfsList, chain, clear, clearCache, clique, clique, clone, computeMaxFlow, connectToKClosestNeighbors, contains, containsAPath, contractEdge, contractVertices, contractVertices, createSwingRenderer, dgrid, disconnect, disconnectVertex, display, displayGraphstream_0_4_2, displayImg, displayReport, displaySVGSalamander, dring, ensureNVertices, equals, equals, findAlgorithm, findPropertyByName, fromCaidaMap, fromGraphML, fromGraphML, fromGrphBinary, fromGrphText, fromGrphTextFile, getAdjacencyMatrix, getAllCycles, getAllInEdgeDegrees, getAllOutEdgeDegrees, getAllPaths, getAverageClusteringCoefficient, getAverageDegree, getAverageDegree, getBipartiteSubgraphInducedByVertices, getCenter, getCircleStar, getCliques, getClusteringCoefficient, getClusteringCoefficient, getClusteringCoefficientDistribution, getComplement, getConnectedComponentContaining, getConnectedComponents, getCutEdges, getCutSize, getDefaultNumberOfThreads, getDegreeDistribution, getDensity, getDescription, getDiameter, getDifference, getDistanceMatrix, getEccentricity, getEccentricity, getEdgeColorProperty, getEdgeDegree, getEdgeLabelProperty, getEdgeNature, getEdgePairs, getEdgesAdjacentToEdge, getEdgesConnecting, getEdgesIncidentTo, getEdgeStyleProperty, getEdgeWidthProperty, getFartestVertex, getFartestVertex, getFringes, getGirth, getGpmetisPartitionning, getGpmetisPartitionning, getInaccessibleVertices, getIncidenceMatrix, getInducedSubgraphIsomorphism, getInEdgeDegree, getInEdges, getInNeighborhoods, getInNeighbors, getInNeighbours, getInOnlyEdges, getInOutOnlyEdges, getInVertexDegree, getIsolatedVertices, getKClosestNeighbors, getKShortestPaths, getLargestConnectedComponent, getLineGraph, getLineGraph, getLocalClusteringCoefficients, getLoops, getMaximumClique, getMaximumIndependentSet, getMaximumIndependentSet, getMaximumMatching, getMaxInEdgeDegrees, getMaxInVertexDegrees, getMaxOutEdgeDegrees, getMaxOutVertexDegrees, getMinimumVertexCover, getMinimumVertexCover, getMinInEdgeDegrees, getMinInVertexDegrees, getMinOutEdgeDegrees, getMinOutVertexDegrees, getNeighborhoods, getNeighbors, getNeighborsAtMaxDistance, getNeighbours, getNeighbours, getNeighbours, getNeighboursAtMostKHops, getNumberOfDirectedEdges, getNumberOfEdges, getNumberOfHyperEdges, getNumberOfSimpleEdges, getNumberOfTriangles, getNumberOfUndirectedEdges, getNumberOfVertices, getOppositeEdges, getOrder, getOutEdgeDegree, getOutEdges, getOutNeighborhoods, getOutNeighbors, getOutOnlyEdges, getOutVertexDegree, getPageRanking, getPartialSubgraphIsomorphism, getProperties, getRadius, getShortestCycle, getShortestPath, getShortestPath, getSimplicialVertices, getSinks, getSize, getSomeEdgeConnecting, getSources, getSpanningTree, getStronglyConnectedComponents, getSubgraphInducedByEdges, getSubgraphInducedByVertices, getTopologyListeners, getTwoSweepBFSDiameterApproximatedDiameter, getVersion, getVertexColorProperty, getVertexDegree, getVertexDegree, getVertexLabelProperty, getVertexShapeProperty, getVertexSizeProperty, getVerticesAccessibleThrough, getVerticesAccessibleThrough, getVerticesIncidentToEdge, getVerticesOfDegree, getVerticesOfDegree, getVerticesOfDegreeAtLeast, glp, grid, grid, hasCycles, hasLoop, hasLoops, hasMultipleEdges, highlight, highlight, highlight, highlight, highlightEdges, highlightEdges, highlightVertex, highlightVertices, highlightVertices, highlightVertices, highlightVertices, isAntigraph, isBipartite, isChordal, isClique, isComplete, isConnected, isCut, isCut, isCyclic, isDirected, isDirectedSimpleEdge, isDirectedSimpleGraph, isDominatingSet, isHyperEdge, isHypergraph, isIndependentSet, isIrreflexive, isIsomorphicTo, isLeaf, isLoop, isMatching, isMixed, isNull, isReflexive, isRegular, isSimple, isSimpleEdge, isSimplicial, isSink, isSource, isStronglyConnected, isTree, isTrivial, isUndirectedSimpleEdge, isUndirectedSimpleGraph, isVertexCover, listCachingGraphAlgorithms, loadOnlineGrph, merge, performRandomTopologicalChange, postOnTheWeb, prune, removeEdges, removeVertices, removeVertices, removeVertices, report, revertEdge, ring, ring, ring, rnws, rnws, search, setEdgesColor, setEdgesLabel, setEdgesStyle, setEdgesWidth, setVerticesColor, setVerticesLabel, setVerticesShape, setVerticesSize, sortTopologically, sortVerticesByDegree, stepMonitor, toEdgeList, toGraphML, toGraphStream_0_4_2_AWTComponent, toGraphviz, toGraphviz, toGrphBinary, toGrphText, toString, toString_elements, toTextADJ, toUndirectedGraph, undirectionalizeEdge

Methods inherited from class grph.in_memory.InMemoryGrph

addDirectedHyperEdge, addDirectedSimpleEdge, addToDirectedHyperEdgeHead, addToDirectedHyperEdgeTail, addToUndirectedHyperEdge, addUndirectedHyperEdge, addUndirectedSimpleEdge, addVertex, containsEdge, containsVertex, getDirectedHyperEdgeHead, getDirectedHyperEdgeTail, getDirectedSimpleEdgeHead, getDirectedSimpleEdgeTail, getEdges, getID, getInOnlyElements, getInOutOnlyElements, getNavigation, getNextEdgeAvailable, getNextVertexAvailable, getNumberOfDirectedHyperEdges, getNumberOfDirectedSimpleEdges, getNumberOfUndirectedHyperEdges, getNumberOfUndirectedSimpleEdges, getOneVertex, getOutOnlyElements, getTheOtherVertex, getUndirectedHyperEdgeVertices, getVertices, isDirectedHyperEdge, isDirectedSimpleEdge, isUndirectedHyperEdge, isUndirectedSimpleEdge, main, removeEdge, removeEdge, removeFromDirectedHyperEdgeHead, removeFromDirectedHyperEdgeTail, removeFromHyperEdge, removeVertex, storeEdges

Methods inherited from class java.lang.Object

getClass, hashCode, notify, notifyAll, wait, wait, wait

Constructor Detail

ScheduleGrph

public ScheduleGrph()

No arg constructor for ScheduleGrph, initializes with empty weights, task starts and processor assignments

Method Detail

setVertexStartProperty

public void setVertexStartProperty(grph.properties.NumericalProperty vertStarts)

Set the NumericalProperty containing assigned vertex starts

Parameters:

vertStarts - The NumericalProperty to set as

setVertexWeightProperty

public void setVertexWeightProperty(grph.properties.NumericalProperty vertWeights)

Set the NumericalProperty containing assigned vertex weight

Parameters:

vertWeights - The NumericalProperty to set as

setVertexProcessorProperty

public void setVertexProcessorProperty(grph.properties.NumericalProperty vertProcs)

Set the NumericalProperty containing assigned task processors

Parameters:

vertProcs - The NumericalProperty to set as

setEdgeWeightProperty

public void setEdgeWeightProperty(grph.properties.NumericalProperty edgeWeights)

Set the NumericalProperty containing assigned edge weights

Parameters:

edgeWeights - The NumericalProperty to set as

getVertexStartProperty

public grph.properties.NumericalProperty getVertexStartProperty()

Get the NumericalProperty containing assigned task starts

Returns:

getVertexWeightProperty

public grph.properties.NumericalProperty getVertexWeightProperty()

Get the NumericalProperty containing assigned task weights

Returns:

getVertexProcessorProperty

public grph.properties.NumericalProperty getVertexProcessorProperty()

Get the NumericalProperty containing assigned task processors

Returns:

getEdgeWeightProperty

public grph.properties.NumericalProperty getEdgeWeightProperty()

Get the NumericalProperty containing assigned edge weights

Returns:

toDot

public java.lang.String toDot()

Return a string containing the .dot representation of this schedule

Overrides:

toDot in class grph.Grph

cloneSelf

public ScheduleGrph cloneSelf()

Clone this ScheduleGrph

Returns:

getBottomLevel

public int getBottomLevel()

Get the bottomLevel time of this ScheduleGraph

Returns:

getVerticesForProcessor

public it.unimi.dsi.fastutil.ints.IntSet getVerticesForProcessor(int i)

Get a set of all the tasks assigned to a processor

Parameters:

i - the processor to look at

Returns:

dependenciesValid

public boolean dependenciesValid(ScheduleGrph input)

Check if this ScheduleGraph is valid with regards to tasks only starting after their dependencies and dependency transfer (if on diff processors) are finished. Note that this method does not check if tasks overlap on the same processor

Parameters:

input - The full ScheduleGraph read as input used to generate this version

Returns: