MERGEGRAPH-mergeadjacencymatrixesof2graphs[MERGED_GRAPH,INDEXES,NUMNEWNODES]=vlt.graph.mergegraph(G1,G2,NODENUMBERS2_1)CreatesamergedgraphfromtwooverlappingadjacencymatrixesG1andG2.G#(i,j) is the weight of the connection from nodeitojforeachgraph.NODENUMBERS2_1arethenodeindexvaluesofthenodesofG2inG1.IfanyentriesofNODENUMBERS2_1aregreaterthanthenumberofnodesofG1,thentheyareassumedtobenodesthatarenotpresentinG1,buttheywillbeaddedinthenewgraph.INDEXESisastructurearrayoftheentriesthatmakeupthenewpanelsofthemergedadjacencymatrixMERGED_GRAPH.Thefields'upper_right','lower_left',and'lower_right'havetheindexvaluesofG2thataretakentofilloutthegraph.For'lower_right',thematrixissquareandfull,andtheindexvaluesarethelocationsinG2.For'lower_left'and'upper_right',thematrixesmaybesparseiftherearenodesinG1thatarenotinG2.Sotheindexvalueshavetwofields:'merged'(theindexvaluesofthepanelinthemergedmatrix)and'G2'(thecorrespondingindexvaluesinG2).Anyconnectionthatis'open'willhaveweightInf.Notethatinperformingthismerge,theconnectionsamongthenodesofG1areNOTmodified.Sothisfunctionisnotameansofprovidingadditionalinformationabouttheconnectivityofthosenodes.Seealso:DIGRAPHExample:G1=[111;010;001];G2=[11;01];nodenumbers2_1=[14];[G3,indexes,numnewnodes]=vlt.graph.mergegraph(G1,G2,nodenumbers2_1);lower_right=G2(indexes.lower_right);lower_left=inf(numnewnodes,size(G1,1));upper_right=inf(size(G1,1),numnewnodes);lower_left(indexes.lower_left.merged)=G2(indexes.lower_left.G2);upper_right(indexes.upper_right.merged)=G2(indexes.upper_right.G2);G4=[G1upper_right;lower_leftlower_right];G3==G4%itdoes