Man pages for MiloMonnier/supplynet
Supply network design and robustness assessment tools

addRandomEdgesAdd random edges to a supply network
adjustAvgDegreeAdjust the average degree of a supply network
aggregateVerticesAggregate vertices of a graph
applyCascadingFailuresApply cascading failures to a supply network
AVG_DEFAeverage Delivery Efficiency
avgInvSPLAverage inverse supply path length
avgSPLAverage Supply-Path Length (SPL)
dagDensityDensity of a Directed Acyclic Graph (DAG)
deleteIntermediariesDelete less-important intermediaries of a supply network
deleteMultipleEdgesDelete multiple edges of a graph
deleteRandomEdgesDelete random edges from a supply network
efficiencyLMLatora and Marchiori efficiency
efficiencyReSupply network reachability-efficiency
firstImprovementGraph Rewiring First Improvement Optimization Algorithm
floydAlgoCompute length of shortest path between each pair of points.
generateSupplyNetGenerate theoretical supply network
getBridgesGet bridges edges of a graph
getEdgesGet edges from a graph
getVerticesGet vertices from a graph
lengthenShortEdgeTurn a short supply chain into a long supply chain
nbSupplyChainsOverall number of supply chains in a supply network
neighborsDegreeSummarize degree sequence of a vertex neighbors
normEntropyNormalized entropy of a distribution
reachabilitySupply network reachability
relativeDegreeVertex relative degree
rewireEdgeRewire origin or destination of an edge
robustnessGraphAnalysis of supply network robustness
robustnessGraphAggAnalysis of aggregated supply network robustness
SARSupply Availability Rate
shortEdgesRateShort supply chains edges rate
simulatedAnnealingGraph Rewiring Simulated Annealing Improvement Optimization...
supplyTransitivityVertex supply transitivity (for intermediaires)
swapEdgesSwap two edges of a supply network
tomato_anonymSpatial network of Montpellier city supply in tomato
updateGraphAttributesUpdate vertices and attributes of a graph
MiloMonnier/supplynet documentation built on Feb. 16, 2021, 8:03 p.m.