Hi
Iāve implemented a procedure similar to yours for studying that classifies the connections of a network according to their importance in maintaining adequate connectivity between all the pairs origindestination. The aim of the work was to answer the following question: which are the most critical links for a mountainous road network? The network model includes all roads except local roads and is composed of 1,607 nodes (of which 293 represent centroids, 726 junctions, and 588 represent a
change in the road geometric features) and 3,500 bidirectional links.
Going into more detail, link flows have been first simulated for the base scenario
(undamaged network) to calculate
totaltrip cost for the undamaged network. The software then allowed me to rerun the assignment procedure, each time removing a bidirectional
link j, calculating link flows and totaltrip cost for the damaged network; in
the case where the link j was a cut link, the software also provided the unassigned
demand. The specific link was not phisically removed but simply add to a Group excluded from essingment.
main steps of procedure:
 create a LOOP app
the loop variable name is id_loop and varies from 1 to the max link number (in my case 3500)
in the input network each link has been coded with an ID number and a field namend CLOSED1. ID number
and CLOSED1 must be the same wtin non interval between links.
 the highway script is the following and permit to close one link at time and assing:
UN PGM=HIGHWAY PRNFILE=āE:\lavori\2010\0310  prov di bz\CUBE\BASE\EX_MULTI_ASSEGNAZIONE_DUE\DAM_TON\MAHWY00D.PRNā MSG=ādue Highway Assignmentā
FILEI NETI = ā¦RC_VUL.NET"
FILEI MATI[1] = ā¦\POST_STIMA_F_R1.MAT"
FILEO NETO = ā¦DAM_DUE.NET"
FILEO MATO[1] = ā¦COST.MAT",
MO=13 NAME=COST_TOT TIME DISTANCE
TURNS N=199999
PARAMETERS MAXITERS = 99 GAP=.00001
PARAMETERS COMBINE = EQUI, GAP = 0.001, maxiters=99
PARAMETERS COMBINE = EQUI, GAP = 0.01, maxiters=99
PROCESS PHASE=LINKREAD
; USE THE USER SUPPLIED ALPHA AND BETA FOR THE BPR CURVE
; LW.ALPHA={alpha}
; LW.BETA={beta}
;distance=li.distance/1000
LINKCLASS=LI.CURVA
C=LI.CAPACITY
T0=li.distance/li.speed60
;time=li.time
If (LI.CLOSED1=@ID_LOOP@) ADDTOGROUP=1
ENDPROCESS
PROCESS PHASE=ILOOP
PATHLOAD PATH = TIME VOL[1]=MI.1.1, EXCLUDEGROUP=1, MW[2]=PATHTRACE(TIME), MW[3]=PATHTRACE(LI.DISTANCE), MW[11]=MW[2]MI.1.1
MW[11][I]= 0
MW[1] = MW[11]
MW[2][I] = 0
MW[3][I] = 0
ENDPROCESS
PROCESS PHASE=ADJUST
FUNCTION TC[1]=T0
FUNCTION TC[2]=T0(1+1((V/10)/Ā©)^3) ; congested time equation
FUNCTION TC[3]=T0(1+3((V/10)/Ā©)^6) ; congested time equation
ENDPROCESS
ENDRUN**

Matrix was used to calculate total_cost and demand not assigned for each assignement end write in record file
(matrix#35)

before the end of each loop, wrote the total_cost into and not assigned demand into a specific network field (network #5)

at the end of loop you will have 3500 network assignend and you can aggregate into one using
a new ILOOP procedure. Final network will be the first āundamagedā with 2 new field contaning total_cost and not assigned demand related to the specific link
i hope this cal help you, procedure is really complex but it vary fast and powerful. I have tryied with other software but only cube allows this approch. If you like
you can read results of my works here:
The Evaluation of Road Network Vulnerability in Mountainous Areas: A Case Study
Federico Rupi, Silvia Bernardi, Guido Rossi & Antonio Danesi
Networks and Spatial Economics A Journal of Infrastructure Modeling and Computation
ISSN 1566113X