From cd881ec3883840453ab00ff092d5c706f7ef6133 Mon Sep 17 00:00:00 2001 From: rsdpisuy Date: Fri, 21 Aug 2015 15:59:27 +0300 Subject: [PATCH 01/15] Update generated documentation for version 0.0.1-beta --- content/img/github-blue.png | Bin 0 -> 817 bytes content/img/github.png | Bin 0 -> 806 bytes content/style.css | 224 +++++++++++++++++++++++++++++++++++ content/style.css.bak | 193 +++++++++++++++++++++++++++++++ content/style_light.css | 225 ++++++++++++++++++++++++++++++++++++ content/tips.js | 46 ++++++++ img/logo-template.pdn | Bin 0 -> 15052 bytes img/logo.png | Bin 0 -> 1581 bytes index.html | 119 +++++++++++++++++++ license.html | 111 ++++++++++++++++++ release-notes.html | 65 +++++++++++ tutorial.html | 79 +++++++++++++ 12 files changed, 1062 insertions(+) create mode 100644 content/img/github-blue.png create mode 100644 content/img/github.png create mode 100644 content/style.css create mode 100644 content/style.css.bak create mode 100644 content/style_light.css create mode 100644 content/tips.js create mode 100644 img/logo-template.pdn create mode 100644 img/logo.png create mode 100644 index.html create mode 100644 license.html create mode 100644 release-notes.html create mode 100644 tutorial.html diff --git a/content/img/github-blue.png b/content/img/github-blue.png new file mode 100644 index 0000000000000000000000000000000000000000..57432a035c7f20cf128620849ab94f969e0ec853 GIT binary patch literal 817 zcmV-11J3-3P)Px#1ZP1_K>z@;j|==^1poj532;bRa{vGmbN~PnbOGLGA9w%&02*{fSaefwW^{L9 za%BKeVQFr3E>1;MAa*k@H7+qRNAp5A0007@Nklr)FLcgCVo9Pvg?e5tk=Ui)SuA%` z>1o4{wxPwR%9U~5+L&%ls#w8NV|1j`86;G9ye0XMMwbNvLCEIXB3@X_<9QM&PQ##< zqjvVS5ApIs!iII1N(E2-&H!NYBC#h43k zgdD-4Boe98n`5jHN6wiY0k*z6prMIJ09VEeo$e5~y6$7^i`{&aM?`!ec!QkN6JqO= z*GCT;r98GHiIT<I!b@WezA>?4X7&B*H2#4IfluGP|Zy)2P`VAW);lZ4LJLU;QUEVM{r7;1s-7i*wDfKoQ6AJ;^oCSTA zHBVr4VH?6UGQ>idRmGx}1_W}10Je7i-ZaT}xVNcSfC<%htG?KL)VoK%5WvgAYm!Ly vTcJ303H%O3+ok$3c@AwF`ZmL2~800000NkvXXu0mjf^MPk* literal 0 HcmV?d00001 diff --git a/content/img/github.png b/content/img/github.png new file mode 100644 index 0000000000000000000000000000000000000000..5d48d83fab5dfd443c9e3bec2a262537f4ecece8 GIT binary patch literal 806 zcmV+>1KIqEP)Px#1ZP1_K>z@;j|==^1poj532;bRa{vGmbN~PnbOGLGA9w%&02*{fSaefwW^{L9 za%BKeVQFr3E>1;MAa*k@H7+qRNAp5A0007&NklyiRZ_dM+J&{THbRBQ2Kj2Fi3@98KxAP};1Qsq1e#z#5bWXI>-9m9nx-eS z;LglB+?hM`xSRik)nhS zmCyV8bF;H=Ha46NhhuklV|{(jZ1(wl)$3~{K#t_UT3rwOUQwkUZk`IKqA(%lf9*?v0qwene zR;dZU^Lb1hBmT-{IBbo$TCdkjbKAnTx5p?-g#s^De}1#c#Jt$`1kaP~`+!0~W|YN+ z1vu+M0lyz-tjJ5dUD4Bn)qlUeok}JJ)*bM-JkP(~+?2~?Oa*pybcASK2n(SZ9YxLf zfP4*w&?%DfdTmWmps=s3FfucI2FS$Jg@Du3Q_{TeCnq1BPRzGqVgip!q6FWLkHr!& zX;)YD?2JUI5P;7WVpEfo*=#nQPNP$}DUAsbPaLsNZa0mIg#c*bUTA@7W(JmQY?D|B zyXtniXh1-N5P;G~hlfdatg$pyLHs(6CL9h^?=6~z08Ezm;NY3XlFQ|&OTf=``nkmt k3iYH( z$r7Civr>vs-mv-H;J*5Sx`76r#yC(909tL|hCx(Ol=9hzK~k!ijrS?!n8AHn0`vvS zfXl(;t;*%aLn%1KC{LbRVM8EmRJlV^*kz=Z2dg#W#RC9h6+}H{#A+`BIV_|Bl|Gep zxnz!Fq1sE7f>SZ7tWXd=O4VeuQi&4pP(A>?Iy@8r31^Bn#WW~i(GYe$sm@iRnncOz zKua-;T~|yicQ2L!LD)(K;AoN!K$I_lRuIU>5KbEtP}`_X)!=jyrUXUABPK(kqBFw~ zN$Fxlyc7!-H5oxr3(AL{9LPH0G=>GDObA6p%ms5eV#jd=h9u=@4|5O*2@nXT>?x38 z*h)F0N2#I^;_0HgREmVdx`aoq(IXLc%)!AFO^0zkRgAbS33ZZIsVrq#rB*{I8UO<( z1WU$Bu`y&yZ#iFLnn8ByCR}3n3G7`~KdXuSI)zY|~G7?5C6g4K3YE#T^4X9Kq zK!@Wl$Y|#=K2Q-Dj=|v&uVch&Mhl``#uqFWRc4hYug6FoR$!s9la*~{nH5d#kJOEYk5(E_~4nhzJL@OZbg;Yoy)MG9ymsa@n`<xB{s56T#pf-uzK;#?s+Ye2vd!$5e% zUD2BpX$wpF(vI5uC=_Dy6|>s!bXHV`pc9OF6){6Lkx4-?igbQvM_W-1y_YczfnXt9GhSEv9f zA09WU)j0_ji&O|U;tnU|!vjbF51s39wT3vajPszOT#~Us z!5T6kP|WG#DNce*CQXj8YXQs+ zHzItx1Yju4x+%`eV>pyUp@K%ssA)#Pcu;{m2;rz1baAmD$4EGYg)45ts@2D1fSt^g zy)tA)3@8B;6;rGN^O)0zLy;QxYz40ui|_%f4slrvZqDpwLI#gmDpfI4v|LuJlfj_C z%Kk(U;5kh?N#PD1;F8g<~Zd3Mo=FCKx`X^)lIDwunX8AnJ;yIUg)jAOh2H=k$o3 z36PwO+YxszqxDgGP;FMrPBpJ_&S>e*?p0`$ObSG5<(1)DERipO(v5v4};H!Ce_NCQJIZqR4SFy8LF5I zq9#9Hz~V8*?rAi%kBr51@kp$K%O>6&!Z94Qvlyz_-JH{v3kPt5NjcMnLX37;6f>z) z$z~~J^GOzik<_Itl|Vw52LKltU@O%EV3JftokmjmQP2aEoQMM{&L6>yS#Jb4O3F;M zDwz_J?m(cTmI~R7->=pIlvkl#*6MT-GOnUk@v@=hjO22e3|*4qpoYZdJfcB^umpH$ zF;#H}fTWEwn=M|AY^MG8XhkK)3eH?Q9ZYBev&-q!8T4M+4Oz=(vk3aYl0ov@lQ~N^ zQ$@k3o#aX>KrU3|q(2^usiK;&9!fg3ISl|9WTV?wi2Ai6f{08A_Tagct?D-=5f_$_ z!WLSz;c9&}kwlCvVnqn6ZAw45)~^uIOU_upVlufMmT(@* zrLr7>h15cNRjSor6PM=;=sFVzhGIt-28C*6OL5P0DlXDq4 zCTP<|b&(v;leD8!v8a=7+DFrDDy5I+a=MBPYKjH54JfBE4{PFaobeLcc)*qhLR3;0 z*5$)Cvzj%!APml+l$Zg_L7FW}UO^L$!sVD1@p(Pvm;-bLa=}75`nWWcbJ6{yUL9! zu|S&7ILcWb!W;#ZVg$LyzZasMG=Ud+I%dtgZDH2o1j8a}tXAwQ9gl;6&k>-R0-FmO zEVPg;;%QFG*}Vh|GX)$sfV?Xn1u|Y;3@rdsIp#NdEbzlgJlyVT)FR5?-TG zBWEd_8&`!5o~(jR3=boAGOqEtxkOrsDu^=?YOBSQHCBx|4@8J!9JGsimsOCl3R4PT zri3*UjQXUAs%Vl(Td=6F7!6J|rZZZ+fYL85<0+KlHW$fz?8TG^&aif-c^&Ds^O~X=Z~=@5 zO>jXa05M>;tkE8KW+guk`OvC2V}xQ3jF)2wc8Cduf}lpS z31OIrQPzm_VV@SPTAXPioX^0 zNkmgo6|2TEI2uHX79t#1qC`+*E0+~v3WCid>tQayd#OGSp$lSmjN90(VJ1&oUU<^YTF8Zj9*#zIUk zV3h?xWj9s1pho2fDNR{tEihVhDUWI_T8o%KOvXwj3DtrVwKZup@IV&jGhVZ`h{bI< znWfzlfyFe6`YQ^8Lp&KKN|GB#A)i?ZZGu1q@eqn%w#VXOwbhCtfkId<(?HNqD5l;J zu6m_pSww-9lZ(X&RW9!Lo1{=EXQAXEnpHM55hfcEqzWY&3nki+!h!`GYJniP6OLJF zXNhA&MbR&6g=p;i`S=7PIKe7W)#n60grGpsV+hB} zdPJWn;!&{_HZm1KPZX5c)G1nnI+@iGq?1BIcADlxWL zq87EHav_f=Trm@0aBx`MoU-87Tt$FQyj7iW8}kC8PT@sK*$>-e2&U|acvlgjb+ICc!d=qDt%bg=xVVV@yd~ z6i%UV4Dm>M3*(7-RaF;Mg$$OGTW9qO9Pc3h*MdvQ4P+5V8E%!$Wkt1G;dDC02~LQfZZ22_z2WP3OZ8&aUlh} ztfxFqQSY{wc?mK`vU-k%(+;hK@s@nq8OCg3Z^VO?S2KZQ99V*BMd%?;%891jeC3H!|5;W)`D30U+m@A}VGL|dgCL9dp zqWVD0Wn#6Nk{L+SB|?sQa#c#DFQ@Za<=nyyDf=PHz-T#=;1eVpLcCf4^{5doC+VVK z*%HXQgbY=U%X&b;Xg~pAHI>bmVZBaQE{nztr}qbeun(4^YE76(K%N|$<{&5$3Kc!B z1ZfIXQV9bWkp#a#DN-Q{=PfoARu&-Yu})rFa6;r+g`MOvVMh97YfwQ)I!MN(hJT6~aw|fDlbdVOm=( zQ(;IWVIe=v7cEYh#X#0Z=zMvE(xgfXpJ7Wh>_WVxM$$sYm^-Ws6w_|M;&-eeI7h{D zCK!OTQ3tExVglwSSV6!wkdAZYy_7PoBvSO3gDxWKOd!Po0~LCZ z#^VBf3IKoz$zl|54;y&ByW%j47Aem7G_klZW@R#AC=RFyLZ+$`C7WFCND2z8X*nRK zO&Z9~RVi;VtN17z8$i$yV-u66s=Ov>6A!r%yAQ#Mbh26oOfe~Laf9}_LkjAW zaJnea`hs!>00lfQNv&oKXe1#7I1~pc4ws~Y9HVoHz(oo^0Z??W#A9)rN-t}a{jy(U zB&$}h4btY(lHVJNa0$^;$q`0-C8g*P(dC1BF5#y@Ckzsj*6F1R8Y)!`0Tqv3Fa#v4 zA&U~MKV&r#B{A$O6{{6>$|C>;ADUo6b0KWw6OjU7RM^Q?D_Sb-N``$Qcg4jaHdDdi z!lAHM%cUIFOh{IawP?z~lkS)f@e?JE$V)c810oPCXG9AK6~dCREe!Y(lZ)_Jd`KoA zp*(CQA~@}3<%j{b$lhuOFS5A+rlNg(s7Ux2mCG2@Xq?d^t_f8f%321KZe>GcP-JL| zryxzSobUx5MY!jN>@=QG=M9MA=XI6O~n|AhM`ae4y%HWOoEJ+W2`q) z6m&vW2{O@`rzU&GpYgkwJke5;6*Zw)v2_kk+AY{( zl;{;?Fa)DcyC5k>Q{%DcWYz~zHJ){H&9yaD#QwFKv9xWj|2)nz2_?0tTtKCd-21Wvbgi$%xhJCV)M{z%> z^+(7I8Pp~t*$krzlvN79M8%DjbtoOQD%&i-Aq7>Wv?0z^74KL`t2JpZlyF0;NJW8o z3erZ5TAzr-H4zb_F#?b1f^s$)Bzz&WF@RXZsjMInjs(eg3?VZXqv9HU0yd=pfRF4c8COgHXQJ;T zvY0ATDj-Ix;(;`PEvm9ZTLOit(2@?6zsA+ww*QRWo+I_XeW(l|2~Bt)t-G)#Fknu2oh zQ8v)|oPeV?SIS-Wk{D-ac z(-ZDkARZ}tNXnV_B^2y}MyFgMLUb4dV{}0mDwtAEG{HG#X9cjJhb1dMO<5BCe$1>K=mii&1BG~R$sP-m9#qFGt3Yu?Iot!w2AAS! z6BHTNyTZyrK)$5mNGM?i{V`JUM?neY!}c7@2i;EIo$`cOEX~@KqexHC&vFS@*qKU` zDbYczgT5rEQO;eRu#HMpqJC@GY?Pv*sF;vKh%M!I8X*qKF?m#E=rX~>Hc>6vQ*spL zc-o?&vk}Chg)NvVh_ZZvGMLgZ5{@E(Q|olaG6Lw&o9*7HMqjZT$ZCm=r~(M=5)s$| zhhc{jn>&>3iJb+NbVJ3OS5RKt_A{8W)l|a&sKJvg+ssjhagYs}&CszJSXB zMG<6h-#+SwLF%8AQ|h0yUJZ5i%3odGb>*tvYuBweDTUWhvN_3?m%Owz&_+t+fIdIx zyndVV8qfzSW+cUr49?L-Ngy)=`uL0S3`@CaIhg0@+~8a>lWAKce%Ehk=BZ+q&PnZ* zhTpNGjTH-dkxsO`k!@?+nvH9BBM;Z{A8EJFMUfUfw4@w?NF*ZBS+TB7UER$$*LVFj zX?HDQ=VnEz#z=<_x8t&?bRGE9{14UtREP4)DJ3N-X*_YDgU-yUPgbPzLWYh1S{T4Ud;QuA@VMB)1 zn6K-2vr=sS>DN(_Rb9unO3}9V`ahRhtxvlGDJZJB!zu`*Toa^f1X~k!r(eAg*(%-T zSM}13jA$E${C}$F8@i~K9cx(V*j_1Wv#3p{O>NMBr>53)Uu|$0}#=d`KSMGvH}TCIayEoS|BMW{8ww!8H=Lm1lKrqtEH4576s zlv{^T2;Ue%`FDYzMzAv08`RGHOs&&zs2SVcq0~*kqGnd8v{EzwOikh7Cu%orJ6tpH zH>jTanQE8cP&Ku?^WRfdru09hdPi-2)|O94Wl`02>{=`CR*K)<+D$2c;~k*9K>ykx z{`wyx{(HOF>K$rhbo;dl2U#gg7FrE?tAi*A`2sCSEG@Pdi$ap5=sQ{)Rlj(STW-8) zbsV?ec)sC2e(L!PiB@yd=HdThJk_tp_Wxtp8s_f&^%wY!Y1E`q-=V|(zizrQcx(Av z0PI^L@kzjU}ysnplR-`b&<^3bujQvA}Pk5Xw{ zqx^ryRm~E&k1Lo+_zG?M|C)!8;%LDe4Wi1M7qVpLr)rIfRz~ixjag&lKa)!hI=^w^ z?L@_gCg`>zMdkpdv5jK5f1`2_oy{wInoOSJYC^63es)}a6zkrxZ;fJ2QvbcIYmjM^ zQ;t#pW4zG5<~kIPZ)KGX1;sIfk}OHI&lgBaNlABX6@@3CpzCY?q|HA|s8C;jQ;%OO zzZJTz>aNM+XN9-xr^w`Yzeug)14_NV{(9TpiUIoHeBTPPR^v5dL|um(wc1r*gL&&( z=wGYV@Lt2xZ&dzJt)+(jn%dj_UMbqQPOXpj#@Kb&>$fXo*Tz@c>gsC?qm`tpR;#U$ z|3Gp;t)-7rw32*SdH9K>{vRa2{1wTzHIV-g7lzWabz!uvA@#q4b`4h@ly${ODWkq) ziWL2=p;m_koumbUPAJVC>+5Uauj79bRek%Kpj+da+WqE#4kuqTCLKZL6vCw{5rFa9g$hb#)*1e!fHNLz}u2AJr>9`__;8aOd+!R|54f_=mmq|L^rt zd+SFn+iq}NGo`K9ZRuaJGvnbG?)tRLlfFLQLHtcmJwE;MJ~JQhdYh^3F5PwDvCe0{ZE0zLW%P*la<7?}`fNV6v-9}2SN3jr<8sdf`pqky zJvVnNW(9AU(X_gi*fZ8$yTo$LpP?v%dse(~(Zo4+`C|EJayr`jIv za{T+Z^ewONT5Yy{X*fWfIMw0k9qX^`eeLEE?Oq!P{Y4!7^4BdhUmNkYL$&3e6)Re9 zi%!(9z^|-%y2ZbbdBO2+lsWa)>m%RVw0wi=hi=y%{&W8o!-iZRJD}Tl;^o;F%5AU3 zugu?L9((yQ!*z&i)80DsnZqr!nOFLZZr`~p`~A`O{U7SzgL!q@*DIc)OQ-#3KTeMh zf1#ds=kHlQzjw@$URNg{e7x(I_wC-l_trCS9G&y+HvR?i_)V8Tj(<3Ow||EG&ZvFA zJ3C|LjQzJ~K5uSVl&}x8g_t(vI%=oWAAXilc76;Cf-aUfy*q zvtLN9Amt}ihZnTW+jaJt(_Lm$^O!Mzo3Yq%>ew{-)uoG`4ods(=hyF9djFBBGb|0Z zo#*!M690HQUR{p{in14n0R2IY5$uS2JMclPkcVD92mI}7(QU@y-Q1b z77gBE+^*)N!w+`vW*s+tVs=ve@WeNNT)*){uBqEb*MVLKJtyQ9U!EE<7+}`%LxtZqZk#XqHaekZvlD z-TGiD-}S(<3;#;4b>b^~P`$@IJJPxBubS-*e?I|gyL>w?;XF3($D{wYq?5Bh(X?z5 zcw*Jo!t}w5J2^LQUA3fIiafD)$e9hj9@zKb)l0=qx}5pY_{PVz+n2tvQp{C0PT8|` z!uj_v?A#PRxt4siZJrf$ewh=GFO_Lh-)h+8hdV_btccr~=uk^k# za&f22-+^7;9VW83lF54pDf$j#jFa!bb#j8hiB`s%Y6(6uYSU$tw* z$s>>K2CnVpKi{!#R2vyP@X^x?KC1SdvvZT%yI{x38HhOIVD87I%=bUIj*cIFb;`TV z#Y^{mnB4#6!P^haW)^mA**o>N)u;Nd>@_<*sruN0=Dnl(dWK(n9@#c!=J2&co_yf= zkz1a7d*K5s?yfx5c-%f{$dwDtw~W62myfTUPp;c@F_5`q?4(aRzP;yVBj0@D5w`lb zH^wj5KW1-2OSgYE%<<~M(LDj%$1m%Kqk9Z%w!fjG2TZtrU3+oB`TKv^6+PNA?BpZ+ z`~$kZy<_CG!K2?`>H*S1!>7=PIKfk9qd%`;#nqC{*_(i`_ zpDkWJVbavqV&sucLs##;`K{hf_jUTJxZuE}ADS1x_wL4~*Q@o*4-5;hI{2*o+-Ej% zbFbL#-!9+&=)RZwFM42m!)C*`LjNr@Hl|1si4_DT3Gfi)@`8w0V3M@Lqwe_t4b)?PY) zbpNhzmM0o|cYmUT^T3Q-C%-%5N@E>5IW}Sq*znD$ho0;bX%3xU`(hUhS+~67>Z`Ms zWnURI|5~oj^3J#6gWIL)J4QYBWbpG5%a`44yn3*1O0<@xe6Z*7Qe(<5tpTZxOkA6dR(N@x*yqTQe0KNBm@Idb2$7cVY6_WrDcz``x% zCsnI9MhH5+X%({8wAL@AV7NKQl zFJ-MXY&mvv&Zf&RTIPPOX+-W-t-kokg(bt>(?*`8q}O+}_+H$8=eco1_jd2^c~xH2 zIB3ANt-yfKH{2t(KSRHK`1FI~lr~oi`=;cmRZWi`WmH%H1^{#BH{Q2r7b%XM`b6(0 zeB--6&e_p$^3S7~?zd0WU0S(*$L;X69>W%GJ((DP_;37?z87x(NWs?S)Mr=LA5ONs z-Q>Np`RMh3*;;*JVdEZuH}<6E`7duiGBWq4mf#=G_no_X&3y-&Q;V7yR%_u|Z@ z-eEIN)Gxif!m?@3`qCKw_=5EV-u9jNo#WmOJ9o`8pBU3}Yfty_X0*$hslwuh!Oibo ziaxvaN%P4sXKiRY^!>L(&aaxZc=+?fcYo3NP5!}+-Ns!{f7s~n`MhrQ+Ouo^^ss%t zVdcrylLDH|U!mjgA)0FU_FJ1%C)c;1C=b;PnNdCQ`kd^}p*i!$tqsTCFLWL;;;-LZ z_Uw9o)0r7B9)EpVcIWicz0|gqi7}l=3_s34tNG?)+Bo@}i^R0E_S0)0Ke7A{%lcz8 zneM&4_j#H*mpIQnS!mp&Uj4U4ldidch`xKte9_SDp8bDb{OqY?J74eh?1PI(%~`_j zI6v@E-AC5xqh24+qYLiogs#6nXkz7o^UH=jX+GN$Xqr8>G;1Ap;qvDCKfkvN*?Mru z)8_9#p4V;R%)kPEt#Q_A%eo!=7p)g!nS9r!GfTbNKTY;&*|TBJ)eBvl@W$!rwp&^@ zU!F`{%D%L@IsDFjyT?3m?zDUUq-pwc=dGVTak5PZ@sjS$wN6}9*UM0k4R7yg81>%S z{O6H|PxZ;B@a$5TqZ;<|+>uS~wt3!q`T1)Te%MuR_Yrh<*qz7wU7FsYA26=rkh^8p zsa@T=x9hTF8#8?U#KuMBs%x6lR~MZdv2*wX3(6D!mZB2d7d`maq#vGHGi$}P@hwfW z_e>emQq4>nc4o)Q=}7b5k^43VN2J&7i&L-XE#i}X*=yO|SI#zHnO0e{dg9Kd+mF2P zz0Tk5%CIe;4&Kl`J@nhlpRto(+Bx*|rAw~#dTr3w*lzgs#C2H# z(d;E)?4E8rZ_R8d4ys!>;-UQNql-E$zWwbr+sw$sPV<+gT6W$N|2N>S0UMBGD~DaY zzuR4d#SO+0r#F86@kdE=$?9S3<+jBmcWytAUSpdcZg%eJX&*Ne500LDdgS~D--(sY z)GgCgLT2PVM{L7WgWsP=t@|!FZT-rF7l~8mco%N7tYI6CC+>+padR{c78_ zcinRjgt|ZZ9sEIC>z(A}iN?R*)aHYsYwK>dcHjQQ%^xH>lRJk3F{5sBTb=cewe=sQ zbRTeUogOdtNN;MH|LWQEmeBb@g;$RBns-$4Y>_I6IXnIM>>ZnDPrEWU<=AE3tu!~CJI#M`0(#}n?5#(ke(!uU)!6Rh ztj^n$kN2E?`3J)pe#@q|;%ym9>b+|6jvnNE`!daZg<`PZ?pO9W7ESi08-{mJgFTmC z-aO&zjO~XFy-m|~OD25Vn0jXWmeg!#?;f*4y4}Cuu5?v%!#nL%ePREyp*myeH){v_ z-<-QD3>Khv4wmSZ1ZxGUFh*`z(2&(Gg<^V~MeIyaBAzxT{*#@vo6&6eh4 zCtF(l{RY^d=(%s+;gdtIiF0>Pn%x6AHf~w-!s30=S6wTXbodt%qGYU^jPw3ltK!lZn_djRYWna>8 z#?r5+rb(LHBR4zM`_i5sFHf8XqAhNOPUmWA)%w5!9Bey1LMxAW2--E#M5pE*DI z;+)Pcj5Yhrg~=D^b#8uPRB~V2Wv9j1ntq2zYWKhQod|zrnF*hp-1E}4jU$WQ9=!H> zuX*POy*Byfm5aJwY${)wCS2L|RlN6+AHz>&e;l&$k1>BgvN1IVzxykvv-bzttMeul zBaip{O8udFjA8#1=#n^rMjFX!1 z`BA8+E%oN)PaE5;JU!dEV!>p4|MQ*qjJ-bhqtQK5iE|>>b7+7FeJ@%a; zw@hfW^1H?*p9hw9&Mt0a=<#Jcm+-0mrrnhp+uvBe@cv_W@7#QGojB;Z^!|-Q{ZF?w z2zwuG@%9`LeOzI0&i-q2ZyUIv(C_|6sb$e^UAt!HRC@1vt?eIs{L8L!#uW0D{kijB z?%kpvWbW5JJ@s4X1m$WZUM~8kT)9ZAR)qruU5Kdztqq z+r1aQoXTze PmMh&#w`1pP#_E3ov+rLx literal 0 HcmV?d00001 diff --git a/img/logo.png b/img/logo.png new file mode 100644 index 0000000000000000000000000000000000000000..8a2b81b9eb60b9bd48e50daed8ab02a46ee4992f GIT binary patch literal 1581 zcmXw3dr%W+5Wl3S(FfL4WtA!Y%7hEfB!WB|b8zRyCiVIVTx zNzPm!kts^~A#+bmdOVOCle8;y)vowVJNH%WRc?h-Y9RnDXcF+bn z*li~;306aP%Y%y_0u+mAh&qS~58j$LH~q#G z(!AI7P7v@a;K4anPh1DRbFD{?CC`k4tH9`WpLUy8FJIZ&Ii50G%=g!EI`_@yHw=Ec z=jKi23khOhIw@uVsAYKr)=cunp1k<@G3BZAvlAk{wfW3t?TVfRh!}mVDil!J0WWlD z3%}LeE(WSh7j%QSNvLtZ*W;c&roXfii2sXub+u%OU|XU6CK6!I2&}+Z!O@)L}$~ZX;#W(qagHT z71H?4SU^yr9j8p=&f*U4Zmu~(<4}3Q;KhMCgk57OH1o0=vDbDeJlhOG@UYRlcj+!l zR&kXeG(uh~Dg6&&i4w;(*$!rzE7IKcSk_Fcs{m23@{D*jhIsVppUhHARrKQ8LG?u4 zBN}BZGVz8uIDpY5SyqBT1w7x8>wYC08jB2q```#kF{@YG6v&H^H%LlYy`>Lm6d!~= zwvWFNr!zcrtVJc)x(<`~S%g(V^^`H3H-vys4vLDLzqg6~&tQRa|$R z*ku3G;X1JCE!AJi>b+b~bDZw6)-bzsN%$Mo<7GMX4DNP3ZJGzWN+Ev!2aC;4_T+%$ zO5<9xc7at4lw5qc=hm2AI>c`C+NDdVQ31~@o&`(4jfL2awpVp;-xQ5cP|s2$A$C3V zMAwipYc*(j1|)}^U}J6}h-^9xa^P53gAXH*EXSG*^dYYk z3FpKeKWJt&mSHllRRb)R9CL6@hh~O%{5`-~ce$*}_97@*b9fu}#3XxVg~|?omiifh+Hsmj>=l_z6AzHj%P zh9}7VaJVZ*w+<*dGr}Yk37JWCJiXKDFk<0meCm1n1*b!Zh2hMsABR7*2lEj%fRFdH zVWE_cr~s-Bsw)*rRP*%zFHtiJ&C|ofM4a4m VXWV0Pq6A; + + + + QuickGraph + + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ +

QuickGraph

+ +

Documentation

+ +
+
+
+
+ The QuickGraph library can be installed from NuGet: + 
PM> Install-Package QuickGraph
+
+
+
+
+ +

Example

+ +

This example demonstrates using a function defined in this sample library.

+ + + + +
1: 
+2: 
+3: 
+4: 
+
#r "QuickGraph.dll"
+open QuickGraph
+
+printfn "hello = %i" <| Library.hello 0
+
+ +

Some more info

+ +

Samples & documentation

+ +

The library comes with comprehensible documentation. +It can include tutorials automatically generated from *.fsx files in the content folder. +The API reference is automatically generated from Markdown comments in the library implementation.

+ +
    +

  • Tutorial contains a further explanation of this sample library.

    • +

  • API Reference contains automatically generated documentation for all types, modules +and functions in the library. This includes additional brief samples on using most of the +functions.

    • +
+ +

Contributing and copyright

+ +

The project is hosted on GitHub where you can report issues, fork +the project and submit pull requests. If you're adding a new public API, please also +consider adding samples that can be turned into a documentation. You might +also want to read the library design notes to understand how it works.

+ +

The library is available under Public Domain license, which allows modification and +redistribution for both commercial and non-commercial purposes. For more information see the +License file in the GitHub repository.

+ +
val printfn : format:Printf.TextWriterFormat<'T> -> 'T

Full name: Microsoft.FSharp.Core.ExtraTopLevelOperators.printfn
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/license.html b/license.html new file mode 100644 index 000000000..584a6338b --- /dev/null +++ b/license.html @@ -0,0 +1,111 @@ + + + + + license + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ +

Microsoft Public License (Ms-PL)

+ +

This license governs use of the accompanying software. If you use the software, you accept this license. +If you do not accept the license, do not use the software.

+ +
    +
  1. Definitions
    2. +
+ +

The terms "reproduce," "reproduction," "derivative works," and "distribution" have the same meaning here as under U.S. copyright law.

+ +

A "contribution" is the original software, or any additions or changes to the software.

+ +

A "contributor" is any person that distributes its contribution under this license.

+ +

"Licensed patents" are a contributor's patent claims that read directly on its contribution.

+ +
    +
  1. Grant of Rights
    2. +
+ +

(A) Copyright Grant- Subject to the terms of this license, including the license conditions and limitations in section 3, +each contributor grants you a non-exclusive, worldwide, royalty-free copyright license to reproduce its contribution, +prepare derivative works of its contribution, and distribute its contribution or any derivative works that you create.

+ +

(B) Patent Grant- Subject to the terms of this license, including the license conditions and limitations in section 3, +each contributor grants you a non-exclusive, worldwide, royalty-free license under its licensed patents to make, +have made, use, sell, offer for sale, import, and/or otherwise dispose of its contribution in the software +or derivative works of the contribution in the software.

+ +
    +
  1. Conditions and Limitations
    2. +
+ +

(A) No Trademark License- This license does not grant you rights to use any contributors' name, logo, or trademarks.

+ +

(B) If you bring a patent claim against any contributor over patents that you claim are infringed by the software, +your patent license from such contributor to the software ends automatically.

+ +

(C) If you distribute any portion of the software, you must retain all copyright, patent, trademark, +and attribution notices that are present in the software.

+ +

(D) If you distribute any portion of the software in source code form, you may do so only under this license +by including a complete copy of this license with your distribution. +If you distribute any portion of the software in compiled or object code form, you may only do so under a license that complies with this license.

+ +

(E) The software is licensed "as-is." You bear the risk of using it. +The contributors give no express warranties, guarantees or conditions. +You may have additional consumer rights under your local laws which this license cannot change. +To the extent permitted under your local laws, the contributors exclude the implied warranties of merchantability, +fitness for a particular purpose and non-infringement.

+ + +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/release-notes.html b/release-notes.html new file mode 100644 index 000000000..a4f53b36e --- /dev/null +++ b/release-notes.html @@ -0,0 +1,65 @@ + + + + + release-notes + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ +

0.0.1-beta - October 24 2013

+ +
    +
  • Initial release
    • +
+ + +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/tutorial.html b/tutorial.html new file mode 100644 index 000000000..b175f2335 --- /dev/null +++ b/tutorial.html @@ -0,0 +1,79 @@ + + + + + Introducing your project + + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ +

Introducing your project

+ +

Say more

+ + + + +
1: 
+2: 
+3: 
+4: 
+
#r "QuickGraph.dll"
+open QuickGraph
+
+Library.hello 0
+
+ +

Some more info

+ + +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + From dc74478d3b22e3d9e1994c11b8cb4f5bedb842dd Mon Sep 17 00:00:00 2001 From: rsdpisuy Date: Tue, 12 Jul 2016 17:00:48 +0300 Subject: [PATCH 02/15] Update generated documentation for version 3.7.0 --- content/style.css | 32 +- content/style_light.css | 32 +- img/QG_undirected.png | Bin 0 -> 29405 bytes img/logo-template.pdn | Bin 15052 -> 73191 bytes img/logo.png | Bin 1581 -> 39589 bytes index.html | 30 +- license.html | 27 +- reference/graphx-bautoresetevent.html | 186 +++ reference/graphx-bmanualresetevent.html | 186 +++ reference/graphx-bwaithandle.html | 235 ++++ reference/graphx-measure-point.html | 451 ++++++ reference/graphx-measure-rect.html | 740 ++++++++++ reference/graphx-measure-size.html | 276 ++++ reference/graphx-measure-thickness.html | 178 +++ reference/graphx-measure-vector.html | 473 +++++++ .../graphx-pcl-common-commonextensions.html | 90 ++ ...on-enums-edgeroutingalgorithmtypeenum.html | 68 + .../graphx-pcl-common-enums-edgestype.html | 68 + .../graphx-pcl-common-enums-eventtype.html | 68 + ...phx-pcl-common-enums-graphcontroltype.html | 68 + .../graphx-pcl-common-enums-imagetype.html | 68 + ...-common-enums-layoutalgorithmtypeenum.html | 70 + ...enums-overlapremovalalgorithmtypeenum.html | 68 + ...pcl-common-enums-processingoptionenum.html | 70 + .../graphx-pcl-common-enums-vertexshape.html | 68 + ...on-exceptions-gx_consistencyexception.html | 90 ++ ...common-exceptions-gx_generalexception.html | 90 ++ ...on-exceptions-gx_invaliddataexception.html | 90 ++ ...exceptions-gx_objectnotfoundexception.html | 90 ++ ...ommon-exceptions-gx_obsoleteexception.html | 90 ++ ...-exceptions-gx_serializationexception.html | 90 ++ ...common-interfaces-ialgorithmfactory-3.html | 276 ++++ ...ommon-interfaces-ialgorithmparameters.html | 68 + ...common-interfaces-ialgorithmstorage-2.html | 189 +++ ...aphx-pcl-common-interfaces-icloneable.html | 95 ++ ...mon-interfaces-iedgeroutingparameters.html | 70 + ...mon-interfaces-iexternaledgerouting-2.html | 197 +++ ...l-common-interfaces-iexternallayout-2.html | 180 +++ ...-interfaces-iexternaloverlapremoval-1.html | 113 ++ ...l-common-interfaces-igraphxcommonedge.html | 146 ++ ...x-pcl-common-interfaces-igraphxedge-1.html | 112 ++ ...x-pcl-common-interfaces-igraphxvertex.html | 93 ++ ...-pcl-common-interfaces-igxlogiccore-3.html | 560 ++++++++ ...terfaces-iidentifiablegraphdataobject.html | 110 ++ ...-common-interfaces-ilayoutalgorithm-3.html | 93 ++ ...ommon-interfaces-ilayoutedgerouting-1.html | 96 ++ ...l-common-interfaces-ilayoutparameters.html | 94 ++ ...interfaces-ioverlapremovalalgorithm-1.html | 108 ++ ...interfaces-ioverlapremovalalgorithm-2.html | 110 ++ ...-interfaces-ioverlapremovalparameters.html | 106 ++ ...hx-pcl-common-interfaces-iroutinginfo.html | 93 ++ ...pcl-common-interfaces-iweightededge-1.html | 93 ++ .../graphx-pcl-common-models-edgebase-1.html | 270 ++++ ...l-common-models-edgeroutingvisualdata.html | 196 +++ ...-common-models-graphserializationdata.html | 126 ++ ...graphx-pcl-common-models-graphstate-3.html | 209 +++ ...pcl-common-models-semaphore-semaphore.html | 186 +++ .../graphx-pcl-common-models-vertexbase.html | 164 +++ ...aphx-pcl-common-models-weightededge-1.html | 177 +++ ...hx-pcl-logic-algorithms-algorithmbase.html | 113 ++ ...ithms-edgerouting-bundleedgerouting-3.html | 327 +++++ ...gerouting-bundleedgeroutingparameters.html | 240 ++++ ...dgerouting-edgeroutingalgorithmbase-3.html | 224 +++ ...hms-edgerouting-edgeroutingparameters.html | 126 ++ ...gorithms-edgerouting-heuristicformula.html | 68 + ...gorithms-edgerouting-ipriorityqueue-1.html | 136 ++ ...gic-algorithms-edgerouting-matrixitem.html | 112 ++ ...orithms-edgerouting-pathfindalgorithm.html | 68 + ...gic-algorithms-edgerouting-pathfinder.html | 308 +++++ ...ms-edgerouting-pathfinderdebughandler.html | 143 ++ ...s-edgerouting-pathfinderedgerouting-3.html | 143 ++ ...uting-pathfinderedgeroutingparameters.html | 258 ++++ ...algorithms-edgerouting-pathfindernode.html | 68 + ...rithms-edgerouting-pathfindernodetype.html | 68 + ...gorithms-edgerouting-priorityqueueb-1.html | 254 ++++ ...ithms-edgerouting-simpleedgerouting-3.html | 221 +++ ...rithms-edgerouting-simpleerparameters.html | 130 ++ ...graphx-pcl-logic-algorithms-edgetypes.html | 68 + ...pcl-logic-algorithms-graphxextensions.html | 343 +++++ ...-logic-algorithms-hierarchicalgraph-2.html | 426 ++++++ ...raphx-pcl-logic-algorithms-ialgorithm.html | 93 ++ ...hms-ihierarchicalbidirectionalgraph-2.html | 316 +++++ ...-logic-algorithms-isoftmutablegraph-2.html | 453 ++++++ ...raphx-pcl-logic-algorithms-itypededge.html | 91 ++ ...hms-layeredtopologicalsortalgorithm-2.html | 160 +++ ...gorithms-balloontreelayoutalgorithm-3.html | 128 ++ ...lgorithms-balloontreelayoutparameters.html | 126 ++ ...talgorithms-boundedfrlayoutparameters.html | 166 +++ ...talgorithms-circularlayoutalgorithm-3.html | 145 ++ ...utalgorithms-circularlayoutparameters.html | 90 ++ ...gorithms-compoundfdplayoutalgorithm-3.html | 187 +++ ...lgorithms-compoundfdplayoutparameters.html | 306 ++++ ...thms-layoutalgorithms-compoundgraph-2.html | 304 ++++ ...outalgorithms-compoundlayoutcontext-3.html | 128 ++ ...ms-compoundlayoutiterationeventargs-2.html | 113 ++ ...orithms-compoundvertexinnerlayouttype.html | 68 + ...ultparameterizedlayoutalgorithmbase-4.html | 130 ++ ...ms-efficientsugiyamalayoutalgorithm-3.html | 157 +++ ...hms-efficientsugiyamalayoutparameters.html | 212 +++ ...ms-layoutalgorithms-frcoolingfunction.html | 68 + ...youtalgorithms-freefrlayoutparameters.html | 144 ++ ...-layoutalgorithms-frlayoutalgorithm-3.html | 159 +++ ...youtalgorithms-frlayoutparametersbase.html | 248 ++++ ...ms-grouped-algorithmgroupparameters-2.html | 164 +++ ...hms-grouped-groupinglayoutalgorithm-3.html | 143 ++ ...d-groupinglayoutalgorithmparameters-2.html | 194 +++ ...hms-layoutalgorithms-icompoundgraph-2.html | 211 +++ ...algorithms-icompoundlayoutalgorithm-3.html | 91 ++ ...utalgorithms-icompoundlayoutcontext-3.html | 106 ++ ...s-icompoundlayoutiterationeventargs-1.html | 91 ++ ...hms-layoutalgorithms-ilayoutcontext-3.html | 136 ++ ...ithms-ilayoutinfoiterationeventargs-2.html | 106 ++ ...ithms-ilayoutinfoiterationeventargs-4.html | 106 ++ ...lgorithms-ilayoutiterationeventargs-1.html | 159 +++ ...outalgorithms-imutablecompoundgraph-2.html | 68 + ...ithms-iparameterizedlayoutalgorithm-1.html | 91 ++ ...orithms-iparameterizedlayoutalgorithm.html | 91 ++ ...ayoutalgorithms-isomlayoutalgorithm-3.html | 142 ++ ...layoutalgorithms-isomlayoutparameters.html | 242 ++++ ...-layoutalgorithms-kklayoutalgorithm-3.html | 142 ++ ...s-layoutalgorithms-kklayoutparameters.html | 223 +++ ...ayoutalgorithms-layoutalgorithmbase-3.html | 192 +++ ...thms-layoutalgorithms-layoutcontext-3.html | 158 +++ ...thms-layoutalgorithms-layoutdirection.html | 68 + ...algorithms-layoutiterationeventargs-2.html | 267 ++++ ...algorithms-layoutiterationeventargs-4.html | 214 +++ ...lgorithms-layoutalgorithms-layoutmode.html | 68 + ...layoutalgorithms-layoutparametersbase.html | 142 ++ ...lgorithms-layoutalgorithms-layoututil.html | 132 ++ ...outalgorithms-linloglayoutalgorithm-3.html | 142 ++ ...youtalgorithms-linloglayoutparameters.html | 154 +++ ...ogic-algorithms-layoutalgorithms-pair.html | 90 ++ ...ms-parameterizedlayoutalgorithmbase-4.html | 159 +++ ...rithms-positioncalculationmethodtypes.html | 68 + ...outalgorithms-randomlayoutalgorithm-3.html | 172 +++ ...lgorithms-randomlayoutalgorithmparams.html | 114 ++ ...lgorithms-simpletreelayoutalgorithm-3.html | 128 ++ ...algorithms-simpletreelayoutparameters.html | 190 +++ ...youtalgorithms-spanningtreegeneration.html | 68 + ...layoutalgorithms-sugiyamaedgeroutings.html | 68 + ...talgorithms-sugiyamalayoutalgorithm-3.html | 156 +++ ...utalgorithms-sugiyamalayoutparameters.html | 272 ++++ ...ingcompoundlayoutiterationeventargs-4.html | 157 +++ ...talgorithms-testingcompoundvertexinfo.html | 154 +++ ...orithms-overlapremoval-fsaalgorithm-1.html | 104 ++ ...orithms-overlapremoval-fsaalgorithm-2.html | 92 ++ ...erlapremoval-ioverlapremovalcontext-1.html | 91 ++ ...s-overlapremoval-onewayfsaalgorithm-1.html | 90 ++ ...ms-overlapremoval-onewayfsaparameters.html | 112 ++ ...ithms-overlapremoval-onewayfsawayenum.html | 68 + ...removal-overlapremovalalgorithmbase-2.html | 194 +++ ...verlapremoval-overlapremovalcontext-1.html | 113 ++ ...s-overlapremoval-overlapremovalhelper.html | 90 ++ ...erlapremoval-overlapremovalparameters.html | 161 +++ ...hms-overlapremoval-rectanglewrapper-1.html | 159 +++ ...ithms-softmutablebidirectionalgraph-2.html | 557 ++++++++ ...rithms-softmutablehierarchicalgraph-2.html | 557 ++++++++ ...aphx-pcl-logic-algorithms-typededge-1.html | 128 ++ ...-pcl-logic-algorithms-wrappedvertex-1.html | 112 ++ ...hx-pcl-logic-helpers-reflectionhelper.html | 90 ++ ...aphx-pcl-logic-helpers-typeextensions.html | 90 ++ ...x-pcl-logic-models-algorithmfactory-3.html | 296 ++++ ...x-pcl-logic-models-algorithmstorage-2.html | 203 +++ ...graphx-pcl-logic-models-gxlogiccore-3.html | 656 +++++++++ reference/index.html | 1226 +++++++++++++++++ release-notes.html | 7 +- tutorial.html | 3 - 167 files changed, 27219 insertions(+), 77 deletions(-) create mode 100644 img/QG_undirected.png create mode 100644 reference/graphx-bautoresetevent.html create mode 100644 reference/graphx-bmanualresetevent.html create mode 100644 reference/graphx-bwaithandle.html create mode 100644 reference/graphx-measure-point.html create mode 100644 reference/graphx-measure-rect.html create mode 100644 reference/graphx-measure-size.html create mode 100644 reference/graphx-measure-thickness.html create mode 100644 reference/graphx-measure-vector.html create mode 100644 reference/graphx-pcl-common-commonextensions.html create mode 100644 reference/graphx-pcl-common-enums-edgeroutingalgorithmtypeenum.html create mode 100644 reference/graphx-pcl-common-enums-edgestype.html create mode 100644 reference/graphx-pcl-common-enums-eventtype.html create mode 100644 reference/graphx-pcl-common-enums-graphcontroltype.html create mode 100644 reference/graphx-pcl-common-enums-imagetype.html create mode 100644 reference/graphx-pcl-common-enums-layoutalgorithmtypeenum.html create mode 100644 reference/graphx-pcl-common-enums-overlapremovalalgorithmtypeenum.html create mode 100644 reference/graphx-pcl-common-enums-processingoptionenum.html create mode 100644 reference/graphx-pcl-common-enums-vertexshape.html create mode 100644 reference/graphx-pcl-common-exceptions-gx_consistencyexception.html create mode 100644 reference/graphx-pcl-common-exceptions-gx_generalexception.html create mode 100644 reference/graphx-pcl-common-exceptions-gx_invaliddataexception.html create mode 100644 reference/graphx-pcl-common-exceptions-gx_objectnotfoundexception.html create mode 100644 reference/graphx-pcl-common-exceptions-gx_obsoleteexception.html create mode 100644 reference/graphx-pcl-common-exceptions-gx_serializationexception.html create mode 100644 reference/graphx-pcl-common-interfaces-ialgorithmfactory-3.html create mode 100644 reference/graphx-pcl-common-interfaces-ialgorithmparameters.html create mode 100644 reference/graphx-pcl-common-interfaces-ialgorithmstorage-2.html create mode 100644 reference/graphx-pcl-common-interfaces-icloneable.html create mode 100644 reference/graphx-pcl-common-interfaces-iedgeroutingparameters.html create mode 100644 reference/graphx-pcl-common-interfaces-iexternaledgerouting-2.html create mode 100644 reference/graphx-pcl-common-interfaces-iexternallayout-2.html create mode 100644 reference/graphx-pcl-common-interfaces-iexternaloverlapremoval-1.html create mode 100644 reference/graphx-pcl-common-interfaces-igraphxcommonedge.html create mode 100644 reference/graphx-pcl-common-interfaces-igraphxedge-1.html create mode 100644 reference/graphx-pcl-common-interfaces-igraphxvertex.html create mode 100644 reference/graphx-pcl-common-interfaces-igxlogiccore-3.html create mode 100644 reference/graphx-pcl-common-interfaces-iidentifiablegraphdataobject.html create mode 100644 reference/graphx-pcl-common-interfaces-ilayoutalgorithm-3.html create mode 100644 reference/graphx-pcl-common-interfaces-ilayoutedgerouting-1.html create mode 100644 reference/graphx-pcl-common-interfaces-ilayoutparameters.html create mode 100644 reference/graphx-pcl-common-interfaces-ioverlapremovalalgorithm-1.html create mode 100644 reference/graphx-pcl-common-interfaces-ioverlapremovalalgorithm-2.html create mode 100644 reference/graphx-pcl-common-interfaces-ioverlapremovalparameters.html create mode 100644 reference/graphx-pcl-common-interfaces-iroutinginfo.html create mode 100644 reference/graphx-pcl-common-interfaces-iweightededge-1.html create mode 100644 reference/graphx-pcl-common-models-edgebase-1.html create mode 100644 reference/graphx-pcl-common-models-edgeroutingvisualdata.html create mode 100644 reference/graphx-pcl-common-models-graphserializationdata.html create mode 100644 reference/graphx-pcl-common-models-graphstate-3.html create mode 100644 reference/graphx-pcl-common-models-semaphore-semaphore.html create mode 100644 reference/graphx-pcl-common-models-vertexbase.html create mode 100644 reference/graphx-pcl-common-models-weightededge-1.html create mode 100644 reference/graphx-pcl-logic-algorithms-algorithmbase.html create mode 100644 reference/graphx-pcl-logic-algorithms-edgerouting-bundleedgerouting-3.html create mode 100644 reference/graphx-pcl-logic-algorithms-edgerouting-bundleedgeroutingparameters.html create mode 100644 reference/graphx-pcl-logic-algorithms-edgerouting-edgeroutingalgorithmbase-3.html create mode 100644 reference/graphx-pcl-logic-algorithms-edgerouting-edgeroutingparameters.html create mode 100644 reference/graphx-pcl-logic-algorithms-edgerouting-heuristicformula.html create mode 100644 reference/graphx-pcl-logic-algorithms-edgerouting-ipriorityqueue-1.html create mode 100644 reference/graphx-pcl-logic-algorithms-edgerouting-matrixitem.html create mode 100644 reference/graphx-pcl-logic-algorithms-edgerouting-pathfindalgorithm.html create mode 100644 reference/graphx-pcl-logic-algorithms-edgerouting-pathfinder.html create mode 100644 reference/graphx-pcl-logic-algorithms-edgerouting-pathfinderdebughandler.html create mode 100644 reference/graphx-pcl-logic-algorithms-edgerouting-pathfinderedgerouting-3.html create mode 100644 reference/graphx-pcl-logic-algorithms-edgerouting-pathfinderedgeroutingparameters.html create mode 100644 reference/graphx-pcl-logic-algorithms-edgerouting-pathfindernode.html create mode 100644 reference/graphx-pcl-logic-algorithms-edgerouting-pathfindernodetype.html create mode 100644 reference/graphx-pcl-logic-algorithms-edgerouting-priorityqueueb-1.html create mode 100644 reference/graphx-pcl-logic-algorithms-edgerouting-simpleedgerouting-3.html create mode 100644 reference/graphx-pcl-logic-algorithms-edgerouting-simpleerparameters.html create mode 100644 reference/graphx-pcl-logic-algorithms-edgetypes.html create mode 100644 reference/graphx-pcl-logic-algorithms-graphxextensions.html create mode 100644 reference/graphx-pcl-logic-algorithms-hierarchicalgraph-2.html create mode 100644 reference/graphx-pcl-logic-algorithms-ialgorithm.html create mode 100644 reference/graphx-pcl-logic-algorithms-ihierarchicalbidirectionalgraph-2.html create mode 100644 reference/graphx-pcl-logic-algorithms-isoftmutablegraph-2.html create mode 100644 reference/graphx-pcl-logic-algorithms-itypededge.html create mode 100644 reference/graphx-pcl-logic-algorithms-layeredtopologicalsortalgorithm-2.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-balloontreelayoutalgorithm-3.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-balloontreelayoutparameters.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-boundedfrlayoutparameters.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-circularlayoutalgorithm-3.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-circularlayoutparameters.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-compoundfdplayoutalgorithm-3.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-compoundfdplayoutparameters.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-compoundgraph-2.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-compoundlayoutcontext-3.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-compoundlayoutiterationeventargs-2.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-compoundvertexinnerlayouttype.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-defaultparameterizedlayoutalgorithmbase-4.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-efficientsugiyamalayoutalgorithm-3.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-efficientsugiyamalayoutparameters.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-frcoolingfunction.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-freefrlayoutparameters.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-frlayoutalgorithm-3.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-frlayoutparametersbase.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-grouped-algorithmgroupparameters-2.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-grouped-groupinglayoutalgorithm-3.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-grouped-groupinglayoutalgorithmparameters-2.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-icompoundgraph-2.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-icompoundlayoutalgorithm-3.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-icompoundlayoutcontext-3.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-icompoundlayoutiterationeventargs-1.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-ilayoutcontext-3.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-ilayoutinfoiterationeventargs-2.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-ilayoutinfoiterationeventargs-4.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-ilayoutiterationeventargs-1.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-imutablecompoundgraph-2.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-iparameterizedlayoutalgorithm-1.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-iparameterizedlayoutalgorithm.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-isomlayoutalgorithm-3.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-isomlayoutparameters.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-kklayoutalgorithm-3.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-kklayoutparameters.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutalgorithmbase-3.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutcontext-3.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutdirection.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutiterationeventargs-2.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutiterationeventargs-4.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutmode.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutparametersbase.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoututil.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-linloglayoutalgorithm-3.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-linloglayoutparameters.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-pair.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-parameterizedlayoutalgorithmbase-4.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-positioncalculationmethodtypes.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-randomlayoutalgorithm-3.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-randomlayoutalgorithmparams.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-simpletreelayoutalgorithm-3.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-simpletreelayoutparameters.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-spanningtreegeneration.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-sugiyamaedgeroutings.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-sugiyamalayoutalgorithm-3.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-sugiyamalayoutparameters.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-testingcompoundlayoutiterationeventargs-4.html create mode 100644 reference/graphx-pcl-logic-algorithms-layoutalgorithms-testingcompoundvertexinfo.html create mode 100644 reference/graphx-pcl-logic-algorithms-overlapremoval-fsaalgorithm-1.html create mode 100644 reference/graphx-pcl-logic-algorithms-overlapremoval-fsaalgorithm-2.html create mode 100644 reference/graphx-pcl-logic-algorithms-overlapremoval-ioverlapremovalcontext-1.html create mode 100644 reference/graphx-pcl-logic-algorithms-overlapremoval-onewayfsaalgorithm-1.html create mode 100644 reference/graphx-pcl-logic-algorithms-overlapremoval-onewayfsaparameters.html create mode 100644 reference/graphx-pcl-logic-algorithms-overlapremoval-onewayfsawayenum.html create mode 100644 reference/graphx-pcl-logic-algorithms-overlapremoval-overlapremovalalgorithmbase-2.html create mode 100644 reference/graphx-pcl-logic-algorithms-overlapremoval-overlapremovalcontext-1.html create mode 100644 reference/graphx-pcl-logic-algorithms-overlapremoval-overlapremovalhelper.html create mode 100644 reference/graphx-pcl-logic-algorithms-overlapremoval-overlapremovalparameters.html create mode 100644 reference/graphx-pcl-logic-algorithms-overlapremoval-rectanglewrapper-1.html create mode 100644 reference/graphx-pcl-logic-algorithms-softmutablebidirectionalgraph-2.html create mode 100644 reference/graphx-pcl-logic-algorithms-softmutablehierarchicalgraph-2.html create mode 100644 reference/graphx-pcl-logic-algorithms-typededge-1.html create mode 100644 reference/graphx-pcl-logic-algorithms-wrappedvertex-1.html create mode 100644 reference/graphx-pcl-logic-helpers-reflectionhelper.html create mode 100644 reference/graphx-pcl-logic-helpers-typeextensions.html create mode 100644 reference/graphx-pcl-logic-models-algorithmfactory-3.html create mode 100644 reference/graphx-pcl-logic-models-algorithmstorage-2.html create mode 100644 reference/graphx-pcl-logic-models-gxlogiccore-3.html create mode 100644 reference/index.html diff --git a/content/style.css b/content/style.css index ccaf894ac..a765e3699 100644 --- a/content/style.css +++ b/content/style.css @@ -1,7 +1,7 @@ @import url(https://fonts.googleapis.com/css?family=Droid+Sans|Droid+Sans+Mono|Open+Sans:400,600,700); -/*-------------------------------------------------------------------------- - Formatting for F# code snippets +/*-------------------------------------------------------------------------- + Formatting for F# code snippets /*--------------------------------------------------------------------------*/ /* strings --- and stlyes for other string related formats */ @@ -40,7 +40,7 @@ span.prep { color:#af75c1; } span.fsi { color:#808080; } /* omitted */ -span.omitted { +span.omitted { background:#3c4e52; border-radius:5px; color:#808080; @@ -54,12 +54,13 @@ div.tip { padding:6px 8px 6px 8px; display:none; color:#d1d1d1; + pointer-events:none; } table.pre pre { padding:0px; margin:0px; border:none; -} +} table.pre, pre.fssnip, pre { line-height:13pt; border:1px solid #d8d8d8; @@ -71,7 +72,8 @@ table.pre, pre.fssnip, pre { background-color:#212d30; padding:10px; border-radius:5px; - color:#d1d1d1; + color:#d1d1d1; + max-width: none; } pre.fssnip code { font: 9pt 'Droid Sans Mono',consolas,monospace; @@ -91,7 +93,7 @@ table.pre td.lines { width:30px; } -/*-------------------------------------------------------------------------- +/*-------------------------------------------------------------------------- Formatting for page & standard document content /*--------------------------------------------------------------------------*/ @@ -159,7 +161,7 @@ td.title, thead { #main li { font-size: 11pt; margin: 5px 0px 5px 0px; } #main strong { font-weight:700; } -/*-------------------------------------------------------------------------- +/*-------------------------------------------------------------------------- Formatting for API reference /*--------------------------------------------------------------------------*/ @@ -191,8 +193,8 @@ td.title, thead { .github-link .normal { display: block; } .github-link:hover .normal { display: none; } -/*-------------------------------------------------------------------------- - Links +/*-------------------------------------------------------------------------- + Links /*--------------------------------------------------------------------------*/ h1 a, h1 a:hover, h1 a:focus, @@ -202,14 +204,14 @@ h4 a, h4 a:hover, h4 a:focus, h5 a, h5 a:hover, h5 a:focus, h6 a, h6 a:hover, h6 a:focus { color : inherit; text-decoration : inherit; outline:none } -/*-------------------------------------------------------------------------- - Additional formatting for the homepage +/*-------------------------------------------------------------------------- + Additional formatting for the homepage /*--------------------------------------------------------------------------*/ -#nuget { +#nuget { margin-top:20px; - font-size: 11pt; - padding:20px; + font-size: 11pt; + padding:20px; } #nuget pre { @@ -221,4 +223,4 @@ h6 a, h6 a:hover, h6 a:focus { color : inherit; text-decoration : inherit; outli border-style:none; color: #e0e0e0; margin-top:15px; -} \ No newline at end of file +} diff --git a/content/style_light.css b/content/style_light.css index 603dc7475..488f3b726 100644 --- a/content/style_light.css +++ b/content/style_light.css @@ -1,7 +1,7 @@ @import url(https://fonts.googleapis.com/css?family=Droid+Sans|Droid+Sans+Mono|Open+Sans:400,600,700); -/*-------------------------------------------------------------------------- - Formatting for F# code snippets +/*-------------------------------------------------------------------------- + Formatting for F# code snippets /*--------------------------------------------------------------------------*/ /* identifier */ @@ -41,7 +41,7 @@ span.prep { color:#0000ff; } span.fsi { color:#808080; } /* omitted */ -span.omitted { +span.omitted { background:#3c4e52; border-radius:5px; color:#808080; @@ -55,12 +55,13 @@ div.tip { padding:6px 8px 6px 8px; display:none; color:#000000; + pointer-events:none; } table.pre pre { padding:0px; margin:0px; border:none; -} +} table.pre, pre.fssnip, pre { line-height:13pt; border:1px solid #d8d8d8; @@ -72,7 +73,8 @@ table.pre, pre.fssnip, pre { background-color:#fdfdfd; padding:10px; border-radius:5px; - color:#000000; + color:#000000; + max-width: none; } pre.fssnip code { font: 9pt 'Droid Sans Mono',consolas,monospace; @@ -92,7 +94,7 @@ table.pre td.lines { width:30px; } -/*-------------------------------------------------------------------------- +/*-------------------------------------------------------------------------- Formatting for page & standard document content /*--------------------------------------------------------------------------*/ @@ -160,7 +162,7 @@ td.title, thead { #main li { font-size: 11pt; margin: 5px 0px 5px 0px; } #main strong { font-weight:700; } -/*-------------------------------------------------------------------------- +/*-------------------------------------------------------------------------- Formatting for API reference /*--------------------------------------------------------------------------*/ @@ -192,8 +194,8 @@ td.title, thead { .github-link .normal { display: block; } .github-link:hover .normal { display: none; } -/*-------------------------------------------------------------------------- - Links +/*-------------------------------------------------------------------------- + Links /*--------------------------------------------------------------------------*/ h1 a, h1 a:hover, h1 a:focus, @@ -203,14 +205,14 @@ h4 a, h4 a:hover, h4 a:focus, h5 a, h5 a:hover, h5 a:focus, h6 a, h6 a:hover, h6 a:focus { color : inherit; text-decoration : inherit; outline:none } -/*-------------------------------------------------------------------------- - Additional formatting for the homepage +/*-------------------------------------------------------------------------- + Additional formatting for the homepage /*--------------------------------------------------------------------------*/ -#nuget { +#nuget { margin-top:20px; - font-size: 11pt; - padding:20px; + font-size: 11pt; + padding:20px; } #nuget pre { @@ -222,4 +224,4 @@ h6 a, h6 a:hover, h6 a:focus { color : inherit; text-decoration : inherit; outli border-style:none; color: #e0e0e0; margin-top:15px; -} \ No newline at end of file +} diff --git a/img/QG_undirected.png b/img/QG_undirected.png new file mode 100644 index 0000000000000000000000000000000000000000..2890523f02be7a19d78910324c891abc028c7357 GIT binary patch literal 29405 zcmdqI^;?@w&<0wZ0L8sH!7UVNDDI(nvET%U;_mJ)#frD3IK`o*Sb$QBwzw0dxI=L` zq3?Hn-#P!n`61VH<;iAtc6MfV=iYl`HPjTJ;!xu}dGh3`5=8FxlP4%Cj~{GIl5uZg7|8Dc7l^+5lPCB+j~|qN=Q2y=OG*!U zsE3xbwTCy%&FYB@%+AS!*U8F*L68^3E8-v!r1s>Ao0^iGw6>4Qem+L4(d2ncXsf@B z37v2fsy?R_4%PKR9?@R5G^8+nv9{+f5rb{&#-)P<$xoA;*1sn6^+< z;Enj`&AK()#mwKPtRX@f7n*+8yfA)T+J0A>Ql23hZP2llAiqe`+FP`S zF%J5)1M?6{ZpyJ7U^A&=Y-e0>jACEIs`zp0rCb1S2Zd?8>GNCQeHKEmyHo2v|57D@ zLxTJ;-n%b-Rlzm?vSCKmfyF233VpP9Byv%u(H}V@0~AQP_?WO?dLE?l*j|{yq~0-Y zyWhX(*FTF{rYTRqT~i!*E4bg$m3murEUUPFW##f0GzokTG>Nx*nWhAkM_ zj-LJvj3Hc+H!%CP;5xJWi}c-<{Jv zwF*3Lyi@?quwpGMFfA3|Dt=?2Bh32%a{Wt^U*)_3R&z%RPRJ4P7`hdC?Z5zz2r^P3 zyOk9h;hkfa#KynjBZ`jm?TtCRaHlCf=Eu#Y0{m%Gp+3c}`gqR*ja4TZ2%WeZ-ib%^ zt@`Fg7~i)Hx-+Kjw-XzJTQk!g0WB~(NTF=S^>$On3dOhFm%3%GY9s;u#oLE_U^NRE zxiAUwt>D<^AxjN;nQd*sEBq9-doxJL!$6<82!bSbO_1FhCcw~*OQS<3LHIz57qI_p zq1mKckdiq(9U}@WThzOG2kx48-OKIZ0lakBc@u zJ!&~SGBFN4p3xkFSPo(Haw~G@95oDcPqXS}uS}xpFQ*@Z{|$?%r8Y({So+XMV=ny5 zbcp+_<-KVomjQstv98LzzncmxG6-y92txawW$jrx@*85FZa;^5u68$$Z%fdKJBRf! zC3@GEw5E;UP^$|8k6AOU9A!WnDB|AqK1KB$A6&i1BZzOnNVUr%{?HpTaULTln#Ev- z5DkO-g`Q?#szjYq$-FPZUmbN8uu_S*RT6nf?(824-lts(&0nGKow00Z*-2)2JHd6X zEUvXY;lF_SU$^@ae`VT=@5YiA-YmIt#^^&Gfj+*YJlHwiya=7{l>svay1I9xbWUz zVLm!?XMM$oINd8s5HiduunV&dfve#1S^GTN@hRxCK{ny^oks8k^SRQUX6NzYQG41x zLkFg0ziYp(WFzw&$$mxh zrJQ+E+D3p*g26b&M^aVMLJ4{|u(9aae1= zNu4J^`1#FyupEeT8F)aZg^tFP`TF>vWa=AFHaM6M?4qs~&<7W?)obLN%Mk^?RHNd@ z<$6l1pCT8Fu5^j__N6Pdw{pUut6k(H7UrHidIdEqF)<=DHq^O`N}W_auCugLs~m!T zO=(KsV5RM+B1}n=QX9886o}eHc%_)FVt=(bqpJO$$3=CHYCq9y6X~;WQ5tH~Am9mB zl^@4pD9lr*o1k$O0r}v+JCj^^g;tp$k3Ts*G#1|@d^f3{-L)%c@fO=8(-q4`E<^}2aOx~T&L+D=1Pa?sH@M`J#Jmsr(3j#x2X^;Yh9qgqr@?!1$K zT}nGfXG?LL?*)H|pHD>DPx!0Q_TkRg$FHA*sG;^XM5C>W@#wXh*8z9C5Fy^yvZM+$ z=nH7O>#iqqv+!Ag?@ry(*!m58{QC4%T@o+-u#@d}zhbaQ#3r9e*VHkib|Ot#E_^US zV8qs>K?YO{-(4jNeQ8e{szcZo&u;1~&It1kyT&V(6gvedpA>iLu}Zutqn= z9(9_+gM+RZZ!f0lKNKQ@AFeoVJ0I?8?rwKSm!tV4AHd(PPjC?v>FRj9pIg+nX6iop z?mve!@>Y~%VRVzfAPtx6$xeB-I%B57t{gXvvB@UKtT3!|>`tGkg^=>D?_#o-m;Py>t@X6*D5SBc2d($H82( z+)Siw*0hquqEr6nqy?(pZ zB-MiBw4F3!4-4b4!}h;1_y*PfEhy=ju^%XDT1eKOAFhV0paQIW;^PG{?x~Mk;yW#t zG}MvettV~D$3~_My=hOE!v4+<`YHCi8uTMake2^EUod*I@%L?ilU{CqyV1A%op?mZ z-32bQb$(OdU1^Ufsxs%<8ZNe^Z9aaQ?F&|YV-@1dCDQd^**m1@ES=6iDx7 z2fgTb{gkW^FPx9j2G51oWMPo71ux4bF%er?3{2PldvnrH9Xt^Cnf4b@qxyD z-%+ue9BlfyPh)xrghahdd{*nCd-fUL%ynA8YUjsz$ zb|#CpO4US0nLvu|hE=xh;aXzE32fM%GAdj&T!wjx8uSzKI;I&Be-%YlB$JEU@mrRV zyTQ!t$Py;l$_#|iQD|Pee?;87_3ut4TwOBYjo03*lQ}NFD97d{&i(R)ogHWMh;ur% zZ3qaVP#qb^ezRYWh19cdr!sBq9_iox>jHo|u6<#ghgI;%89(k|XhaIp>`1J|%uZ!B z^{0-T%-QnFZj8-*k|;d7yueR*=*I#*v7#HHhg=}FA3@$bq1UxL<FRs`7N^%z}54z4F;}ZiA{mF8W`J3+qN1Mk1&EI+N!lOa;lIT+Q z3@rNA7qrg+O&CO;n{`XbwXfsNpBwARoPgk+?utTt8UK&Qza`deNE!|2KIgiNsy#!_ zDFb8JZlS#JsN!^uagXn2o<7NLB~Z@w?&!`No~E3Tj1^CLVxLS%SMf37NL*k!<1qJb z2`P^;sltfMHn~xG&Sv$>wx!W@wDbV%XhxnH7GV~SUN)%4kSAgkI7ucXE|q+BFwgfP zkLb9;s!JxOc0(fcEm4QfpSC|xv*WvRtjeGYz<#P%&P$RHi@$@gpoi<=kq4yrhDFd~ zf2nTZjF%3_lm`Ucx35NcF9$Jm3p@StV3oy86so##eHDKA?yBQg%b&K>|C6M2lTfJs zXt547*F0emuClaDhqDaS5-X8T+%F=Y7yQ|HPwEFrUGHVzS~pWvl|RY(Y%_rb61Jn8LUpDC(RdEY6LQN^~B zJ3k-qemk^=T2f&4F&#?~p=RmcOtI{YXI6d>a;R2FsczG>E&5bDON0lBCMcIRIsaq* z|C`PK1bwCYyw(_s)Xqb!?lZ%NU9*K#E8<#cIkZbi&y?z`_o#@VRi9GO>Fj?a<)kB; zrR7*I^sC(|efOCAkKL^D0n$}}5H&=J9=1;I{g_;>Zar7$Yt-+GPQYFvz01e2ef#B0HOhhGd!C}W~-8uN^OL-7C_>k17nxwnnDFF#1>5`sl(B z^9G}bZz($5|M+iCpq!ge>ai3fcOB!SOd6)=O$E#UwAqlVFZ(edgSGyC$@{QhS*4w%LfgV}o3;6LtnG`rV}cKP<8w=C4Sunj=VJ*4ASm zLj_-Dl-M-Z63el>qOyucP4e8bp&{#M55Xe6*8=PYw0ne@YG;c_y#H{HuV%I4Z_^>V zELo~n#vdXSf)xS7+dCSy=!OVS8#hm@s1 z+*)i$?;5Q&8#>`|sX!(0s0GKqZfYTGxw<6#C(Gi<)DWHbwYa0~#m;9V$52T-)5eCg zI|BqNf93h!KMy01k67`2ARoY=Wxc!p`}A2=r&H_2fhc_5xns_p!8RVuPOpEUCce?T zJaV)qN} zzx+==01OpUu9y8YJX7ah+4Gsgsr8;-KM-8`!!-Dwhm03(;NkvMOPKpMc{!K_xdQ5D zpX{Y0j(YF`T%Q}?`!3?~#i2!rK5a%Ti&hEL;M@KhS0qucx0B`fsiWL`r_hT~ox3sF zr$zc-L1wEy$9tk5H0UgPrw-?>Vl*5QQYe#l>`wxYl>HCw*MXLIVDX4b`o*k>UAUO%UP*PtG5 zZc;$>hv*nfHg4Q9LF@-{+m$Ymd2baF+Vw^9Pf_m!8tXh)h0_b-1-9?8(o+qhO_6>B z69ngPYudOc1kP34wH{mzi;Tx43^esK;fChYyE(M|SIFv416YY$Khk91Y>0Lgwkh=% zFSekdkyiH3awqoMo~XS@;g%cXxSIo@EhQU*%M^vjGNT9458y+wxAL#)YYtLEC-73JlWyUGM#vKt|f;86U)qAd&YQmsOb!W_SnpmLj?T))zLJ1p1S|D6MZeOs7oKBVPK zKr98@8|dgJcsNNvn}B%Y=|`@1RiLObW9_?drreW1#m5r8iBx!*F?2=UV}f$(d2=2% zxq2~KYfP0E$jgG~Q1(N;h?+1`-KSU>tGf;{Tx;0bF=fW+*>7ovU0-KMUZrhARZs`; z^|12-_Z*DpU4Mo~Y+-|2SSL*)yAA`H$m?nj!NUp2zSAOmRhfK+HQ8-&Mmtxu@c?Zp zSAC~Ui}xpy0CWLQ=gOq?E^Y^0zz)~*mOEe?Z8c#`R-cg3-MTjE0QV}MW?Tt_4X=3h zuBcjrIeBxWWrB}3A*$%?zzN1AnSJCIUXLqhBD%X#RpW0*e$&gv@ai}JTB;EMGGCLR ze@Yv`*Tr^@Ba57$7S)js>mj4OySHV<6@aB{}o;dNFm9aZI{wz<&{&Lc^ z>RwT%Mb^{E=C&l{3p<4&_%9U}ziJ!r|$FnRHnyyb1%j`ggEneeWVK3aPG#GGr~<| zBH%=ayYunf9xaq}5aW-}%9B=pzgDPvgPgl}fQB)d`Z$I?zk22k+{)(MzJ;kK+R}HB zn2C6PNZo!8HXbndq{pMQoF8`_qG7tv5O==bXK`nS@Utj2X6R->kFPNIW+aH`fBc(1 z2-yfbD=?g0_~gLd90Re#g>1CV^W$TzmD$(!KWHfAEe$pM;NdX+Y=!3yt?EEgjgF#@ zRqvZeg$)=P1D)zvxA%-7Zj-~vu?wPE!>9+YR|8Y`q^?dPXY@Uqk$-NIk$GP6M(*qI zA2gC5JmwLP6NNbh2NI7+2C>EcB0CjTVHh-gl*fD(f2sL#-bq4?(!^JPAykQIY+HdYUAeQtf{qd_$qML^#o(La;<9j zrJBFgbKP&uaZTS}_I|DTr&&S-*&KD)E$x6>Iv;(kkUZP&b&}Q_;5tCWlr+8INu}Ja zbd&*74TXO0gj7)I9!K1;*kwWXGIC&z6u?V%GJ(+AH!#3Q9Y(v{gVw;#3sF3o1%=*g)auy>b6%NfqGnD)qnkk zML6E+uiB*UabLN;_cZReONL}inT$3r$}lQ#a!z^DmZtLKN{3-xM>5T7oTQ!<9KRw}N699mLY+)XXEajI1#AF#5pN6U6KM6?J`S~PCQ@K%O!n42gQojwY{6kP+wEm=gAZ zNzCutzCBKpHd61riX@82oiK!G_d&^r$C&#JiHfA<|bB`gm_0S-jHN z6(|yL-WVb{xl3zOis08-ke2NLA5+5Lixg^V<7O21pWrWbNd-d966r@Ss)CQ%V;TjyfX{TTF|$XT}jcIk$c zwG!YHapVx8X3UtQL%JKQCgC|6fAG%@zOLlU^B1c?+xbJ!9@Eu6*}&ea=D+b*QF7ek z^*)Y&S?t#ZnPi+L+W;0fH0JwmadrMznff9Ic5{B4;M=8dkD;Jhhn#5`YqvBwRVf{5 z&#eFoK%rFLSDEK(0ZhLgzw+3gevbK4{h#IU|6tXJvRk8~uo9}XZ%jNTCVs`k9H+`I zPp-xUZp9h=*QpnS3WMomr&)@<4*$9F?5h>*T&K~i5VTc>e`e2)WYE_#`<=Z9ygF&z zVhIrXgA9t1yC0$HPJ>rnUzX3|?(hGLKJM2ABm+rleDpD7k4pH<{Wi|yj^n36`AzSG zZeLmsLPoOEs=)i~F1PFlwZ@uV@IDbhAN-l5Pp;_u#kSdFcR!HbQ8Dn6_hk#NCaTGq zc(Z!!paO6|nXj1z@@ic9UDEw0hlL!4EM7mgm_)+Z$H1_ZH-($&$D0DAMn^eaVS}T$ zd7t3i=t?%OWelB)^$qK|S8^{OR}^G6BU$prP%8et52inoF@=9^)}n`qd6^PrNAeS^ z_;!-JDh^Ogm=MHhPI=~kmrpZ}Jas=g+$U2~tc#Q)BWpp(v}&~?H%ba&Z%{M6!qLg! z<6<)rRB;MZa5J#RL}JuEi5*(#`uP2>~q#;4syMUX(k8Mzyj~5+pe~o3HT*$i{pJrC?V80eqC;OJ*Vm*c=@qu{)=UtxBZi+h_`?+8 zN#A!3|FgR~Szm-_^s@-(haDP#4Z3(A-KujKzP`iK5oJ)}t`T!~%5_`?pD+*)T*jF_ z@q09zV6SG1%qdjI0+?s$;xxD#5vgjDt`Ln+J9MIZsau;~FzOd&-Gf|2$G$X^dYr8* z4rL|xo=i36UrWi9<{2(9E)i|N6yBbxD^eTqJR~mby*3!tR03KqTe77F)dWZtO3Zw% z(V_(&>-Qh_&abkiR(*&`q7{wGv3|#aM>!@r#NVF{n$B~NIG-|R<8GfwgXK3(;jK}a za-Z$Y3gFR+fjthF+WQVm8D8}Zn@e5$BKK9GSW7GEvYqw*K?>CIYPN-U#rUZ%PddIb zFiBTdio7)J3<~U7kq(E~4|3D$8o^|s=C`Y`5;DDndkL4Wkg?9-hvt_o)4?WHJPOcJ zEdUU@VZ{4;G@W2?=-A`}&?`kuu=i`^br_5G$C|g6-VSfsf<`hoSzoOp{SPl#65-=+a%^Boc zrK(&XGH%-x14QS;kVB$!8b_kctm`Sy^ed_>=?w+ri*n0VaeNd%R^^ZN2;#pyv&0bS0PfxB~w zVG*%mvUYgvQP}t?6eN43npCiZxVoYCut-)LnLX$-AynM;aww8=rEbVVQ%OWY7_X!3 ziwFVp$&2$5Dl~iPk&mq-k*i|efx^VC|IQr7G;2S|BU305=yt#cW)6~BiI~x*+kdPL z>{n$|Z*8w+`VRSSX+GvNcmKwjMC+gtIR_)*CfK6q6i%|3*zBHB-^rx~fjlRsHu|qEL3d`0S|@VNDRv$V2xIZf<8 z?nBQVpy2a$k{%>VWZm5I`f{W65RP`SNGrT#+cQ>eI8A;*-Vzg8<-Aaq9cc%2Fmxs! zNY3E%5Nv**%2q!vky=zi$pc;7m|(<;#oFsM^%%4Dta|Nxd}Y(~5$%G&J%K9SeHjnh zwnC`;HzPk{(z7m=97uCIf7b^@=({VLhj4&ur&tS z4v~~|tT1ZBk9Y347Tc?vuPIhcrrWlWDv53JAHVF#LF!YbfxT~1CBpX-o)IBR)~p5G z`f@z*qr9zn=WW~J-?pQlgQL0m<^N93V4uak<0lBVZ3rI-trjC8lv2q=eb?Z+=gTu+ zz5L~6Xg|2ktE?=a*P3N@OOnsG%wuG4(UlFXl~5E2%HVa~s`sRaIUwsFY@&JghCoZNbZz~O9zjpg;_-ne=;ZTW(V??L$^ zpc#n-G_495dvL=-ysZpFAb*HxCdk`47ww?vAjvvpPmH9dtUMm3$6$3b$ z8w)x$fO}>91dg!#95xlPOU}kh+NOvLrYAd}!Z1*LUqOjp^s0Rj5?*#l{{a}YSI<~~ zJiQikc@T$%UTvyNl2GaA!X zp|1w8Hoto%87#{`ZR8$xIwC&kpg0+VF?G;(&r53+>KvRwX*;RU3?pww0v-7`@+TH# zsN@no$l9|h^qO$1ui<>6>CLpuLY-nR?I(jgAGj&cU|2~qBd-_yJiXmZ01 zj;}yY-P6>e8hdOamH&N;5N|rjb5ghtDl`mzIp!p>R z0mrk7u=7dXrd0x3`*uYMNX)#TX14UjNyIJK%G+Ux0^s@~iF}XxR5fKH#-JxoM80|Msk>(dD~c=|^t{mnhpUl?-c`A>^JZ&asOIL?mmQ=jmAL z2Z2yV`FaYIYZIt4=oxv%&T3W+PwE*Hm2<4xkU&rBd^lzZW#O>X1Jp&2lXsCJJ6`&` z*BLT!6cHjv*AwokkP>nr+xF$=$9Fta=10!1zS1N&@8h|N3j%J58uqnw1xCR_XNQF( zm-hJL_ zeGvCvq}!m3EmQ?{nf3l!_A5jJdd35Z`QJpMl(U+WLO|B4#h1W%kAUNhSAk zmaH-KliFG2=_b}Tfuv8TmmCk1GKnrMnf$R5Nc89#xunctDwkS`O3z_0eFcA z3bov|9@_eaSR+`DcUY(%dCk-Mpl2FD?0d~xs19OJY+kbQgB)2VGk+zQ)p59C*?Suk zlTb2kNz`9rPjJMoLMq2?R@8qIue1V@b|OgYhfTIbn4#vW9`WwI$Hqu@XTB0$y`_`A z(l0XTeU}i-M)wRqMGozc9~O?-mQqQc#W#UNvC{~<t zu!2f7y+H|T5pNhGXFuA1Z+qh-}nAhCu?|42Hb%w5w(_@UPL-2qULgg4s z%@V=0PF!7JweZV(RYJcoNzKAvX3UdWAIr@Tvz`G+AW2GGS4Ga9=d2Cs+PQ59twMM| zbzsMN*(XWJqjDLUTz$>A^)rkaD3vP*Q{qSf+gMzwF($?^egKV(iiBH4qJX?C{|Dqt zsF_~3T38S?ovbNB{z<|4tPSfCYq?!@vz97Y?%_r#cu+zwY+PQ}hEouU=fm;CbY4AL zY92vuokQH*v{l819oB`CNY&=etr=q>cllJ8#XWXQLua*{8aL#S6{_EVP9!3?=s!x! zV&%exwNMB)Di*otLaBMyt=VuQ$~9d2!qn zMOl#sTT`yedtz;ayj;t|d>SF{=T(2T99d~=gSQsGxc{9+Cpo^FY7->3hIK%o-ENl| zw=R)Vn*orj)Gu@-s8{K+3(AdJ%_G@r#HFz~uzDGSSNK@?v)J;(&6zntrqVrZCuQ^_ zo1y5PF@thmE`13XXIkn>L$=jPuX(VET>s{jmR8sLsL9B!ll5wZ?S$(D##eb_NZnLI zmIwegXx#7v!oEK&9GKii;L$E%wnt-x6atTFZo_cY;0-YEX>r{TUTB-=KDFBAZXF`} zutRuWqv`Va#<|CBkk{fW6vR3yW-iUbkF>2!IJ2}wKKIozPN?yZ0n|4nGCCQ77QfLV~v+1lt+T%Y@X85ccPx}e zpcsphf)3L!Fjsl#)2jWML>>+e^~uF9Rs?svK<(a5V!rGyNE>6yAJMoABLKsqfgXshAlQw9zPCbR}AY?%wMQG#qFd2sq<-^u13U0ga3u%hWKJ&2`FXyP^(msdWsd1; z-vZkr?LyzU-JF~}4!v#vb(N99Sf^z=A9K(~uB92c_NFTv|Xl4r|Tq;p7L!i`s$j&nAKWsDyb=tABDojY@`u{}Hyp zRjMVFYcc(qMD9uOsdD4Fa-UpQz$}m3NEQ{Q-gA6&8tEE${KEP6I8J(?N>_BOLwkK! z@7ZnNW?{L#Fg!b5?e% zU@IOhz+8L)(i~P|7djNP=()RC(mBtdjovH+{wWOZ*lVy{sR~(K_h2Ig_;xBc;iJ*ZoOjU52oa#5aRQW@+sZ<>xE;iUKfuVz!!1#|8S-yae1GYS#?%;pl~X!K)^U@m z6mE=Y(~Zs@6P713;Ej(Y?`f9G+Ny4_#cZaV3p#UBi>SMvFmC!g)^_{-xu_A`3;I3E zgl#8HE`@(zy7?laK&+p=2pcTB*41p;FAZ3_2f{h~h^vs~SP=P2>LOaz)@}C@qT{ zaZw#^>&eMZpUchJ+C>i|mU^6dKTDykOO5->;X~*65X_@)OqRnS^V6>;?FTu+2fK(8>GoRZIzR)VNhI-NISpq&=31@1u zJP|>+ry8+4+A~%y%CsvU%&L7UziImO3RN_#zZZ3Tmm(}e_O?6BhPUsPs~;%l`7D3Y zd!{#AV+aPAV#~L#m%KMT8dk&QO6#FF2T6ity7QbAm+Y{e0ynorM(<$R{?1oOo{9_- z@shNy91@-{tL^I@hHI&3N`9D8VxyzaPlaBPp}XhK`rTX0KUZ6E$r8Bat?jziEVJKz zmi6pb0;&Q$EDTXXmwoyzRfJ(v1N=tm?UksFNC~yOOQC1_@+S@8F@vHh`v#4*-wK-i zk~`}}$CSGuC$YABFd4ex&=qf9j_&U-M}wo1_*uq&nox~9rocnIRFY5U3yDZ>HaD?D z(*UI+Ve7i0V|Ovp}(>UJmKZz&qC``tgw*WcR!ff~If4U%~t&9G$=k5VI-z0k@k z3M97RPZ73ymg!O>$IwrMHB=z(uMqpg>C5)A)ze1Go18qKTi0JR8E(|*-1kT8&hG}$ zhTyMLQY==Xp)8OSG@BgXKa8+`+GgC(?bqhM8yj!VVXb#yx|n+Mexz?8_tTO^ z(c@QC%Oo#4pwdsK=VPZ{w$0uGtg!t8M>6O^bpXM988~xzaU(}=I(0V}q7)HsSCvaQ z^fm)^`X>Hd^+Y~wQ}he>EAd|Sp7U%mVdA})VllRufa4R5_CL@?SJvl9JP=aix%9;* zvIQ5UWYdC@=Q*Y@Dt0$fyMB56E641Fj_N3Z?Yhrp_llbKk&3kya_r(nlolcO9etpI zvnFlt+c>_+Xlkf&%%+VxV|Q9Cp3n9nncvwKk*=X*#*bBubBkhM+1kne+jq;R?unBh zcJ(g?NH7!Ko=)|eaP1hW$oOwQp+`$R^Hj#Dq#JpSeY!+=PqQHhZ&}tBWBa|#>v6Ea z@v?s&cH_ugnAmpsjprSWZS;V=M!?bi#%7`1)umF!cl;;~j=Q~BG%z1fNmr*qyP55g zS|zQRn|{`bq^76h*Uc%J*>Yc|r*v~)iJ>~5yUXji8%?97d7>kPe=l=~iP1(-e>u8! zXa4NEb9Q5ADxaTrn7{WiBywTDWr>vc>(RH`z30l&zZyoJOj;B`mwOCx_E>597&+%Z z?Hv2oW1Q9AA`iTLjkzE*8LmF6MZ+|~pMaOKJoQI1umP6uifRL!1%cLJ#HGcD)Amkd zUwyF8ZxjTQq5Bkx^orRRwvv0;`%V${9AwE)asLO2mP4RqD?=IXUGjZIK10;&Tu)J^ zHL@sK-?zklazd|W>^@vYPrbJ$q5;;kGnjXMf96Pt0kfR+y7%3TXc!R_e`oZ_G%BN6 z#=oc6L`y*XVIZSzQ+w7Ns@!$&@f;B=V z*(f~xcK-`}V?q71y{mbr)7|Zwgy|Gzr88v5f_}eq*DY)@?jkO!yZj+UGq?hA0kzy3rb| z_wNaogV`Kf_NRVTh#WiMF}2|wR#h_;YdJAF5qi8|zu+Q!>03gxKNqGF9&d2CKu*j` z5EhduAPC@GcJDQx5=X99DHgQKLPNg?7*CQQ!Mg#lfTF;(zac=c?1Z+L{NeggPGXvN zji;7eVLn&%9S=1kwR-7m$v4VdGyFEFu*v=kI4$nHluQbI5`)Wj`xw1<1@t zYGu?lx$G|xju1qX>E5IxhTGM0t{twF*#{IqKwK+8nA1Goy{^G3)laAx@J{)e6V>?cura3-^{OO*+&bsB58lHb5Bq z(#u5J&mr#~wAKk-;P^o+i*7UGV6TcORk4#eaAVW?K% zU%!ztAIsVmz3`JLFnPydUQk*V5@Lee+>UJ zy;DG`u_ANeRy6v1c2Fl1XA?uj;b)PMw= zu}*1!=j#YHvvhTBCi^s%EHS?Puh3jw!8B-7cM^6JW;(S?O-mC)zWs?`pHwHq&}iuP zji_4tBi|W)664@*wsvKmM*?xVHrI#0zClqK|E z;z%pAAwi&RrY>JvNIRgSUd^}D{1CaUPhgKs+%;?^(@2*|Y;&f-rQ zw~WDvI@iN^eL5;mtB^=T<^6}U%8a~mslObbxGFcKRehsC%p5x#GULb^Sr=x^CLy&6 zn0s=OI6mSQ)$bG<%jRF8$5d9WMt-2UB8dJdnG(Hrf3$)gT)PxFy_}KfTC073v#YL| zA}Ax?KbnaM`lWnH1$mm{;uN(;f%3F2?bWop2m%l7S@47=G_X#Kx20kz?801eZ7N8u z2T2}}i{O#WRGq~aT>f?%)v`P!`O&Qee4-wVm;bUUrcX{{J1q@cq>qu&9%b9Zoryx5 z(u;gn;45dyICbbfi0WKEZXEQOagh8xJZ$ve%x~RFPRZ1h2|jg@G|&1Co?T&az1F5a zfIzK);5Vr{NwOQ3`4b5_6T+(+FO1u~62l}<+$)AjQAx;Ppv>Bi(6tGHN0zOI(gLsB z$s3ZV)6_GSeQU`Qq?q_L*?|Rk&>IJb_Gm3CAQX&9xp;dC{kZ$F0wj`h3cJ1R>uHsz z02n&*^Y68dnjpN}_DGwvTYb+iShAo@uU<{HIGdhQSBKaq_!xd{JvX9L>p}WJ9D0MI z!yk7ynRJ891)`}H6FZ6PmG;_E6MusN*wHIG7_zq@Al|3mS8KKJWcNJ+wG)d4Mrr=! zStPORY+r5W)0zaizG_sy+lg0yyqb|4i7pE+k~p1M)4Y$_Z(d{_;k7|l zX-bJekC!j->8i?0`}n58XfLup^a!X+(y_GF&n04z;MmW+`TT|R7SoJAeDMULV)`nGomW zZ7d`TRvLx8Z8hV-b#-zaeHc0K)Xu>TdI*56bfHY$`Al~LUW~a=Bd>nYK%lO~m{$_1 z``R=ryd5*GM_bJ4!)p3~BWWt(MtLTVl>|)s5Y;sswa#cQ8scwX0EDfDt@7HxwS_;^ zKBeMMzCIJDLQRn?tUNhZJ-iI`^D2jRo>GAmAp4GTIjyRSJC!Y?u0B^?9E&) zCjn6Zjfj!$`BL?nz-ePRme#T`*3~Q7nF6a!6V4kkKmk#M;UNNi9;FXe0s<>c4OL!< z5HK=Z7x+T5Yj53PgFLKJs=`a`I6QTuOa76uxz6O72IjG4;eQXO`RJ2Z+~9Jk>(Q;R z3Gwstm3n5bm1nF#c7(;*RlYa4OBAC!_Sdd1eA>D|_jmn%x+y7rDPqrNm-oj@y+6LH z$Got2-Re%SA59NwNb!uUl+FLz&s`-*j4%GHP@TN@{VT6p8uLxbZ-H$d+r)PX_C>Ou zY>87+p0eC*Cl2mXU(*>lG)*X! zwTS^BSu|m?c_D{aS$^1Ig}*l$vX}cvNf_c+#BDI?SW|+t5tbhC<5q^Ew+nF@4Ou%A zl4e?X8a@sDhJp1BN-xfOK#tc1W#wVSUK{@S`tP6ulJl#vYAFiZ&_`3QW4F(%#S==%4fK^^qLYj)_;P3g(Q=slte{?L-s;rrkJg%8g z7&K%QAR6kE(x00#V}ISr+4uA+RZs}@y=A^N<1-0`Cj&;q^OykYuXV6!HYsgmKYF-#H0TM)2%T&%n~ zGHWx~g=+KdTp~$JJv*{VA?#-~N;=d)1rx7k>x;-xAF91_sObPa48_K5=R)7rLU`!^ z>Fz4~qWJ!{(o4IvE>cT3h;$0LgiA<@NJvOYES<8_(nvR`AR*n|poD@TC@uA)k?#Af z{$IuYhzERT=gge^UNxWa#zvlOD}Q(>6&AocOLLMXus6d(yXJLd*WD&m{@ir*w5i_U zDRX~Q=k@B`REP6d`r=$f{%1No$$J}DHEjN$gnL%d-rO(P*$nk8_IFTL%IZacIDAgJ zKE8B)dA#a0ky;Qe<9F7*bEj+nlO3>)eW$Q8^HJ!`fu0&8obEn%33odglYSg40I5*u z!Kv0ATW}{#P-~Vn&51%;3oMi;gkMK>{XVh&uCX_=MPE`}NTJY7V>!W<>%hb6GRpoN z63vf?T`y9uPo(prZq6NLp`GC?BcJIkqqi?C*vAQ&rMTGcbwLT9BG}dFGySEZ8x*ir zozQTl(L-I1_#P!>Ia0lCkKUFHD5XWOe|;qn5t^`p=&iRjXl|FgsOt7W(wfIpI-*cwJc3uLEvsR`Rc4*-KMng{4AG(pEBsnv ziJ)i=&khs=Q(=-A(MYHsR!0LvK6f`#n+sLO{?d@#1D6;09Py4M$uus6_1V!ZM#Kbs zDs8qed(Te`7(y6~PY$GjQ(J_01cN})4CjC3lHj;T!Y zXt{v7wa2^mSGn1TGhc#nOwz2Cj>N;XHHXNzOZR|1t!@R;FZzc#7&-Ht`aU<*m!Du+ zKFz4|Kj+EWXOCX}qDUdE@;NVPclFlOO4Q_oy2lsxRZduEye98$Ny=59yqpf$F*XAf z-oOqes(YSiJZS_GB#d~V?COIB3HLQo^<%JyKugf^4jNp1IEY%1Z9~dcxkT$*oyzR(yvu3 zqOn<`Ba0ylG34Yinw*|-KZN{sSQlCr8RMFFWV_SQkeV6AJ4rdc%q~vR6s!$jO}rNx ziWoj(cA^Eye@SDQN!EqiBkmZWiU^w)!u;omtyhX~)< z*VdxB-x;9q4p@B$nbGaRTS9m8gPPC9@BUZ5+&wfT-x@D_8c-{q3I;3;U=l z5U32>=hPCXEFF|7IU!3o%`B0cefzkfyKBpk44RGAUt`GNaqp6l-@f>(s(O8%VF^EQ zt_g)M4?j0s%L^72MOhTSs32nEoMI?`5qH@6wtz+BWP7F&s7G$*Ua=dD?1&wP8Lm-= z;!x>VH@+pON-qB|gM$2ooXj5Y1&l_JO8HPp{oRtGsyJK9lE`9q16h)`9Mb!{7S7XV zbpf;3y%_R+&vkvCX5aU5B`iFiZTcmF;t7jjo6nX<%TBz-m%yp zo>i#W#-8IzDR~+$)$QD&0s?J3iuW|!LQo}V*AkLD&u9VyAe#&jMY_>v40)s27w zvl?A}NV2g@ocM0?>mSej1Ys__?*xDnqqg1yFOMgtI;$x)c8Q8${397A=>{P{74nj~ z(lmaMP0YIel+=xO_Lp;XEN?d{TIJQn-Jn`_nsYq!=N+H#TvIWRL1!~EI0{`SaSw-{ zX1`tu*{O!I*{HucRU=j7Z?Oia+t`>mGr}MX=qxqMX8Z zP`NLV4PU)I6cUsVvOeBM1g(&#(;FYl z_RuxY4e>j-AP!_>FI^6EZd-;%3F28z6uz8NLGgvHC(Vf5yq{`1pcwAPa-~RHP+wF= z3UZDLX5;3cB361l8AlXC+Lx1!?qd*Yv(G3EC9Ap#9J9Usn6ZD65c>>2f?l(2F<_8V zi8^(|JFmU>hy{Oo_bMx(x!#69r<2bU9{!mkg@Q@#-=NxT!<`7&M20*$M*YOM%KiOa z5~{=g5E4lhkFApg(6?Z(-e{7(yC|LdgLtAYBgf|3TU;1kgCm}g(Co1bCNb+&iwkw z3+{K15K2r?$?3>zm1grnz-j(f|3#90h@^d+LyBwr6-L-a_RA44Z8m*dU0mE{lvde( zwF0Jc0sFT(Q>w#urD6`%fgDjKO<2+$7F1)_H(tbQwwX9`jJ!6wGoKLD5zf$DCk*1F zY;fQuSAzLSQsuGt0JxpXR03+J%Go6^Qg7m{wPSJkwuAKJe8vUhXo3kv_I|bl)v@<# z$ppjUD|C_`llEheIspz!3!)sh%D;u&2@+qSrO0F;p%d!9xWw_*hq=>0r%>_*wJE{T zV+07=rT$Qp|H3}2!!}(6`c^jI=Z^D2Vb&`Bz2Xnw2uC9`C4zxxJUCJBDbwazlW`}> z^@We;W*mNg6$>*Q6@9Q5`nU^#T$HV+>s3z2nRUUk^v(v8E^mhZa?I~hbO`Ra1ZKY`U zv)bdlDtI|Dbkz6Hx9?8-QKCUD$3LZc8v8qQlQRiZdfF4P_TBYu#%V#`*6o`E&1hqJ zmm6GE?srNW4gIdwV!y@LzsM}LegTK4teG=Mxfvn*Q-(7ogE7d##d1nM<^&(@erEz6 z$6q(&@_f?i^W59*yjrqD2eed9@h+IIrRSRyQc#k>?SE31ebrZ+P_?L%KKKm z!AZayc3z6IN$z0%5(SS|^lL%{6!)K){<%DUyJ?iL)VI?HSUUQ(ga zLSs<(!M{!pin6(Nhg*YyO8D9Qk5{&Yb}Y^B^PiqgT;8UGm^l(eCG1OAsQxlvTv-4l zst9|a_NnQ* zdDUI(QtAyo&j$JiJK8cXHqJIWoA)Chv9Bpah2WpVCQy=zec%zjAEH~cQp|W=f|ejf zMYkqu!1XqS0?PgV41<|8M)prFj4eq{mRCT&3}JxO#n-jgfmL!7!u2V761!K1Yhs7d zI6G^XN-pICH0my8<)41pBQ%Y-xLsPm@qmeGcjc~R5pPFwk~j~DS;D5x=I2ZL@t)M~ zN(>OJ*hXEwM3A0Va4YuW5#?`ewCxgEUhX58eR+lMr{BG%cE+l#N6Pn<@1(r;eeVUZ zi!QAFk!(Fnv&6%P3#oUDBmdssqP%_ZzWCQAq6E^wi?q&8TOjRO>RaSI_e*+e?hE9# z+(S28M@^S&c4U0svy;~=4ZZ|n9pd1{ee{6C2OG8F_^G~3xjz&)8i#^{96clZPi6jU zH^DI`9ozT)>0E$6p~tj4D#f8zYrt9|ss}FG_TuL~yqfmEuTLRIR{NL@Kh3v8C$anC zBWYR{D;kT>gZ_80RI`9JcxC<>Z)^6Eu7O)(;)86yDu-*3^$=G;VT*=s)wfu~4-m0cU4Los;}`LP{>rP*IaQrlVgJ zI~CVHv`~T6J@A|gYkQo`;_XXB&e^>NKOCsxK}E9i7Hw)HS<;*TBY_Z@B{+_-+ zZOU3r?o(1<51qMDMg1CoIoG}>yJautN0b#9dkk^CsuNzTwMwz2d1KuK@~8X0lH!YG zvInLpxw88^ZO85@j;&q^Zb?B1Ea%a(FWu3=jq=9y;i&w{r+36)*?YW$5K|10hvO&t z%2{>|TjpS11NzK54-B&NojS*pKl?F5@-1mndy`$cj@dHeBUa=ZaD(v$76sobD%|ki zMj|%oT;kh*GtHu!~?1Llwq2<;#^J%7X#w0Irt`(0FkSbvobiI>GI}v;if# zQ``*YdgfQ! zXeilif9O6WQ^HMk!m#z?;RWL?O}FYVB_3`oio!a?%*J}D6lUJe#>JwK=9tAjm%gZ( zi(ndM@k-3Zf}K2X{w_E)?E*AE?X{1{U(Ik)@u&EbGV}RNf2f#hd=X7H4KY9Bb>z*! z?1ZI%osL6)Y@rp&E^+!*pXO2NL~PE_)0Y0b@A7+}czMXZ(L;i5f@e2ir4} zFrPuKg}R<;&RD~e3@6++aq5x|g*={?N{rk$xU z#y`PQzf%0~Uz##4#Gb-C+S4wT4diCL&Px|$+b&E=4-(BWnM+cO2_xD!Cu@XKFSsRL)A^O4C(tIr0#qj;kE;E7wAv8gcp_}RIaAs%iFME1`QyZgl z_(jKBPnkgpl&K{#b3#{yW6fHPpLhFf))DmG>GIdi`xD=-S^ph_c*34ojD4ZdxzBF+ z!$BGDt0vV{75d-TGLtzcfCm-DXOe#@6VWr__1U@IzBHhSHi5`X#6U9=cp1|s#%91U zSC;Fb2Da(=pP4=J#1KpM z`o@i}0}UP|X3Ps2OT5k%jE+*##Vm@t&mC3rQXJv~^JoHSu!Sr$rd$zM*Djz20SjF& z3+hH%mF+NvUb;qjE7)hK2F|eN(n`39s%8cAABJ|3Ny3|thtpT!nmlb62gZMm5oa5v zcV^gIt?{y$&S4^G6jVL1jcPCVoXea~>&P?%8hINruKwvv95*ght0s#TNo6q)M+<%Q zb580;ztjqR?4Sg7Nd0@!3l8 zzccy;k1apz;UZG2$#9$ia%}a(;kFlPGo|>^laCRT_sIYOP>g+q+SLiCJJ1Z`oB|?+lrL{6d%$OW@ zukT%>+=;T(*f!b~pH%~nIn820|K!c_#%FSv79!c~73B~lmjy{Du_T~-RU9HeO^9bpgeeEb!f{ISb z7B0_YmyesCd_14;Q?@95bC~`&Bni$vdv`$cyqx#_jjK{7Gmy%PrMFM} z*z{v}&fpYI)0cymB9g5)tEPW?#^{OahPstH?aM%J8&Ppdv$oiOL2V%*-$+pC-pOLs zoJ-Z;>_1t|F=1GlAjS7udf{LUNeYgEj}2Vof(t}#DDa6!}cephR3T_8PkePVHXO z{HsebUW(fcZRh++akJudB@^iTe{yPFRAdKa=sAg90{)VouW6~X{OE~Y2-9o)0@MKZ zTxL~TVu|DA?SIq4^>;pwp5y?K;iSl%@xe9VB`4xMv(I9o$xBZ!ub4+QfV$*||a!T_#O zjUmXEy}AcPibm7iT?uH^JLH6@I%aXqXEek0$>gwlWvUyp-4Y74|8DTY+LI##dqGBe zMpDYn8&2-eU6^15!!I|XKPZFLIXB*YyA5T7y2D{FOjrcs-nZKMA)y_HeHc`*?XHLV zz1?KtKpL)30HKz~I0CwC=ht!N*d7?4^Y6;`{x1lbQDqe zCMz}job^gtTT7+LR%qxFht%8Cj=~`s1%=(5iW5lvZm%zNeX$=*#4lEtce=`u;p=FC z8X7M>&!1%>)=Xbz`dcl#Vs$XtSH7mi${Kz{aExywSE%0+D7gyXC(JmSr>64uek#L?Ae`@up zy@J$Fs^2gxi$W(K&X*i>{rHpkx2zxH#;(94k=K)FLrcEwjxi4Lu9_Jf2&Pj0Hu}y+ zWGlLRlwOvK?f3rVVvMXy9)CMK+I`TFyeZasLNo$%&WMZ6$r3~4{6Mi3K%nJk^vDjN zlE{3fDb=qF3G^T^VQB6#<&wqny}Q*nJ31uy>I8JzgtmPaxwSU2Sk3o`L`g=Z&)!*RpBbf~E&*8a_Uv4CADui)b^JP7u6hpEwcO1THbmSQ>ni|>^^Ltm7Nj?X)-~v z6fcK2s^t`@zf`0c4sP6|v8X^%$J- zc!SkvqX;*coUhkYk1%3vmW+1VPTWpGym;={Q(|uH{Gq++ishEiLftDAzV?y-<#GY0 zOcJ;wv-LJXVRc&btb3DrH-Bo|=$C=5i;+d0f!Qc;t@ebD|XwN z604xp%;H-S)9gOmt?8K3=a*y4RK%>B@&n-%OH4y_;4uGZY!T9%-9acfkPY#isiQ22 zoL7;jm-56B{q>Ky!^WR4e8X(NidX?@=<@a}_o1(21n$sr6(J~1<8sU=jjGq$z0e{P z&Yh(d8R$5tHJLiVqShMUqCaj%4GZBP*zS)Kjf4QM763oQuy_3CtqHndj)mc@mgDw- zJQ;byK=K{M6Sr*g0uFdgnEeO&N`hx@J(er4o;ir&(}}+PX5oWRj5Q%T*TV&dsS>(o zP(05-ggW|pP~9#Fi7|y2Rz7)W*t!vI#9~5hr&-1Z+{HQ=T2Xw2ZMV^SVch)N+kG04 z*8*QkZ*P*CQXveqc=!Q1>HJecVWPv{b?xf%JTyT=Y8Ljjct}`7`fkz_mv9RseCVSF z!Y|Gsf<=laKJy)L(J{p+K2!04u`8oT2y!)DE*@Z%@Vj8!PkHTK(@qogz_p|^euT|H zfY-J)2J?)OI7XKgN|gzeSnFj?JscpbW$bo*G?sOjz3B+p`+~M=ry5r%2x4CcO>gW~ zLDXjl;zqyuG8BW=o_@f4kqBg#1k2TLWGZ?5y%Z`W0R02ERrB;mZSPLpDFe3^nF6@l zgPms}n;7O476}ck@uc~CIRyFa-8K(v8@71O!zVvHU_=no(xA`)U5j6%uWn*@&H#rJ zt5+r7ku8umY5?c;6P9yzh?wv_8dY9GSb<@zI;AH*yQCUZGk+~6P@4X{_G-Gm6f*@k-IHrwGsb$J=5 z`MU@1K>h=v*;BRmfGREM*UN?qwkC2R#+MB}-J4Z#)8tuOa;<+??nU(fr|EREg##;0 za4o2FBkQY(o!1ZavajWhyX7?JcSHy(fKJ#F_W(wX!unQKCgwza(@Z)519=RggD!s5 zg`3k8i9hgq!sB2(=gb4|?(1X{VHerPfG$7@K!%Df!?9pdbf^U^`iI9qJ7pD%*SRqe ztzj(rtObphy)TbkvR^H&?M#>RC_+q~9X?#ed}jiO`iWDZ(|M_=ZjbQgc(Mt>Lzw>y z3)KwY5MqNjz}qW}DUAU}@$i{}6kmL1fu@1VHhj9_>j2Tuh<0{(Uq-Xtk56Vz4t1p2 zzW2sq2VVwq@iqRTRvzepi2Iir7{H1R?umbG__mTrKG7|K_Bm(*51iI?n#1Mi<7B?f z{LNP$v;JyIFyc9{jYB8kg?Y$Tb^4v5-K{=?|V(4qjt!pqZ zV=6WWIr+$!FP^?gv!AXqbN59HauzW`GZOCVL+E#YM1ucFf>G-HfMO*mmMjG?;9|jN zp*P@C*uLV_ig!CMuqp*;OqyO`I`tOhZf9Yx3#kYZj_w4#x!J~Du+T6K-T3Gzm^ozg zI7os{!u16P1nPwJG0@!2@HII(?Xy`?jKd+~u7u@bo&O;D5ey<`;gNLGKM9ivcrsp` z!&^T8Dj2}LaYcpRPG_v018s$j3yxu`DuZL^jC)WW!<3`==8xmGp+9Ya@sY&nWrY`I zhX*E#0MPSvTSx?+$l**~UJ2Sj-`M9+cVV&(Mz8nGrbobBZ$C#W1jjCgk|rY$gJW4K zjXsF2P3qPfKl*;`MIQEX56zvwd9WO? z0gUhhK=2{pV61HLgM0~oirC~1gFbb-hl_bFR1$FpNGX>1%u-ESg7Q6+p~jfs@VE=D zX4cUy4o85evsF#Mstxa9YM82{R^oTT3=b=~F;4DJHHb5otInSg9=KKI_VPW^_+fLU zy=X*Twu^#MBs(cjsQ|6KrPa!5KgjiWPNN?Xa8B(1aF-V>esdj&*dVMs|_FGS30p>S=WAcFu>G&y#4kJk>y-c@6)7{!s!O<`p9L;?n=-o2VVU>I-n6sM2MbNmmUc#o> z89h%PcxvD1M@cC8yAOv#`%&aQ@a~+i$RJ#=4skMDVWF9iyF(^gGJ2Idx3L}fU25`u zx<5>`6a|AN1j!fwX^|icqB+!>0J;7Z#CIZqOVg=Ws`735j^Ig(6np}zlo^ho z%^+wKDobJHqx68pQ?{_R-V%%H$u)Fheoi&W*nK^tEKo6MZ9Ky*(UOw8QxMeZ;G>?wuaFjV!RHb0*Og5W1w!3+P2!lHp;|5a|tASRY_t z3AKArvWJT*i4RNFZ||rxw5F##oR?B9`hDQRmvoFO9mGH2%(8?^N=6@us5iQAnI~z47Wa5=&}IC`V)mzAPk^bQ&91_< z!7a?K?Fm@vFuwvTLTx*}N4Otoo6^X05K2uv3@>qL3+mbv?-^je^f7D%Mn6EL-Card zm=!QPUGB6k{scXmeqL98YL%{NqyFQW-H?E3`zwwz#Ww%TK|2dm{ns%!Loe>e%aFlS zeE2z1e7{t%M4H7Zd}z;|@UsiYj1Yf>)vZ+`(&B{7Rvl0>i8yDE_qd_=<1?<+Xm?)D zGzNREX0l(rT+Qs{6}{w^I%#iN$S0d6`b#PT-DDoI+fM7H@(IR}w3_Wt`KfWSvV3mm z_*-|S&0AS!zagBp>AFX)Rbx=dsuo2LFS=ahza0Y}TG{d!92}2LF{^Xm0KNNZsGaz&|d_6;!v7KA4*YhTO-Q(5eFiosVP4|#47p=lXS?n8)o?y@aq@HT^K1xV}f{<{xkoi$$b5%sdb&Lf4j zgjH?J+iTW@7z+RcB z(Kpd`uhF%eE;Amk{KA*uPwJ}+d|&o0J}k`tu@U$V1m52(5pYHZB)d3$GI;v^(N{H0 zb4KH06%LrSD#IP;TKzgFj2v$HUy2716>FbjGC|rL>-i2geu-X61*wV49aPLVX~oWK zA$f|8aaw7qwA2WN2wli!-yFiW=>Gj!x1K~HtLkWCjEQfB(};0hI<_C{=}PfPXY2VU z)oJRxEJ)R&yWO)VT=5;|+<`kJ3+A6~veJX>G@vNMk#Do0!0Y2=fM&Fdxn63*@nf24 z?>U*KxXv>S-fX=+?bcWNt;27W%KL zb%z#|G?Toph@3sg72Bk-^F)IGs>`3oNnPTKtdGwyBbHMZ%2QoSg`=QO%2uk763<&V zDdn3hKYe??xT8!qfPt@d_u^}vM)p!w1-dt~rmV1OTzG`1|Gk251qn_O*KiTn`=SUl z{r%?oEH}piD@+UN;Dw0YwchxTL(}wtdnW0FU0MV3iOsR?)HcN<%L}bMv$P)vx1rdO z{>2jiA}=AQXwfO7D)bl5hk<3{rrFz@wtTlNBJ9HsIx)jFQAwfSaqxbD9aI9CtOQO2 zeK0hK@5RFR@&&vNqY=c7j))~Ues*ZQKz0N9qK#07ZQ`RL;-(=0$};* zO7n@5sqqA#J0p~|OVEIpw|}y}j4|NEC@+I)Vn47kQu@o3gL_R@!{4#-kq>%7%10wU zAqx*W0|3F$&6c!_i{I5w14^sb+1wpdd1Z&lMCDG4!0>zGhG8Mip8y=IjCW1QGb^@P zHt~`r6}<_9 z;FKL^RK;Qfw!pGe3`)*NK&ZRn)M*k^14Z7-Oh#oy;cD52Moi)EbmcIx=El2H#TBWI z^6p#H$g{~x9qo0smn6xmeC=+#6=17X5jts-6Ma_TsXZT*EIc(q>rPJwai>RxyQg>M zXJD2C9fkoybfW7$jv=w%k!Gy`gPqej|B2}{Oo9`s>_Mz&x%z%M*InPqc4c#6v|`xH$ZG|D{O@v?$b zW?SR;RO6SasX)8Ep59>gy8&W^_Af}b6IV9)Wr@x= zTlB%#P@W&9rV;4a7`QJKybc$TVS`= z-S8g>0VCuFC`1<9O?($X0QWWR_09?-OUO^W)>h-AoAo<) zL%k}yC%IMbxAvn9Br__9&@)n-rjSzL;gWgGIfJO?=-=N%22FcxljV6N!(G?EbHa8* zFFV;89*F<}^lsbr1tqYgnwUikK3@#1iIdk=(wPkilg5pXAjzz(gZ;gp6pzojs6TwJ zTh9MbH#z;aAFJp7VR9EH(42mWJv%?J-8W@0LhMEs$Hc9wCvJSq#vDVj1M( zRAShCPv9aQyxEq~eDwJZ<|`-tvrY1*5BuK9$3AfPv?f@z9^ySSbX!noz-$3OnL#}- zLn%3BY520il4V@`z3+orpVg?{bH8KKuF#Qq)SLvX9(LuJr_ocMBPbC;_B~ZVlfw#* z5dD_&w6P^71R&Z)xTL0ceE}GjNrB}wN*qFoO)+ZZ*m~Q2);V;uWt~zdAV}9s#fcW# z@3m-itN2Z1tk$H*M!IA$p!cI6`vBlZkFq-$d>!i+pjabDXOMo!k5CHzG#6^EXNw6= zm~fCN(Vqg~Ya7KqEk8Lo`OIr5PY3sYFh)}+Y~RPSZj)ywU0X}i!I09h0zXExn&u== zd2(*9yHcP~R%ga!wP*OR5B!sg5D@W{0Pj!?COM6OU)_ssv*G+DhFI3CHZ~QxPVv<5 zE@J#l*Npm;tP?ACpL$_byo+&d342kwgY@;1mRfkj;!e_467m$Y{n?lxCMXPu_L8Y% z&)h*EKnRcth&??%F3zXNT`v`*=S%209&3&8x9a;dY*ZFpH7v%vS^fLSY`bBV5U?h7 zpT6Wookb!V71NfVhDgy!5-_jdWu zNxP`R5ncafM_7KBJz-^I(c8I{QRhqsy`&Z7&F(5iZKv37S+|m)jM0sN23p_^K(J(k zJq2Fggk<;HDx^4k@8<}a$PI;2(uXnleUDoZxNKggrsztd5GCshA&qi}O^85ai!aIY zlzQb=M865{3+t)Fy_m@eyyR0h2?jbFx~S1PuY+8ycV(5yS29%~V}_p*?|QBmjy0tP z4NJi%-(nqN855T9ndB2B4{KO3Yrs!-s6uAWZ|h}bAf!QYF4!#$MRl}d(bn73R0yL)bJD@!g-YJXlj~lJcm}5*5X`>0MS-Uu_!CcL z_!LXz*0m;=I-)R#?F~z}!Nyf|!r#&9$6~gOtS5=5Tj1~Xl6O()$0uE$a&{6JGQ^h0 z-iwiwUT(Tk@Cehab$p0z>0!^yMQwR?cAf$m=tZajZ_fx!6IB?+N`*hiPC(k78X2Lj zFFy1Jvo>5Z$=CGc?wfX)-TzQ3N%$w4qV~D0JfF)23qc}Um#Tp`uL{5KZ}FUQrW9YJ z9S<*k-)Mbx0O{f+!n8g5cQvNCjQ%a=fEoP1#gHJD68woCqyGQ$?=kkl-RqkJsj|~A URi8wGuTS1kQ9>$yQZPmTA6Lv3g8%>k literal 0 HcmV?d00001 diff --git a/img/logo-template.pdn b/img/logo-template.pdn index 52606f5701c62c79bca692489b4d19150329a5e3..7b3f8674a4da6e0bbabd8ad72030cdd89538fd29 100644 GIT binary patch literal 73191 zcmXtg$ByGbn&v)Aqpt*p-T^ZM&>K;7qLXg)-g_SBE%$9UvbU!Sg{-VnrX)r%{?Dc@ zn)v_ypa1ipQ#NRQT;~5c>ujt3>z@RI{PQ1GUYFJO?@zk;&X@JS{)zqbA8UN%Sy*pX z0RE*O2k?mhK#~8T5FGyxjAaPwpa1=z>Ar4b|KI<)RePWOV;ai;`ez;RmU|*Er5ri% z%l!D2i_N9HZ5K8Cp3Mbtl-#=X}_+>o{>PpFUg?<)o4ir0*+d#f_ zL8`t#=zO2*X|v0HClCVVHjJ#X4Y%*aI8al$X~@kF3r5t%fG>VVXxLQ_@c;Ajz>iQ+ z5DdL?;lP@vf?;PGVW@e2Fw?N@RxuusjA(=#1DopwEP~AD{7`m z|A4kJZZbwI!tD6I`$WA9a;I3g-YmO!_%$CI_%fkm{76%3_WYage_>W+Fo}o5!l*0$ zOUaP(+Pa%pl=g$yL{-jLX;G*Q)t1^x*;|RdGi|qZ&or&46VXKxAyCF$!b++RrNuMp zZAFg7Bm=o#dNYz1X+5*oQ#lU4*Dw~0L%qgaj}-LPs5w7FFwcP(=$P>dJBsmpdA=$L zy%=z%U=$-(uPsZ{zB$|YOJ64wpO#bp+`VD{oM>-N%VlO)LyA6C{eEEyb58F)%$-P~ zq_tQjQuzpjRyC;|A)_wNdEEv3NA!I2}ALO>o-;de`!k|cJUzfw5{p)&o3k@9L@Jv)v@&TxsI{d zXYuvn1w3)b^^Ie}=^RroUBWJ)PRUsob&mKqUWwPIoj13Ay#(h%A_FlVBH(5l4VhIZ z?+&@@Entynd2`cf(cR6;XOc&c8+7HvE>C4sEmkR~=Bqco0CL+!%))+mN ze1c+m{HQxS55Gyo4~25iuSt?8-piwJWS%hgp#?p)PAe&v(PnhKBY8qe_%|1GYaup> z-Xr7<$4G-Sr*YBlI86P^j^Uh0}caVr`YE1kf1xLF6%Sj@)>UuIqs zz5V8wn!$)Xs@Z|a5B|)0ec*#fQ`IARFVRsGr@ZZuT70NN7P?>6`H@pNPgzOGy<|ky*&;s&&cdGV z7BnxppWkxvGWlU&kiYq4pKgBq{^>=rduXIK)LS6K%}HL;E%QN9>9Aqm0$6;69mugZ znBTkP7-2w_HLc(AcAQRgXYVmn7Mx0yP5FsA#}xDDncVaoOs z3+Ao=jA#85Tr%bGw@}Wg3}5XU+CFMS(5o2NjTp1*J}I2^xG5VjKF&^ zzp+ruJePYlu^N`wl8XQ2O9 zF(vzyue9q9m|K5T*Kxgj_y5Q<&OOMMs1W7k94*;asE8owh(C#xPowWXv_9&f+`NG8fHXOcG$b7>PDv1pWvNy1spPT}SM*)`zF0Ss4 zjL&%^aDkAXF5NAbu;hDl)bFm6{5SZJp~J*SF=pX`^DUNrsDM!z^&Z{+q!W<<>mFuw zG`RaUh$mx-N)xW$#pYIDVEJnizHgh_g3sx2>J}YD)rO}PerK*Txb!Ej+^PR|M8V%a z>|;E8kRy_tKA${aNR=M$g5g4u%pOf$R(AbtZc!(N^vCJT_}HiZhEIv0kjVVKC-HSi zUl*JS!_z_Fj2#FPAtOSO7z+>9g{&!$2yF6Kpfty9z_li0(K%E61_iuK~v> zA1rMW*;E#r3)@1$r|95l$EjkB2H3n{^yjQ!GdLsoe&sSxJTU(^yMR9u zk;BD2e$gRUOCmu7pZ)Xuk*q+tzNHWGD+I%h#D%Ni-|idP z+z7z!=Bj_RDwpD6OS8npG|4c9hqC#hd{6b-3RS^N7(GyQI=1von@p--okenUwmb+X)C<)3-s1)3pJda+Ch%JPcIy+$ryc zeaw)lyIe64ECksUlnoEI@BC}--p%MT|#M%mGtcLN>t#e`+ z6}5P80AfM?l!|~*fH&#sEGZ)YtDOyX0I0ELG2*Cc$a1K%Hu~onLD#;dCY#O_EHCvs)~kyI{g%L zdx*busH7Z{mO{7v>l()9^>B^4tcHFnPd3LqcX2;nS^S^O37O2ijcBYW7+(E=8JL(V zZQ*Qn)8u$5dK==2dky6tfZWCPk5o<@%yv$G0QVgcnhM^!j57uF(Z>90{W^_#aOp%$ z?3meC!0W@}457B7`?gGMiW}Bjy;jc@ zibg-s&w-qk`AY*KsL;>rSTHI^O?T$m{rM^vq;>}C&;6H0X;aJr*mzaEbs>L?F@-y(K5EaHW1xP;5q0I5qX)>|J1>)5j5CPRI!gmF`QHo%haP z{Etz^NQ!G=z|a}QwJK1_KN}x^@cGmQ@Ia6)e`JUybJ!he^M&~2U$XsVw_`M zRl;3^e=H?4<8k3PhsU;ILMfQPW`hpGBdGvLLJZ@}z3shh_^FZI(sADT`<#urH(Y># z&cr|YrljTIVwVIXj}XwIi%C0+<$(U%SzhetRLNkm_^sTO;{g@r1>1Ot`tKunUBDJ!};KM`7Z${uJJK z<7CaJKi}T}6>W*45NtFqKdxWBOAL8MN!s)-Q;GpZ#Yfz=RnPsxoQBj^(zjVpd-i0J zMyvksS!r-Ozl;i$TY$X=)bW}Um}()KhrPp}0#nriv&b-xU!`yf=I%Y92=)Xp%)nV; z8K#5BShjLP3X~1Ip z=yye~TbJJV5>V*-L!U3<73(P{#;YU*H$UG7$8&bq(MfFWNu9d-sAe=+#U6 zdiVnm``XuJ`qndy#%Iw%8)fK;Ai3}~fkY?X+~<%He_<|)d8}S|r?i8KLR(CdaUtJg zO?F|T zmTFp~9Yhb?p)eGU>tPz)LK5WBkJDW`1Jbu)c{65xLU%Zlbo+ox~UC zm`+JBqahcLuX_9llY8(L8km)6b+3iH2dl>!RWSY!@|clfbz|o}-~jYSdR^bfo)vVe zL<>R)RJ1YL?s}!M=Ts3Dl$P~R@@VbRzna-jecPNC4ma?Po;p_SAbE0(9b@-hFMOh?Qg{5)FCCLEV;@0*qyB9tMGO2)F(+o z8&@b=1?XR|31Tz1)Y_r*s57Mo3k*~Eb=h{V6v7??9kcr|pWf~jU)ajLd1wbei};g6 zzd$2_+BhI|dwMqNnq=P6g zc*Nat%MV1HaoLl*HQaDx3G4kzv6D4Nma!1dcWdFcf0#TaN+&t(&c?uoR zV4)Ni@!X^3x6e$KLw$A}{JV6Q>Ed3T*ev^a+3$29$@^sSY5N^0pSX(L}QM8&$#c55>eo8o#rw=os0(VoPKhD zL-F@~>c=%dG$}hOHr}7_CZDCJ)z%F}=`;d^T|CV}fT)J>wzGA(FQ0M&jlKfCh16H| zCBN|}VrZevsMj$prpvy?cauhHLQIF2OJJKyoW@<#AdnkJu~e#>C$Rxd6e&^vYw(E9 zxSz#;LpIGS-^WoMTgY~~b_DKymo2u4#lV$>%j!n>5RTNJXeb?b5Cuju~dR>)@N*Tczub4|9Hq?=tNaetk)siM@ii7V7C~jH)v-&OD=ip`q;aQmlKbhsI%Na1oalkRw_xzx zwA+W1OWhYMf5ZcrOb!E5H)+(7rH_fLSOv z-uD;jy;Gk$*^xgx{IQ(8IS|mF-VCA&TL1bz-vRNEHsPR{)5I*Gg5N`>X|WqRSCn!U zz2?;>Op>O%?dHMz8{^>zt$ zqzZ4zCTIZGg(^D8)s|={v4f~cpQy|M_Qs24S(leD{u_Eu#gu~XW8>lT!ZlCFG~n3) zwrKqhKMq)&e?8aD26PAk9heVH`t!l=3}}5LJ2$1QVn-YaB{ky|<_FQQ>{t$LI`-EO z^|O4vblbzzo9*{i z%d1@XIE@aNYkG7KGF&-9(k4;PXBY9tG$)CX&w#&lg+)Vmo)CsSY7UQxDj;V1f_MG_P zF|Nq1QG$603?_8%>!=^?oaTm)OLdi_fe)u1>7aUlvrIk0sa)en-u^7 zqpM$n%X{!(zS}{1&9cEVRI1cB>6ZJhR$k^XFN~2LPLgvjFIris0l2E}F^w7hUBcXF z0lu$-zhu|hA(=*rR6tTuvrmx%&m#VI3UU%e(7uxP9S5LaE^cm4FXXcWbHA*0X`l|M z&&~t$ z$Z+``rSZl9axmu0*ALm`n_*tlnw4ihTSc(_`X)&lE`r!LFs$pR2d3 z^7*K|Z%;E0BfF;{-Pi2ItU5`)F9OEV_ET_=qGP%|D|M553s*n^qhHmL3=lYx4@%Mh z*_@3fz}JUH(})s4M0|wge1kS|wfp59qhrLo2WQ#dvbj5=w!*EV{CsWd*~mTR-#SC^ znVd_g22APZx+51K_xIuEtVS8TL0L?VHk>Q`mPhDr5v&%W@El*$Z29q=aqO#dI`1Z0 z-#(>qzz=54J=r0~pqlaOq7~SwM_OC2SNF1su?old7pnmUm_S$&Su2@JoZTvM^(cBwV5ncLw zUvE_oX6*_b?)HFh=4&+Hpce`>_G_ThQZdx~ZS>TSIaR@C0HLb@;uL|*2ed{tnt5V8 zqD~^L!r`e!`0Wqz?7A!|J)lc$M>kRCeF@}cF16QQ7P%Yc$r$?;<#b0e@C@xI8;}FQ z&(1G&Bx5HYeB=^ohnWWTg_4CrfJ0Y>ow{KZvR^+0>webjLQ*FlIX| z82P~Qr8@2)8L)SkE=swpR`P6X;U@nsSjKaILo*^o@~$iYr>_* z@+j*_E@7D%$$oKuD`5P&7$jAAI31pN0d~3@0{^R?7`eAf*epC3%Y+~Iflpb8*=<(O zVbd@%2CPZ=?pDV>#~OKV#X?*tBSmRWU>#R3J3S z_`z;^3=&uq+hO6t6CHA7QtyF9CT9-unMm0ZGne2c;$dF<^m0hN^lVvw!(9hT3;H)a{uB4Zcc{nS*G}MK7tALT_ zsb$B0Qr59iRsCvhz6ACptY9B!xU%fRAR~`=&VtR*d$%F9 zPIp?f7v=zGy)p09B>{;5hv4B!069e^bgFmJ%My|n3?KPP1AmRNZF2-K7Cs_7fi0SW zWMGpo8JB=IlPwoR@FIGzqgREC6Yq{2XX6i4YGZ)Tsej%iz;e+T%858Q*Wh6KmuBVWYN(lliIHqC9)6(`VY z?dkmUL*ElfX-!H6yn+5G+F$jXEB+${z}3mN_Uzvv3PZ9kO7!!d63iB8Kay8Xm3)OK zNE!Jd&G|AgPAYb`L&^2F4mtsM6)fKK-`%<*HMAFfe1fPXL!96w1M&xRfTR8UR@r_T zG-c#SOa-|L{P&}H*e=8$`DI2^@>I-vCIVqR6KBeTkH5*s3_o?~x=Old*p&XG@V5FLzIx{e1*cbC*3SV_|60HEw z&;pizmsQCC^cT^8zEY}fE?hh*ZZgrnAW&xEVT;V+2a15Efs;5(B{~~zI1L#OPzJeJ z{ZLA@otGXjC`+s$GD`;-z4LYWr)RL5{N~FS$!kF0>%9G`s#kyO?W5lS%9(=6kCR`p;OQqfZWBrVQ$wYpGbM-3_AgPKbS3uW}3=DkTj1QjAFxQzd$e% za5>~BE6p`k-)b)Ng@=!aj>q=*c&MN&9;03}Zd9^+7uW3G+&zj2z_qZ<>edM?my#pa zkH?e1?hg` zZsS?R6|>a!npQs^au1*EFS&ke<0tsDUh*JAwvq;bAsP<6A*y=Mf$?@h?qMY~I187M zC{)sAyEWg665lx3FFvhi-bO<;>`x%Uqy!1P#T+AFUG3fWeGs6+!CB11Z-AIUfKG7h zn~Hs5PGu12v4#8Xqx69vRQP4@Ghrh@&>1dkLjMTqWS#!MpTp)5p_Z#==6&O{5H=rf zO zQz=zG3|m)AZXV+R9#x*Y(-=o|YG-(gTug#^EPW5tnWD1{MbE_0C%tE}q$M1++$Fr> zz~SUL*ZH>ZAKw}*;f8@5xhYiLzJPowO8sWba1`nOHAfgk{?4JWgiiN@x&m3EaW*K; ze2W>-#IUgk`h=_ybOF$F6QDu)y4pWYr#Eh~QgMLZCC&i8a(97r(%sVDZ!|@^rgv0{ zj0qpFrid!{O}^m=1r8BXu;j`dCLLGWXrcWN>#?<-kWke`YAy2il3a^${f_NF$^o;V ztj}bNnG2i31z!uISPpIM230Ln{9;7$KW(utwi@Ea`|d6 zpy>6t>(jHI53y@X9K^`>xBmP}=!#wEqXqcT2(R#&zlCBpa~_sqe&TO8(Y{SN_MP8_ zbxXoG7%YMhG(Hgp@AadjKj$k5nGJxj1(-2+9J+fI(`9aIoI`n(pHgMw^a;Jy^LQ5p z4i&F1Tt^e5<99>_m7lxZw3E0rk^BxEJpV@|d+)j9f~_33l(N=bZ^y3e6)Hi-!~~h{ z+GsyxU14v$xjp%Ki5>lGlc#gO3_|lAk9nVl02%N4 z7+>>|s@u|KfvRj8rTkv6ID8}Xetm;{dn37l!C;NrO8k$rB8{R1j_@wHeb>lG$7dlm+YH=0Cxr9;^AF==DGrb5*Ba_zsUE< zIs2cMVTorU)g@u72%xj^^+4ky0A}PiNxmILGjKOd?%@>vx6G$nRPak^Zl*li^k3n} zv&xH?8xq{H7X!V%mV>lp#oMV}mYupSUYmlv$+EGAgtHtVmR-ozPf)vR?Z@X!!z=R% zRhiL~y)CALldb4wgg|!l_wzUqL)eWF|Kvhht0qb(*Vc;`&#t>tdwTR2MG?~8s)@>e zShKbJG-NqQ{M7&v0BQiyT2KhV;56y#@BZO6@_EZPTHX2j9cNj zR29J8z7eCKe%D=NcfZg)j`YQ!=oH-BZH3hU@P98=^`>Jn+zD}%TL-fI+YLUSZ^iM+ zd%zB%z|!~ddc*HeW+_6-co!2rIJh%I87TDrwB{9=@YwXj>3%n`WkaC&L?B?6YfUA2 zgGXnhAa$AaR|4?M`o4c$?@gPP6K|4@$`TxVnVC?%XfD;NN~*Fe{30%mi?{SldTA{2 zhBz@kTryjEuD@McYk}uJi{*DLI9#fDM}69DG&Z;F+K>hPd2Vy z>qD6l4!thC*`N%PpIfhXrmlf6b)Y#z^)14U621h7w-^uel40PUh@H@(}6CV+%8)yMGUT0S8UM6|C;Nwj&5 zCur`Jm?Qr&cW(pnb*{s7a=h4d0%5`e^Nz0*mvFMR^0kR2kU3yCmsN;EIbEKg#~0!Z z0unb4GI)1Y0m1DCt)xPgfSd03NRb_V#;3?y@}e`it@4>2+Rzy+*O7%Dpv#RcITgs4 zN>5g!2F5YkXW0|P?ldz90cuw8xwecTJi?GDzYSz|*G;O~mmw)x7%83^+n$pb#lk}6}@Df?puWPwe-7?@unMv|0y8~A< zS*L^hO1_;)i$^ouYXEV;Hajf>{<4$r6^JdYFbMGNHA!>bX{16{(XFjFUh@u8N2|fr zEJF(}zrOZ;waKS*RJ0xfDS zXz+w1V~ynRRGE4PeCbh!Z{b3yYFNqs_`8KC3gyh}DxAD_8bA_V-fZpn0-unW7tbeE zA|71;_L} zNa&mp9Dta#J;zK*h#?8g;jxiO`K$ciRO+pdKXk9^?M0hSPQ)9nHSKQ(b4tlq=@OD{ zE0Ef50N>mK2@FKnOV+xMz zll=lYC3=#Nt>w$w{7!y?WT1}p)K4k^&yP&PX0_c6&aiM_FWKXGSNX66wN&=Wo$%t~Idy@`lKb48JQTfB{6MJ5Dr z|4ofh3c5a^@CK+FXa7axoECrZ2EV{i6Np-?r3xg>4Y7>h&M)7w@l-)HVKgW*>1)?# z32GG%AVJ|E3gB#8CER7b%>3^O67LF36NHS0i31`7VJqr9I_wc$V-BL6Sl=u9{k#ms z5*@sv&!`b?&=k-`!6d{?)U*UMXZ+8kwmf`t`e%84}qfV)N%!} z3m}gwY}Rzsq1*$`azOHkqpIbg>3Gn>N)YaB&cM%BlJr$V_-K>BxyOh-7y}1Y<80tb z`v%#3_YUkrr|3FzBcWYNAVpF6VVnpkR5i&?^wRW5r7Q{ubvKQ`{Z#+}2ziC?&j&pK zS9Z=!;j+0cm`$<*wkeNt~$W1mkmAsSE^#@g_n*c}7_- zVj)%M^Jotvg>@(`z86JSg2uP8+-s zAxU}41Ka820j;^4jcXrNL!;}>7mn~2uTdW*#+LnLn?)QMkY{E-&kfFF5X)4^?(W`} z$mmX7JQ8!i7wJUc>}MLZG!Y{63dk3Tg|TvNg8t#a6~NnADTDKitI6x%aE0?V%6J3= zf8=qi69XMGb(}!dsV3qC6agMALwulrIY4M1z8L?u-{<`+_DOPwG8hAoy&X{68gMoK z>lyUFHd^$NE11H%fU^_fFtAcuo=@kZ->fY;M2jXCiHwLx{u>A`@zUb{wwO&c3+l{Bm3W8sws8dGI&*! z(*c^|kbto}cUsT_iP?d4>NQU>Zd#vE&g59}BE5;FbYNwyH3D}4nb!Auf+W)<>7ZbB zsmQB!d+qa0i5+x!72bYNE{?oJMhuy=;E-`B)yIG?CFTbYhwJZ+ABh;iz%W!?$N}H4 z_d!F?n}P4QFg#Hze%J!?$d8Sx=7`rBj4?p>FjE`Q%BNj|FafAVp!3J9kqaHsvVSub z1ou^uSWkSmR2rDJkSq<_hEq?s5xA9HW-}4#&K&_o#!>nbHN4^rmLXdME4e5cBRt9E zes86mR}1>}BVi{1Xze{p=H37h$dZx1F3op49V~@#U#)TieZ8lN1RTJcBzBpst_~}XyEa9v zdI$1+squ=@h`&KCJe*ZM_Hj*dkTfN4`7aB0B_%~AU-vx z==+hW4RDBd%*>M0&tu<;hZlg6(RQHRN+*jhCb)q|m_RFA$dv_vl+CKNd@Q{5I&N|H z1hw_oCwuIMLfw*BEp?eN zpRtr0knmPH&>yP=kgc&|kMLY#w(4FhI-o<(3~+?(r6q_}L4nLT%lpvuwDkg7ohj?a z-FM^&%E&Vz%wn3_s3fz$4U2@(#j2k(xeBNs39(&_2#5`B)$0HkgLB?ityS{~!rz^ki{LEb*x_`RBTH|5kOYxC4_j;Ur) zWWa;sL|+N-6}AgE;;qRmprzl2XbOCc44^k=)G3m_ zfc#$uui*N=9cEU1*9|l-#L?9imooQb6#?yb0Pn94_}Lm?N8}Q6r$KN~<=w|N%{nfj zHe^J#Qma7d@WR#-bj0snrC|H?-lG5NVpfFnn7PUo-jU7(ehTb?+?!SYI$9P%`y8lC z(RFhB?_=Er05-G*%n*3yfX)rTaue808gngd4YnZbiHBQk@$S2u8k z=Q+dkzMs$gynmechTZ$_J*=iHD_Lt@*YEeez~nrvR`Xe6O<^bHDrJdT5JngDt&BrK zM6Nb+xwsgZUy!0iifPcn88}SCZCxmMMjjVs%JL!hAAs znssK;E;cDFk2EI!2*pL;EjnXmE@>bsSXgnh7lBSpEe_;*H4+x1WHgkj0_?3;IuXe1 zvai@genpJI%h&ouv8$ki_dPJej$bVoQoK1&lTkrDhHnTbHGY~Uy`Gdt-F%YodF9h$K;ai}i9hO6)dH4C{~Yl*AOsH;jO+D8!xBMNRf zB0`re)>h2G)pa460?xv3l|ihv-r3hHUaktGf5O#tTt*qH;fJ-xVCVY;@4WLs{VlWMOw%se#ix4&yd!&!J&0?`m z42NXB2g(k{ipM~rATup=gQ?DxGFzXirH0PZd2iO}kBYg}VsiMfS%wugRm2)I(!?uc zXH?^)mInFSLMz2I9nR29DQ0mL`(4iAaj6BNYK+mMrmBZ8r;(&87P<};)HWD~12IwC+zKHXJnI|-- z4su~I@W%}>;4On0$%2W$(_1thvuF$<)V5g01{^{YZ#s5i2noza7%*7A33+SND1@z4 zqM8gW!w?kBv6G^VIz57}xI?*R3~PE7FR*l)NDV8C+hVslTyX%D(LjHLHwAFC)>=wF zOo=JOm729yui;LIt|*%otlC@9eA|^<)?BR-dZp#?YrO!bfO0Fz7K_?=G{7}4VK{;- zVa*Xav0Dh)k0x+y?6N_=g~3$@5p<)>)2ZJtx(S=`bDE z=2ofOCv_X_b*=+x3DLzNz~AiaPH|r3A+DP9=SvbCJS1DqYiK9vN`0_1f}pL~Qzrt~ zX}0-BZ93Fy5c}&-cv4DzL$kV7-tKg|u>aT1Sxqq)(o!sP-bff=^MOaM>>-8a!g;nr zQ4kzVYYrIOc(tI5{K#h9X|XghJp|3UHLxj;>IDU4@@TYN4l_=xiMHr4d8S-TE2x<7 zOh8Xhw|l4*s=mp!jPcY{ynMZh14yK6CM`AcLZkuO60uxfE+^wTinPGKNcu{7M%S@s ziS{@NB=}M4O_s|DBL~^g>yJgX&(%jh7UC)b7OY%W6p2B2YfMP@N1glg5SIh-yjcP6T|*b}WZs|$kdl<)@RK)YO0 zWYffw>cOZc)(e$`K&enf6>G4Z&^(C6b4IXQlyfT8CTIxh7KF6n zB+Uh~oW;PKs7AIJ>9Buj7`^&rL~6mj3{vBQjLz2jo;YH~awN>nj13(|@V!Q%q8l|> z+=12#wD=N-n1!qn*zsx+Ic$Ux(^jz(O{R+45_+?!Nf%)9Pp1S4YV``NatcDwBJr-A zQx*_5BMrC8ku$ihr)AM<(#cpFVR(o)0Kqev3IW^AQDbu6 z2y_7BaJU}hbMVb(p6BKJYPr(wc>|5DArQNuw4%XT1+hc2GcNSHF14hIDup%YKH`v? zzijsL#WbzD0I&#=ZoO0wY)jIob8i@}lDW7(@cuW>%ynhDl6skfv0DE|BpM^b1}>@>;NL zQ_d8?IGDeQ{kz%7?3r#OmjK7f!>TEVOAyw_Sm=q6y7CBvmgkUCIni(JIoys5_{ z(6%F}lj|;r{h_mfWQvcW9Bt(Kv!r5{V!tK<*~9Bt8hnOZp5Ch?Hbwfpkrbw0C#X}L z;d(_m10^?E04I>HNf_(s;K7Hr5H;^NLDiurl1h*zflgJdx(X_}DS{5;K&djhaa0`5 zIL2VWV8z0E6cj&9Gc|hlAgmUAf4l;jVb{jMrN(FzM+_?Ej_Q*&&^3o}%jg7CU{%al z0h@uu2xFr@T1mk9%VQHylRBN2eLp)^h+>pn#bD|?2Fz{?}ffFEX#_$49G z!SOKU(w`xioMpzEtTV1*0F4kv-!0fS&ji zDXxlrBC2b2Sxl2$oLBNx2u^J)Q3KDC`lYHksAh(j^T@bHR}{94Cad~jI1Ec9)Ab9E zAOah$2i{w|P@2^3SfK_N(8EKZE6ljUbQ1bl*K)2TzAR`+J^oF1lxOwXxCO29@ncAMS4HNnT= z=q86P(HFvO1b7*b&fJOLMI*RgM~KOWVV44ZTAA!MLb`@Z=*XP5R;WFx)?A9_s};W1 zGubli@Oy;}xGFy6B{-iQ@<_D<8W>%Qsg|neSFn%8@X3OL5R6u&DQZ!aWL{S_&x{@j}(vEa!#ACZr32 z!cZGCK)=ew>D-7jJ5;a=HD6Zi#a>)16q1sxT2qIMY0zUS>XK30UVvF;X4M5knqL(s z4TbMess~9%*u1ps;H7A!5Uta)nGDI#0Y|OZ+VNC(ycOj}8pSzGYaTOjs(QZEX?Yx- zu2`Wy7< zU1_j&7|y2SnGe~ZuBvFQXYmmItdqIA z>@Mis`ZdS`lSo_w%Dnc}@N=DR3;c$2!H%gMnMF|+0Nn&u;)w2GM6Yhr^VI|^A_}Y9 z^tg?eYB>;%#bn#8_|tgZFI?K1g7$9hoknn?HiUfBpr{!MIm+Xryz0nqGjSG5zb0F_ zKaU_}S`IO6SVWrcfC@`6!6;f?wp>gJ(q*Fuml?bl(#Hz@a-&;>nT2L0uimHt69@qX z=AZ}L=|1Em0LTdPy#}7N!zHBU%XXEoSrZjv{w2NJt2dn5KuLW#JW(6Qv>PJ%9vwsr zz{%z8V481{aZVm)WfN-xfoFl^PJk)oSPd%{1+qgl`0B?vQr~MA=*5gPT{?EK-&kVF4reYimS>XD6gpC(WGK}Rztc2 z@KYFBWln_EBCYaeVbaD3xdT??e7@hzLfS(kw51q)aX|N2+fP!+T;@Y}Z0O_y=$KL! z0|j_Qt1U(FhlO4*DmFauGHe}(wE`&^F2tjiGRyXoUfi=`5rN?@KqA>Wpjq;Ojp6l` zjYBBP(rp8S#RcUi9LNh2IHzqjlr03S19XM9<|No|i*}-p@hz@(qhl1W@$GZp>da6$7>Czw;16_xf?en5QL*1!sh4{u19e_?y4d>91d)A z$cC1jl&uWt70aHfq$F4c!qs5Wi*qfzH=dy0uw2OjfTN{jxy5ukaAXdqO`wv^+c@jG z5jliy20$toIe7^JR1ol3^RYg|1ifs{ds(K`E%1koYp@cWw3ZTH(PuH(0P|e{_4x?6 zf~_1db(Vu(eM|;9UY&3C3)Q{C2xd~a=BlVYs-#)3*jp{z-~zXhe%(&6uIURvv#}YO zG5eq+2Qw-nIOJ4swo`fH`lXeROCFmCx05<(78MePoLyD1k*GSLmKQ*Wy5`>)J<45R zHMLQ4Tr9s9e=~O5hj^*kPJMu*mWWz$K@G_jQ$``5iO+RNUyM~W%~#x2K+9AHxE@rD$RUtWNIqCSMLw36P6s$*x*`5JFs)3D*U{>X4p!}s8RBmmc zs}*Pu!)Qfdad>C2tmJbGrIU^pxGXP>$RL4H(XqM{&=H1tJ6D_d_^h|Ga!6R}0(XRG zGrQ2GhR_8BEGb){=cqgKV10lZXxMU9H|Qdus~F7My2uq1r6S90V&))xT6Jx#Yx&)@ z1g74h(Fq7Zf>L>;N;Wyrf7IkCkHhrhn~q=y%Z^8>KrtDvSwKA!Tx|`qRio#NmBEx& z)uP;Qfj4=;%)+7%5izvOH84Q}`BKN3@T&-gG2m-DIRvX(sZfzA3gA8jku)cIGA|~* z0X-GqR}o<=%;N$+L3S$)|lxrEzas9IW`IQ(dCSEPbviTK2ZoM8lP zm1wz|P*`Oyj(A8AI_UzSWEDoKX|h(;9Sailr~a5u)yOgbF+jW)8#pjuDA@i8;x->hszbXI+uAzm*F^%>~( z8}nvgwVGBHv`6DrNu76HSx*3f+E6XguW%3>nJ)aHpC8X~XNAzP9y2H=LO>=`oH|x4 zz*L_S&7c6YZ6t!?$pVTe+)7gxw3P&tTl6Yz)2r7TeNh1!O0HqJ5Cv#3Ua4se z6m}BpChFl-S&(aE%i>f7GL-fRkw$i_mKVE_HB2a!9XUK8+saJ2Q`Oe@CS}&_G|=)? zUi;ZqA|<_HK{8WXTofVQgx5gQH)^ABmzP)+o8h?}R*Og+shEC$DDwjBcL2=*vqu-O zg>nar1z*M>oJaflNKz?H_P}e0*NgsAqX)nT&FMi;pD9wg29T7&z-F4DhyiPKrEIqp zxV1&`gqzqJ5JV)c0vaIOW?;z(97VW)V}n}E^8g(k`AxGj@*Y@t z<3h<{xq&n*AlOtSgnVtZW)!IgJ8tRgH7SIwhI+og%!fsxTA^21%Inf-REf$UXsNcA zRUiV^lI9rlc*XwK@z%0=X|WiOS)-MMJuMRlwo2gangv_X=3S>f?G}3p>n+I8uFQZ5 zJAu#!o{nc(KNQy{r6KROTe6QdKm-A64gj98#RS+}v4PM^Vg&-8im`ntGv77{}iAI(qagZ4h5+V)YB!|L$NQ#XW8`42B z%VonckM~)SgTkB$h*WYYQ{6i1;O%NSZ`ty!oa^*3$w4QC?uZl-n{5yvp_Qxxyq3a} zk<0V`w5^I91JeH>UgE$=WyWxaVhPOaBgAm51X&%gb;emtFF~vh3N12*4QLP56)WY# z1_~TT8#f279-yLX61dDpz#%8-DhhgyJmf|e4hhVLP)~ZUZ}E{Ax3kbQCS9jGTj3dx zG|8>k83>?q@yg5=dXk?(0ydOZG};@wG;l0%m5NNf-JbR*CBVq`%UxlhYpd?k%(7tA zD$Q4Ar;=|iIx#4!twK|>N4+j%La+zA5DZI_I9YX5a+&fVXt5R0HRn@?)?-L^EC+6` zkp}De+IHbGm`hd_!m}i>b>M!J_Rv^v+tQLLBN>%%rcSNR6$T@bGe&Ga7tcW8m-N7Z zN`};|VJlUt$pc4+f!mq~?h$|}%sa~=MpJAHfUqFH=;^~DqzQyUbz=tj26pIN#?sla+D{p!=m`~jL0gCo!CN%%^+J@#YeWnVNgi;1u_#4AQlGA5 zyu^rwp+v&^AG{USA~8ZnJ_H*W%tZQvIY;n%RdWV{J(Jt&tefj+U;QedZ{0Fn9RilhscZIpDV>VLqizDZsz)pX{pw63D6PIS*tH6 z9JGZqqN5pAqn{Fv?W7c6H46h7yyQgPi#zL#70rMcI%wdL88qS|Hf+M(-3EgtiaI0G zn)>ZP%JBBI1lU#8%Bo2VAC9=t;!(aE7bOZ|$bc#vkhV&aC}s$`4DQw(hoBW00g$l3 z7E=r-2_EbnwoDBS64`ogRaoo*gBMBHEm7Puk+NYK>!2~UBH-FcEW~W+>VRwU6yoR0 zV`^k1qplc1%s|PKY;LqbKm$y&V!x$Kavt!aeM^R9Mb-vXaH}b;#${C_0z5TjjSt}( zsd6^BcEAH|=ng1P{Jz_sa|3cnRvKwSPjkSe1;{B&O??3P3_QV4S*1GA<|q)}M{r|- ztbCk;K61sj*4%epnl0z0bZm%mi`=?Dqf(9PMJTM3F(;mMFxKt)E|}V?l?G`D7#Kz( zd~U2JKv*l~D8>7$I>2AA_^$r zvdA&VGD%O45WG+%NUjEkbr6BIz%)isE(Maag6t4pFG%t6w8_g}0L1(JfGDkqde7N9 z|Le6%Ym^V z0A5PtWidc75$q4ewwPBPp;iODrC<|{C4d44;L&Fhh$e&9r`xS!$<}K{X_kn{(3xp< zW|(cwo-YzIYW0U{Ng%6p67;lIW~ODC8R7KW8yLm?EGXcEWzEg!<~eTJS0>9_ox5} z31!TIz}L{z@&z;ktwAYBNy+hY6u=(HWxZuljV6T~Ws*WD2}mLwC>JXbE0v>&FE@KO z7c|;Sl~Zj-t1%FUaS>f1Kuj|Wm!b;$sf85Vc8jreb6}uL+P2tIt~py0IRn^P3SXJ$ z>)nK4z=Z~eC9~(GuzSbaBU-_P5wohrT^m^N%Rs@v=@JUKrx~qTL-inSgvr80C58x{ z3L;PO=>*TpexA$^*bcSz9w$O##aN*-lw(N!S&*tQE=@s`;T-YR35yk4r6N$RN;L(x zRPK1p59g@4An1Y$e3D2Z0qBsgNN+8pV2=>Q$h z(rE5gOLey#bb2D%E=h)$mQ@fWR`AX+fgo%ipZajylyW^jU?6Bvgpl_#DK}%th82SP zpdBj_$F|4wd=sw<3^>V4QN2X(x9j2o|feFqD=+!t&A^|hxV3f`C66)jCmIdgdc(iEi zi@;^=&Q#yJruIWsT@k)iPzDRl9k(KU%nsW1Tn!NEfhLr}a=jd99t!yWrin2u3Al=c zj`fzL%Y6~&hhx-9`*g7*dALMFFsGF*yN$456pR+Y7xV3Xyh9CqAD@suOn9^&ng;cf*NTtl?8wceFGL ztgTJoEg*%s&iMI8XIgBbHcTnHX@{`<#d5#_oH0>tnHO@iy*~Hk{5)EU8`df zOHS3%45n6A1)vKO<7 z1G3T_^;69^CKW&E*}!5jsZi?4)!woVaJNpdBw8pAFRa+Q0>*+~Mwvwm1WvGnD?k=< z=0)s;OQcacP)VT6+zVSRyn)(v(jQosq|pT))tV4@@M5`7f*TgVKhq(e^5eNYiVdJ3 zQ<6vd9a1RGX}}7v6dIu8IRnWJ>2W~=dtXl1;)PYA0b zGlGz^`t>T_3}kNHM`n3RFVq~EOo7lWXNV`erIzJ3%U(4VN)vk7(h9I(^DshKf_2r% zQ?yqGJ5Hh3T@=&^_&P|1Z=oLhz zu9aO+Su|%IeVPRtSnFU08rqYw%oiNHK|rw_u%icx$;D{1pKrs}w_aNgRLvVxNXKw$ zaR83i7tPSPR%BRU0{? zSu2g>iU(K>NW}LA*7A&~Ocds_;p97s8oQlkP^m(S1pJ161z*P-F@l~4oFQ@Gq=ZDW z)|qz(p&hXGR^Kbpd`oV(GiK&=Fs?`HTDPF*Z6QzA0ZdmN^r7+u3U(uWTmm(_+k`v_ z=^2$3j>O@#yKGC#QHh}{`C*+OfO4qN3QftA<|MqSsM_vnQcuz$WMMZ8?Gdc#*Kv6W zXv95%l^Bm*HpNO}E}B`Oi@tA;{ay%nG*Nw56e<&kD6bj? zSn>g}qAL{xu;#7fdP~1bPr1?xnaVi@=J5_5>r*-o7<5*p>huZ}8BnCA(xf^AIjDoX zd<>#=Y9$C9K%5enj1+p{z<3_1v&12?X{)M6iVO@FZ_+AS6K0$ zuLF;(-=64!Tk8~E*)G(eG?I-~8z_hd+lo(01XEr0Oh4j9NP8|ivwVHdLEW#!&CRrN z0lk%Q4#9#`sEAuZ4{IqnLO2{bFz1Z=&)2So;@Do{A^6!J;3 z*R(9iyocGWya2qNh1P?9EzZ~161YGW^o|lPntg4iLp3dfjDl_^uCr}bSlvo=D%gBUK$6{{1J|$aZ6K6oI(;;=N zKJJ*&gsctJqOVZyiY^eNY7+_&c-|y+4Ky2~;O(?>m5J7CL^-GL>ZIJrt@-Y0qvgS7 zF)4+DSE+{MTC1Z#F1ByCrE#v*0s~*US}MfQMJ8E+(DKBa;))cc;A4-1mXW$P-L7U3 z3TzR!K#!q}Q2`T>Rdvn7FU0_6FT)~v=`%~(azMP7C&BuC`#0U&iv2Qa5BNAUohR`1?ChhofTf zP>_uyMl#Vz3LZBc;+S2IAXpS(DkKQ#BEMp~SVwrXBrA*dP`BsQ^KA=lAs^0 znj&Pi8IF$S$uuBLj;>%DiY}3f=Jy+f0ThnG7(=iQ(;D0Bbw`aL2NKs=_7}BONn=oK zpp`}_iZc#~WPrPEw8lfVzT){VTt^NRsT)oUnksf|+Dmbf9lGUZzG{GXbQx*=RW%v1 z9EaAqWs^6CZB3S^Ff3Paw#Im;t*Zs7nb!#M_Ar)&B0GVEHX~9VK;c%+)(Ui0ECq3B z5mF8H)i?mUP;Oitm9@Oe`f;MyTvh=_Z46%2c-YE76}qZwrbJ3}-7TiT*TYqE<&Gf# zUkoM;5v^JZIKnzTY6Y8pvI9kp$UrqS0*Z1FE4rAkAS|u5As^--4q65sEZnt|7)r;e zqzL7ghCqzTN_BwV0m7M?N`?N68i+8-Vk8{ntXM17mb75=FqUjkg&Cm3jyqLdwy1gn zRy)^#eWVZj&58o~4T?amK?(LEVB~DbsNxcE!ql0dxO{*C5rrZ7Nlrija)BouH8)vn zXiKYQ9%3p`Xh?Gy5U~{o`Jog}bBl%})xyM@Ec#wl8#TpowbEVBPeFmQ6sb3pJGCjJ zbZvR5#XUsIs0gub0TTgVjsr?crDUjl0Fz@&cL1t`7vPR+2KK^8_$qLr;_@st3grUa zrvr5=Bb8AZta3xpHWh{~4~aAp4AASf`9x~~#6nu&<(UbQt1-Z^c8rUZcELC!T5vHtV3ByIW9%_^tfm6MX6cHgx4G9#nsOdl@EoJNj z6Q;n-iMHG5!8t^*LJ>^t3dNV`L~@~Clh5|lHgH9&Lf?oh+{EYzWDO5nZKUS`lNW>- z^A=Nfay6Pn=WYoh7>Li+d7Ji)xis@}U23I1)P}2?IjK<|4;|SyL<@r?y@mk}rV5p; z5Q@z)-gE#GZ4DqSS<$by)D%evY`+|jSu0sJ2g%X|NhrZAaiGP6#y2(MoHpzy%nTHt zu=!|Ca4*pF%d8BbHmW96DNhE45U?S7U?VJYWv|@ugrTC3Er9t6dL>=w4#-B7P3@*< z_Jc5hx&dKzU7#tGoBd8O+RDOAiU9DOYf3^wnZN=LxX@K8c6n9=VPB7B=YxUKoAo#y zc6LpYOj?Z!4uE?fYj+?_=acgZ16Lo4D=t-*%8gEChYEleY@ z1X-GB+Xbpf1NJo)P&pWj5@UF)!U78SbVyVJR(rcpCd?(W;Oaz;v-^uhF9B~H%)rp+ zWJZ?8jBohTY!<>UuLf2w&@rvNz|E#yXUcIYlx)-!fFqeran)EdeRfe8O(vWItC#L5 z(XA2GNCe_9%1^RBr8EA>>;mot=F<79AQncAYz*;o$aRq>R1N?cUaeiUrgX!vLtu3d z`YV8Q$?mL)hAi}yp5>qb2@t%bR4CVCYWLbM2&k*7Set_{^_GNX=HwE7h#&QedvNYs%=uRhb zD{4I?;)=5>$WpnI<_zG@Y8K=zcs1%Jp5#HMtWsR-RKTlQ>%FdBtRR4?f@VMbLZ>nNbgRYqMz>$Tki7!N?WDVA7v5Ofm>uBODBt_D*U^7Tqd zPE-yU=#_cbhPn}*7J>LWtl69fnzP8*i?Iqh0w^SDkLd!-FIo-_o|mfQ(sH{cAd(k# zr>v6IZNeCYMNP=f<#3>w0Jy~%0dUM1ASxCiVv(H2LG2+2DI+1Fp-eYy<@~l)sh0%c z;E02X>v-m(zZz(xkdQ~%7+%D7+pgjQAZp;!y(ScwEpmezurIG;UAG`fhPeb`S1Ae+8U_2XHzv7jidoS~> zIBw=po@qCR*{HRoRHu)maessoY7Vvr=%SA!Z4gQG^MNud&is{VM?|+~uwkh$BsAFn zfX9wP2E)xnW;TH^&)N@UuTh}{fbx-PH>dI7k>b^1#VAgZAg(Jt(rLP+SEL(cM;7Us zVlaXxZ$h3Hnu_Dm<<;o0ZxK87^D-5ccCV4Dp^2N06<-n4@WDK zT!F~|Hvz^pns%km)?*OZ#$c2mv<<^ts8AgiSp-FwX^eqJ&6N{wMIUG? z6&>Qo*=%IArX_|2?JJY^*FM{1XaHgfG~1kvg6~cP`+FCtioIUG4H3UQ4);Gm1Ot_$ zZS={I&hrzN2x*N}IqGAD66`$IO+HESwjWZ z?#x(BR?Tun>gEk|1Z%T-4SaR3W91>XLG=a`PTw2`(N z_Gy?o0hSE0bWbo+pz+bbjv^>OTw8$+OHY6_{2`UhoP+E!!ml6d@I?$#}p^jG8>FFxsvHck2Lep$QwR_#j zP#?AuOo@<7*iX?Jeq^mh8nobK=w;L1c8&JNZ`X1BW}_R zgT}xoK_4=#Xf`4xU9^EzY&@=2Oah!Qo&rcMhMcrL=(<%c1Pvji;f-pYQpBucDG6*MN*V^@WI zPk-7gn|9l4uB5)3KqUgWAiz_^WT0P_~|eF{)A-4}z=| zlhqpCoIv2PRUw8Lr1GVCl!u8u7Zo}Y)vK{{E+P}Gwd^F|F&H`p8`qTKfSa~4))reU zvb=&4v{o*ft5x6bA*gc4 zY)y(}G8#ZJr#gv6E{)GB?GSM4oH8czuq|87%%-v~sY}RfU9NBCEx@=!Mhuh%yhB+_Zih}|0NfVPs>rBS^po<49hb5y*wjXR zR8p{}m<~+3)u)_kIx1J?8kG3yhHVoqcXGp`PEqsev`y!k6cVFM73vuJ^9ns^f)Bly zh*h)+(F;CA!bL}~glK`laV3ec^M1h=RnGwJr3u;xsBH;Uf`OfZF0&w&hfx`#Hu!2#C@lkyiAp{i z*fz^rSOel#X=hfqO6{P4X<^eU3B!&r1%|<}6QG+cCP;b3dvXAl5GpLNHq;QspePOn zxI##*dIrC$!e%=1@wqD*K?Am)MYuO}c4O9G5qWtnqMda(9tAcs0PQ>k3YQy6xgq5_ z%EyaAIme6@v)rV#x!&lIT?{T2VG{Y0NjH}S6kmbbB^3?_Lv)HMM%#uR1jF|&&(X{D zdM;@!6|Kfo+Hl~NCK~9Drc`MPU?+ZCq5up7NVV4%fViwd z!LSH&xC?XER6x_`lqxmP=psRBK2;z#ODk>}XhyI+uNNUh3Kbjx)9gz%*cL1yo=K9` zDGT7nxiX{aefG{Dd|=+3$B93KFF;0Co9VW7@P>`>--Zp(!pHja`r{QZg9mV+j==!x zCrv9kfYB3u|Gm3b6pwxHAnX97Z~$IF(E|X?i{bn4P0y#vJhBe*ta%dY)BX3B=f-qw z3Rc$fUCTQN&==Ef*R8+iC5`&#d}evcCiubjCcJZ!uE_P^g}>)+WF=n(|?6{qR4Xrme?ugs20VY||0q82C4vj-cjHLVU{+Eo(7e z4@LMRIK7)UuYYxW`1cRHZP@Tn$%YNvt>5C-alHjTzx>Ys7AJh0$Ke|O@9|dG!{+6# zm2JCNU#c57Zd#w_?cZcA$D;!h-9|U92SfhA_4B>Q!-MuImyvz;p2D4IANZUA*Ldp} zTmSf=eMs`4gVuM)jgLV8t^07(D_+tXw&|7dy!@ip@XGV85ihh>+Gp?QTLUi#MM7E# z?!M2p`sWu~-SH)@;+uAY=g8k$Ef&h9;(v0K%JWD0zzgl|{F3&{n|6WcrI)scKHnbp z!g0bE&mU)+f)D70cYf~+ZSMM#Hi=EI{a@RJCbstEf7RxnUTE`mFKM%~>GklO`P*@# z1?arz&Q1A+!-Rf#{xD6B4GgH#Ys|U@aG%XZ8e57lbnU;s@DjU2lRNy|=|>8i-T>ct z(fKb{@aJCxT7K^QL)W};{_W?_)EzH0x93ZnLpJRN-+0jgC=xH6sDEbw5FQKw320w0 z9ObPqH2cPvHe1}Z&;Q))3+L;9quHI-x6k!`Z_B>xhd05)D_{1CH^Zlw%-pmeSudWe z{-4a;>lfJV#nUS_PG)+rb&}mWc?XdnSWz;z;_c#jG}29Lr>#HC{cTp?;kj>Yoz!3P z+}F=d?a%+_-RhN|KRn&ga2=@E&toguI~rCy!bEL&mG3PJ2r0K{Kgmm=(!i) z`uNfY){Si0Z~gEVc=+3#`9I*v#&!R0?dZ3{7hB#24}bfG96Z@}{fGbe4thNaZfC&A zA4RthUxDCviFFB*41xE7>^wOrg?z8p37uF2#f>XTZ?dulT9r0gx<$6SH(BNsZpp)wjT@fb_UCYG`A`0M>j>L=mpkH!4V%|Ztv@!dhw#>M zj;x=p$MSk0z2tls*FRa0>-9O`gu=u2e>-E(z5K>!H(moTzdi)`@rG^JBl3T96t91O zeKgyyht+>H4%dTVGh76A;^5d8M~~&LOVZ6lYh*={HH05;*|>2%Qa4<=p8nxu<96$g z*}CpqfBtW>?%TLNjqBduxISy^F8y1F>;MT#! zua(B|^XLcn`mOWjj{1N0W3RowzQfgT+HmE1l&(KE?)M)Z-^1?a{|}Du|7>skSFd)< z%b%uK?|lArLYMvjz4f2<*o%AX-!6b%FL}`b`|Os}#Q9U-KjVh-`KP|o+(X#(g|q+R z>eJsYym`nUuGOo9{XcgJGd$~reU$GV{p{iXKQ7;1J@HK+ehu}yLl@tC;9nj-__`;a zIUv3N##6s@&3EGaKYG_=PaJtj{P*9n@2}idzAip}k5_Np_T)3KKb>eict~OIy*J!* zz5o8-FTQlgDVG(v{iJNS*#qCc>$VF{zUVK1z4wp5{@!*hcNMYcQ+s^={n!6S-0A6U z2Ol``PgmY@?O$K}?%`XNtM86q{pVMG>t!eW{>1wpeeYY}_{NQ&JmAoic02d*>$;a- z_t)X8_S^5ZS4YyLdl5f2Z#wU`Pl~_&yd~II%>-s})P37re#V)nu=hSp9sM+!ocH8` z$6vDT*I#FBA6|dKCx7sRA0S_U*jzsOboG)WpYgx^=c67thCblFYY_9Q_x|%CH=j}2 zp`Gh34!l`n_BiX@Q}=#+_ixpAy5@w-F8TQzb0@s>iSPXK?uXY$wdcNn{njnQg`doy zyu)kX{*zyC%FcUs!$(if|1rsb@c846-*dma?eZ^NbOCQ+runYfc zA9m65t>+x}y-gS1|Jy&PH=1{U>rbC*eeUyj+$o59{{9bt;VrxDe&RikKJ}+--=@Cu z;@hA8!&wLaX0Oj&=w0>3b6;`AnP={8KlSN{ul)SiFYO+C>$!it?2gHm@5ujUySwlD z@t({H*WdM~J72jxcc-IH*ac47fd{_f;^dj_?mr~C@~$V%Td$$N!TjXo*FO62fxq^< zN9;>Jm^#&+_Pyj=&3`@V0&?dQ{mU;tZ2xP&oGH`yU9SG+=Cd}w z?VnD6X*Ok4?i9KwteF*Z+h!n zx9naXf7txdNmuN8)}>dRzgzy|e>`;luRnP670;F)d-#dpUV6nB`WH+quh_CByud&C zp6~7T%GNb++6;(6}#C-$@l*3l1hu_)f-uw<1 zJo$HMN~`N`ce{JQ+m1{Jq~C zvfrj-u73NS@B7t_=W@5d;n-Wvcm1JwDRo%!wg)~Ff0HaTUi9GV!3-|xs z{U>aD{lmBX{_#)$?EYI1yzH0VGd{ET=GSjjclqTuodZs}@aTK)z2oK`zjoc{AOEID ze(RvZ>pC}|ec@9l-go=A2Ya1()EhUy?}Q7U-RobDet2|cGPkv{;vHtA8Wt=>d!s#mgOP2D>prL1@1oa**kt(mY=}y6?XsnAyapx|-f74#a z{MkRx&;9sr_p`hG;=0$J@~-PYdN@8lxp4IR@9w?%$#?Jc=fassYKNUa|1I;x_mN+e zPx$5yPv5-HnXCIAy5!OG&)M^x`yY7YP1pT-i}L%s?>TL^Uwqd*>DO0{?tA66H~ign z-LbbGbmr}UdPDs9A-h=H{C=k!k3ROEfBD4a2Yh+2&S94vh#(i6$A5@>&#?2FFMX-| zqtzq3zvmNQ`q?)gL$5QQ;@2fzOh=JL)fYv!Ie zU3=4eA3FI8?xCOm;*Q6EaoOmO_`1v9zXyNrgO{8zJ$SpPet+@csLwvLhkV{wFyqx< zIlMHw@3{EMQ^|jQ+4j`I$9HG9=RWbshrWKnMfvcMuN-zuqjJQ7ANk9r-+d%_-2Fmu zpS1f&wJ+{=&S7zOz@tAB4-Kxq_*dW9_J%i4Ke5fW+g6_1|K4}r_Vg{=oOSNEFWY$a z$=b)4-D_6peXn}oey2A6@xmt$+?IUsm1iC)92iedL0|vCn{RyJ&fTthV7rf>cJhfQ zUcTGmcl$rhS>L<-;d9=7{q85-d-Ks7t~%+A6TVn~v;9bgc;Lc=_%mMd)Kk~~^=t1X z|8UN!zc~5IS6^%Kn|@;Mbo`M!e*H&RZok)$|Do|OUsHF#<#pxDAC$7Mp{JcUv){3} z|Ifs0_y5$bkH52W@(HuEKioaSK5OHyPu>1BcFxakyze-B(**}*qsIKK>(rf&zj0${ zkG<~dMVDTtmF|B1eJ6c?@BPpC__5dY&c1S&FJJfRuf6kij~;c@Gxxpi$bWwKQ)eIi z^6L)#!{1$f=r4EM@#-Ufh;O{B=|6PL{qK49HG6k-|G)=syI1GKtJXd-6oW=upeV3AwAD{P$FQ0c^{LDw6-1$RhbZ~g- z&vIW>Kec>C=Vz~c>;weO|7OpFAAQ$8KfF7B?KYP`yFq>GhY$VwxYK|9sVlFf9>4wl z#~g6Y)3@Hb)0eOM>fr0&<=%Jp505wiH6DG{Rd?L=&;i{e4*kRfyWFL}<=C%Xc#QWZH;N8ppPuduqd(P|5I``ZykA3Kw&KBm-+n@dR zY<@kry5dK#y8W&H7gJvy*Yp?tt%88GA|W*p5R?*-jtM9wl2VdVQ@U%g$qYbgq+5_q zkuC`d8BDqx89iXYU>n;rzrW}8JiphAf7l=Qo^$TGC*J4W^I4NAN7yow6DePKn3@^1 zGgv1|Eo2swyfc4~eiJ{+j94QU;Xtuc)s9;n<3)Dt3@3SLK)(si5P;b0boqSQiBqT(FmSgYg7W3K6NMy`k5|;5%A6I^8$< zG@C_smqWomv62u+pUAzgO%mF_gfSfO3N0c>wbMgMD-x}J9E}Xq>2^-p9z`YOpNxN zEjx|DcxUrMJ(uv;Eq==cy3$Z~DD_IjrS9@-;67hoeLz3bOzosP4BDe~F%42^`eUrj z^YG^%fnUFSSJjmttkqcfdt)=^&imGG&6Fg~2T(0Pvs9L!&sa6J1*kF}3+C<6sZd0; z0dk0bhg(OSPPmp+;BpWHM&$>wvuHR&G1*&**yDs-UvtVLbcula({*|+{D#fVygVKu z>{bc=?vdJgA^l#~*O4uke|5!?Pl6mD&hn3*4MbL0Tx2@4BON1P@g+ zRpm#l{9L^D)vH&{@7GJ_D1cQgXH`xnp&?>?>uWJ`U_I>mM!K(D(15T77m}*v!Uz=g zH_y2ns@?XiO&fkix)V$;!TEv?e#M?qA~6W?g{!O1wi)6nQA^=*ma9|*Mfe|D0}^x_ zH0xWQ9%cVMt(lKBkJg4CgJvn#2_}Fy*8RaYq}kex@2#%Cc;3wdzUWofGz}xFr}$(e z{k>wVFToE;19DI3*FRN+hQZBK-QxQ&vb;FH8IwD1;=AIz(@Ly^rci|Mf_wAObXHrx zS(v)j-A77Pt!*#3mMv3ZChX)OW}F@L4kCCBPno_iOa*g#yEEMix6yd2p>apqOCGYX zThyuK_?jZU@ATaW#AD`g`umsUU!R!!Kbuv9$`ykeuv~$rwYoV-nO{SFs{_#KzGA`K z-Q5CRDwt2F97s_jbs161+khY&m&JR-V7b$ zil@r@f^yeO;pupk#7pOaTsL;DT)WwFe*pMD5 zV4xPL|0=fw@ye@asH0qoX8LW-z65@qLe2%^En+lxSm3S4I*s)5csQNn1-IR!Bl#-o zmw}}8+v%mBE^UYOHW%O2tE6pF?$_Hd2p`_RUuzv-Lhulg@JrgHq-P*uSsLaC(bX~R z`x9s9pmQZUQmWrM?UYGwrhPtd^l$RD{Fz5d6+AbJJd?XAFDyo;{n@?msl+d@-ZG4;;kJ z+`lR7K@gqC_=CSv_Wc57sHTbEpkwGugT3nK`8ja8mi6i&tlNLz-jfQpGX2`(7otUT z-(O2hi>l+$9;yy%dWk}crdC~kK(mT<`~3B2w5md0+bdR34b@SiDN`}Tnvhb2Vp66Q zOv4!>Q_D#VIumRz0yZ4Xe89-Qap^t0eB6P%Ho~zf|H%p?oAdhlml`aAhU6!xOO|St z`0O*=+Z=$V`>nexbDa1W&NWW+sB_)i4%4B)x(mx)+5^{tvqeV(<+=xqN2bexs*L1P zdCX)kQwBvBJpQ|rQg|JU$@f7tn7{k;s9+J(wx-GBC6Vkd+u4zs=Wu>3W8kL|MsnWH zYc2uTF$6hJaVDDELT`sHfAszpHeK6Bvpyf^sEBJo>GTV>V1B&Z1k>Oyn^J#!=7r>W z#RVVaC)2tR3PzEOJ2;a1uLwWBsAUh|xt^@8=QARTXz&lrY38#s^C5-Ee2B(Ek9h2G6lx+E{9!43<*^>)hjBd|`usArZXPr(zy%gz8nW2%rd@OSjHaUpEU9$v= z9K?+r(HuxMCz|K&)8sJwGbGrzdYCRNk|YFuJM}K__~e20uthTSA0Tzc=u znft8s^7ksaQr!9X_G2)XI~06;yMR(h=L0p{ojd8taOdSan32Cr-#L?3n_2YV?&RY# zQkKy_L^`jPvF-z~mldvJF1VFK!jegoJn#&bP5=FLMmg`a=W3-?AY<-L-^ZsKQ2L1q zp@aRA_BDC481NEBBuW0N1JNl7bdM(mXB@rn1$7wfeE4Mkp!vtBtm~f@UJa4Zb639Y zQv==Ii93o#{(XgoUq7}d^hf~_PSBfKaMnU*Rr1~Gtj=Dk?4Scp#me0#2AY0Oh439I zIkh2zVIH=nPLI91bJ~nZ+llh7EYElihJk2&Y_)SJyU}TdDf*1$U1X0>Wz(<9!@E{y zc^jrV5i3}Ah&#@ONYrzqKd9@_*ez#c02aG@@L-DQMyo9dlsnVcPo}+EbL+SHqTEU9 znnqjF45^)qkmC9hH&9{z2$ySmvu7r!25WVlBysd8Vt>Km9f)=K8nZBIQiD}Qrc|r^ z$j`8AsELmIwO7eWZd!h>_>^%p^PKSoKyV~oVPhp}ZJIN4Ge`z$;0*_JmY4?#=!coW zc&OBtG;sBDOIBO;_+j{7NMstw`*B% zyO|rF)bXBuqGA#8Q!Tu2DiWE;^Y!b@YZzDS*B9IF9XO~IN1!ZDrqz?lIcY&28K^dk zk?}mpZuWHcFw{x7_5X;_p2Xs9**) zb~&=Xp)AJPr30M9eonDY3J*b&poi^g!fE**U%|QHr*L`rH~59F;3j`jZnLHox-O$u zFs3nUQ(AbaYz%f^%&W2~IK(Inse?wrQtuA7?T2HD6g@d8wax?&omS7yBv6s0N%4 zBYA$I{S>oPy5lBWomf+LIzq&5N)j9s_A?6_FaNUyuQkjw>2CKm6j!G|hg-sf>WbbtOg;WK>>H_klU!BkNs|*t=4gU^Oz_*_o(jQ- zwx~zwz(U_JZlf`6u4$mQa$QS4yL@qRnW^G~`PDwvcajaXyD9qV-f(NUH{4KH9-Z|a zBR~aXBy)BT$DmnsJ)N(iAJiqD*o;-NAx|IACur=XRcX8IeQ()Gm<}obH2IxoZ|T*~ zj@b~h90u2t6kU4b-wm{+llpXP;di`>xLn+w;m|%e319bo`1)XJA$#Mq7jbRI>M@oR znkM}@Cad$YE7H`E0|!$HRDz0n_@YRE;YgF5Q?B<<#^v^TmTm<#N~+(3u=Ex0@EkE>-U~^o(>ZWeP7{UP)ynp2day zYK!nx{DOWoGUS<_Ucus~^o(n=>Z6X9ZjHOF+Eu7{)~}w1l{c0!w-t_Gqc0SGCF#~SvZK=x$9K3rDz>jF*dM9oMyru)5L zD8<=v#KSr*6k@MlMNlw)Cy1rAxKl}2`62*dvU_-Z)IxECLWMk1F*rkBbuW^K>KENu z?Q*?#ze?Nd&Gt0B8x8yUe#1_32{*K}C;DA(;OVcASI)_MI#*tesZbvJ>eY*q zJk@)196-t1{lw6TP@_679ZELb*_AL>ChKY*%}d!v|0vfBWphBGf#2U!Ihl%trmo% z1`A!J^$cW{tWA|$zqTv54j7iHO;&t;t$qa$y{SIVr>1;(VN`slIaM~qD{b`i_f4YC z{FH?%>y&HPBVVQ@Z5nD zo;g~ROHhpKnuU+Ne==uQFSg&}=a|08XQP7sc_b(;mzMVBEpZ;CLfINr6A!J1*$Z#` zuMpET#IOck1NGSnXk(276|T1`kHzx`#&N^UIQ3`N(dhHo}7f!or zI3{1(_fS?+Rtl3iV)%ix!#E8zyl_#LZWh+e?tQQ_w9J8DJbH`5bS=c4=2ypR%k%Y9 zM&mn9Tb;$P?{r=51mb*RRH1pAe+0Ko?#wHQQK@y=Z_>00+dL2P4E2phk8=CQrIJ=O z~hi}gfzjs1Fl zr23pkp7X68UeV&2{g3l)?&G9>c)JenXCb*1@>B`q4Q<YDT3g3 zJx@p01YG8#(|3*p`^%~p!6h>8^YXsW)Vg_ND$)DT!g@lrLd44$-avUOM917Qjg%L5 z?yz>LUMw#+pjivT$HnJ6fY9U7A7DQIkj3jcz;ztK{TT4WCiGzI#>w>%vdeJp56zfy z4F&=Fr;MMj6i#!MAeE=xtr}mC8qu{J-UUI-(Wi|rh^yZM_GXI%4i-`PJ9~41kN20L ze=g8xi{MEB)bmAo$ID_3WqirbILa|OE6ZvI%|7B;D}Ji7jsH~qFu8>7B6bXV@zYL! zP7;)$qNqw(4fCTK(dE$`VDkA8$_pCc@QJ|ZQ>tXYg*?_j1Z~lsP==6)QKPwhV^n@C zJYig88^ax1Yawq8N~H+DC@G<^_R0_O+>Y2mE)(I|tY7~Y=&P78<>q`XGbzt$%{6?x zA`*Dxjcv(D;qJJ-ZQ0Cpurwk{`o_q5ZU2Wl=sDS*$m`at&8m=izKv}Y*8fzV`DExX z&gM~w#h#N8)zh0}VEKs5U|9s4%H|BqP7dw>VXYsOEgrhUjS4%=uUj^3*N8DkN-c9U zA0KstSO|v9Iy;KOmyKeoK)<`$ja<^6G>)D$$FK#SPT1IW{CkKh!m1-MYgAv}nDxEf zJ3qI>u>3xcT*ze>25ydwG6+5UtKo(Nq4yBL<3zlg))bKLJXGOct#T7-`*ZEB8K((4U}*-_ZyIuYN(%s8C-3 zP2QFMY%G0TtN+{ISd()H`p*4Wb$i9o(3(9alVT6$M2ASiC;JPw45X?4&@dO_7g}3&jE@p#@1Rr?0H&VEP0TPEcid2g&V> z>0puXbX67d@EYRfieMp4tyNstt#`tW)U1Q&M-~ldBeYb2yBG2g1OxWB9La)moMq$Q23Q|$34qo zN0-@yx;5%I%lk6U&;if=gslNGpBu8%%K`n?qgmE}cdo5bFCN?=5vK-tS7q&aBJ(St z^M;!CN57oNh1#f~8WI9gf|@3BK1`_v+#Jk0JOHDRHfTb`P&eeP3Vc8#?-|VnG&HHQ z5;#W>%(F^Dn+)t){zSr#k?QpEnsW1`Q%>OhJ70>9D)a12>e+dGiKUxBaS*)QWltEf zY|}2oms&K8IblYv1Z_>XiH3<{jdIlVOWrx>7Dz z$Rg1S8J!Eksh{ro8y!jy410?W1_!^|R?FC4eyh+GPqwjouiR+}NK;BfIJU+tGVIj! z&<9RtCWTUTw?P(<{1+!9e9%Vc3nD13O=wA(|hGK+hI>Ni3AN|#Al9Nd0em=&KoV- zqi*9n@)m7Xty&pxF#R7F$XB=+f@#en6lO5?a5pX$j}d-gQnoRH@dhtHQA(Yk>9;b9 zKU<#%OqDxW{-CY0jFc}Z-tQ2OjjtO2f)fjeXcE=wJtSW?Z7G|Dl~}jx4Y;n+cv@LkOS&#db!NKd|-0{pQZM2b;Gu#FK~F%K09^L1LLsk9xs?$mWiIu0fme8g|-HHXQ$ zYBCk@FBA1+YbZRkljntUi>J2zADU+X_H@GVzUK*WgHccKu+FCraK+#K5(qtOCOZx- zvj3&?YS%#ZpPGR@6{88Ch*dnC_R*JYIxQV<4w{rMz8G6g1M*BO=XjA(V%DwAHcXtr zpz#{Z<9fh2XxQ{lIF31J`H3jHr2$tZXFml1V5>DpiSg=??=63)=DX+OjrD;&Q4G{h zipQ4Va}qN{dAo#HRV+AOs(_WLoY_5~nCthjAYa0KmBXw6pp4AtE(MhE%WSiZq#YEY z^h6eqj`Q8z=Q~-x2;WeJcOB~z^I@i0t1^9^ouqxpHWG5_!egjF>I+`z@ncG?xfBXa zb8;p(ANHU1p-T%KtcEZiPdv|3`sFXuQw>}QeJf?QvG6oo0WW_}T*Uj}RjZcuvK1+9 zKesTHBnZiy(P*+7=@Ka>!oxXv7-TJYWgLD>AvD~9UI*M!`&a(-=i#F$qnBiA7Cm7G ziK}OCiA@@nloMX&r;`epz~ON{%t_S^XGE~X@`e3LL0su?ljDtL>;8$lMcZF@PO7(& z3y_Ha7Or=jRB+*9lfj!#o5$JZMf~Y!lzzosvuI0NmN$$7hF#sg?7w$x{5(_Qnfp@1 zqQBL02rfJSn4`t0!L2#ct^d=cZK>3Vg5r6|#_voGBVs|#X@1H!@@-Z|JmtnMk@8Mi zPrCa4H1Wv4=D2-KGbY@2xvi0PQyF9TKR)T8c4@0JD~t;Ev?*D@npMUw`s-$Q1L-q> zKXZw0MzTvvx|1ad>k4L%fScz2$VH3>z9Z^9i4hZCO?*5bW^#+iI>HNDL(9V|n||5q z8W*xZ+&IA%xL80B#77FbX{)_;H*Y`4e2Y^f=0)&U{aP}ym=6=665#UaH!>KOf7>#y zUd7EmnuTf;CbX)DVSiDBVvg{i#TA1w-TRpl_Dl0LoR+s=fEjh|%jOQs6R%)rPXaxN z>fG@(8%$B0#d?|C$9uw@&og9(d;wdwkys=&zDil>6mh-lZlUiXeE`R}<|DU4?$FnM zFJyiSmoSW0YU(FvXLI4fJoi>f;gw0^W2mu#2-U{5i^qBioeUy=J5666B;T0|plx<8 zc}d(wU7c1##SU0Dvf!U2l09dv=-HQZ7QVQ^Q;z2w3rYw7mipjAiYo};j4hRC5Yu=Y zUo9U$fJ?j9qf72Q)_8=8dR4#%b4=(>jz~OtsvY zGyO7l`3ky}n;R4ts<9pHA6Ab=TCOU?R8*_II)zSds@T7C$0U&KXw%}8xj2CbxYdGJ z1sY|5IE=h_dsZuJY@n7cy%LAW*$w&&b%s2KKQvpEC*;^`?coH+ z_cl-sY9Hv*?-#X;nlOU}-Y~I{XB7>6w`UNKJ3Kemsw~P=)Gv;iv!MFVpPSscapPjq z;pRB3)Uh@9eSC}Y-~h-_PX7O{jq|%2a`n<{wmSL)D!srB6UTEqu<4Y?+F@kUcKTXm zSignP4zG^rnA}Id;q_w;n_wRnb9>osg$APt14il_QU@p=F4U@j#ewX!=R+vQC4wM8 zs_5~Lr=A3N^akC&s@4CIpRGCOkq>^lfSa>$=47BBq|2HZY7R3H@>0x#*?&?#BpZ+Q zTP!_-%fe-x6)#iC2yd5>65@N(#E-ygUM}OeXq*avNApwmF_n(6Xr)xP3+_k9OB{}@ z_)~}0QI0K!DM@38iD!qAZSP2^Mvv&{JF2Sn6b0ndUzaSekJaBj)+yS`l1)BN#wXYFC9x?x|GJrrnXt28{5GFN!%Pw((M9r{cvHwn{Y zAFba3X)zetQspXOWrh=zsaxp%$*Tmi=YN;S-bLbLx-cx{yfW~nIgXy0-sXORhFo=_ zj`)$N!w11Ynl68+Wd96=MO8@5OEDuj<{Coa>)#uRAv9{d_ES91(~~8(?(g-Bel3SF zDi&g@42s>&XdQf#nqr6y};gN4;dN0Jo<$3TDC3ubH;iNk-!oY`jpXmMI*XGb?-=HH! z*7sDr*6U;!bi`x1&G=`hR}UaSdZ+_$^ z%tIoQ!*ENpvEZrpXxX;9_K`6ALs|0@jJFPm+`Mr%D(pO@3lBY3HfXd9E# zZIxo{plQ$2Ui|xoKypITiWImb3ge-Fq_(MH_tuS$8}vi}%*4_E<4&z>AL3lB$#Hz& zIK|P{lu@m_@|IMLAD6zk!=6QA8UrsquXTSB7rIh&ap`g5&~rvB36vQih|~74mHid& z4tW=yM~oJ7<8&v&|MNbG@qJKlTka{pb#>3s3^sfFSK&W>q`JP{!oxIRseJ96?=F2| z2I(Z<2ldRvl@EZkyK>Wt{?XB`svtA?`BLunQe|OE3=g@g!oj-4all!4?J1{mKZ$l2 z$3kM7$A&Ts*F_L6AuF6p?MmUgN=gW)nR%U(&_9W(D-`2&;zBy!@i)SF$nDOmeA42S zW6N#RX|#6usl4eM*$Z7W!L!A`6mZ=4{u76issd zM}MhN3xMUVPQAUDTgS~HbXn&SJX8tYqVG;1mD3?S-))7de&2Z(dAZeHftE{I0h?G) z0Z6Lqmkk?InqxTU7_oowkHVUmS^y|sh4sW9$Rc6l28`f&Le^N9zR!KaCGmb{H(BYE zT2#aj6!Y5vmx8fp9~ya`gj0-^DIXd12+At{DRG**#Cv}G9~R%_ zb_sCr_p=vCL?QAGx_QGODqjhPrMQETs_+&kdzuDb>EwAEQ`7WElYdXJI|mm1CA&HB zS<8C8TYC``B*S&P(81X(p^;7P{4${Ck``viF;@G6FUfe@F7@i2oh4R!<3?SV(%Aj9 z0;6#<(!d|*PcBd+cYovw%g*Lt{fo~Y_Z6kSXSaPG{HOe1!!4PeYa`GMZ#nOAxdY$v z%zU&A9;+wAfXsL%FZO8tk#05-x-R)IbIgsufp*#}endM?Hh@L_aT5-cHTV5rl;@Ow za_<)-boy$KAU@osX!P5B8izC6P1pN=z@nqDpd*Di@1t-VxKaGAe7f5tbjz@APxRaliWN_x@h0y64h=y#nSLS(>1HTNV|7Y<= ze^%0>Q#5hmS>yZvB-u;0ppjVR8V{=Azn7q+Mcc{{TAT%?dP+AYU1;#m3;LyDJuldE z$MHYv3NHgaed_=hH4)A43eWNkdRI)7+WK<~0$L^>v+5{01I}+9o8m${YXRR#?&RN1 z34v>p)QDBrJrT{2|6W~z5GqtR-XjM?Q6Hmp#9Z^Wy7q;}f*IR;8P;0({_n}&-Ih8O zIv=#BXG=kW-FzMCK+n zTKOE}l;{65Tk%!R7uTKw6sZ`|kKq4)A-Sh(=tse5rzf-uK8HHA`3C$CQO|6AZ7-jP zbej2`QNeurm_lnbz@dO1$RS%IdxP4|@Ogc50qz4qpuZMag zqUrMed+Ncp0MDdzn;U9Z7FrTUgm;{D-5us;Ar$$4{P~CRy%(xXMJ=;K+k>3_8xNl! z5ed0*vQ3NXOQBC|Iu%pzJN&cjIXwG4tqTR0=kJ=|_L6#9VD;Z>Sy>ZD0vqBlVlAGx zuu$Ob5|~_KE&}mHIdt$$Qp={w)U;sV=J4@rV0;04y$`=_3D3FeoZynHGFNnYls)hh zLt)s1htoDroAak|Tf?1S6b`mtmy??i)60}5uICEQgP(JH0t2bE+n=jaz5T&}D%cQ> zQw&PykJC1k#Z_Mtk&g^f9No<>@y$bIluS zO0W8+nm2|cSn(r%HJ6-fx(aVIs_4=$;Bg7RRqo5nvnzLnvBobk2)nM{(ai9F&&owi zD|NHfgE7W=?W!rr)~D8fu=2YU(nIKe2z839Lva_P8JqeNQXZJ-B#WBqnUuY-;F=}` zP1YKNCd>ReCY#YwBg_A4F27U7QK4edRVxJH^d;R&_4DZDv^U(R9J|M?y$~w3*ILNJ z9He*Xs?se`(X9xZ-j%7yla9pQR`p4j$rt~i?9XC%Dr`cWszN|Vw@yj;WEmZYY&i;w zeR|m*T#gRJLA?g{FBGwe zW7s6fpQAF*eb4ddQAv|ORawive7TK;@cL0eECUUArycHwRgEYAsLo?u)My(RZ1^ic zbwqs`Nb!AfolTun3rdQzo`|5z;C7ohJBt)iOVi0JYt7-b)2x?u2botCZ;CcS&d}l| zA*Va#K7W6I7~_}`oA_B_6N$*^(&a&c0Feoznmz$yR8?NPBlu14XkPl2kVL8YridSL zCX{0moL7C|gQcZWOe;NS(x^f$Xn!IJTm`yx-)GyZ4G^g-5W~2PRct&Yklfl z2z{CVYMdX&026s{-Y!=&=G-}@Xx}vZ2_F4s-ZPVu&C@I8oE>L%U~?JNX|Km0B@k_? z)&FUPKE=A;Wpd(Ms%^e0q`twxEh27mx5F^imNc=g+K}%H0e*i=nrhp(9X9}WV_LhX zUneU2FVyYl;>%5#_SKll*3>$STE8_0vMM$ zyPs@Zc%DS2J81OT0pl6U<4A$3+V3;nvD%#GV;wCmgMY&32PyCZZilIizCPPO5RZr7fQx*0yKfH@kv}ZaYSSCmd$7^waJ&I0;fcy)o9z&C*{( z5$>rUOJd`i<0no50CwoUva8(@UX4gSl*Yi*t()mQZ}hDqyk_9A^;x{bT=O#Ws8vE-tYpzO#BeNU4D53%M3@ z#zt%DlKW^Wu%09ePK%<9Q@g6rcs|U(0(zxlK=a6c;G(as*6b4I=R00t96qWm*F9ij z^woZULw4)r%nc?JXH(O|`V!6c(xuytx|`W-eypJLMhT1mM9u7hNy3~0cPMy04QS>O zhGV?e09wdo^F{6oQ2K8=sApuqOT|>hCRcX(G=sS4)Wg&f8@ zkA#=Ua(OA@&Nm}Yt9-ICXWcbtSHPy{R=FLQS*K5%5No*Qmxr;&#=R)T8V_^$7tDD@ zlEWX1-k*0V)${-Q-hQ8WNI-~u2zk@Lk zQjtA`EAG&tIg+24^;~}HTV9qx{qBU}GnMlJ|4Rw*$mc4_r(C64Zt8_R^yEhos>^lv zUgA_0h--yx`;+X}a5st>eU2xN~%CwJ4(+DI|Akr;DBw_isfAoq})PnAOOl7yqBNrJS z=ov%du2bBrkCLQ#+cnkqVqha8C=!H6nx3On@LOp$$oUcnZoR6;g%Hbu-FRc~mFui! zE|X>Ds3{`n6odygl_r=&eb(8Hl7Dv>ZmFdJn&*O7OKb_9=P2j=I}8K`ibX+9}JYATUp+kZ*wwx8I;^Y23><&Auf(7zWG=k}F^ zUjN8=xc%lI{$4gdA}6&%JVISms#Z1mXdQ+ff%OWg)-YPQT^T2q-n`5jv!Dq1rG^Uf zd^t6R;=wVtJ|Q{A6R9aMFK{QQsIyIWQy6$+_*f-_)b1`PeYIzJKX4fg)%Ae^yqa*; z=9kGX^9M~UoS)1CbGTQ1R~Oa|k2^g7IJEjUwB?^WQjtKr z&AiX{^>@sTIU!Hfk?m)z{e2|}vnnIk4#HFvUr(@@3(czF&io}|dfDZ4u6l9;1d?m+ zi1S#o`a4l^=YTMtZtR9JX?x{JxjgX}YZ${0C?%oFa?5hwhon$TA>fiK#k!;eHF5C- zsjFh8Crb47-57Ei`|;*5%&SjE1c*~@i3L|c!mk`vPPz?gl5}_>BVAr$r#2%ov21K? zESpn%fF^ckU29Vmz|rXDyQ8i22z#^GM)s`5s$*B6sBypJlWdcTz&@DqkL@KE6E}xq zab=mwCRL-$Nj38dh=U?vU%BS&2Cw3TsQPecg_rBKv0Coh-W%7la(T^CdTFS;d13Q* zpL_r`7b)?dPh%Q4%WWY}G0|71_-4H0Fspv&HGoQiR*kQ$`*3 zg?mpFOm`63=x^Vg3&KJHRC=~L!pG*!{yi7AdyY^_rOvaa28~_j=OHBxKa)7+$XTUPo&>oxEbj>k`z&> zoBmzTMyVP-GSZGywvI@XPL+yQ}ixk0e9{y_GgA9=A zrVdSn&B*25?Dbkg)7}BgPKTNAi^U@C8bL5q(k=Vb`s46WSD$s;13Sw8U{HeSCccX2kyHElClYHTJTxGSf+;pjg0BOQG}4K3H&6zNU)@n&8u zXykD;RxUAQDt}`-B6!NZZLKmBbsFD6d-{nwfH zCx(+;%gas)L!Xn=ZYS+O=0+B4* zF#dZuvHT~uzJGCh`t_+c&1?bV>@CALs--VUCIB0{7Vz+JyDN120r=OR?2@z07P|Q-n(3a8*6R{2y<)FZrZPyFJ^4yM0F2aAcv%JmalwBcB7ZB#F!)@!04K}$1ZtgO<5WRQKpQyf41@m%1-prSGe~V=> z-DC+&{hO(n@^>@)w@+o!(C)o*>&-OaNKPwOkdbgxzt0dcPiI8!#V0=wlW(k<9h1%WGS7NKIz6jKo?P{dxSy zY%%cg;|f{VE^PFZ3hd*|vR`OTUP&JAdG;|;Vs-qt*`|BtVD+UzQgLNTPjzMGka!g% zk#L|vcpdl*0tR0{K*NHH?&4FpShaUDWoMN?vd7#Lu%|IYYko&5iHXGu>g9B^R$HNi zJD__01z@;JAU|!oRU&;zPd)t!woazQ|IDvGuI}ao_pXJLDy@!s&}~^1cbDkF%}xyc=88e56Xk(4UUqShTRcW1 ziCr4hR=Q*&0Q5mq(g0V{snzF7%M4s9-9BPl!M2{A8~sP)pysDTmcvMO+9^61Piwz; zF|1bbPUEzSklYsQQMFY5YA=u6d%3$Aa+0Qm9EwhPw>R(hI!t3U9AYxaj0WPYnthI7 zaV*%|;AHM&GAx1w^Hgl~tE%!D)c$ixt$(+DIix1Z_PWYQEy#MA#xt#o1pm`ljP+U=WYK zU{s&$J*XY$2dW=t;%OH7-hLWhuvzO(mWW(RK^~I+hzYY@$@W;6r@Q=>Fp)1wI(DltqtFKSA(H8;s2Q}b5 zA4z)}WBA8Cs+y(Ml|(zzvjx)EovZ}_HjHjB5M4JDYXO3j1anLLQ^^iDnnBLABN$68 zNMrXN`*S-3-=BONj^MY|*scidQ9h7(9NdBO_S7G0&bts54ON-Go=+69Xn;LSdElh7 z>{4Gffqtuupbd34At&&ray`H0ySVdAwYUr~{q z6xIS&8QFyj$ND}#P*xwquzFz9Tpn56sTD{^zFQN}Is7hedNlhvH7o<=I#uR=aX^|I zb?(M6A9%=c070}nFH=qx)PT0|UC~fI7b<7!0LQ#NuV)4ZUOr)&0|Q$0#;$bZQV!SM ztp0#pXm0IuTgKcgR~zH5&B_Yhvir%TkA1WZ#Lir4M7gC)I$c1YrGmpcP!RL}VDzSR zE~UTe0mFG{o zqH^_8*cQ`L7V0MedR%Zx$%cNv%{lN?j3kV|w|h-v9m5`-e+xTRB>w`tPUGF|qm74e zA%mt|>wDy~99l2G+6k7iH~;A0iiFwbU{ zR&w$b@!CMY<5dAi&>os8XtD2k=t=MWYJc+qrWw0s>%*%+!iI5QbGH$0{L1lyWiN z^w|!HcB~gR)v|eCL@YjmPdjoMxK+9}W4Y176nqxN%*gZQF((Z`M(;#`VNI%|+uPXT z8lwD@MZ|X)PJ2_f$0KB62)UUtu0IhCNiPih_Fy|G>ZHZi+*9Ue=zgg9N>YXK|LN(i zoUj z!1v|n_x*kU-{W=f-97i5bI*C6b8FbjO$aJ!ixyUj`x@Vsf1ayeKeMx>@$mAuYv>Ya zP#l#HnyuHlD__`*hRdua$%m$0pds; zgYVLYOOmMtZ2pyX-?X~6aO?c`F=O({f*5p31{Ly>v(U7W-DS}~d}$S3IyY+J)$ix| zbgC?|*LnS3R)LkqMm)#2*SJu1LV%jw!g)w}cWXG~8+p!DocHVkw3|NdV#93fG~?q8 zqHVMM4l=R>?ecKX=Fggx$1$T%wrxg?kx1LP)gVpxEk6U@j{Tj1xJUsZjXCQtu4)vL zs}<1Mzfuc}TM~ur`sPj zW`7C1Qy(y`@;UD}*+Lj9xdajR4{XlXwU(|+B@}6t?qt~x|0x2ZW~1RBX1o~#qNqp` zxP=q?zVUUf!+V+W?+;_E5KRJ8rAFB{Htw#MMEw1Rh6p=qId&@gT$>sah!Ax{P|8{C zhOm(7U!IzS=_sQ>LO}DSnlzRPFUqZiT;TF~{pn8{O_fF8$wgS)ojErncs-Z( z{@{75s7C2DUem@ccW!(Pwur)nwA*5A_|^svR%wGWDy1%R9PsjolbWZ zKD5u}3{n$Iki`1LLWI~t zbc3Lck(B3pOYMy97ON~cTtM^YQ9`Hh_UCg%-Z%u5mber^kDC}7qI;Tep^b(3^-#1E z9&W7Ii{m7Rq*6qoq979FXNe(-?Q_VsPUvM)(bDdgxm5sGpsO&BhD@I)y)$U^#K#zQ z%Faa>V5M95Ai#o(dG4#N~~lz?5>=srEbXA z*i`;)p2V0A3w1Zv6l-E=s7fu+_icVZ?zHjKi1nJ~!>qyd`ZAxV@d~6SqubS!<|RI^ zMn`i+3s2!5{m*i;%i$qFdBK`~jPHjJDHU8k`ByfwxIMi8{^~n<-;InZx3%mwZhT?3 z1bL>7tOVjnHE-!{&<0CZKdCE;z| zY7ToL^osP-1Ct6=*WhWDH_2yXAPjT`~LB!IF|E z+w^rS{p?U#EtKP%0J79DX4$i? zAAgVo9}clif+Fh{_Z_l=pg!JH&P3wpDB=Zd$CpsH5N_$J+?^;&FUY89$qu4A*f0LG zw49KawVt1kG5@X0+u+XLB6=s_X2mmHF`CXR-Kj21Y(c`D8@2H|!+djGD?M|u`b5EDTPV<%Ve$7{dM6x2lasl7NOGC4TA zPI)vSx13h$7X0nH>-KFiGkMOm{@=?0pQ5x(o>0Ijnuy~w{cHRMDUPU!GD}^#cA6k$ zR4%;g_Y$o}p={D{P-TDbZK84s-!XYRN3+n;Po}Fi54kddKizlB6$hvELrKYAqkrEx z5o7Z^qmGM;s_+Yc>r%1n{ZnI1lssL0vgR;T;ME#yWL2rfkfeWu-30OX7Zfo%C7%?$ z*Af4?dZ!ZX8BKK}gL>|J!Wt2O%+WmA7%?gl-b*v=8P91x7`>x(&`gwOL}{sYfC+#j;f>+h~z1FXT}t)v4TZ^|)}x7WQ5ncl3!M=4%3X$gHTH zzrSUUrcG?4(n^t)%@j7e?jBZXa`*Rr&T`ZvxSZaK#N+RaW@l`iELcD3n9??iux#H6 z$u?-@tZmUj#HU)o5J!f+ypFO2EDJ&!}y*ouJ;)& zBVn0`b#|vcf6(};1qgA}2yupSY@>{3yQaNFR;Q4tfey<@i|!qcaHt+|i7y^Tv|0tk zwli}T|_3ch+qG$%Pt7tr6X1nKOY!PWL2 zeJNSlRw4`gfpD9H7d)o8LpqnOhvBg-L}mhemR(~LZ=iTT=&_JCcAM>c1eNtJ)fk`6 zQCT+G4*6zAWL165R6w}UDR$keR+fH}K5{+k#U6PJ%S7|O@6$rXSLL1lQMCu}!Dz#h znctSmyEMBC-P}KaZlpK)Nl8GqJ!04(y71OQ+e1T^Sak z20F!q-K5Dn(_f&OUeqjHnNf@xwnV#gT9HUGWI0jEk5>zCj+QnIc^y6K`^H?+{=>bA zvpZY+fP9g<`~GHmWX+{4`0Hia+{69eP@7+$etz-YMI3Csc!kHvVkf3#7t^VSVonL7 z;V}Qsb>9^bcka6k`|1_C3NA%CTW{R0Q{G~m z1j^e48aFj+LagO;Ljp%~^Mc%!-+=e3dDO-lRbEt8+@7!)6LP5>4)(;CZb)$#Q&ZFS z4#*fT!@O(OU9;EM^QDzo9=yN8VXis!zumikrLDN3Qy~tv&(nO1#QZ2vDL;=0{WP@tcVX9mqP1U}C>*ApuyprV1w%21hjq00@VRJLAKRjZ zA;tP&pZa~deOHJMl^J^5r`7x61iW?@Q^@ z#CwxajJ&Q=;>^0~c!cKZFn<)IZ zJ}V#^D?l#nZcI+emD-jec%%xRS}e{`V6HMypxsf`sYow^y*pWOCH~zKYG{≥v?p zs#b$m%PhSPQ?Soc%i-prXg@%Bf^807#Fr>l$Gtl5g-69aa`rR&50+vU=5k;XzJ`4d zOuo~%Z9~9$?;9P0C$we*v3F{zoE^5bb|QiHF_*}Y_YSu5w+}Z!>K{9wN>}S9;yLQr zyvDbh>!}>y^+B(vCgm)%3t9>WTUjjxqn#eNNqDfUluaL6Jc;0tr}bO-1Gb@mFp9tA zh#+-!=n;Niq_wOya2oQH;K7h1Bz<|=vwBt6WQj`MmHO1Zj;CbB&+!IQdBt>%erh_5 z%?lS;#l+PTphx(q1BhT&M3YHqq67GDfcS*}w*>P)XA4q-nB1|YGGmst1k)-9=8IB` z1=zrxSFNnq04{hhLi%H8Uq(E47$U;)JjLVw0TB2}p&dU^4A2>;ynu&_Izz@dj_@&yiwFICWo34U!*6>C zO;UDQbB=1|9K~!Oh64Z?W|mj}zkpA?XRevuc%?>ZhnwtP0~hnWlavL&Zejm`XxG)a z#(Qrsto<6(DM21C=9~&z8zmfkPKhd?5UotJJ(!XL?`&%8UQx~xF9*9=~}UP zmdQD-Y|-0KdY}0S=ZqrrdsZt=_mtPD>pS;NhZ>bmc0rcY$KI7B05lV;tgMeulYgjS zb6?zq1b%*d6}qwp*gbxwGV5Q^8>x3T*^_qYHp+EQmPfKbyZO8h_uuCbr)Li&@ja;? z_k1{mebUhgkB?uj6k=RF(DwH9^0g?sI&dmf6tL8>IXaI2{!^YzI^JHP|L0Oda^1=H zEEUWw-nQx5c(nUm;gr&|zbQI%&ko0FC+hlw99Y;=1y5GB$4;17Q_$4dTa4Eh{-oCn z87FcG(P7HJ*3+r&d8@^0t0_<(lZ47WkiuweA9P1NkFj{`DSr$NzMvF#dc6Jm^{>~d zS8~3y>y4Kq+}ZVwbSPix19E~s5a;<(e=!w&a1XyxCQptjQXk13>@qi4%XfUcer?ll zUMR~QRrLJ_%cMGBL*sp|gE~zAcoZ}e2g6T^tr(*D4^=9%i2Odg6;{dI&Nmr3^gWF@ zk19Q1*YYPd{@X+gYSHL4F9HRt_K9;_+#cRE^wpUT)t{{`26WZ~KEr?x2{FWo6G>M+ zQO^ZU1sAu|b=)AY&$?Qpt;13;9jS{U>#ON-%yU7SUv-v?reAx$_Ft*IacY68&Xu3} zpu`Cm=VS-zUR@JzACxk?{%--4z}PSv4{x zN_+0q5&4e?pY~8*OD)_W`l>;BE93A@q3h%Iul*@JZ)xue6`~H^3*4rPc*z3rl_u8aDMF);2lh) zlh|0~{B<~x`QlSS{VhqW1mm~?)|T%p9N~-Gtw!OHK+6Tl^t@r>*MOoS^2{54H&=Cb zf34kGnjIQkVhoU<@A#M(5#O-rRs>m}rmv4E6!uEexqF3&kjwv-elPtFGkcMC4+7Pz zq4N{pHfs4sK6hhsqfl1PI~W|8APIf<4wBXM9c+YrJW$!TvLp3{*F-WMUkEKiwjHD z0s1EONojwzfuU}r&-Z6Wurt1~TS@*2NA?hG-q9j!3}>9A`)%Lxh!kku`+fd+FvZcEq8m~$#`*l}#V^J`JP&zqqHuZM^^qd7a6XGUT}<3ze{lxy+=py~t?o-H#x6>G z>Te17kjB?!JYKKha#ybOdb&Y&rd;tuW$F2uE}QOUmh!Iij1AiKle-0=N79dE_2 ztn{wrvyIum5n@ZdeJ@Wx*cj;|n9et(&%}O+Sd87B3NsGi71^Q1qA!-v>OHPwyNFnybph$OQld!o3O@)N|_K_$4@R7ykKi1bjDFrhw z=`HRHkJ$#OPdw&kEQaS?Qts%SF)Y)67AU!8ad0QZxO?#hX>&xB>FH(zg%y`u&n&#( zOo_ig77WQ@r+Xl++bFHz-#>%!V(#&&(=$APwlO;|3lG64Yj+jP6P)GtS4Q9Q6ZGCf z9aZU0%G5ifRJ;`JUJUujt6981+Zc|{P4;`*`UfMbG#Y`-%9tcC5`VfqgN{M4W$iO> z^R#ZP4=}W5ho#)sLC;qPL>%!OXOL8BjuvcGs;&jSlzYG4oRjb?4LvuQn^4dz#2e$+MbMeJpe!iaNOMR*B=VtOr7PjrKcF%l#;GJMVdXahPy4jZCEK1`wm2+?mV=Huw+xo9o!>i-?Eu>p#Zxk;E=#LptLLCc3&@IVa{g7Me5U8q@KznNy%w{p^du^vvP(^ zv7He0*^`ahG#hey!G2nxXQc32CzjcL12eb)xtF=R8KtkfXFmS(+OR&=PQ$x7iY$@6 zNBawfLdlxEE^+0q??DQS64D4^6^PD%L`s`A%p~g@P?2Ejf-1xr>%~PMkUrKGiS5{Vr zpL{7QDnhY5Ay5CzIIgaeL3{3s5)VMw#I>2jEib~T>EkZbe$REx$!#$D2fj^)1ltC5 z{I?cz5>%Mc`u7uRQyA*LFIxsQ+b$-IvU7L4#&XHzZKTX;bc*H)I~<()XQaecO%T7Smi=_URIgO{Gcwk>Us1hv*;@E{Huf<_(8k85ZoRbB=jciv*E6&p zizHE4QBipr9wy+f&_fImkP%CBy3r%KB@K4$xO`UmG^o7dPto(0B2D=hx~U~=?$l%v zlDi$(;YRPNm}AcJc%=-SC1b^RL$#9lwZsh{X(p{c7DBYE!Lnce*;VA9gfTxo63xqA z^T%Tw>LrFFfDAl+tSXK1xOr%rXm=*F;^=;89Rq?y&Egu0+{yr%t-Iro+85F%)KHHb zqW|=Nr!q5udpZr8^$XdrG@c{68HcES<>cq*-h+4e%)Qt|&r}}JV3|%!Qp*vY4X3*& z8dKK}-4(sq1Dl{1;TiF7W+)l(huP#`X65LBbo)ilj`;b?lwdLHjzit?!_+(}xNU}j z?JXy(n%k>A&siT7Vq2GjYe(z0a@^Uo$e{m?clOZvvRp?LG7tvA0eU|>h4^JN{`WYC zI=hk041MvvnILm&Gz(?K&_#J(S4{2VqduTn68UysPEAZSghb9OZdtXVODS)}mfu58 zg2q$Vdffb`MMt6RNB9N(h?-EmtD&*ZRk1CTMumF0b47 zccwmwnb5%TtiJ=uMwhP7TyHSZsjM?HG7Pbma~h|0XU2y6tEgp{6K~!9WNw}jPfN{0 z!|X`Rj+mA~1-5>>E%V_{L%9hsX)X21c<*Cw%Fpvb_ms7}c;QVK5BCtACE=qJ&idy$ zbJHI|!Sj;r#t(tC-p)8MDE%XutlZ{F&R`*sXXEy4K!6D&yjs1z=;YyysI3)~r_%JJ z5yCa!+`~+Jvs~4@BXYR77->R3-<_|!K|)^qJ@Z}sMrLxN%A-Oz(hVu$(EK6w*=lxd zCLvsU@>-nvgLZ!QQ|F)c+*&uob`fj;dY^#xO;MXtH-i!6CVbRr@ZUHW5T8-ZE2b}a`PHo%JG0q_dv3Ava9G% zR;k1KdsX$$DXG<3ED!#g+@tJsBu@h}Pc^Rx8s9H;6*S)-d43x+Gs5|Ds&V)Oa9Zwa zARqfFTi%Y}RlHPG8$GIH0%ldJ_w>ifb&Pk;24T$0Dp56W^SqN+WLH}7Ilja1f~x}XqS#Ie^-kx9KR{KU z)M{b%o5_y@{5&N?&Be!0RZ5EDMgTx3ji0pVlCj7x7y(KiHF+;d=+h(Q1}{vNk9-hg zTB0)3Py%6eUBHr(?L}>Ad`2wvLYB(J{th7P=iU+$7K6-FsLyjQPG(oQc+vx{uJ?}k zw*ZcI!(iL10un=af8aGG^dPItF=W%Nh!d zH}v2@mE)AKM+~PLjIrsZ5Yc;L=W?0?frkoEvdDhc{KmijONaG5x5uT%+yKhnmOfmI8 z0GH~GFQJA%EX?zZO_RkYO`T2u6uq9rI>>@YTd|2a)xHIZ_E4fI1gW0Q$*BU<%hQOR zesR0g1m6qv-|Rc|%un9E2Jk~`tjLSOkFyJJ-}Nc$$c#6Q$_| zG2SOEs}Q@auJVg_KfPaSQK+>kY>)(l+xb;=xt~u70rN?F`MJ_eOJavj+;L*{ggH=K z7Xi9%ad zL;l*ZUJ`izQDU45BU?Uaw(@lU)j%5m?TJly9K*Vq`iiKFw;IF}dqMeg1GmnHM4g@8 zM7~q+c#(t$GLs9vRH(21b?3|~;i++INNi^aRYR8+FtQt9)+&bFvI^H$S7T%;H*XkX z30Wi&k~}=qujJW5tOSo;k3vmG3{b`6``3oUs7Y(ii-jd))qM~iBQ%Lo0Y2drZmV_r zUlnzqQPG<-_W6N>Lr>$L@Fc6!rcwhEkd=9#VTX6!Qn0Mu z)Q^ja5d$Ihb^8IZ3D_6_nF^2ZFMqOOHythQv5Rtrs=Z7~a#H+ALks}2je;kz>>6h* zFCBS>mFM=4QTOV*4%7d4T#lKsgFEl&-9{-pnNGO_QDh$EUb?kv4 znYYJO!YB8o9)5U-o3RaMQ$#lG#Y7Lu;oSQq@}+svx3wiEB!Pa#6<5Cmk1 z+8&z(Aj3U9kpfCjW@U$vr=96+JG+xE!^3v?l{f#QqmN{~4rJbpi&RLe@r?>M{@Z;% zYl!L$&_z>9S~?u$v-uY04gnAz{&#Hvpu`xcHt^gCllNi7+OmhTJ&1#>-9y$o*6jZ+ zpAk8iYHMkUVOa=lUL&HH)Gpwl>;OdnnasIgikrl%-yR(=U>Fj)U&G$*9{lIIHGd(y z{}xrKB677>gk_1n{0pIEaZ3%PfWv#udc*Js0_uzC>dBghub{O~YpEv)1VYSu-&zN!6K_B|FC;oUT?xedR#d_inzz3VJ1i$hcq#-S_nH2|w^~crmPXr&AR_L34s@fwabk*aX^-;-RR=v;OO;J{%HT0*Ufe- z)1W5h`8`JiPPWE|Ws>4~ti`N%**~2`_O9)Po(i=udt#xsCT&-P?;M450EC%>LVE%< z%q}P>p&-7wg}Q)c%lFCc@7dQ0IXu}X2DtFfxbC9tIgQ$LPbbLo9g_ibqV+>*=Jz6p zK5Jrn`V!oHsP`UbEP?#2?fgD*fpX_wcDJB}IQ`Ve>2{Z)K$u#b-#37T?2S(5_pCc; z#2>g7yhs|TT+4Vvb^NHIOY@%w0q9cl`ozZ+d{3X!!vdfoBSSsu{;`VJ(oOPIV@o|? zL$|bc+4%k$ko=p%6(NsMulsI-Q9W&mKN>%bi@bE1xgJR99vP~~B+c`6+u$StQU4!| z$uYxx>W!VZD2E1I0`$=quMAa0SXM-VW^x6bwfN?vT{g}J4ud~o9((G*N$#OClkM?q zw97!d9N+v2Xu~0Y&*~AQNej#G3cK@75qAClVc6RiUCLg&^d1kMP0PtM`hY^lhi=0! zIQlsDUw%ql=1_u6W7H=(1Pk`f8W)z#@bjB0pJ|!Z z90fEHK7Ake-B=D0=0DT?9b*eh z{ubglI|x{qU1g_^n;_Gk_>>fee+&$#>Rp7h)jLuT`srWsptGaG?7CtSm{0LYh=>i^KTH07MJ^#s`#Vpa zMTktp8XvibVXQSDCjMF@FCSzE7+3F@mA@r zTRiEwd|ETX78~%6;twYJP3M8Mh4ur%v*Duq?!e=SBrdBDC@%5zLg!9*a64BFQzZuJ z?so!)S4Dr*ooNgQ{gnd_U_Om?F~2dxo4V^uhr%tSEzBVV^^K>W=K`7-pJXY$&}IYc zXI4DnkYEz~&~4KxHw2-)T&eugRFgvnUZqi1=C`4FBNSSWC|a<|9r;kn?O%bgEParQ84kGCH9;%Z%JN)srii|!e^fNB(0=c?6Q2F3g*8C8RMPiWdkpK~gQa5%b`jzILGX0B?uSot z&KxpOqPvv5}tH1GYt5i8B) zoZ0dKVC7KeK;VhB>%st`h%)>#HVZ{^J`R#|?VVnlkcUvPtP%+FZ%~Pn0rU~szofT( z_<^f6yZU*TL!&};YQc!%aP^=W<)jBWWY+s^m zLPA1fEs=v&eA&!|#snkaA&VqyqB}YcZCF#a0o-QurLS;1&{d$*aq6CNWS3vKhm{&I z&NcN@`1!cb1&Ih*6~XP9Q&NQM?sJjJ$G-mC5+Ay;OIPd@^Or5HI*m+L$Jeu-Uc7@5 zXn9{tPS~*{$i;2>9j@in*x3J1o7)Do8yY`Z(!n34=M*nYy^(OZ*Ol5uCeA&g(ji+T zbhc>&vw_&58)5^Nu0C;eb#d1&&?9{LAPmQFc)^R*kH+z?1{x=+5;Kdy_k?Z-?F+UWoCuvhW^w4QhN_JVXUT_StEHa9B@izqT%-DbPTB-_4j*PI>V zm;C+v+rh33I$2FAc9=dO zeC~X%S9@KYI&l|4+CV*b^Bw&Qw)F39YCbVD&q1`su6rJ6i=U?gukwqmFg8Akw_7ko( zFbb+; z3Mkv?@hbvz-g{mI#-bDF6+5Mavc<0|j$Z+T(F~loOk|ZN6*4`~eMEh-@qE|>`s~>= zrl!?}^+>W8&>Ygnh9SkJ$Efcqek-j;e-wvPZTVgD;h|E}aoTw!XQVx*Yi7g@r0&ko z5ZkpuYEWXz*m?w$S~m>kx3_s+!Q)IFxo7mx zPn$q!XsiRCBH;S1_8R=Etq(N%%Aypw;2T1?C2{);PXPGY4j8y_(}FM1$TJR^vd2x2 z%KtaPmea8bS$UX(R6LADZo|v@V7{PueR?nzr~NA+)6o|HPyun}+N8(b*Vg3GP2E1m zA#qcDz?o~th~Kn_x-=1R_Wz44y@y|de9Fs-`gbtE5GWX@6I}jXd%@3t`H;HC9Rl2& z`MYQ<%r*injtkd6$^^O-7}q*=mWlY%cd%&jmPZAeE!EYRa@vy%i0o^UhQLT&$ zB+?RpKXR*&4Yj=|3-*fve;+Zk$>F)gNUG!Ga0icQO zF&ZHq>R7KRqVOQVS1mE7PI1Vlo#F#1N;Of1!+yz9<#IhcoAz%mi}M(}{giJAP)YFn zt+HX1DM5}Y#%GADo9LjS|zFCSNb1$4tYQJozWT& z%115?tNrB%E{7D>e7tAPLwFRA{YB{bd=vtT&gkL>Ds#GGm|c#^J+h_}L>F_{O9i`V ztI8G)0#p!y|2?A9JAnWK+alKf1C=BfZs}rr-~%oB*L(|{{X0`x6B(*@uJ9h!QkY2m^hv7+-Ut4e`bT{OJjpSW z{Ict#z1R!`;3La(YzdusUN#Hk;AO!p41Jwo#|PYVH`-d;@L3QD<`RG?Qz#$YzLfJ# zL!LQQjmQ9)ZbWMFwy)&(tinq$S|DgDv9kFPr{ko>{KRf`pk zH4Y0nT;k)9`O(Jrr*BK^l&D;Ap0-@=lUcUfT9vHiM~y`t@=opQmjO$`LA`PR7~RWL zFYmt+@?EQJcp5WwQvdB}_BbtoIuTCUnP+MZ=t6I#E+ubl6>nowa69g}LSEMkx{fkc z)d&vKv;Qn`H8oUU3q6XE8X{TO15!tl<)ds%-%gv@-TjfUTN9Pmv$+<{qR~D$!Ii36 zOmMIllV`8420OCjMPcmTP2meu@u|9w^Jt46l+3L6GVp5ki^Tp~pY^nr#0ah3OdK79 zTy856aN4Kb=X1L@!nv!=zOME`(lv=Ww03UTm`$XR0a=^N1ta{XP!KMlUYdOrMgCvk zK;0^*q!|Bnyts!Pl2sURrDo6f!CNjuR5=xDf)q~g+SEH~FL@<%5m=M@G6|WowXf&e zXUEwaqJ2tiHiV;NVo(@bUQ8QI zw)bBp<67a+Iar2W;*yBAfavwcr3(a4kLL|-I z9MhO2kwcH29(W8ol&q;Q6*u~2p1QW`W`>u_Fe%#@ zmyA9L^`)w(-rhkdR)%A!F|JK)Y|rN#Avcj#6;Ep#Wgb(xi=XKXTp3>>RYYovzULH0 zA3a}$fZ)Po-)zWPY-m|&+JNGn3_c@4LE|D_%#yN76C9EaFQff6k{^Q&x7>h_Mta;`bLnX~O&8baL+EGUWM#kYoTrzQU4E=MSA zbLE8hS{A!2a=p2y`IV{Ov(p0ltLputud!F5We!5 zj4pU9`#*Ft)p{I(n;-v>!NFJ@f*;6cQ7$1MTKsK+BmZ7~HvS2^We_PC2Fx zZ_(Rz5LQLvK=nodCix}RK|9=P72Yru+oLuAPL~B)QGJWsV5qBw!`bs;pzHXH;N9m? z8SA-yy2h<-UoCa@C)@gnC-!#(Pw}rfJD0l^u9&=AwfGsD%qTVxo^VJXIpcu zPG^a%_I>H>zU@E{3w97&?5o5_k!p>}$q|EPeYd`>WBzlez0Du6 z2GsGb1&5Mi(+&a;rLqP@K>FQmXIZ?4zjn7F#Al-s|Gob=m+AXGCp*eU2Zdz6xzaf! zD+tn+OyE6J2EwX?JQLU_4RwBH@yJY<xZp*cA}Cl0a=mBTc;2N= z?FO^qj{JzMr^!d>=}NJP&p%Ad3;7P+|KqdF=+g3ONx=n7NX%a+Ok$F(+|sM}?k#j4 z&%_rVB2hI2#?cSEsslDcaI*9o=3%pqp{R~@Tw6G&0+e0 zuh--hDG~!+dnbp?w?>J()2@POUl+g5h8vh$ZmrvmhXeoW5{oR}SK26r=fsuo+vN0& zM3zSQEy*EWl-jG(X;-GEo~}^9o`3%)VT}Pj+SBPj;<2EU#{p%iU-igwLCdv5J2ZUK z-dn8-7mYIoL}UEKw%EyV{no~Y;84Kn>borBs#qKhCIKR2&HrmDWA7#cwz(8=R5l)I z)Hlg$ED@2|r@D^6o{lpg6^>=PrNIou2-|sTccrkG~u60=L%bX`vJVm?uvnnKvji$ zBGJcTc&vxOemdol{e_mVPF5%`6|<_zLia7#ihkRpbaJSPi#u=k{-f=MSH~Y37B!}v zw~fR3#(A4v@943x0aao&YMG6rNi@Ezxy-c(pMBzDw2m&n>m*5a)6DDUmOcTXnnVI?AV$*xf zB`95uY5ocruTg?8_Gr~lonAo8bSb?z_{s}Ru6V2vH(-HpA9w?)to5alY{#9rOy{8s ztk7H?P%T;Fzge}*rV!hyt-kTufSx@&G|!Eio=3yH`hBEcc>~~K6PwA8WViFo=L5j0 zo|I%oTb6JS*}P7j_UdmL=XZ1MmVv~c)*s?wd+YOPxh!V+_*u{G6xf2$2Nztey_lDZ zi1r4pTigUCTn@ypvx=ob^Qp2t*ucm=Lohh>*$3u!+I?kpEW_8C)>{`OgeCx80X)5c zn$RXA^x|({J_-BTe*d^=hlPTvmuW1NJ(mvx>-^EOIKMO1xlr*-<;t!%ZgQKlzL-Ox zmSwCYaDMTJ050H=BkK~wpCyc?z4XV^6LxY2Hd3zOrZCeg+;V5Bsu8Y=Or?k r^mTtWqaHZ?OQWUUs#xGSleiBMRHcNwxqApYnKOmxnB1~|txoiYH( z$r7Civr>vs-mv-H;J*5Sx`76r#yC(909tL|hCx(Ol=9hzK~k!ijrS?!n8AHn0`vvS zfXl(;t;*%aLn%1KC{LbRVM8EmRJlV^*kz=Z2dg#W#RC9h6+}H{#A+`BIV_|Bl|Gep zxnz!Fq1sE7f>SZ7tWXd=O4VeuQi&4pP(A>?Iy@8r31^Bn#WW~i(GYe$sm@iRnncOz zKua-;T~|yicQ2L!LD)(K;AoN!K$I_lRuIU>5KbEtP}`_X)!=jyrUXUABPK(kqBFw~ zN$Fxlyc7!-H5oxr3(AL{9LPH0G=>GDObA6p%ms5eV#jd=h9u=@4|5O*2@nXT>?x38 z*h)F0N2#I^;_0HgREmVdx`aoq(IXLc%)!AFO^0zkRgAbS33ZZIsVrq#rB*{I8UO<( z1WU$Bu`y&yZ#iFLnn8ByCR}3n3G7`~KdXuSI)zY|~G7?5C6g4K3YE#T^4X9Kq zK!@Wl$Y|#=K2Q-Dj=|v&uVch&Mhl``#uqFWRc4hYug6FoR$!s9la*~{nH5d#kJOEYk5(E_~4nhzJL@OZbg;Yoy)MG9ymsa@n`<xB{s56T#pf-uzK;#?s+Ye2vd!$5e% zUD2BpX$wpF(vI5uC=_Dy6|>s!bXHV`pc9OF6){6Lkx4-?igbQvM_W-1y_YczfnXt9GhSEv9f zA09WU)j0_ji&O|U;tnU|!vjbF51s39wT3vajPszOT#~Us z!5T6kP|WG#DNce*CQXj8YXQs+ zHzItx1Yju4x+%`eV>pyUp@K%ssA)#Pcu;{m2;rz1baAmD$4EGYg)45ts@2D1fSt^g zy)tA)3@8B;6;rGN^O)0zLy;QxYz40ui|_%f4slrvZqDpwLI#gmDpfI4v|LuJlfj_C z%Kk(U;5kh?N#PD1;F8g<~Zd3Mo=FCKx`X^)lIDwunX8AnJ;yIUg)jAOh2H=k$o3 z36PwO+YxszqxDgGP;FMrPBpJ_&S>e*?p0`$ObSG5<(1)DERipO(v5v4};H!Ce_NCQJIZqR4SFy8LF5I zq9#9Hz~V8*?rAi%kBr51@kp$K%O>6&!Z94Qvlyz_-JH{v3kPt5NjcMnLX37;6f>z) z$z~~J^GOzik<_Itl|Vw52LKltU@O%EV3JftokmjmQP2aEoQMM{&L6>yS#Jb4O3F;M zDwz_J?m(cTmI~R7->=pIlvkl#*6MT-GOnUk@v@=hjO22e3|*4qpoYZdJfcB^umpH$ zF;#H}fTWEwn=M|AY^MG8XhkK)3eH?Q9ZYBev&-q!8T4M+4Oz=(vk3aYl0ov@lQ~N^ zQ$@k3o#aX>KrU3|q(2^usiK;&9!fg3ISl|9WTV?wi2Ai6f{08A_Tagct?D-=5f_$_ z!WLSz;c9&}kwlCvVnqn6ZAw45)~^uIOU_upVlufMmT(@* zrLr7>h15cNRjSor6PM=;=sFVzhGIt-28C*6OL5P0DlXDq4 zCTP<|b&(v;leD8!v8a=7+DFrDDy5I+a=MBPYKjH54JfBE4{PFaobeLcc)*qhLR3;0 z*5$)Cvzj%!APml+l$Zg_L7FW}UO^L$!sVD1@p(Pvm;-bLa=}75`nWWcbJ6{yUL9! zu|S&7ILcWb!W;#ZVg$LyzZasMG=Ud+I%dtgZDH2o1j8a}tXAwQ9gl;6&k>-R0-FmO zEVPg;;%QFG*}Vh|GX)$sfV?Xn1u|Y;3@rdsIp#NdEbzlgJlyVT)FR5?-TG zBWEd_8&`!5o~(jR3=boAGOqEtxkOrsDu^=?YOBSQHCBx|4@8J!9JGsimsOCl3R4PT zri3*UjQXUAs%Vl(Td=6F7!6J|rZZZ+fYL85<0+KlHW$fz?8TG^&aif-c^&Ds^O~X=Z~=@5 zO>jXa05M>;tkE8KW+guk`OvC2V}xQ3jF)2wc8Cduf}lpS z31OIrQPzm_VV@SPTAXPioX^0 zNkmgo6|2TEI2uHX79t#1qC`+*E0+~v3WCid>tQayd#OGSp$lSmjN90(VJ1&oUU<^YTF8Zj9*#zIUk zV3h?xWj9s1pho2fDNR{tEihVhDUWI_T8o%KOvXwj3DtrVwKZup@IV&jGhVZ`h{bI< znWfzlfyFe6`YQ^8Lp&KKN|GB#A)i?ZZGu1q@eqn%w#VXOwbhCtfkId<(?HNqD5l;J zu6m_pSww-9lZ(X&RW9!Lo1{=EXQAXEnpHM55hfcEqzWY&3nki+!h!`GYJniP6OLJF zXNhA&MbR&6g=p;i`S=7PIKe7W)#n60grGpsV+hB} zdPJWn;!&{_HZm1KPZX5c)G1nnI+@iGq?1BIcADlxWL zq87EHav_f=Trm@0aBx`MoU-87Tt$FQyj7iW8}kC8PT@sK*$>-e2&U|acvlgjb+ICc!d=qDt%bg=xVVV@yd~ z6i%UV4Dm>M3*(7-RaF;Mg$$OGTW9qO9Pc3h*MdvQ4P+5V8E%!$Wkt1G;dDC02~LQfZZ22_z2WP3OZ8&aUlh} ztfxFqQSY{wc?mK`vU-k%(+;hK@s@nq8OCg3Z^VO?S2KZQ99V*BMd%?;%891jeC3H!|5;W)`D30U+m@A}VGL|dgCL9dp zqWVD0Wn#6Nk{L+SB|?sQa#c#DFQ@Za<=nyyDf=PHz-T#=;1eVpLcCf4^{5doC+VVK z*%HXQgbY=U%X&b;Xg~pAHI>bmVZBaQE{nztr}qbeun(4^YE76(K%N|$<{&5$3Kc!B z1ZfIXQV9bWkp#a#DN-Q{=PfoARu&-Yu})rFa6;r+g`MOvVMh97YfwQ)I!MN(hJT6~aw|fDlbdVOm=( zQ(;IWVIe=v7cEYh#X#0Z=zMvE(xgfXpJ7Wh>_WVxM$$sYm^-Ws6w_|M;&-eeI7h{D zCK!OTQ3tExVglwSSV6!wkdAZYy_7PoBvSO3gDxWKOd!Po0~LCZ z#^VBf3IKoz$zl|54;y&ByW%j47Aem7G_klZW@R#AC=RFyLZ+$`C7WFCND2z8X*nRK zO&Z9~RVi;VtN17z8$i$yV-u66s=Ov>6A!r%yAQ#Mbh26oOfe~Laf9}_LkjAW zaJnea`hs!>00lfQNv&oKXe1#7I1~pc4ws~Y9HVoHz(oo^0Z??W#A9)rN-t}a{jy(U zB&$}h4btY(lHVJNa0$^;$q`0-C8g*P(dC1BF5#y@Ckzsj*6F1R8Y)!`0Tqv3Fa#v4 zA&U~MKV&r#B{A$O6{{6>$|C>;ADUo6b0KWw6OjU7RM^Q?D_Sb-N``$Qcg4jaHdDdi z!lAHM%cUIFOh{IawP?z~lkS)f@e?JE$V)c810oPCXG9AK6~dCREe!Y(lZ)_Jd`KoA zp*(CQA~@}3<%j{b$lhuOFS5A+rlNg(s7Ux2mCG2@Xq?d^t_f8f%321KZe>GcP-JL| zryxzSobUx5MY!jN>@=QG=M9MA=XI6O~n|AhM`ae4y%HWOoEJ+W2`q) z6m&vW2{O@`rzU&GpYgkwJke5;6*Zw)v2_kk+AY{( zl;{;?Fa)DcyC5k>Q{%DcWYz~zHJ){H&9yaD#QwFKv9xWj|2)nz2_?0tTtKCd-21Wvbgi$%xhJCV)M{z%> z^+(7I8Pp~t*$krzlvN79M8%DjbtoOQD%&i-Aq7>Wv?0z^74KL`t2JpZlyF0;NJW8o z3erZ5TAzr-H4zb_F#?b1f^s$)Bzz&WF@RXZsjMInjs(eg3?VZXqv9HU0yd=pfRF4c8COgHXQJ;T zvY0ATDj-Ix;(;`PEvm9ZTLOit(2@?6zsA+ww*QRWo+I_XeW(l|2~Bt)t-G)#Fknu2oh zQ8v)|oPeV?SIS-Wk{D-ac z(-ZDkARZ}tNXnV_B^2y}MyFgMLUb4dV{}0mDwtAEG{HG#X9cjJhb1dMO<5BCe$1>K=mii&1BG~R$sP-m9#qFGt3Yu?Iot!w2AAS! z6BHTNyTZyrK)$5mNGM?i{V`JUM?neY!}c7@2i;EIo$`cOEX~@KqexHC&vFS@*qKU` zDbYczgT5rEQO;eRu#HMpqJC@GY?Pv*sF;vKh%M!I8X*qKF?m#E=rX~>Hc>6vQ*spL zc-o?&vk}Chg)NvVh_ZZvGMLgZ5{@E(Q|olaG6Lw&o9*7HMqjZT$ZCm=r~(M=5)s$| zhhc{jn>&>3iJb+NbVJ3OS5RKt_A{8W)l|a&sKJvg+ssjhagYs}&CszJSXB zMG<6h-#+SwLF%8AQ|h0yUJZ5i%3odGb>*tvYuBweDTUWhvN_3?m%Owz&_+t+fIdIx zyndVV8qfzSW+cUr49?L-Ngy)=`uL0S3`@CaIhg0@+~8a>lWAKce%Ehk=BZ+q&PnZ* zhTpNGjTH-dkxsO`k!@?+nvH9BBM;Z{A8EJFMUfUfw4@w?NF*ZBS+TB7UER$$*LVFj zX?HDQ=VnEz#z=<_x8t&?bRGE9{14UtREP4)DJ3N-X*_YDgU-yUPgbPzLWYh1S{T4Ud;QuA@VMB)1 zn6K-2vr=sS>DN(_Rb9unO3}9V`ahRhtxvlGDJZJB!zu`*Toa^f1X~k!r(eAg*(%-T zSM}13jA$E${C}$F8@i~K9cx(V*j_1Wv#3p{O>NMBr>53)Uu|$0}#=d`KSMGvH}TCIayEoS|BMW{8ww!8H=Lm1lKrqtEH4576s zlv{^T2;Ue%`FDYzMzAv08`RGHOs&&zs2SVcq0~*kqGnd8v{EzwOikh7Cu%orJ6tpH zH>jTanQE8cP&Ku?^WRfdru09hdPi-2)|O94Wl`02>{=`CR*K)<+D$2c;~k*9K>ykx z{`wyx{(HOF>K$rhbo;dl2U#gg7FrE?tAi*A`2sCSEG@Pdi$ap5=sQ{)Rlj(STW-8) zbsV?ec)sC2e(L!PiB@yd=HdThJk_tp_Wxtp8s_f&^%wY!Y1E`q-=V|(zizrQcx(Av z0PI^L@kzjU}ysnplR-`b&<^3bujQvA}Pk5Xw{ zqx^ryRm~E&k1Lo+_zG?M|C)!8;%LDe4Wi1M7qVpLr)rIfRz~ixjag&lKa)!hI=^w^ z?L@_gCg`>zMdkpdv5jK5f1`2_oy{wInoOSJYC^63es)}a6zkrxZ;fJ2QvbcIYmjM^ zQ;t#pW4zG5<~kIPZ)KGX1;sIfk}OHI&lgBaNlABX6@@3CpzCY?q|HA|s8C;jQ;%OO zzZJTz>aNM+XN9-xr^w`Yzeug)14_NV{(9TpiUIoHeBTPPR^v5dL|um(wc1r*gL&&( z=wGYV@Lt2xZ&dzJt)+(jn%dj_UMbqQPOXpj#@Kb&>$fXo*Tz@c>gsC?qm`tpR;#U$ z|3Gp;t)-7rw32*SdH9K>{vRa2{1wTzHIV-g7lzWabz!uvA@#q4b`4h@ly${ODWkq) ziWL2=p;m_koumbUPAJVC>+5Uauj79bRek%Kpj+da+WqE#4kuqTCLKZL6vCw{5rFa9g$hb#)*1e!fHNLz}u2AJr>9`__;8aOd+!R|54f_=mmq|L^rt zd+SFn+iq}NGo`K9ZRuaJGvnbG?)tRLlfFLQLHtcmJwE;MJ~JQhdYh^3F5PwDvCe0{ZE0zLW%P*la<7?}`fNV6v-9}2SN3jr<8sdf`pqky zJvVnNW(9AU(X_gi*fZ8$yTo$LpP?v%dse(~(Zo4+`C|EJayr`jIv za{T+Z^ewONT5Yy{X*fWfIMw0k9qX^`eeLEE?Oq!P{Y4!7^4BdhUmNkYL$&3e6)Re9 zi%!(9z^|-%y2ZbbdBO2+lsWa)>m%RVw0wi=hi=y%{&W8o!-iZRJD}Tl;^o;F%5AU3 zugu?L9((yQ!*z&i)80DsnZqr!nOFLZZr`~p`~A`O{U7SzgL!q@*DIc)OQ-#3KTeMh zf1#ds=kHlQzjw@$URNg{e7x(I_wC-l_trCS9G&y+HvR?i_)V8Tj(<3Ow||EG&ZvFA zJ3C|LjQzJ~K5uSVl&}x8g_t(vI%=oWAAXilc76;Cf-aUfy*q zvtLN9Amt}ihZnTW+jaJt(_Lm$^O!Mzo3Yq%>ew{-)uoG`4ods(=hyF9djFBBGb|0Z zo#*!M690HQUR{p{in14n0R2IY5$uS2JMclPkcVD92mI}7(QU@y-Q1b z77gBE+^*)N!w+`vW*s+tVs=ve@WeNNT)*){uBqEb*MVLKJtyQ9U!EE<7+}`%LxtZqZk#XqHaekZvlD z-TGiD-}S(<3;#;4b>b^~P`$@IJJPxBubS-*e?I|gyL>w?;XF3($D{wYq?5Bh(X?z5 zcw*Jo!t}w5J2^LQUA3fIiafD)$e9hj9@zKb)l0=qx}5pY_{PVz+n2tvQp{C0PT8|` z!uj_v?A#PRxt4siZJrf$ewh=GFO_Lh-)h+8hdV_btccr~=uk^k# za&f22-+^7;9VW83lF54pDf$j#jFa!bb#j8hiB`s%Y6(6uYSU$tw* z$s>>K2CnVpKi{!#R2vyP@X^x?KC1SdvvZT%yI{x38HhOIVD87I%=bUIj*cIFb;`TV z#Y^{mnB4#6!P^haW)^mA**o>N)u;Nd>@_<*sruN0=Dnl(dWK(n9@#c!=J2&co_yf= zkz1a7d*K5s?yfx5c-%f{$dwDtw~W62myfTUPp;c@F_5`q?4(aRzP;yVBj0@D5w`lb zH^wj5KW1-2OSgYE%<<~M(LDj%$1m%Kqk9Z%w!fjG2TZtrU3+oB`TKv^6+PNA?BpZ+ z`~$kZy<_CG!K2?`>H*S1!>7=PIKfk9qd%`;#nqC{*_(i`_ zpDkWJVbavqV&sucLs##;`K{hf_jUTJxZuE}ADS1x_wL4~*Q@o*4-5;hI{2*o+-Ej% zbFbL#-!9+&=)RZwFM42m!)C*`LjNr@Hl|1si4_DT3Gfi)@`8w0V3M@Lqwe_t4b)?PY) zbpNhzmM0o|cYmUT^T3Q-C%-%5N@E>5IW}Sq*znD$ho0;bX%3xU`(hUhS+~67>Z`Ms zWnURI|5~oj^3J#6gWIL)J4QYBWbpG5%a`44yn3*1O0<@xe6Z*7Qe(<5tpTZxOkA6dR(N@x*yqTQe0KNBm@Idb2$7cVY6_WrDcz``x% zCsnI9MhH5+X%({8wAL@AV7NKQl zFJ-MXY&mvv&Zf&RTIPPOX+-W-t-kokg(bt>(?*`8q}O+}_+H$8=eco1_jd2^c~xH2 zIB3ANt-yfKH{2t(KSRHK`1FI~lr~oi`=;cmRZWi`WmH%H1^{#BH{Q2r7b%XM`b6(0 zeB--6&e_p$^3S7~?zd0WU0S(*$L;X69>W%GJ((DP_;37?z87x(NWs?S)Mr=LA5ONs z-Q>Np`RMh3*;;*JVdEZuH}<6E`7duiGBWq4mf#=G_no_X&3y-&Q;V7yR%_u|Z@ z-eEIN)Gxif!m?@3`qCKw_=5EV-u9jNo#WmOJ9o`8pBU3}Yfty_X0*$hslwuh!Oibo ziaxvaN%P4sXKiRY^!>L(&aaxZc=+?fcYo3NP5!}+-Ns!{f7s~n`MhrQ+Ouo^^ss%t zVdcrylLDH|U!mjgA)0FU_FJ1%C)c;1C=b;PnNdCQ`kd^}p*i!$tqsTCFLWL;;;-LZ z_Uw9o)0r7B9)EpVcIWicz0|gqi7}l=3_s34tNG?)+Bo@}i^R0E_S0)0Ke7A{%lcz8 zneM&4_j#H*mpIQnS!mp&Uj4U4ldidch`xKte9_SDp8bDb{OqY?J74eh?1PI(%~`_j zI6v@E-AC5xqh24+qYLiogs#6nXkz7o^UH=jX+GN$Xqr8>G;1Ap;qvDCKfkvN*?Mru z)8_9#p4V;R%)kPEt#Q_A%eo!=7p)g!nS9r!GfTbNKTY;&*|TBJ)eBvl@W$!rwp&^@ zU!F`{%D%L@IsDFjyT?3m?zDUUq-pwc=dGVTak5PZ@sjS$wN6}9*UM0k4R7yg81>%S z{O6H|PxZ;B@a$5TqZ;<|+>uS~wt3!q`T1)Te%MuR_Yrh<*qz7wU7FsYA26=rkh^8p zsa@T=x9hTF8#8?U#KuMBs%x6lR~MZdv2*wX3(6D!mZB2d7d`maq#vGHGi$}P@hwfW z_e>emQq4>nc4o)Q=}7b5k^43VN2J&7i&L-XE#i}X*=yO|SI#zHnO0e{dg9Kd+mF2P zz0Tk5%CIe;4&Kl`J@nhlpRto(+Bx*|rAw~#dTr3w*lzgs#C2H# z(d;E)?4E8rZ_R8d4ys!>;-UQNql-E$zWwbr+sw$sPV<+gT6W$N|2N>S0UMBGD~DaY zzuR4d#SO+0r#F86@kdE=$?9S3<+jBmcWytAUSpdcZg%eJX&*Ne500LDdgS~D--(sY z)GgCgLT2PVM{L7WgWsP=t@|!FZT-rF7l~8mco%N7tYI6CC+>+padR{c78_ zcinRjgt|ZZ9sEIC>z(A}iN?R*)aHYsYwK>dcHjQQ%^xH>lRJk3F{5sBTb=cewe=sQ zbRTeUogOdtNN;MH|LWQEmeBb@g;$RBns-$4Y>_I6IXnIM>>ZnDPrEWU<=AE3tu!~CJI#M`0(#}n?5#(ke(!uU)!6Rh ztj^n$kN2E?`3J)pe#@q|;%ym9>b+|6jvnNE`!daZg<`PZ?pO9W7ESi08-{mJgFTmC z-aO&zjO~XFy-m|~OD25Vn0jXWmeg!#?;f*4y4}Cuu5?v%!#nL%ePREyp*myeH){v_ z-<-QD3>Khv4wmSZ1ZxGUFh*`z(2&(Gg<^V~MeIyaBAzxT{*#@vo6&6eh4 zCtF(l{RY^d=(%s+;gdtIiF0>Pn%x6AHf~w-!s30=S6wTXbodt%qGYU^jPw3ltK!lZn_djRYWna>8 z#?r5+rb(LHBR4zM`_i5sFHf8XqAhNOPUmWA)%w5!9Bey1LMxAW2--E#M5pE*DI z;+)Pcj5Yhrg~=D^b#8uPRB~V2Wv9j1ntq2zYWKhQod|zrnF*hp-1E}4jU$WQ9=!H> zuX*POy*Byfm5aJwY${)wCS2L|RlN6+AHz>&e;l&$k1>BgvN1IVzxykvv-bzttMeul zBaip{O8udFjA8#1=#n^rMjFX!1 z`BA8+E%oN)PaE5;JU!dEV!>p4|MQ*qjJ-bhqtQK5iE|>>b7+7FeJ@%a; zw@hfW^1H?*p9hw9&Mt0a=<#Jcm+-0mrrnhp+uvBe@cv_W@7#QGojB;Z^!|-Q{ZF?w z2zwuG@%9`LeOzI0&i-q2ZyUIv(C_|6sb$e^UAt!HRC@1vt?eIs{L8L!#uW0D{kijB z?%kpvWbW5JJ@s4X1m$WZUM~8kT)9ZAR)qruU5Kdztqq z+r1aQoXTze PmMh&#w`1pP#_E3ov+rLx diff --git a/img/logo.png b/img/logo.png index 8a2b81b9eb60b9bd48e50daed8ab02a46ee4992f..a31cf3ee94de69a65a6579a9a7149f2874728c79 100644 GIT binary patch literal 39589 zcmZ7eWmHw~+lC9%ozmUiE!`>I-67rG-3Uk{Dc#*jr<8P;fPzR%iLh^e|L1+j*!u&+ zAp_Q&Yp(mM^E@tMRh4B?kqD6>ARtiX<)qXhARv=pzYw6nchI+ra=||^HsVU+5D<+Y zke|$8!T%9mY@IwB3p+ka znRo~+a`*r@euF88`C8=5VcuU_I`ZQFxiuyId+CfVQ&9PcgfHL zw+jmwUdhs6S`@MwGG~bwq~Gu&|G1~aVLuyfeVW_aMKAQ@;-|0u=x}XbTGs-bkYoRW zWueLi@p)mk2-d#rjM1^EFcrIivz^y-Nu=QD><(1)lyNZTGpo=Ab_psuHG25K1uAaM zi$TEEyT_E3$_F+vL$TbjqnZmsk=~7D)eW>>)G3md+*VE1r3^LAj~O~CXK{i#?{*BcG>cK?kf}f zAe)fz`&+mB41OZkp_NcJxFCYPBr|q=T5jn9sKjx4pZ1&6`ky>D19T_+oRd?H8pwaq z?7C=)#VIgo=SXnlr>&727&$o1Ap4Y$Rx;X^aw)6J2h2Y@UvsxX$ja$rbHeXwEOFpw zrgAxNbsE)+xy(^!;)P*ldOksa!og)jDRaw7HnqyTM-agIaEJN97z#j?| z^9?4nI7Mk>Q7n>c&qkKv#IGh1Wo_A7x7K|t7qLr@!i3%UW8QYB6@RG@m|T<@r15&* z6rXolKCvW`ab#U_yA43`A#G+68Nn7%zB zO}g>1bP;=k&)xyUK>`7>-#2Ulul34f@{24+9c3Rvxa}mj{=lTrtq9M{NKBU1Svc)U zRtuC49CqkpR8Ceyp_si!V)#UUG^gdCMer&Mal&knNrh!add=E1L3_vKt-J1rxc{Vr z$l(@XY&FARpRu2mwgZC==V|Nv5dygceQ|2dQ7d}*;yPVnRx=(aH>~|XO=)p*RRmG% zI%47C=%_9^Z3N1lb8s}~*3q8(ioNvWD{6dBL0E1=eu2)*Y2H(Brzom5>=pYgHBver z{{>e`QP)MQV>b66VJ*uVlqZ`G_s8T6oh6R8-*fh>Q^Ya2u?323kSJvga}BWZ9q%pp zOmbUXqJ4kOV8|@xaE&a8mDI74zI;z>$v}FT+2IkVz`PH|VD!2oLGJV03oXBy?>8kB zM%8V=EqF>*yYQMzgGDT=RV9=ZHRTGc^Rx#B&&J#}YjXZcPD5c~ ze#HKm=1TU~OlqpB28+x+K8PGPa)6tYFyAziO@y1?fkG;H{_2I6)gl%F@ojGPS^f`K zr%oq-!6dmYf3Nf$2w7Db@ui6cHg-Q-yJz?P323+ldRw_LobKbQ*$5w49uiju{wwo; zI<(C6rWQ3FLDrc>zZBs;FjG>VkX2BsxoJ@US=W9l|A9;WyDJ)-1a9H&{YF^2=hILs z*A5rbHqB`VN#F0j;XH3VlECJRT`nIik;7w>gS@}Jr-Lv3)ow0#p$OuUBOJ++>NIpoih#83`iuLyAs>)B}Agc-QQ-0&Onf*?UC0%o>tnW#9gVsyEzP=70qL zoc!Oo{mE)1eEz6ouh~XXdvO=5uk^E^1+q)bbJKp~6{R_pM3}^=0Mg}W1E(aO(`9W{ zDVXBsean&5N4BMRni7OhbI({<=6oif6;dH4aTV|<2^5GXi52oIpem3nFe~sXNGhl* z7%JE*c!U;7HR>x2USlL^JL8wItW2nTN!3D)4_ZSEzAMKTj5Oh)*WUXl>jR0e4{Wu25)v*B;h_WNjcr2XT0hgYwx z$0^yS^Ha|kiyvNOytQL71ja+myUqm%`=3vqHEc(v+ML(`Q6a8eNx^ zeilE|_i?FFB8H8dOreznhp5s0TcmYfw!T(ZTLRo2=4)@}uiPdH$yKyj^Of_%2OtS> zTdCjQUX35p#Z#62Zdbn*j{1cQMSq`ba05*Z0mT#t3JBzdtopTy*eBQ|6k<-{c5=I= zY_-PfN0?c-()Y)w-!|LwGE!j2Lu0b2_mY-c8Ek)sE7hL!?T-{z1krmMaxhvWx#P}jcyhu=!1|`RJK6~fYD7FbEiJ7qDk`U{Dy7H_dEw|nUrI_! zT_SAg0ePr0uKW}sJ}#Hv!{dy@W4uLr7bY}}ng9A98@hQ|eRw?C7e5fip+(m$>mJ|i z&5-G2K2hH}ZxKchg>puxMqfqihjfJyhOVdzUNER>c!aM<2t?*YK90QGF@45qWzfYS zh%EW-c6&v)@pihTv;_O$(8%ahc|;WR%;Z}gkE_*hk~ZQRtlM~bAtj^xBVB(TExr7`{=V{otuHtz60g6&Was(ruVByp!@uiXomnTt zZXr>IqUg->Let+j=Podj*)}! zaGvly2!G_PHO*C5RKNQu*-V*~;ldyrhIiERi4%^u8JhDh*B(tJMR}=gPE^AZyY1g& zA{cOUS9Qx7yWZGrce&r0ExhsGRuaAH+7p0^n1$^#xAXeq7;W4&UHcG^RfJMRT_p5S zjc||r2ccEoTE|@VyXtudI_WiECG5Z?z0VH<4CS`{H`iBJ5r6r6kFN(xk!{A{KJao< z!=q|hIr!qRbW}ypPQvcMDA#Zpy+cM9$?e?Nj1KzT`FTDrnEB3m39c003V|jz&CxS- z{pKWT^snmqE+S=l+`uA9E4eOY%9`b0md2Sp!8(&}Lfgxy%bi4~kCL=@_Bd?B`mqdE zzjF9Jh_TweZXe?lTSc>6a3trw?nv;MSn8)NBM8%o(n!-N)T^E#J&}0cSsR%{roDJ+akD?E4ek;g*!=jX2KNeSL zHW6bJNmUQV4!#&A-f^w3j zSQKf2JV4>d5-64lOLu=X0DYJI+I*e`H4QZ-RT)KX&(S9lUqcg>ObsuWtezLA|OH*r_vrSAK(%V0^M^K|fy&YXwUal|~``9NIhM zm^WV1Q=_BeY>uMfTNqT7G2vkt&I`c;$r_a$K9_g;{+rwthpxn2#Xu40xEt#phuAfeh(IVJP~$XJRZ!JdHNSx>iHS=f zU(m8s#T-i_l}Lhpy|bda36I^(%44y2s^t7 zx(D|_z{d18RfSs6w>TuAx@I~lskn)9e8#Y(*l>NJrld$G=pn5PF%3HKfrOrho~h&p zVc+~ma;(BsZD2R4@zz9e8jmD&_zGJAB|n7fSJjo9f!?_{$r^*ECs5C@Oul!4XGVDm zQY9tSD|N==sAlj@obxHhbd$s+r3OUBql)N;__c^NRj05h{9Na_fI}T{_59vtw+h6(b3_vdjawK)*)Uf!Y8C?y#Ad? zpDbuZj*WYNT|bQfQNfKJeRcQiSNfyJ+?zsSa+}D3MS%dM*RnQbbEq)Ekb;^qLdfYe zH+EN_VvUN?tK;!b#VDi%(&@!J@hNMBb8baeq;$12Fg`3yC_8DS$>XHU^abl+Glx(W zN)^pAwn0}_L{&kq6S6?`3ysFy=~gb@4YzQwe=^yegTuvpKSHPq`@VtjaqL}_uMFb; z{msZ6o~V6cp3f>^V5!(j7f+{6BD?!e^dXz<5Y~RW3P+A`_j0KFV2n9qXE$`b92-{l z%JzCa4$m}Z%L9kMy$mi5A`KcRSMoviU$_UW(c5>_g&Wx#bU$sq95xh##JJp>ac{U` zUNf%dp~Sn8+mLcx^Akc5So_NfHsest#WMp$V(KWb&ErfH+zZI@m$$Sf>bu6O;}2X4TUg2KOhtZ_$29>v|Hn3hgmNS4kcTH zT#{Pw?Q|)gPL8v}zQVOi6jL9n1^)4j0$iAtVR7g6}eF6M4#|VDJhtZq-E0hc83`@ylS5#5_NZ}``;4~1*I zosBUNf42Gm;H4($S8d1_4g6{9EL&#LXqmn^ghwVZQ(Fo78Y&qG@k{I9LVuiCxLjlG zw=z@COZJ&<*OM^3E0HkXfl0^*UY#tia#yd1_wC)nquEzj|oFe@j@I#%$U z_c9qnA!Iw+%Gn0KRC9X+)+fsU%fG+h7ShhWKjdLas)#{&=C!d)OG!oi?`^)DHhn!Y zOy`@<^?M8Nc$G{M-QJ3a4v7Z(#B+edyCo4-|DuG6KZr3<9Ll&HEh2KN>E#xriIoz(EfjrVT}i{n@n!uB?}^Hz?5XURnxf!Iu`Z`D`zZM&zQ{f8HiBSs#U?0-Vr%!P9_ZR!s z+8Wcb?(xPud3Xw8P*{i=obe{%6%ZNt;$n_}s>etC`Mtm->*!l8lkjvK3z3$Vf=x!h=y8F1 zPvAfEIS7-+RM}%w&>T|QEO8&Nie@omp3%enFZ0ri<&KwV={?xQV84c*rNG%}B<8yh z6#wO$CuHrXTZ3uG4K?I(L?oo6qYGUu-=#P!DX3w6L4gDUVK=vNDIf7KBdu4nwe-e9 z{)=A%1vyE)Y05&z9eU&-UL!tGi}Qb13UM|OVV?bJMX4(h7M5Ot1L3Kp6cqJZ=+>d# z%<&a#hx$w*NhOD3Xpw2DsSh@nk4Ia-%6)}W_z?Dq$QS_nQ6#k1g(?eH2 z%98qMtHSy|zr&_kGT$4^=}#PaBDUG(6BCo##o8-%hNtHXnTnHnjvJ#E7{=)F5U-aI z!6TVOQb;fkA=~aPmR(3+-LFXyY_G$T4GegB?Ek`Pbg$a?TB|JW&ir(JawVpAieyN& zWd;O=7dVL=yS&eCej}f2N$z|J65(Oi)Q}8URN(rht{={hM1&f3&!mZDB*W2ZOyK2IPKa)n8S)qdb0IcY>j z$R~6-4Ls18Sl6-^vw0xWGEi^?Ij}Ev_=14zj{gzgpS|AWYBZ1%kl)LK@b~UFTtR|0+_#}z{>xf30O6A}wRhrrPK9j-zd1ta=1zG3rP8cvoJDWzWG|zP4E6 z#}tRL5SS+Ya};lAES52eL|N~TzyH-Vuh6S7x#Fq=LIU6A@u#dl#FsFf#+$5)2yULI zXs6%nod<_UsbqwvW6vBc~bRBg6grlIY}^tinm3yXXJGn(#%KWWDw5*pSK zi+Zs^0ngJ0)1WuKo!0}G7SYgAj|+E2P+Vv|`y}6Jig^G$TCp!t|2# z@+A({$cwa#4B57N3!F^|IlaXE1h4IyY=c{TkQlaDLEq>CGt1PT460+^1e^(i%lKK| z#ztosJwrMg8`OfMld$6irjSi7WuawZKw;YW)jnYw#p@Iji~|{5L|Vi4r>1s0`C2bHfztFp17j2_HwuE-4nF``Sus_J`~2VtR@2&>fj(ZDB^c4aAH|G zb@F1Cyl3|H|J4Y3rl!RXI2y!5#8L%jnMrp$58qe$Ag+BYgC%die_<7h_$5a1K#@I5 zKbmadM37ZmMm*i23Z=%^9qXLbIG3-MPC#R~Olhh-^6SxTz4LG}w~1&U$kj6=*EW=8 z(cUihDx~sUsNuLkBfgMRqZMO#ZLCwQWV!yo)1Aa%p)o=xk{!|svK{J4l2DU6^Z;n2 zk!MKUXz>+)t2++F>HDrvj(l_|Pf#*6RFsn&Umo?dR5d*bdx*ZiJ6~`7GhPJU{?h%$ zV&mv^>ZT;(Ehzl%?p$hW9-i>*fn42~9A8ttwj`C|G%#QLSXC!W#CeqezW_u!NoEIm z0%Zqt0&53ciF~+1E~KWZs;aKJ zxV#JnruID&Gcz;Z+%afbb}XV5AkfaE^-6)u@xNY7)z6YYgXjM@%@$J@$`l$Wv-jwi zl@yURpFz11{_oY130`v1)r-eyn6EZR($oF-2KYMU?4?W3N1!-1Kl7_YLJ$5_;CB%{raJ zxVDsvj zTC@mu*3cD+6~Fz<=TE&)B%6UP3Cs{0f_z+K%GPKkTkuLZ*%)N4CyKzE$R69K+DWQp zDRd}`DEd^?QZ!X`Q1n!U8*>uk7rGuQ5SA167^WX@>^{>b$)gQVc_!e)M5RbFAlE=% zCb#LkQk*EbMoWOd*`-ut)ZZ)7q#tng6{w%$BdOjyD(jwXK^wsYu+Do07qkI!=TpJ( z#h+s1LjF(9pu< zn~GRQk!o-gE~uR4YlCZ`Z%hLu2Wm2uvLp64HCe4c3W(EiDM=Sd}m-?f}x zbCF+YXsYCo2{rwLn4d@lQMO#E-#|_ZCU0%ItZ(M&5w?UmIBepv-@8X8Ccli41deL{ zf^4kJGw|A@dwuCBO%~nD4QGNZK?D~c2g0cZa{LH{u%90Xxe3cG&+ssrjN0oJ!iNLH zevoIIvh$Q64NS5;5`4K&j%&kQLm|j&DihaT78iO`p3?a9XYT7HCtz)zWE60zNCJYf zHTrPboBDd2DXB2I(&#S`Kav&M6GIBuzTzx-PUKjd&f(LRI7o61nA%C;gz?x6(O}to zq)aHFlsE#B?(4}_fHjr|f!yE#qrrIRySCw>9 zz{`ej7Lx((NxM3@zkic-R)1`fG96Ld?m6D87b;RZTX`p1knzmMaT5sHHj7QD*Bp8Z zgpWR7B|x-hn}Sy0t2<^#Tuo$PH0<93@Ma0Iz$pvI;?=Ydkksj$@CiXKYpYOg$jJZ4 zW9rt_5^%hHk)9iqRWdfmE~MS?4XgF41@vT+bn(-;a~zFvKpvWa3E%sG1k2QY;oiMX zHSRUmPi=)ml|eeR^*b@2#^#Ir7$18g(g?K`cm~qo8Qg!C7(kj{EiWmO>2zHmspX(^en<5nH~^&vq^B1^gTkMBMWu|Oh~yj*YISGWA5 zV>N%p2*yH6@F@rM8#LgO255gff;~jt7nl2_c7Y4-AtpPyDgD6*?>!Yr((cNEueV%< z>^wl2*`uf2IR$r_o>h`CI7grdp4;okoOQ5u_gnCe%0O&sw9Vrrr{@P`Dk7YQkq^T1 zd~@GZxefbSk!iSTN75QT=3Qv$#M`Bui$t__MR2KblR) z4Th}hcvtV;AhZfNSXp)hk_~W?ES6usRD@OCenQOz?@lQ~WWXIC3HPnJ3*IntshJ%D zqwcY+vG*0p*AD1-$CXOw`8t0&+N?4$Fm4yc-*S>&)s+;920i0$CPr2wR+zE~-6wPh zAy7ff)&N(N7@b#d*LWm=kHk#PRfq&iLvj)Uck|z?NW|Anm8+{oTVBJ#Y=>z4yJ8}> z>AcYb&t#MY!2ygYm)ZhZIU#6(DkP8Wa6ZZl*>4X?NWd8P$EDts>s%ngP; zy*co6NXuFGo+!>)bI;(6V0mv#yY+K3$P6=E1Vw*W-W!y>Wq;C;dF?+Q6=U!+Q>iv| zw2tZXfvM#A-&Yk7=PUWCoKqv{|<% zc-7Luh!SB%GHlErxPe>qO&EyCM2(j8T9=;gU^43*8%vKI@C}jY@0-x<= zme+0#P9=2oLa7p{$bU&v+u|=tvmNlxLn7e|)S@kNXk7}BXZfdk=mr*NQ0vnZ_Hxw+ zpms#q1wM3|cK#vB_S~oPd|Nib2|k`9ribI!h7o%ji~BOg^1uCa5Br==#3_utU(MWM zhH)&n0%Z2}BJj!mrujMK3Etyb{;gPDb%5+4#Vn&uLs|yqCtA^fy0*5?+?keI?^1uu zA)}-#HAsc;JocLpB@-N|TX;{jO}?5|`ZBnPf=*Q66F^~jEvB(^#v zdWwI70a4P6{lz50!Xr#LslrkX~!OS z7X_4dRt_D!leB_{)p<$}tEy5m^MxwW+SN9;<Xq{pElNT=9iPgKA#@ox6H z7;TJOPyM-gl{vfa_ZfX1ef8QluJJFHT-wv)@zfNI%nan1snKaP zXiMxK$K%rhc4|N$fO?BN0SQhII2pMAJg#o2a&fYH(&Rqy`uQ%Lu8h8=QFhT6)d@aC zNy&HAb4wjTN3z0x8eDK$VSo!so?EOFzRt@C!&?5okBPZMr3*brcO47zCG#Wpt;?Jq z&(Q6eU$`)0aiEd-NX%?xgf#T$%>85xXfe6f$))&>_f@?7R?`hN;rH6ndmlI{ipJ&| zIE~6L)Mdi9mJ>);(+{1XT`3<#?({yG`1m<}LqBm*{77@X>VLhQH<6*1K2iN%X_iF{ zv@xh3R@k2byJOe$>fo>T1Eq=(DuyQ8>HIeRU%dfq5Ib1=Vd+KafF@L7MNwQFE7 z$58$kUcfy@nIahnw_(d?pWX9ULR@|j1;D|k?VV!6Z=jLmGNWL$o+PyNAg!@hvA5;aP4uv= zq!6>?N2MWYJAIpVmCwaT#zlrfX4{Pp-E{(T$TjSfqJtqYvcn}Mz)8Ps5Nn_=Ih@GQ zN+-~NyYE=QAvSkGQK9%aS-&5f;Z;8b}c^l#s$0la%lJ{?%+j1Lp)>r zj8dQyA0rPZW&OSJvl4N~1V@1!Jwx?d22Z;DZ;^YsoMGt(Hw%GtQc>RTAd^hTo(Fu= z4``Kda+*Pcu*|KPEICLk`+>U~q=K?T9`@(+T^2qd1DXQ0tboxg{{1JvX%05Iusffz zn(6`tk(5^1R*lucl>{{wN)*2p3^IOZi@c#ihJ%R~ezzXej}oK1WMcMU$VvH7yq7sM zJ-^!(VB1s7Q5i^SSs%?|ic$_Q!e}-~;QhwI#i0XLgO-sMC&in10#ZX3IHn}ewC7($ zZH5j(D<qB)*!NDkuAG+JDa>Bjc7uU0~Em%kJp5xY7~nYmHhX zxBL=@`ruuU18|FQ@}wVI5=u%-pAA;}_aHag90dICcfUt_@AUdU{2a(bKQ|t*_pupk zo2G(__Po1M)zHGh5c40<@=Sn_nyKGPzqYP>I}!kcn`PodmW`8e^OTW^>&C~7gCFuG@Pbo9S?|G$*UVpZ}Zk4|; z-osDh9t_&5aehtYxjdi}X;<&`kJi!|x1(#g`yjtgP8l<#mhRP)h5RR3x|me897{Ck zPX(X?c;*^>ES=zihW63QA98OB{+Ik$CV09U+5ekwK-mR-{YcL{ zoRZq>kjswf;w}Io3DX9V1p4C2%TFki2!0avC;XO|<8mpXhIcokuC9LI-JlD6g3snU z*MZ@&TOR3x#%bTWY)yA-E#QeYm@aUc$?Xnpk3Ki{Gp~1i|D9X)Zut`3DNr_*W}HV_ zdL)eMA!h&L;NM23x0BJ!9|?XmORkH680p{?J2iGzupkw+-wyqGp+L~=<^8WHS7A2pDcCGI6PI*0yV?xE3 z{Oyw1?<&NCPz7K7ufy`Q_J7>XzRR>kM#@mWOi9jw-x8mRM%)bq%{BX{3lz9{UZ4z~ z23pufBEceG6yy&GF@hfDl+));(3{~;31QxVQTjI4?fH8@=t>H*mn~oLAE(#zSGsRY>n{ej??_Q6C{7`NPV9en)zyN&%3DfX$%fteh8HxzS&pS#u%y zZ_u5DL0%jiUXOI}Ls0}H9N-7R_!Ae>#M$CP{WWRi4GvCX9#MD&%1E5my9p1JQ{bSC z@4+BmUJnlsk4rJ*%E^0nXMn;PwSn&|#C4sG5uI5&vWT0Gh`SlIafb-C66@fnm0i)H zsndt?egVvDS7Hp(_59^^&I%bM@mBU0fe-uqj~HHYsK2y7#=bvVsGqG!p#p~PMDT(G zFd3-fA>6+BJ%si4l4Mu-d{J)JtB$YIG6CS~5I@%kc&!$cO9=1(v;asfJO`WS8^Wpi zN~YTvf_ZO4=0Al>Vq%3FD`KYt#VqTzKubD*C7HUvL0+p#=9 z4<#>l@$c8zX^nJhYU#&1frliEFXJX&do~)~w^Kyn5iJ4rYRw=SP&|N{UL(>JG9OYS zI~oFtcmNQ6pSAPA)yPYLEbwhKFDIUkg7u3K8{RiOs7Gk=!P~R#&=N=qI+a%^`UwtQ zN~Bb`*R8VzhCvswuN_1j0m`Y~&!Cme39I6DWyS)W;-`Fn>}DZ>!p$Hc(I2>W`V%TFZ#^Y>;*kBGSVT_rFrmXPc& zx$A{YT(eB_PFsGb}sB8R)(ki3VC9 zJdikU^3w3}^FYcP0SI^T%BRE)zwn%RTsiHO3VezsH z`SBxFCY}WMw~p@L?#jXLSHy~yAsrp}VGr^`f?s7}(5U9gaXEyE<$ZrF|0#M7InH z0{pjnXV7#V=s6WDgW8%B`kFl+z8~XI&>&G4IBczs7d^qGF!a0|g>ausu6tu#lp-D) z^9953i%*iG+RT)G7VYS)LDO3%>*cASK>v^DO}ZCosff}SKh-QL&$|2^h2XR}8?g3o z0CC>ha4tsLKfdasGWeN*-4jM*0E!c7J8VIU_no!O%{NtHo+(tc6rFE&D@-ni^JSxc z^-%>f1-A#L&fb8Bk}^R!8lIxW;%NTs{UYf`-r;pVTx0KLs&dnqN#po}YnUIzr> z;gvI{?^rqyDm{OQ+v*ojEJ_aSA*iQVOD%nxErV`vCoG&&+-OrK+n+jTNU$L^8PI=Xz76cAoetr^?-(GdBlF|35mqbFYPaTzJMHlNMoh*gq zZ0L9_*)28VhWr+5hzFL00zf}B?13IP88?@gi@7`A`n8>x8#AdorJ{hrlukqnoXKys z_IL;MaqxFef9{Uo{pvRdw5V2-r`%~-HS6|J)gg&HOe9DZj!3hL>@RUAh`5Fp05F?4 znpo`*<+Qa%5g80iEBTr^v(@GM=l8E4JAFY<5C6EH0$*+qtMOEvjr*G19_AzNeYLe& zT3dV+>m9c|`&Wk(#~--g7qSP^4lm$c*qg0Cxja9|jaEW`AlrtG<+EK*5Gou7-LL_> zXzUM7sW7q~5fb5mxy{W4p^yz8v^sm~u-5y7%o7njI4*W?U7uZsR2(>scukdtkhNcI zVP45BEsR*WZ{FZwBIXI%4s|UB2L)Cis8iqHKTl8p%KV7+UC{Fsf`cmiU94XFU4DnD zpqmJ44v?OXvsx&FNmqJ$dy_f$5Z{`UJKAg4zSZ)1SKqPURVRRo` zE{UDtnfxpk5({Sjhsg51f#NKI()BRdds$0PM3i)F90Ps*)2-&~hXvX35e2am!~j4euZ1Rt9zDs1G zDK7!@sHulBkP;Uw_(p8;5;^kbW#_eoY}Za6kQbB#ZaT}vw+FkDXC z9btz20Ux`mH$vMQ*zhB`fM%PlVb{Sd@K^@M?W^|mtm?Iloj=DfW9nLW~ z+A{J5fDb=XlL3JTWI>AM{LcNf&`#(F4vPh@Rszvr(38E^7aB=^F~g8jm}tE=`XaMufcM1up6(Xi7d zUV?(7`yxdD>}^#Gcenjuo^klK2qv=v;5TD^%xufyk?=Rd-cThWwn}R8;i21W0Io{( z^pve-Ye?nn;`k6!j3G0#zMp}YN5f9L4P7yh2W}^34UY(!p66`ZGbi9B{_5pk3NeNJffSqP}MQNkz+#tTC zj_6s=yTK_hM|oDK+#vjz&DYjpBWa>8ulY7U`UQ*ntmiuy1zHe!pvLAFadvVBonA_PyF?_OJF!A2V(Q1;C-I z0+d`$0nv8=$^9Jxfn84mYaZp2Xn4B$SD|1nZb>;mXvP)+}ublci^0f;I~9Ywb# zEIe+ZfMPCBtt34>G84KQBa|=#hgXkzcR%XXMVQ*Qu{fh7|G7gYjz#R>1yUmZEHHoO zYSOQFD=W*qep{t!k>6lpV?nNN#(ZEIX9yZ#y=^eeoK}CA+dt1xD@zM@1m5~>6K;9} zd>k+zVBo*{FkZq+Auc|U9Q&O>*-kS5E>x>UgJTd-?Mb8}rVb8Lq@(5oBbyy~XeMq) z{$OAQ5#ozl;Ph?O$WTF9K{cVG(5)zH>Hah(6*@Zo(e@>1QODbbtoD4Zi6IteY+Y&bXp!wTJ z;W?aXZC82$KrLxwDLw(sx((@-_t@owevK9f14Y?v!z>7CTXEz2@sS4kxpAO8E8igGlfiemVT5tk zClnFvMX0C9l|rROOECe%X+I%GuXOV}W%GQ;h~7MyuGP3(SIp~Q%$)s79;&jTMR|H* zQw1nZIGU|s)i5>y8SZ*zSEFH9VDAiC(Q9c^?w#{`L&hHc-0?!$8(B5p#T|5c4NSnV z{@$#l^2NUsHyfU}@EPe)2pNq-+FC05YzROMysF5pqUPoVL`q>jhQv!Voz~^Vai& zB%CKXQuRW?*5As$ZYJtXstD3K;j1F^m-h|WL(K1XBLD(Ol-gk<5TTVmt|d(~z>rxI zohjf1d!K$X>K;{MUURsW3Ge35O@$-2)G+lW(msmoC8>5#7ej|m00DhoLUE3>+&oaa zDW0fr5IkI-x1%|Jv4+6IC&ZfY`Peaj%f2z~9PL^7Hy_#DB~ZFSS#iQ0UJVP7@;u;|hS<;U-Lz&sZ~?79 zEGG$g3a3Z*YD_BO?4Cq#sx0P_?8IfnwLlNAs17&ZZzQE}EUlm{|8;z@%LpCpID*O- zV>jr82eiQ7X8$7m8E{Mx5D*fO2nSrO)cOW~dUPg{Y$kIHf&Gw;?JdEZ8;^-0U1lu% z%sAfRF$iF^&aSz1mNrL&#VI{Y9xe(qH5?X63nn_SPpC?tOm`I?rv!GmBBsEkv29^4 zc1#FR?J1LRP$HkGI7dn?C$#l?DsAGs+nF{mBa?KzRj#t$G&ed$f&i(==8A|=2+zU2 zCAsKw#YyS7K5M9;xmiPKHFwF}|4fze7N(^6$9M%ut*_g7Ht_@Op}_-j8-5>yIDY*a}ZU~$Y-}0`P^rrp98R(Z+i@O)HY$i zK1YQ{xprujNl8n`_O4ghNuU%Y>`XPLe5=XkYT{g|H|j)~Ip0{BeO*JicsyJnT460<62Kwj z^N!gurIH-F%Jr{)PXJu#-0n-HD=c;`i3F^uae-gMW1v?at?9<-dVdZ!fmE~h;?aQ$ zl<9tA5AtmKY3hc{o=HPULk)D?NvYAUDS#ut1ph_)Mi^KA;XHFk4N6f>+zd#)V1Q1( z!G7IFLhc`3&k+jg4k3#WQso$D;8DtOl@(3QZ!h~ii~krV>S;DOIOwP^I64!{?|r)% z?Txd{0~xadNWqmlJ$~DLpSKumYX;(48-T9L<zp-%|(5DKJ0+BvaS#5W{xYS109_ z^)$qlWI^U<=?Ck_-#D98SNQ&16mT+l+JJhki ztEto)LX@u3CsOEVnPdp1)42)=`+`E&d*K!tzxitwMM7i^($($AZJVqaZF+6bW z7-r8^3Tjs8lcoEHmz?HIyI!YH)d{zx7fw-)1$;XVzn9Ha8nu^ zM)H=uiqJJ22Od!Ot)Z2`2!q~g6D3x9^6RFxF_|Ck|9 zOh?aP)l)1G(%tTFZgAMB1^s+-Em+u1akmc$5k&m*@BYDn94<}gTh-Zg8zuBsbcLD3 zBrl*Su5y;D(zX27p-SxTkNSvoqG0cFofv9aH{UZVAX^!bV58vb&F5|i_lErW%g zo}Qe%u#nu@(sFfbb-cRU22A|)dK*-QB`8@82SEYEfcv~G_4}1RvL2UMV?49-s@;Mv!^^nupf~a*e>c+>vSQSN#^8*6?pu<;fi z{2_w5o1!i58<#w^Mng_MJFcVWWqp?#FxPO#+5H=x4Y!Z&irW=X`^IXtfHPHYLRJ#? zGvN8Yt=Mz!`RVcYc!=mgDGtb8Zf;gGww=JHe<>K2)D!QX9sBimmvP4ANl z-0yF>p*5k9jbUKh&xMFKKFXdL64J;h53Dr-HW>o;@9(eC3K>Kp3ILWyNvpQU^LBJ( zvDA$%Nss_~FX4W3(mEzHIcVtsp`_U|d834Yh%|_5=5X;7=WE9E)AQli@;kXk%AVlA zSA!2+?l!XRj=!i4Z!zCmFnJMxy-Gk}77~Dl9y$rptqK*^JS79LhXc{k-INhiuDW*I)m6rQlQn9+V0DV=&3Avm4PC4$!oS!lIU}SY(kjM*ha`^~dpBPq{ zy&%tv^y1_K(Bq@or-y>$0L^^V_8XWnO!kC7vvkG3zA{SMJMcx|k0n?%!|swK6=GCC zZ{mZsITt#B2;inCN8KWd;wFWOb%4LVFwXMUO!8-Oughmxl7y{*+LfR04;YXPWw(WU zmh1E$ZY~3(e!ays?DOLgV0^Hy4jFEykJ(lCz#<`H3*!Cgh{LnC>{0^OiPuM@WwV9_VJ)nLVNzQ5v!iY-1fl zOaAz8M|=emIQ%(LM}^`T37Lu)6*!_gF}i=GKs{>jZ2i;(xA|$8?UKQaknrSR;N#Zw zxd1ldkY^yKSQ{MLMS9Br!_!%YRk?j#UyyDjrMo+&l$H+ZQfZKsPHChYBo$D)lopT% z0Ricf5-CAK1WDnY`#k^aJ=ghgzMRe8cdWJM9Ao?@JN2fSq+LaX6EuBvD;MZW)w_^W zP9=j)2#8UPIIPw6_4W1i`lkDQgI#X!fAW{XrV$k(e^%HKc3a5QSM1}_j{*lfI+Nhy zg1bWZn#nu2%A1_|Oj+}F2(aVS7qa7b#u5l`mAa=-V9CIGOS)5b#ZXOA zkpfxt-OsO@Ds&Hc93YVA?|l%A!U5gORc$@(`9^C-DcVr``o3{#)L|3vYXg!r_Z`k& zyK#rn(3~IC#Fz}IJlr36i49)INO`YG?#_+5jB6RZ6tHcsl~xG0bzL6|fzDP;bo$SZ zmlER5;5whOeP;AN7}Ql)esYtBA{S&uQH!e*f<=R7?c3;;jh->DK3Eg$et-6BU4n;B zK*DAT)h_SEiccOyK?2m_Z*EJ#6X{w)4;5y}r_*fvtM*8rusaE&@q&q;9*!d2`iKLT z)#X3Wh)n21m_r0-dmpk;o#;@+dJNPOS$l02*|+gO zGo84@1GU0UK}j8v#xGge*vQ3wC#JuUCCUECS$WVA`etKYmm;!9Gg8YNN|-5~SAH6K z7^Fx8B0jk7sdwV5a>1{%ZT6Am?%6V2A|`wS_qPN1JH2ys1dGAri?vQo8tsVQqbb7?Ik`_4q~pzF;{v<$y- z{qs|7O_TRGm~MU^bS%$)nznqd0vWdJpFf8mp58UmKIEzE1SST9-WxWG%&fErNGEW7 zg+O6(gl554ekvhrnWd$}I_w8wJeq@x_%cle5tf6N%|Qps>7r~zsWv0apM13k-%7{S zyjfZK=$ThQ=C!@rZqwh7%uKYjnzAe4^GNP)mfp)yR04xbaGVy~Y{?bOd2JUJJ2235 z<0r8Bh|`hwwjjGcLA^mX4IaJSkN-NGqTxvB9x@z=yQ*p$BcB`C)1`sze8gdlwu!eI z&;TY2N%_MJ=*ET8%G;@fKs&Z5GurteR12AE(BjF_8TuLaIJ2%;K(^O5b2vGe27Bn~ z?OQ)HyU-9fj#V8fv1)dJa43vp+-X33TKQa5nz^HuN8N0NI5!H6H>;9A^>k>W`d07D z(CBj+wvc@_xOY6;wVVKfqm%tKrpDysZxZHut^!FDoeNmo2Gi~d{EDamrdP?hbQk7$(Qw>Sk2_kD>?-Yd`{O}v!d&zN5MKt8QHQ@pOEoeJ!g>`n&aG@ z$2IK?#yVGD7g*YGvoPXz#Gh6BIp6MJ3Cf6ev1 z+UJ=vxej@%N7gMtPST3yoFf1IPLZjmnwrLfTc&qwMa9O9{QD7)in?UCJxUDbaL-SQ z55q3Tz9eB1@Uxeu?<=9)pMvs|^G@ad>!MF)>2qLBS(ip3sLYdSoFHTIbUk>|lZ;EC z4SX0eK96>==wbYuTVp89b2=f@pYEY>QIJDG-1e<$_Xn*|fN%tFe??BS&hnehUHdgR4lz^A1X#@7oP^N<~Qwq@!-sKgppC znb7jcD(zKF#FCx3l_OHg44#C|k-T_F$N#z9Dv-NEK^^o#4fyk#@og0AkCUuORzqoE zmO-bMg0!I*R(C@FXmRRxU0ln$H14=I%?*3f;yMYVn}|6r*rH9N+kaSqM}7KgkYXSl z_QWh(e5*6Q+xXY0|(Oz5Eoysy=$9wf9l<`Y0C za7*9TNlhuY?eYcmJKD3Trw0w6r4(8Onhs}Zh#u~;6c4yRjPtYAq9EfX{*BZBGcPcl z+oT0WS?<>I@3<)Yk7Dx!m&CA%m}aJ^`5Hb&q;$^N&fiSZp~l{7!?a+)UQF%kW9zUP zTM=!3ydGEo3E!5|blBRrsqF1rjj7p<(a*Q zjGSJ{A@^h?=KY))|KauDs+@tKSHgi(pC01-;A98={zVwL%7(&nTTUm5s3IKd>n_Y) z$Zb@(#?o0E%^O{FyLXcqQ`DjEPVE(Ow4R}!m{JBP?%xzlM0uAx6U|f^=ZSeDv$L%( zq+?rQWs}fs1$nMaMf};=PJ0xsU1=w*uj{b9cf1TH(9OKaBHbb2ZR`fxre+@JZBuh4f zhajv@dfyZ4xBX*hymNgc&~FHhCJ7gtdd@F@CT@AE8OvD3=Y|@l=n#0S(>7zk7xx|bC>H<_^a1AL(J@N zgDaVjXK`}5Jin3Nen53+Q7DyJ-@&ZSZ7AE7*<)K&++%#XCC5n=!Xp>VOsuR1FEADD zwgWHIs<)-H-X{@|1P>=9FsyLf>h#E#Ro-%48^Di=O|YD*Rp03O9Resngy|5@IdkPs zgYP=9)J)}jd%E0QQu^-EYK*je`yRV`4BVEALzWI@4Cny_V$x;-hgY=UFKP}hf1{`j^61I-9v`J zBOHM4os#cR6W>kt4uJdsh7JVlz@RB>$rwp=r>eR|>)~^=zB=Yz0aD85LQvUQVxmUp z1z87)h2DxUeI?0bSXs07Y827EPptZis~80v$D{6Aa}3yc3MD>DJLeBlCr{5JnZR<+ zQNH`Ar+IhO>O`n5al?+vjBeF#=pam1gkOqs^sec#a+!oofP?691xgf_#CgKol|7S& z+7`ca0F80d{n?#|jQ> zp?d@D<4A*l@v_S-E&7zII_1Mrq^Rmezj`fDxQGOnYSjGYXe>^lP+<^Ap)!{_jQApq zE+XHnbw-dC`T%=JjK`knp4O^pNZd@`DH2beS6#+ByQ@LRnppli*n}hv8rs||eDb(% zEpi@Jx#_xQYAZ4aVXDG{oK77WcSw;9NK%*aA9)@ZIpLxNEQu-1ApD97G> z4nFbsb|%f^k#yU>)k{%=m1x%bXpaOHE0I?3kuFn5m_vR#i4-l$V1ki%*WhH$!f0)A zq3hR1ES&()I+mQhDDUNtF@A?F3g79Fi~ent(cV!KK_mqwB)hgx%gN7UE!$Ohv# zo!6y9jzzE~_V}&m?N5!fvqAcljfs6~82lhB%I2+NLjIlL()o-f3l%lp`oe`Q0kQBF z^I)~szf=jihEng8p`cl$kM_d9{{_TIEh)exU}8lp4YF$|x-|z?IQ8M9p9o8Nzaw8U z?Ao_^vJs3HbrOZG30lhJ*y7w!+3faq@W3x$lWMtdBWwHrdY z-vREIGbe;0JyUiPKSI54r^v7gQ#Zc=kKi7Wq=~FCO*NZ9uxNP4P;`U*9SSGr4^AmG%!+jNbTDQE;k^YbXD^ z_{(x*W?}m^SKf_ouF1BfstPwN$^;bq>u)Dm9<)M)N4aS&L;|dfrO>??Q`?P}rFX4);~`)CKNpLT-~DFaA1Y^4 z>?7IffBD0}o*l|ZUxF0Qvw$snr=`_EjbF4;&Y_Kz+MPtaaWRkY(KLTmWJU2dTSHV48dbovPBcW@^=Lq%U#i5 z*nH5>A)?iP`Yx+O6Nr@ubRHB=IU)(}Tk?#1?Z&2{oQ_F9v8t17)=zNp!$Nrv+Ao+lhz~J(-RoA? zT`xE0Q5BOj`4ZdH?#ttcjQb9-Piww^YR-XzYmu!ZKEU#QQe5ny6su9vmt*4hAWiSABGJK;N8o~0K*wqyXOC|MO9;*It=Jze$m z`Cv}!spKuzru!?hoyoI8LM1|~Nj-OI_=x8%<5_E-+?R6S>1`3NXmm6V`n65Jt`m*` zCjA<`y{lifEujn6JGk91b2a~=K(<4GZomn&>-lQ?;_7PWg|_p>`EgZuGU##KrYeQ- z#=o<_KS3V7b@t?Rf3Xc5i$hnv-+LlO1VswfU0Bq$&6+e1e}Oe}yo2ZY7BvuJtqks8 zR?Zm3;i5-bV@17)!AW*E*cmpg^Efe zr`8qa^z!E;|4ZO7I0ab z7o-aSXzc*WosPW+M3e^WvQ@<&zPsLbzl2chsxGBUu+HmY%LB;o7UCzTr=@uuEZT4V ztJ zzWn%cLZhRQcLSAbNi`&)=vPc`;9`GAw+N61nHLH!={CquQ{LzF272Zv#gQF=JFpS= zCh7>B+7h>MKKLGas~5p>U7JZ4$&s{Toa}4&(p6pQ%RhKF4rR!TksYxwfdv`SWz!7d`VB|0HbaF-hC^OPS;f_ zQ6LU29C7GCNBRW}Gc{ePmI4U@&@=@qaliv2lmod(ib%(Vi=QHC(2h{3`oZY~fQIk3 zDIHlh#>UxImB!-YbDC5Sco?OG?>jp`b{;J!@zp6&ONh&~aj~_{ui@ojV9<3Iiq5T# z4BUDF7lHA~tQI^5=jdP=n{-lQTluG-uTS8JrpQ~hOM-hN1_$`2eUbNtFH6A679Mjb ztDsgz2VEbyU6E22uOCZmwwvSedRQf*v4ZNn}=_SjTxK0@R5Y~ z(#T(8Vb-=Y0&+d5%XSKuD&;~+9FW=j(zpaib%rd_d+=afbL8v)V`Vv%+EX-DsSbQY zcPNqMNGVF-01gq~vr1Dqs1Q$&dzy0cyDHFcdmT|p`YmTqU6IApdG*6j@JFmBg7gUz zDY3Lfs~CXS<@Wu0`&p!KDx8+Ic7RmjAD?Z#v4;7aVf%iA7teEiIy6_vdAZS!dxflJ z1CAI0382OcNM6Vjl(BwL&53UYX3!8x=4rT`N}>e=~#!^PIA?$Qpe1Us;d!vO_+G1 zF~X(V$%WtD1My2T4RdF}_*xQ)id=lhCXa-_G$lqb@_hEDs`|t9N%kq_1N=eU$u#)9 zGU2G}C0HMzmCY-8DCG600f@egM+uY-j&dqmo@%nj%RzpMJ=Cf3W!Ug1o~Zyl9;9RV zskax_Nyx_o=Y-&PRhml1S1mldYqTxWWK&yu+kybI1wVI;ZENxAGh|XOwRolZQ#*KX zq4AN~w9my|!^Ojl?bdVJtkn%JvbIP~7lKv|^J@XP$X7|;``*wmgQf2M?v#O&d|WGm zN<3+Op_;Dj!iU%cNIM*2psD%7mpP-qXC4MUTUaTmy4FyW9lp*%mK9P23{PHm5x|eu zO$3_;Sll?XANLRv5D*e3XQWJw&t#;eJhO3pS6q&D5E~s$xQnH0;n)~lnc{cVctbJ2 zrk`ny*y$(`iciCqD?E^oELDIrq@=G14$+m8CoAv5n>Tz_8=aS3tGB0$aUGhR=Ii~Y zk5>8LnwsT0IaMZen`{@`+igm)6P_#LMB+hGnGupt2}b_ySBn&fa9ENqsTCy4lX5>g z`BJiR`tIW72liDUxUd_matdunj<;tN7eiFHvAqwWQK+#Re`~Q zfjL8yFu{|}={k^7uFp^6t93}8ubm~oXQ%gTX&La#1f?6~LB^HXt}(<-1{e8jKO9^} z&!XO`DcznDjgPMT!%(9UC|h)c(1DIiCGBXTlvSD10?(7emrhGQxD$FwfKCO%(Xra)=UTO2f(v^hB-Uu=;gN) zDq8cJexir==JMaazd^Hr=^C??Q#MinFSfeXpqE+$VvC9c>-V&Wx)MDSdvX#61^?B? zpU+YIQ%Rrk4^Dngr}nVtjae?Y2)@n^W5;TDOKae5bTG&VTPs*0wPp zk8-h#6@9OBOa9aK6dpqkD{y*%i1tXfImcV$jYv9=5Kxhm-thBjRadl~Zi+3G@Cjjg`Ahv2F$HH%f~Wdcq&tdj+ZFG7j& zd0Q}7T`imYi%F;wP6$9Hp)HHIb@1}^L7Tq<{Qs#e2_>|uTU)2RlRZ81Dl}xZ^T_bZ zMdv-`BS+>kB&S&i_%gJyWba`JI*hL^=iLxQ({Imp#jELBuxb($(563mWA5ca>`B)R z5v@kYWjYSy7J~>lJ0KutTaord@DLpqAIyD(V_vwcbmmM&iD)4&@#7__Xsa}{d){cv z2tEGXCEM&{Z|h3lD%?nL3R_LAolp*2&b)r8f%D(0_Pq<13Gioan+ScDe<&06avNL5 z7v?2A+ug(kt5?bm&xgfa$92PSfLjW|(NuplMOzD3`5W}!i`fyE;x+*noK0ngJDDJ( z##pRZPcG-%wPr7`8L%Pg>)~>kkF<`oh#mp*8O6NKE(FLCmk&l)phn1Jd{0VFj!uMY z8&McQOR7mJGpx6!lQ#DH}X(K9lZN#PU|*&y=EK6LGNQdn3BL z+C79M&C&nvMV?OTkR{y|XJr(#{4)&q_rBiU|0%;_{UJ>lR~9HOtpB^fbdd7pf9?Qx zUuom%hyFzD7bk1%g}f+0X+0fvI=lw&TbYcW$F~k|vVX4P(6`ny;LOu5wYMW}vEy}f z&Md}(70m?#dsK# zot}#Eo~Kt+d&DAqgX(7Szt1St&l~5rSKt6gk(J%Rq+m4bVe6zsYeLmC*krf4 z)DtUCWv*fuRcKMBvf#b{3TQ=Q{AxOA*rbu7;1tbi+E-J5kwHMFsS@|ltM{Ydd4PNB z#B?niIR7QQjtQ8WpYPp)E^-b9sfuHf+}3_x4z$Qp*qb4zo#p#W>i>TiH;q7QKCq0* z$Bp6Pz5KEL^ycr0yPvKStzblEOEyKa4J;PxCf2w{WoU-2Hq3#Ut>p>)`_DhqAr?Li z`H185uL1%Be^T#khf!9WeO!gmNr_b;>X6mDA~^_JPJqW~#^q2NfT*y>wEJJ8rQ;*$ zzcRN2e-dHtiJ$cSapS{)*O>%a+Z-AuKZ!iVn;Td+F(=Od?0!3`AdA%?d(9!~b-wly zdS48f!R`trVA3Qdxtp9u(B$x0e_iM4Mob%Naq;@>d&BO+H9!M(ev#9_oa{wx0ZBm5 zl5y7`dqV<7GVnTr^OloAR2YRpy=129=YD#T&MauDbX#Fvh@Ybf)e-FLrDEbwkB;01 zqkki6VELCWKyoJ*uJc%CFo$wAHlbZc11${k>2YoD9WX;;%)hqt*WRAj!9v0|UeMLW zZ)Pwy-wq5EaH!5&_{eem(h zBx$_rGR_AlrG;wHs|%QrF0?auLZM0&hH|Ff?c~lKo;^!sK|zOPAYYHuMP8ks>_KVX z6M0cF&axH^gvnE?yAc8YQt0nE0BZo4aya?#&OMkbwWd^;6J*8>grP6sat>x>t9V!K z;pB+A4N4SbNezX!j10BuQ1w zj?d}nh?9v(#*;KfL)}FQHUaa`PU{uB+#qKmmxU&MbULL6HYQL=jz`;L)HIBGhKgE& zw&L1KO5+o=9$iKSi-w}~dqGH+pW&@r8(8EU>2q^GjHmiwG5_eiXBpV-^mBQ4Jyn#;Xfw=(+_aNXIyv^Dy=#eKKGT}lFK zoyQKD%_FK2FcAWqGI-)$Yk?-OKTHD#JQG zGa))1Fb?}UwivLW=yVd2-{*YQHp;=r&aRC4{JFXLcW@sS7mwiL;>N|}^!0*il304G zv~PhOfE#jA5LQqCZ_dE%w5GICKZ`Sr{GlApy}}hD`ko!{$vL^n0zJE*OBE#s-ieQ; zKE=o3=%uCW>FN%6SgWgOlz|2W#y9$Y`F6Z8#QII#tiOb=@f6#2V7Jl+s1-^>Z1wvh zu3$vOWo8-TxgySeFQf2<;AaJ(kpV8?=CHzJC%?KGzpL?@?d;^o7eJf02mL$yHP{0g zj0jh9)6uNtN%XUedrh7x+)ZYU&1qD2`algE5VatHYnzFD8WbyH)-0o?4$@E~*f0ws zen4Ipm{gQQSObt0hQPS?v<%q|vUhD>#cqo*XU&sOXFtBN1}_J_JiPkZL;X!85tqh# zX-GvS#&j&5ubF5&YeAlexA(g_GrYun*8BaOKtfG^WpJVn&n!K64JcrJ5>E}MQqG)i zz>X~4UbtKfV_c*kZ|K!;3vxz8L{L#v!PtTqSBK8$({3ELupPhygyA;STtQ$1nGx0b zQ;c&j98|>ZlC}UmK+3HCbU(~#669-w&QhJ-kNwrpFo+h$AM=KUX(?Ty)TE*yd=ifcWmrUXywkKBq&t zj})sUsev3*{R!S_5I;9^uVDg2_Goz+xmEPJTs9tj`=AlF!|6 zEqb5~D`-xd?7Ri*j9SP&JPU@S^70`VJfI5btib|$Z~UtNsC9y9+nb#hH7G6a{=u07VI;GPeFPSDnqh(BkcxeFv^EZn?^RcF0R#KE9 zEb+-y6buA7c$v9s*BsUMr4=lAMTTUrM{t+Y9_iT zDJ>sP!L7Y`n;c-FFD#<|dvKwTg@bM`qcs_1AFcOM@(NzTH3FrFO=hm z17+|`W&@v|{v(DI%=h!)X_^{76yvXRtTc%p&tOeUPyV^k7kIEwt;+&N^v~SGBW0aQ zjBJZ=*m&$t0_tugAxO@~AN>etAEl$UfLc&tE`_x|cxd!-;;5)+lA8M0Y&A=hDbrlN zIXA%lB@8?`{?pVq;ucE6RzaTn@fmfJ^|qn7r~0BVx>ym*e^n9bub_z*hY0_5y5d47 zAr3E+6uGe5FKQtyb)MQR@@zc{1{jR%+5ET=Ubo$-e6q5f^b~@#ZX5j#M4R6_Xr(wY zNV>KrCMOY=0U1u{KFL?sN6IpgjTO{0? zf7pm;(*mXd0evS5yG$k3U_9orJKkV{`3D#z7S;A+{Q$A{R1kemWVj=@`cr%1tAe4d zDVJ18BdIu*6}(QzC@6r&)ilYJed1G6REJJ;rh$&Qx~tChkQRTesFwxqZt$=w;o;)F z!F)b-zm|?+@7qU)3)%6d$uK2Fqerq-QXwCb3D0Gs^@QRaCL(g|4ePJtP~*LMg&qWT-F|dCZbrcYpyx#nT^{;LQ^&+TBTC+;PEj^HU-5x zIqsG`qFL=K4aI3MyFBjcBub!**pK-$GG1>nNZP1Zh~kzh-? zk}`!cG)e8d!g)ubs5bdEE_P3El^z+R?Lw+Zi3J5n*&gqk7>S;fS;PY|6Bz%9qa&kq zun>-M(kpE}8@uo1;A%^e>jB_W2~ZD*-s);=E4CDE9}-s%?aho-z=we3{_Zpid|Nm< zS(C0M<}>2(O25W@-g zEs@{8x^o#8(ll*V@(V7aF7D#=)fFlf?{cvf7W| zlNK{g5(x<^&azi2y{D0CcCd+zTn3cGKt@bPLF(2jG?9S34w(m>WdwsmedK#LJnHiD z%fFBO1N5Fc9`;S(cgVWg8A@LX!^?CY)=Vn!{0eM~1cCJ12x7Ue1xO=5F-z?u)AX1O z!QT8TJ(->;U0AlUm&qEkxW{iY31AcsI6(U--{xH|c~J2nRxYMr%_9LHwW(9}Co`yI z-0WOYMjmTa-7wS9J+*cC15yF73ZV4?H5#{yiIQe8R|L*qm=|-5LJavtPEO9$XdlWP zMmC%l)aMp}o&&#k;$wFnIAgKgVYNWKQP9C2esd?3HVG^?a*6t|&WGwKbFbk&o`C(; z$IEiuz=F=Pw1f8KCme(az3oZGEXC7<*M3}zf^iN5lYe3J_7yjvH6cPhV}=e%ca5)7 z+0B2PpXd5qYceJfeSo)uu;X6_%*Z=3E*qLUQ3r(%@k4-*vbW%VkJ->sL?U1(4SE%0 z%$rbEZk#T%Iv$tODY^bwDB5IUfm%jKPkV4=u-F!rO1!y7rzF7&%Lc84m5GakgU9;W z>@x84Vx+t#r{S@obT}nNJXQdHvv8ayNfgE! zY98i}DfoANha=FUoz;JTk-!>IiY&ab<=`5(AczHV6f|FP1CO1-xBkbPA+V%(UBc)O;2pVrU%YFj%^muo>#d$H$APo0GXZ<3 z8>Woo{*3oJbk2bZ@NToi4(02AH!#`cxTob))2$MZjZ_t!6kt*aC(JWJe+;tOWrpz2 z02JmB17md4A-dll6nHP_%{!(^?x{@5ZPKX-IQ&j6!Ev^jTdaF8^Jd)Dzxltl63R)V z7j<{S_^_ymm|mh`T^+*PTUzbSCnh#;uTye(oN{LQr{B|Taoo(1m0ing9GM3Qn zrblCPmW1hzPxf92>fegD>a4h9`|ETpoQxdw>R!XPzhb}ny^Tzr?$R-F+q{Gr*jnQ< zm53lKpZM3RgHnz5A7D%q^ZLEVZ=ne9I;f+d*1#A+vs7kGcnvcJ=&f^NGU$Dkb*=rl z9T80%H@oKGy4AaU4Q-G8PY;J4yeHEx96Db)H~^U@B+6~1d?OO=qPx3D>f)(ZH<+e? zWGvgg{dDSC=6kxX%ks`F)=v|E8Az2OTG1J7lEj6eix3 zPOO%6&4R15%dE<{HUjZ2;f$=d=aaa@OWix-+#f8Yfr8_gRWQuBW9Tv1&dIoyFX!Us^?Q1-J7 z=pWFbxcXzjfU4E~x24tC9GK;@EL9WI>1&av=SeQY%LcM~GFrLGC1}+IKGJmJ1YhLX z9>!(XNS3|^EPfaSE4&wn^|Cz;kSo}J~TnE|*=2)f*8m~zbzA54?Sk#P< z$6H$6Mm5!ip=Ffh;vGH-<{#DH!w8o+99(Yh;Ux+0Y%xo};mRzCHrd*8Q;2#EL*Z%G z+T3Jk&cVoS*7!L_2&kvuFJA6uT$>$gy6%FSW-wp=@spM*2%wTR1jr+XAZ6Y66jKM|o8dBho^MXHB)gfCB+j=%O6T zs>Ln(m9&MdFjc%;ZoEuV$>{w0U#9E}$cz9T0op8mO(8Q6v&sA>ow1c|Yd88CNjNQ>bPbVdVAz886TAL|rr9L;BFq8W5IGQX z&L@M0#iFz0V-`kwsriy0(S0fz{f>A&=&fzIJB011Q}a+0f)U~2SCb!$mUibNbgZni zaGJ8XYBQ5)`sDL>`{c`7M9+(xE3BXp-Z#sH?zaK8&`ih7?s~=tGf*}>P4zzeoK-Fk zi6--FRWCndW?^@Qt)k&B8K>U5OM0xL{!o+SRz$t zhUpvGZS1&Fhe{1nR39m@`{BeIPe6e8^E;BOXPEZBAZl02pWy^4^cAhvq(ru7S7XW> zf?5}9(Dzv`Fa}gcm_i357{sg=7~n~kQEC2k#Qe$fFo@c^PjAwxu2{vs>~NZXbaE^X z#toII;jv4;NE;-2gre01usCkDoK)ZR%-3b=K<+;a8PH@w=p|^Ygpe=MYyW;E)NJ0k zcb}>CP%uULEei5owp@f$)dGlovo2SXhrv{>XQ45Gv)HFhK^grC9SInI;83Wufi#co zg2)nsbORt%txc=bjJWW#_ti74smBsxSQtm!6g34f0|+Yck=Q)kiJsnyHOz2;I34`l z|B2*Gk;Uu%_!VFUppHy>q5_4h4(@90FUh9?5oW9#!&B9Pi!+o;Eb){U+jog|VSIrP z5|%>ySKNO)7P;u_SufU4Am$4E|CSSKnBj%DOv*;~dAZj|E>3S)i9LS77^QG(cw~gs z)>gNEAh3b$UiL~ug#*^g!bK?Pn(WrrbXo9 zTHSO}fT#ojx{A^QkL&MB)0Wsl&VdVm!>!RI(HV2>DPuznG`#Vvci}OAyQ+C0yeb8w zY>J9dKRr-2tMN6Q2|1z;fU;!T5;S{iBFG? zJnYnQZKgv;eb6`1uiRiHxGxy8FwTYf{C6}_|MWhxL??)Vpr)s+bXj0x#=^p7d_Mpr znlhSID|oi`#SV>)AC5fxtF(d90VkESoPx;jITjn@H>_L7O+bt4bGdX`UrdJ-i?;4; zdYYbjGyln7X(^b41btO>rot&M`p(cv3!_^v`IN87r$63c5{0`hc zFbO$2PsCy2$ker5s4J4PLp@U_B2)KD?k%e^iHl{OkZDz(rd4eG32AcjUE;fVDe(UP$ z+V_Q9D3_DQy?aK`3m!Z0Lfk4A=iQMbK|un+UmG(P-l0)VM5^)w;1(?`nab?IF}+%K z<(|8-QrWz&enAg(E431~TEp^kjt}m!pZRrr!T4k~aR)m~2x*yD+{|tXYwvV;ND1UI zKsAtu=UQQrs)F?v#$aEZTSEPp11}jApN!v#d5JRaxbV+>_A%jVjlhd#%rA7BnnDwu z3IYK_9kl*^sjy-$$e07Z9G!~C4aWd=W~h7v9twi!f;z7g6#@Hbb-XO4fO^P!997-9 zofs#cv>MdW(GmEs4Z_0DUNl2@33gGBQ!0?L7l4wwM{>_hU!6KUdW4YeX24WeW5{X5 zH2yf6i`p6kUxE4EW&E4j?U!w$^7$Mv@_A(C(p7e72BwgZ@phDyD&kB&RFjtO9Phe@ zE>6_Y7(1_FK`JXDZQ%KFLO?|?6b~hM?}Dws<ul;*FH+0t$g{bwI({oCDR-N|OP#iiNVJD_bxHPfY$RmM1iIy&%y z7_!cF1y1`l`Ne`fzJi`A@Tvr)cx_u>-j^x5?c15PhCv+rs+LPtHJVx18P%L$`D?K2 z;>ogBa3_Hgq5sXY8MG`Fk0bDix_0(|K5tv)bEC@x!vORL2B#MLd{<|bmbMUI+17DQ z5iFCn*5g&7Mh+v!Vw0DQd?!>}G;(F>V(S|lsdv^0p3AWD8os7k3RT3>)HHj~=JXxZ zhJ(eH1gb}`LH~jgb4j1;3}I&ObET*vZ(v$b?ipe7idsmhVM#mSso5B|vvaYE)4J}dPoKVPJ53>2p!jOwvYks~c zTJ^m}#I&fRt|>XhXc)U8Rb^@h%J&4Mr$|!rFv{$L&7WQvLpssS0-AuK+E}v8(8QOXKEuS zu8h#o?vQ`}rJr00IzK%E1AOWPm*bEXlQpwxi)*7v6VH0GDP>M`@(ceSSYFwIhYVU* z>RxOJ^wbifj3NP+{n84cnKRzRBqT90Q8-j%w1wSpaS|{_phAcilH{i6Ays}t_))cX zWY{?A<#W+@nIC?k{7ZxT_-yFv6TZoucWJ;fmjyVT!9d$nQ`|cksE0Z_GaH%a5`a87uh{6- zfI0&6Bm!-{)c!F+9D8ZAsOKIO0-#u5pIr+B*f^19QOv;O+1Khl81W3FfQ8p5hoF3M zaehP*0uxYiUuVbUBJ3aB?_t*k_u#Ye#B*De7jl&z2-o3Yh2Hh5z1Lc zV;wnQK%gZT>#3?fi?-qeNk7?#0C9doh50C8>6YId(su?#E*Lmvegby&1PkL^s@Kw_ z^Gr(i+uI0eZ$RnL!%qgW0K9pqsP@BkXgGnKr~}VMHl&Ow-{>I#ja_UWHVWIIo$kQ| zM9GBu*SAT8;HkP;CDGO%r+*O!12&_!@mADw#1%|TVu$k_M4Y936J`;2jv97|6Rfz> zj8xPRb5+|!C>s!8As&!9h>6_k{lbKV-vPG=-4~;CtqG2g-di2VQ>X+s2=WPxn}U7? z9QBhYZy|0Qx@#>o3k5!SmCgK+#k4=aCL$X0zs~eS)!m1K7Q9kFm(oD#`sC;L=Dsi0 zINfHjG49Ff08KG539s`sLvk94~ok&SnT;F zf-{YL5Lc(>7B#%~75T+Ib#C;v?qHG)uF-sCan<)n0Wh;@O}mhDf&Tz^!BxD&D{zyG zd26VlH~n2Ow!WCfOwBO(i-S?)c0vyiurW*PVcpA{w4Hr!u1>;V_Z=xr@s*r2FXZ5S zo6nxU5(5}05F(4-y{oJ=_S#!>wsn{U-l?$7ug2s zt(g!auC&0|CUma~Ekm7ijnY3fm^3g9o z%BcVFG2+~N3A%aUc3kB%^_lM!z{}&d**k~aSP~BZ4Wh1xY7#N8E2g|GBvGGB59DW< zvq7hKOj5%E+C;I2;rp9t=*>S1G3)PdJXqufZH`HFxP$rG^j$CsG|TGffO#<`O%DXv zZ{CmApeF`)LdF$6G1xjhkrxFaF}?ZYHQ4^vNXSDB&MH`?gWoj&;i;uWl>;GHd61pm zej8}-l$jDBVAlU8pYr~-2nr<}L_?(yTsQu<) znjOrsn~%AR@GV1EeYjPGuK}<50gRIKKFKlt*FIpeQVv6DkGVG;u;HGHGaW1*jKu{m zj2Nfjex&HnFc`;zDKQ_ucObVF-0!NhCRX*1x3yc|kh z-vS$29UJ1f=!&HUdaqDBKOsECK@B#~W?!f+8Z-4QAZ+BLgJSrUwL!J4oWhxz!pC@}nfi$)=Z%4l&8APv?vB9 zE+X38jDNGQuw~)t`C||=_a3k^&u$;@P(0Ks{gyNa;}Vh`L!j_Fp}Je-VuSveB&!9P zh@|SG*2DEQ+VsVp^O%0D(sbxG(#@lUI5W^j?7rXzWcbE%Nsn zrHQiKS3x>S`&p@HnVR6Wg^_w-N}x+k6Xw^}#>9MHN6HNcDTw{tvpH6J^CB?v;u4O* z<@x#fZ>zWsoG&%`T*p9N0uF-RBIoit>AyH5Z=|WL8ou{)tIL!AYQs;y{lmZ}-K0%| zDPvHKTcikBRn)WtvYraOUCAa&3(m0T^%f0nCjx zWYaT1D&L%Leg4x05;VOM@HkHn$K=Fv}+u73!^+o4nP@GkLxf2{X8s8{@r&%S(?Mju+&t50$wyhnuuj!77DQSc6c?7`(bo~JE<+hPLC)Mh$wdsSn0J}_!9na#2@bSKFTBx*Gf>V zD2*Dc&FN!R2aOx|L>xQ`k4S=W5#JF1%m^sEpa^e#`+A3v(5ThVdLwxia9*G>M6?-U z!rXhiZ!^(X$om9*7&v4!0g<@@Qmk83vvL00W`|QpLewZf* z<3{f8Q!lmW?Y>@;AV@Fx^L>d^z}_e}lP2LE*H@q!2SIA6qx};=Xmq?3uaU&| zg78p+K`BZE64UB3?V>c`vwZu71wk_hvs}^UgNN<=Pe47=p$*CLeR})|Ow30uWt}J} zC}?LFZ7)u62r0xNTbo?=g(6%TLEFFc3cSBxRY`3JhmxcmR-fCE*AKAy7-;s3cG|e^?brb^3pPTlo~i<-#T#UUlH7bfl({orj<@#UyzCk z*8ll`9i53k)cGIBF|J66MM78^lbn%r-EuVUiV{hSEk`+%RwBeilp_+k!j>aN&QR-` zG|7=1DMu+yg<{?OUi0$@@bEp}-}mSJe!ZTrqJz;3UNx$Jddod*jrNvy9?Px9OcTVd zaOZ=fxX-Qv4bx`;gWeM+QBjh6Zr)rkUy0K^NymM2v^J_xsT&>W#jr(5-mzf-k|c#X z|JhK-w)Q5vk|jO9J5dcp#oh816+@*FURf`d>1F=1t0}*E@d|wZkmHftelxA4+{e(a zi{u@~PL5H2D6vhO(Vow=q)qO+fvK16r3-aaG%MHUzbRk1vqyDm_(>ymjGbRzrvK?h zt&;_2Y*JTKKabo>!n0<)WFaOkEjuo*CZI*FXFt9t*<6k*ZX@h^g6bn5g^K((7mqxr zWL8!!qwVgh!}o`?#c3U@PeyOMRqLAuA53t{<>+e9*!`kW{~Cfm!l5V#(+MKr3NSOh z?T*Xv_!>rwr>8v1dGGqR!qsR#=6bQ2hV-Z5H}d0m5xyj|VWA;gU{P$9ZN%dT=^FyE z*2Q_{(d?i-gpePWg-e*9cPKU?;w`O|{a+!sD*@E6-fFuB3Vi(v*W>q=x%_f!`o3f7 zsE@m#PHh!9w^GG+5vVq&l^LtsNtL*bwFiO4*I|A%Y>k;X-b0ekjB3W=dDl~f`K{V!=$X@@`>_5=v9>70HelxqtOT+z3Sy1vvK5c})=$Log$3F(2Hv@BJ; zs70<_Ku|cX_eix^PuJwKVq~h_-tiY5wZavh?}?!y44oadUjwCCbnCg@__X9HZQ+#| z0Nv9%c$=7nflQ$H2fyi?ZLFv$+t1p|%E&pzf8_^Cy{x3fppc`jiayAprLiG7;7L_n zd&#rt+UnQDzRlX;qx+(v08LCAm`Q>cWn5PDQzDK3bcx00Q+^^k<4xn2(U+85u|zl^R&Sl1$+gi5Fi z5f_fiH=)p+HYd|waWr3P93J#}EK~$!vhjS3+f>4|iK?tDQ65l24jB##^brTh+{Bdh zjH*ToG%3h~M%FOBoPeEg^^8FOg_cmnWdh0D$ntwwLI%Ic(<&U?!aH7l*Yml3ZBcnP z3!FUd+Qpi``r0sp%J>GdKWm-;=M@#of{19X<5%CZJG_N2UjFnVS*FaSi)hBf$HWMz zQ(+Ly&Rk0ke9DHaDRrZ9wJFwcdV&sjn~;P)Ub9(xhp;J|Y7_y%4Pu2nlAE-y33r4V zzn&g^X7%t}FE!4N@^3KH5Qtf==HZCGb0@RU-LgFL%VJ;JPP0R`hdXmUi&a@&6mD$W z%efDHl%4#KOQp(J6WF->k`Z%wl6!UA$FvT2;C|1JHjXo7dQD`QJ;=}8704C`^b)UA zWb_L%i(=bn?w+`j$_k%&Rh2TaPn|DC{dLs|fr3;`%DuAV6ZMsl-2=w~NP6m{8UE;! zh31a?x;QBDz+JWrGr_UvzbhI-`nsXFjy1hWd>8$e%~iG~fxFxH?^cUmNzKi#oPm4e z$=T6p8TQ^jAra9pDe>CQ8G??s(2 z^ZZDoKa!&(WJnuuri~Vu9=l>U~#jr|Z7hhnb3D!Ns-XRPH4^Yg!I*-*Z6YtaCw2?Sp|SXpI&jK<>f1Y^sM??Z zKDyrp1{A^xFf=ioa!xAM>Pd#qg{-#`WiW^A{s=&s0NZ=Kj@Ua98C zsJVOiL}ER})v62}PuL!@zb(G+8a3>D(8l8GDxh5&zD^?zjy5FMD|H+Bkvk8I&Ba^1 z;Jik0u9{}47Zb_WP}k81Xw_ZM>QvaQqXOgiDUZ36kJTDu;i+Smq{ht5{JIn}V(uv- zd_Wf;va|uskKOUg&*jN3;qJs8>h?zt#5#n$lC0g&KJ_0098DzK!;@T`FZS{scquQK zmMnDZ=HWM|2TIc(r(Gk4+7o1nW*^0gAp{?}2c&*=#(m7e$z22{$m454-tXTPHrspv zQr^$0MzoO_ClJ4oYM7^oC<&z&?uPT9J%^vCo@CyTm8G?|b(QL}X|v3Eg2)Kni--6o z^mIVM-f8)A522P|A&(4J6Q(DN8`!kSa`m}V5G>Idbtb1_J#-oEPo8#iB#4g#zM)@WMmiRK1zE)H~3 zg(>4<*pkb_XJL5g6LfnfUWIFix+TvE?0<5Gjt;7kC=)>rhh)3Rj=719xFGb}Xbes8 z;0WehCMvWrS6CwQ$#kRy^#x;7qjy)cb62)tLOjVT-3o!i`t!bQ-F3ucnqY<|_=fT+ ze&^gXZhz8Il lviG^6+&yy>V_|A-Qf}lH^*`vsL302A delta 1539 zcmXw3e^gR;6o0T+^XV#mV#BSK2uw^I_@k+np+qY0nIfc_uJA{l)K!+Y!V>|Jnltk! zLYY5OQByO`m1UY{%`$7{%v>ExsnA-B(pOn*27B$C{qeo`p8Ml-@A-c2xpn7=EniT6 z7K8=Qv;N8&0DyV?5S|d%icimKE-tUGioaPzVGzhg$k%eOyh)7!0OmCFd4cOBn~W7J z^2^tdvRs@t6PN_MA*aP*h4%r9O&r8La1>h9ZpF2Ido+%iN=Od%fe8n`36`}n;OBdy zmNt;;71;yEl2*@jcF!8FbH@6<_q3L$<4|ioc;dm&P_}LQ1lktqK@;1cY$A#WHhO^J z5IR&+htbK^Z3%P&F4Aht1$CKy%friU}n@^fp2L$a9haS zMW@p5f1K5=_suV_&B9$GX7aLj-IB2jDsF%qUfvkpo{~jpC%KB1i4N$x-`c?NBzMaL zqnwrc(99QBRv}H_j0K10IdMv~-mJjEJ*_oIXdEgx3_Le5gRpC6^Q`>rMx1q>1-|XG zq42PIMc=|5l#IeEzA#!@EGhm^!x9y)mrGr&b}!lGZNf69c6#!W0#>#eM`MUbAOFcL zwpGW?uN~Cr>mJZ38xg(y6>)F?qf0XE_#p-Ght4eTi&AJTCKSE`M@tG>eY)llZnUyN zQpD;jzDJ|@BkZyLyl|Y-s7#u6H8l5P?&R7Y5ItO^-S!K(7^knB!ACUk?yiF8pUBQF z(Vk@m7Q}{B;-MC6KJpTlXjpxtDKu9P)HbjOlF~qx5KctMh!eIdlDx5HbD-tn;b70 zUcbs8*HceXV<2`t^vKYVK5aK>+X#{)D%hA;1fnoTLM|NpYVdx{k;Pc^EPcqYTLb8t zY&XfSr9*9XzQ>EIrelaq7NX(2nGh3<3&eWr+rC7o?JW6`p#T#P?{g!l9pc|$UX_S~ z-dsIv->m{tTWb!>r3*L}w^l<_qX`U)b*%IJGoZiW zb;r~}=i44ah|z0LRVlC)cQ1mzQD?x&+ZT1q?ULmih>IG@%9L#E&hJg2ZE9~zv~F&AsPT*@+ZRr868mrR0q^hERbzMN`a>&bn<21&hS(l6@w7uT0i6`cQoMz zqiP_LBziF-kS!Ti0aTLcrAiRmCBtql)dh?xr6Y z@{mat5KD?Z>)4CWd3gkm>rBY$fM4T?^(p{$SUr=>7`OieQEbVj%;F|hgMWT5#eeIH z^FKMKodzYb9-?1GGSVqn@1BJnOphUUpDG_1AM?NDK6Mt9@NZxlu`a%yprlD)&Mt)Y l)m+p6_tc6)^Y!tu5GOX=8uyu>B*D)*z+V%_JI#$#{tKZZvJLQuickGraph

QuickGraph

-

Documentation

-
@@ -47,11 +45,8 @@

QuickGraph

-

Example

-

This example demonstrates using a function defined in this sample library.

- 
1: 
 2: 
 3: 
@@ -64,31 +59,26 @@ 
Example
-

Some more info

-

Samples & documentation

- -

The library comes with comprehensible documentation. -It can include tutorials automatically generated from *.fsx files in the content folder. +

The library comes with comprehensible documentation. +It can include tutorials automatically generated from *.fsx files in the content folder. The API reference is automatically generated from Markdown comments in the library implementation.

-

  • Tutorial contains a further explanation of this sample library.

    • -

  • API Reference contains automatically generated documentation for all types, modules +

  • +

    API Reference contains automatically generated documentation for all types, modules and functions in the library. This includes additional brief samples on using most of the -functions.

    • +functions.

    +
-

Contributing and copyright

- -

The project is hosted on GitHub where you can report issues, fork -the project and submit pull requests. If you're adding a new public API, please also +

The project is hosted on GitHub where you can report issues, fork +the project and submit pull requests. If you're adding a new public API, please also consider adding samples that can be turned into a documentation. You might also want to read the library design notes to understand how it works.

- -

The library is available under Public Domain license, which allows modification and -redistribution for both commercial and non-commercial purposes. For more information see the +

The library is available under Public Domain license, which allows modification and +redistribution for both commercial and non-commercial purposes. For more information see the License file in the GitHub repository.

val printfn : format:Printf.TextWriterFormat<'T> -> 'T

Full name: Microsoft.FSharp.Core.ExtraTopLevelOperators.printfn
diff --git a/license.html b/license.html index 584a6338b..735d37fd3 100644 --- a/license.html +++ b/license.html @@ -33,54 +33,39 @@

QuickGraph

Microsoft Public License (Ms-PL)

-

This license governs use of the accompanying software. If you use the software, you accept this license. If you do not accept the license, do not use the software.

-
  1. Definitions
-

The terms "reproduce," "reproduction," "derivative works," and "distribution" have the same meaning here as under U.S. copyright law.

-

A "contribution" is the original software, or any additions or changes to the software.

-

A "contributor" is any person that distributes its contribution under this license.

-

"Licensed patents" are a contributor's patent claims that read directly on its contribution.

-
  1. Grant of Rights
-

(A) Copyright Grant- Subject to the terms of this license, including the license conditions and limitations in section 3, each contributor grants you a non-exclusive, worldwide, royalty-free copyright license to reproduce its contribution, prepare derivative works of its contribution, and distribute its contribution or any derivative works that you create.

-

(B) Patent Grant- Subject to the terms of this license, including the license conditions and limitations in section 3, each contributor grants you a non-exclusive, worldwide, royalty-free license under its licensed patents to make, -have made, use, sell, offer for sale, import, and/or otherwise dispose of its contribution in the software +have made, use, sell, offer for sale, import, and/or otherwise dispose of its contribution in the software or derivative works of the contribution in the software.

-
  1. Conditions and Limitations
-

(A) No Trademark License- This license does not grant you rights to use any contributors' name, logo, or trademarks.

-

(B) If you bring a patent claim against any contributor over patents that you claim are infringed by the software, your patent license from such contributor to the software ends automatically.

- -

(C) If you distribute any portion of the software, you must retain all copyright, patent, trademark, +

(C) If you distribute any portion of the software, you must retain all copyright, patent, trademark, and attribution notices that are present in the software.

-

(D) If you distribute any portion of the software in source code form, you may do so only under this license -by including a complete copy of this license with your distribution. +by including a complete copy of this license with your distribution. If you distribute any portion of the software in compiled or object code form, you may only do so under a license that complies with this license.

- -

(E) The software is licensed "as-is." You bear the risk of using it. -The contributors give no express warranties, guarantees or conditions. -You may have additional consumer rights under your local laws which this license cannot change. +

(E) The software is licensed "as-is." You bear the risk of using it. +The contributors give no express warranties, guarantees or conditions. +You may have additional consumer rights under your local laws which this license cannot change. To the extent permitted under your local laws, the contributors exclude the implied warranties of merchantability, fitness for a particular purpose and non-infringement.

diff --git a/reference/graphx-bautoresetevent.html b/reference/graphx-bautoresetevent.html new file mode 100644 index 000000000..6104d91b8 --- /dev/null +++ b/reference/graphx-bautoresetevent.html @@ -0,0 +1,186 @@ + + + + + BAutoResetEvent - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

BAutoResetEvent

+

+ Namespace: GraphX
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(initialState) + +
+ Signature: initialState:bool -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Dispose() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + Reset() + +
+ Signature: unit -> bool
+
+ 		+ +
+ + + Set() + +
+ Signature: unit -> bool
+
+ 		+ +
+ + + WaitOne() + +
+ Signature: unit -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + WaitOne(timeout) + +
+ Signature: timeout:TimeSpan -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + WaitOne(millisecondsTimeout) + +
+ Signature: millisecondsTimeout:int -> bool
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-bmanualresetevent.html b/reference/graphx-bmanualresetevent.html new file mode 100644 index 000000000..d6b06bb36 --- /dev/null +++ b/reference/graphx-bmanualresetevent.html @@ -0,0 +1,186 @@ + + + + + BManualResetEvent - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

BManualResetEvent

+

+ Namespace: GraphX
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(initialState) + +
+ Signature: initialState:bool -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Dispose() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + Reset() + +
+ Signature: unit -> bool
+
+ 		+ +
+ + + Set() + +
+ Signature: unit -> bool
+
+ 		+ +
+ + + WaitOne() + +
+ Signature: unit -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + WaitOne(timeout) + +
+ Signature: timeout:TimeSpan -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + WaitOne(millisecondsTimeout) + +
+ Signature: millisecondsTimeout:int -> bool
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-bwaithandle.html b/reference/graphx-bwaithandle.html new file mode 100644 index 000000000..0c6831c52 --- /dev/null +++ b/reference/graphx-bwaithandle.html @@ -0,0 +1,235 @@ + + + + + BWaitHandle - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

BWaitHandle

+

+ Namespace: GraphX
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + WaitOne() + +
+ Signature: unit -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + WaitOne(timeout) + +
+ Signature: timeout:TimeSpan -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + WaitOne(millisecondsTimeout) + +
+ Signature: millisecondsTimeout:int -> bool
+ Modifiers: abstract
+
+ 		+ +
+

Static members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Static memberDescription
+ + + WaitAll(waitHandles) + +
+ Signature: (waitHandles:BWaitHandle []) -> int
+
+ 		+ +
+ + + WaitAll(...) + +
+ Signature: (waitHandles:BWaitHandle [] * millisecondsTimeout:int) -> int
+
+ 		+ +
+ + + WaitAll(waitHandles, timeout) + +
+ Signature: (waitHandles:BWaitHandle [] * timeout:TimeSpan) -> int
+
+ 		+ +
+ + + WaitAny(waitHandles) + +
+ Signature: (waitHandles:BWaitHandle []) -> int
+
+ 		+ +
+ + + WaitAny(...) + +
+ Signature: (waitHandles:BWaitHandle [] * millisecondsTimeout:int) -> int
+
+ 		+ +
+ + + WaitAny(waitHandles, timeout) + +
+ Signature: (waitHandles:BWaitHandle [] * timeout:TimeSpan) -> int
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-measure-point.html b/reference/graphx-measure-point.html new file mode 100644 index 000000000..971736494 --- /dev/null +++ b/reference/graphx-measure-point.html @@ -0,0 +1,451 @@ + + + + + Point - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

Point

+

+ Namespace: GraphX.Measure
+

+
+

Custom PCL implementation of Point class

+ +
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(x, y) + +
+ Signature: (x:float * y:float) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Equals(o) + +
+ Signature: o:obj -> bool
+ Modifiers: abstract
+
+ 		+

Equals - compares this Point with the passed in object. In this equality +Double.NaN is equal to itself, unlike in numeric equality. +Note that double values can acquire error when operated upon, such that +an exact comparison between two values which +are logically equal may fail.

+ + +
+ + + Equals(value) + +
+ Signature: value:Point -> bool
+
+ 		+

Equals - compares this Point with the passed in object. In this equality +Double.NaN is equal to itself, unlike in numeric equality. +Note that double values can acquire error when operated upon, such that +an exact comparison between two values which +are logically equal may fail.

+ + +
+ + + GetHashCode() + +
+ Signature: unit -> int
+ Modifiers: abstract
+
+ 		+

Returns the HashCode for this Point

+ + +
+ + + Offset(offsetX, offsetY) + +
+ Signature: (offsetX:float * offsetY:float) -> unit
+
+ 		+ +
+ + + ToString() + +
+ Signature: unit -> string
+ Modifiers: abstract
+
+ 		+ +
+ + + X() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + Y() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Static members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Static memberDescription
+ + + Equals(point1, point2) + +
+ Signature: (point1:Point * point2:Point) -> bool
+
+ 		+

Compares two Point instances for object equality. In this equality +Double.NaN is equal to itself, unlike in numeric equality. +Note that double values can acquire error when operated upon, such that +an exact comparison between two values which +are logically equal may fail.

+ + +
+ + + op_Addition(point, vector) + +
+ Signature: (point:Point * vector:Vector) -> Point
+
+ 		+ +
+ + + op_Addition(value1, value2) + +
+ Signature: (value1:Point * value2:Point) -> Point
+
+ 		+ +
+ + + op_Division(value1, value2) + +
+ Signature: (value1:Point * value2:float) -> Point
+
+ 		+ +
+ + + op_Equality(point1, point2) + +
+ Signature: (point1:Point * point2:Point) -> bool
+
+ 		+

Compares two Point instances for exact equality. +Note that double values can acquire error when operated upon, such that +an exact comparison between two values which are logically equal may fail. +Furthermore, using this equality operator, Double.NaN is not equal to itself.

+ + +
+ + + op_Explicit(point) + +
+ Signature: point:Point -> Size
+
+ 		+ +
+ + + op_Explicit(point) + +
+ Signature: point:Point -> Vector
+
+ 		+ +
+ + + op_Implicit(size) + +
+ Signature: size:Size -> Point
+
+ 		+ +
+ + + op_Implicit(size) + +
+ Signature: size:Vector -> Point
+
+ 		+ +
+ + + op_Inequality(point1, point2) + +
+ Signature: (point1:Point * point2:Point) -> bool
+
+ 		+

Compares two Point instances for exact inequality. +Note that double values can acquire error when operated upon, such that +an exact comparison between two values which are logically equal may fail. +Furthermore, using this equality operator, Double.NaN is not equal to itself.

+ + +
+ + + op_Multiply(value1, value2) + +
+ Signature: (value1:float * value2:Point) -> Point
+
+ 		+ +
+ + + op_Multiply(value1, value2) + +
+ Signature: (value1:Point * value2:float) -> Point
+
+ 		+ +
+ + + op_Subtraction(point, vector) + +
+ Signature: (point:Point * vector:Vector) -> Point
+
+ 		+ +
+ + + op_Subtraction(value1, value2) + +
+ Signature: (value1:Point * value2:Point) -> Vector
+
+ 		+ + ARITHMETIC + +
+ + + Zero + +
+ Signature: Point
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-measure-rect.html b/reference/graphx-measure-rect.html new file mode 100644 index 000000000..c6d2195d7 --- /dev/null +++ b/reference/graphx-measure-rect.html @@ -0,0 +1,740 @@ + + + + + Rect - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

Rect

+

+ Namespace: GraphX.Measure
+

+
+

Custom PCL implementation of Rect class

+ +
+

Constructors

+ + + + + + + + + + + + + + + + + + + + + + + + + + +
ConstructorDescription
+ + + new(location, size) + +
+ Signature: (location:Point * size:Size) -> unit
+
+ 		+ +
+ + + new(x, y, width, height) + +
+ Signature: (x:float * y:float * width:float * height:float) -> unit
+
+ 		+ +
+ + + new(point1, point2) + +
+ Signature: (point1:Point * point2:Point) -> unit
+
+ 		+ +
+ + + new(point, vector) + +
+ Signature: (point:Point * vector:Vector) -> unit
+
+ 		+ +
+ + + new(size) + +
+ Signature: size:Size -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Bottom + +
+ Signature: float
+
+ 		+ +
+ + + BottomLeft + +
+ Signature: Point
+
+ 		+ +
+ + + BottomRight + +
+ Signature: Point
+
+ 		+ +
+ + + Contains(point) + +
+ Signature: point:Point -> bool
+
+ 		+ +
+ + + Contains(x, y) + +
+ Signature: (x:float * y:float) -> bool
+
+ 		+ +
+ + + Contains(rect) + +
+ Signature: rect:Rect -> bool
+
+ 		+ +
+ + + Equals(o) + +
+ Signature: o:obj -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + Equals(value) + +
+ Signature: value:Rect -> bool
+
+ 		+ +
+ + + GetHashCode() + +
+ Signature: unit -> int
+ Modifiers: abstract
+
+ 		+ +
+ + + Height() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + Inflate(size) + +
+ Signature: size:Size -> unit
+
+ 		+ +
+ + + Inflate(width, height) + +
+ Signature: (width:float * height:float) -> unit
+
+ 		+ +
+ + + Intersect(rect) + +
+ Signature: rect:Rect -> unit
+
+ 		+ +
+ + + IntersectsWith(rect) + +
+ Signature: rect:Rect -> bool
+
+ 		+ +
+ + + IsEmpty + +
+ Signature: bool
+
+ 		+ +
+ + + Left + +
+ Signature: float
+
+ 		+ +
+ + + Location() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + Offset(offsetVector) + +
+ Signature: offsetVector:Vector -> unit
+
+ 		+ +
+ + + Offset(offsetX, offsetY) + +
+ Signature: (offsetX:float * offsetY:float) -> unit
+
+ 		+ +
+ + + Right + +
+ Signature: float
+
+ 		+ +
+ + + Size() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + Top + +
+ Signature: float
+
+ 		+ +
+ + + TopLeft + +
+ Signature: Point
+
+ 		+ +
+ + + TopRight + +
+ Signature: Point
+
+ 		+ +
+ + + Union(rect) + +
+ Signature: rect:Rect -> unit
+
+ 		+ +
+ + + Union(point) + +
+ Signature: point:Point -> unit
+
+ 		+ +
+ + + Width() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + X() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + Y() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Static members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Static memberDescription
+ + + Empty + +
+ Signature: Rect
+
+ 		+ +
+ + + Equals(rect1, rect2) + +
+ Signature: (rect1:Rect * rect2:Rect) -> bool
+
+ 		+ +
+ + + Inflate(rect, size) + +
+ Signature: (rect:Rect * size:Size) -> Rect
+
+ 		+ +
+ + + Inflate(rect, width, height) + +
+ Signature: (rect:Rect * width:float * height:float) -> Rect
+
+ 		+ +
+ + + InflateNew(rect, width, height) + +
+ Signature: (rect:Rect * width:float * height:float) -> Rect
+
+ 		+ +
+ + + Intersect(rect1, rect2) + +
+ Signature: (rect1:Rect * rect2:Rect) -> Rect
+
+ 		+ +
+ + + Offset(rect, offsetVector) + +
+ Signature: (rect:Rect * offsetVector:Vector) -> Rect
+
+ 		+ +
+ + + Offset(rect, offsetX, offsetY) + +
+ Signature: (rect:Rect * offsetX:float * offsetY:float) -> Rect
+
+ 		+ +
+ + + op_Equality(value1, value2) + +
+ Signature: (value1:Rect * value2:Rect) -> bool
+
+ 		+ +
+ + + op_Inequality(rect1, rect2) + +
+ Signature: (rect1:Rect * rect2:Rect) -> bool
+
+ 		+ +
+ + + Union(rect1, rect2) + +
+ Signature: (rect1:Rect * rect2:Rect) -> Rect
+
+ 		+ +
+ + + Union(rect, point) + +
+ Signature: (rect:Rect * point:Point) -> Rect
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-measure-size.html b/reference/graphx-measure-size.html new file mode 100644 index 000000000..0533f8c77 --- /dev/null +++ b/reference/graphx-measure-size.html @@ -0,0 +1,276 @@ + + + + + Size - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

Size

+

+ Namespace: GraphX.Measure
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(width, height) + +
+ Signature: (width:float * height:float) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Equals(o) + +
+ Signature: o:obj -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + Equals(value) + +
+ Signature: value:Size -> bool
+
+ 		+ +
+ + + GetHashCode() + +
+ Signature: unit -> int
+ Modifiers: abstract
+
+ 		+ +
+ + + Height() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + IsEmpty + +
+ Signature: bool
+
+ 		+ +
+ + + Width() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Static members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Static memberDescription
+ + + Empty + +
+ Signature: Size
+
+ 		+ +
+ + + Equals(size1, size2) + +
+ Signature: (size1:Size * size2:Size) -> bool
+
+ 		+ +
+ + + op_Equality(size1, size2) + +
+ Signature: (size1:Size * size2:Size) -> bool
+
+ 		+ +
+ + + op_Explicit(size) + +
+ Signature: size:Size -> Vector
+
+ 		+ +
+ + + op_Explicit(size) + +
+ Signature: size:Size -> Point
+
+ 		+ +
+ + + op_Inequality(size1, size2) + +
+ Signature: (size1:Size * size2:Size) -> bool
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-measure-thickness.html b/reference/graphx-measure-thickness.html new file mode 100644 index 000000000..f28cfe4c6 --- /dev/null +++ b/reference/graphx-measure-thickness.html @@ -0,0 +1,178 @@ + + + + + Thickness - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

Thickness

+

+ Namespace: GraphX.Measure
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(left, top, right, bottom) + +
+ Signature: (left:float * top:float * right:float * bottom:float) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Equals(o) + +
+ Signature: o:obj -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + Equals(value) + +
+ Signature: value:Thickness -> bool
+
+ 		+ +
+ + + GetHashCode() + +
+ Signature: unit -> int
+ Modifiers: abstract
+
+ 		+ +
+

Static members

+ + + + + + + + + + + + + + +
Static memberDescription
+ + + op_Equality(t1, t2) + +
+ Signature: (t1:Thickness * t2:Thickness) -> bool
+
+ 		+ +
+ + + op_Inequality(t1, t2) + +
+ Signature: (t1:Thickness * t2:Thickness) -> bool
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-measure-vector.html b/reference/graphx-measure-vector.html new file mode 100644 index 000000000..bb2d16491 --- /dev/null +++ b/reference/graphx-measure-vector.html @@ -0,0 +1,473 @@ + + + + + Vector - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

Vector

+

+ Namespace: GraphX.Measure
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(x, y) + +
+ Signature: (x:float * y:float) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Equals(o) + +
+ Signature: o:obj -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + Equals(value) + +
+ Signature: value:Vector -> bool
+
+ 		+ +
+ + + GetHashCode() + +
+ Signature: unit -> int
+ Modifiers: abstract
+
+ 		+ +
+ + + Length + +
+ Signature: float
+
+ 		+ +
+ + + LengthSquared + +
+ Signature: float
+
+ 		+ +
+ + + Negate() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + Normalize() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + ToString() + +
+ Signature: unit -> string
+ Modifiers: abstract
+
+ 		+ +
+ + + X() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + Y() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Static members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Static memberDescription
+ + + AngleBetween(vector1, vector2) + +
+ Signature: (vector1:Vector * vector2:Vector) -> float
+
+ 		+ +
+ + + CrossProduct(vector1, vector2) + +
+ Signature: (vector1:Vector * vector2:Vector) -> float
+
+ 		+ +
+ + + Equals(vector1, vector2) + +
+ Signature: (vector1:Vector * vector2:Vector) -> bool
+
+ 		+ +
+ + + op_Addition(value1, value2) + +
+ Signature: (value1:Vector * value2:Vector) -> Vector
+
+ 		+ +
+ + + op_Addition(value1, value2) + +
+ Signature: (value1:Vector * value2:Point) -> Point
+
+ 		+ +
+ + + op_Division(vector, scalar) + +
+ Signature: (vector:Vector * scalar:float) -> Vector
+
+ 		+ +
+ + + op_Equality(vector1, vector2) + +
+ Signature: (vector1:Vector * vector2:Vector) -> bool
+
+ 		+ +
+ + + op_Inequality(vector1, vector2) + +
+ Signature: (vector1:Vector * vector2:Vector) -> bool
+
+ 		+ +
+ + + op_Multiply(vector1, vector2) + +
+ Signature: (vector1:Vector * vector2:Vector) -> float
+
+ 		+ +
+ + + op_Multiply(scalar, vector) + +
+ Signature: (scalar:float * vector:Vector) -> Vector
+
+ 		+ +
+ + + op_Multiply(vector, scalar) + +
+ Signature: (vector:Vector * scalar:float) -> Vector
+
+ 		+ +
+ + + op_Multiply(value1, value2) + +
+ Signature: (value1:int * value2:Vector) -> Vector
+
+ 		+ +
+ + + op_Subtraction(value1, value2) + +
+ Signature: (value1:Vector * value2:Vector) -> Vector
+
+ 		+ +
+ + + op_Subtraction(value1, value2) + +
+ Signature: (value1:Vector * value2:Point) -> Vector
+
+ 		+ +
+ + + op_UnaryNegation(value1) + +
+ Signature: value1:Vector -> Vector
+
+ 		+ +
+ + + Zero + +
+ Signature: Vector
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-commonextensions.html b/reference/graphx-pcl-common-commonextensions.html new file mode 100644 index 000000000..0c126defb --- /dev/null +++ b/reference/graphx-pcl-common-commonextensions.html @@ -0,0 +1,90 @@ + + + + + CommonExtensions - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

CommonExtensions

+

+ Namespace: GraphX.PCL.Common
+

+
+
+

Static members

+ + + + + + + + + + +
Static memberDescription
+ + + AddOrUpdate(dictionary, key, value) + +
+ Signature: (dictionary:IDictionary<'TKey,'TValue> * key:'TKey * value:'TValue) -> unit
+ Type parameters: 'TKey, 'TValue
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-enums-edgeroutingalgorithmtypeenum.html b/reference/graphx-pcl-common-enums-edgeroutingalgorithmtypeenum.html new file mode 100644 index 000000000..4120c63d6 --- /dev/null +++ b/reference/graphx-pcl-common-enums-edgeroutingalgorithmtypeenum.html @@ -0,0 +1,68 @@ + + + + + EdgeRoutingAlgorithmTypeEnum - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

EdgeRoutingAlgorithmTypeEnum

+

+ Namespace: GraphX.PCL.Common.Enums
+

+
+
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-enums-edgestype.html b/reference/graphx-pcl-common-enums-edgestype.html new file mode 100644 index 000000000..2c1783797 --- /dev/null +++ b/reference/graphx-pcl-common-enums-edgestype.html @@ -0,0 +1,68 @@ + + + + + EdgesType - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

EdgesType

+

+ Namespace: GraphX.PCL.Common.Enums
+

+
+
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-enums-eventtype.html b/reference/graphx-pcl-common-enums-eventtype.html new file mode 100644 index 000000000..f2ae90c19 --- /dev/null +++ b/reference/graphx-pcl-common-enums-eventtype.html @@ -0,0 +1,68 @@ + + + + + EventType - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

EventType

+

+ Namespace: GraphX.PCL.Common.Enums
+

+
+
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-enums-graphcontroltype.html b/reference/graphx-pcl-common-enums-graphcontroltype.html new file mode 100644 index 000000000..319389947 --- /dev/null +++ b/reference/graphx-pcl-common-enums-graphcontroltype.html @@ -0,0 +1,68 @@ + + + + + GraphControlType - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

GraphControlType

+

+ Namespace: GraphX.PCL.Common.Enums
+

+
+
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-enums-imagetype.html b/reference/graphx-pcl-common-enums-imagetype.html new file mode 100644 index 000000000..2ce28187f --- /dev/null +++ b/reference/graphx-pcl-common-enums-imagetype.html @@ -0,0 +1,68 @@ + + + + + ImageType - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

ImageType

+

+ Namespace: GraphX.PCL.Common.Enums
+

+
+
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-enums-layoutalgorithmtypeenum.html b/reference/graphx-pcl-common-enums-layoutalgorithmtypeenum.html new file mode 100644 index 000000000..16fb5028e --- /dev/null +++ b/reference/graphx-pcl-common-enums-layoutalgorithmtypeenum.html @@ -0,0 +1,70 @@ + + + + + LayoutAlgorithmTypeEnum - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

LayoutAlgorithmTypeEnum

+

+ Namespace: GraphX.PCL.Common.Enums
+

+
+

Built-in layout algorithm types

+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-enums-overlapremovalalgorithmtypeenum.html b/reference/graphx-pcl-common-enums-overlapremovalalgorithmtypeenum.html new file mode 100644 index 000000000..f849ff16d --- /dev/null +++ b/reference/graphx-pcl-common-enums-overlapremovalalgorithmtypeenum.html @@ -0,0 +1,68 @@ + + + + + OverlapRemovalAlgorithmTypeEnum - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

OverlapRemovalAlgorithmTypeEnum

+

+ Namespace: GraphX.PCL.Common.Enums
+

+
+
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-enums-processingoptionenum.html b/reference/graphx-pcl-common-enums-processingoptionenum.html new file mode 100644 index 000000000..a08f31a9e --- /dev/null +++ b/reference/graphx-pcl-common-enums-processingoptionenum.html @@ -0,0 +1,70 @@ + + + + + ProcessingOptionEnum - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

ProcessingOptionEnum

+

+ Namespace: GraphX.PCL.Common.Enums
+

+
+

Specifies how object will be treated in calculations and visualization

+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-enums-vertexshape.html b/reference/graphx-pcl-common-enums-vertexshape.html new file mode 100644 index 000000000..f6f8810e8 --- /dev/null +++ b/reference/graphx-pcl-common-enums-vertexshape.html @@ -0,0 +1,68 @@ + + + + + VertexShape - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

VertexShape

+

+ Namespace: GraphX.PCL.Common.Enums
+

+
+
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-exceptions-gx_consistencyexception.html b/reference/graphx-pcl-common-exceptions-gx_consistencyexception.html new file mode 100644 index 000000000..8f0ff8edc --- /dev/null +++ b/reference/graphx-pcl-common-exceptions-gx_consistencyexception.html @@ -0,0 +1,90 @@ + + + + + GX_ConsistencyException - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

GX_ConsistencyException

+

+ Namespace: GraphX.PCL.Common.Exceptions
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(text) + +
+ Signature: text:string -> unit
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-exceptions-gx_generalexception.html b/reference/graphx-pcl-common-exceptions-gx_generalexception.html new file mode 100644 index 000000000..182b9bab1 --- /dev/null +++ b/reference/graphx-pcl-common-exceptions-gx_generalexception.html @@ -0,0 +1,90 @@ + + + + + GX_GeneralException - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

GX_GeneralException

+

+ Namespace: GraphX.PCL.Common.Exceptions
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(text) + +
+ Signature: text:string -> unit
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-exceptions-gx_invaliddataexception.html b/reference/graphx-pcl-common-exceptions-gx_invaliddataexception.html new file mode 100644 index 000000000..c6171c1d9 --- /dev/null +++ b/reference/graphx-pcl-common-exceptions-gx_invaliddataexception.html @@ -0,0 +1,90 @@ + + + + + GX_InvalidDataException - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

GX_InvalidDataException

+

+ Namespace: GraphX.PCL.Common.Exceptions
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(text) + +
+ Signature: text:string -> unit
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-exceptions-gx_objectnotfoundexception.html b/reference/graphx-pcl-common-exceptions-gx_objectnotfoundexception.html new file mode 100644 index 000000000..953c0b77a --- /dev/null +++ b/reference/graphx-pcl-common-exceptions-gx_objectnotfoundexception.html @@ -0,0 +1,90 @@ + + + + + GX_ObjectNotFoundException - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

GX_ObjectNotFoundException

+

+ Namespace: GraphX.PCL.Common.Exceptions
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(text) + +
+ Signature: text:string -> unit
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-exceptions-gx_obsoleteexception.html b/reference/graphx-pcl-common-exceptions-gx_obsoleteexception.html new file mode 100644 index 000000000..05b3a77ab --- /dev/null +++ b/reference/graphx-pcl-common-exceptions-gx_obsoleteexception.html @@ -0,0 +1,90 @@ + + + + + GX_ObsoleteException - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

GX_ObsoleteException

+

+ Namespace: GraphX.PCL.Common.Exceptions
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(text) + +
+ Signature: text:string -> unit
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-exceptions-gx_serializationexception.html b/reference/graphx-pcl-common-exceptions-gx_serializationexception.html new file mode 100644 index 000000000..dacf8faa4 --- /dev/null +++ b/reference/graphx-pcl-common-exceptions-gx_serializationexception.html @@ -0,0 +1,90 @@ + + + + + GX_SerializationException - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

GX_SerializationException

+

+ Namespace: GraphX.PCL.Common.Exceptions
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(text) + +
+ Signature: text:string -> unit
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-interfaces-ialgorithmfactory-3.html b/reference/graphx-pcl-common-interfaces-ialgorithmfactory-3.html new file mode 100644 index 000000000..e5615f3ce --- /dev/null +++ b/reference/graphx-pcl-common-interfaces-ialgorithmfactory-3.html @@ -0,0 +1,276 @@ + + + + + IAlgorithmFactory<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

IAlgorithmFactory<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Common.Interfaces
+

+
+
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + CreateEdgeRoutingAlgorithm(...) + +
+ Signature: (newAlgorithmType:EdgeRoutingAlgorithmTypeEnum * graphArea:Rect * iGraph:'TGraph * positions:IDictionary<'TVertex,Point> * rectangles:IDictionary<'TVertex,Rect> * parameters:IEdgeRoutingParameters) -> IExternalEdgeRouting<'TVertex,'TEdge>
+ Modifiers: abstract
+
+ 		+ +
+ + + CreateEdgeRoutingParameters(...) + +
+ Signature: algorithmType:EdgeRoutingAlgorithmTypeEnum -> IEdgeRoutingParameters
+ Modifiers: abstract
+
+ 		+ +
+ + + CreateFSAA(rectangles, horGap, vertGap) + +
+ Signature: (rectangles:IDictionary<'T,Rect> * horGap:float32 * vertGap:float32) -> IOverlapRemovalAlgorithm<'T>
+ Modifiers: abstract
+
+ 		+

Create and initialize FSAA overlap removal algorithm instance

+ + +
+ + + CreateFSAA(horGap, vertGap) + +
+ Signature: (horGap:float32 * vertGap:float32) -> IOverlapRemovalAlgorithm<'T,IOverlapRemovalParameters>
+ Modifiers: abstract
+
+ 		+

Create uninitialized FSAA overlap removal algorithm instance

+ + +
+ + + CreateLayoutAlgorithm(...) + +
+ Signature: (newAlgorithmType:LayoutAlgorithmTypeEnum * iGraph:'TGraph * positions:IDictionary<'TVertex,Point> * sizes:IDictionary<'TVertex,Size> * parameters:ILayoutParameters) -> ILayoutAlgorithm<'TVertex,'TEdge,'TGraph>
+ Modifiers: abstract
+
+ 		+

Generate and initialize layout algorithm

+ + +
+ + + CreateLayoutParameters(algorithmType) + +
+ Signature: algorithmType:LayoutAlgorithmTypeEnum -> ILayoutParameters
+ Modifiers: abstract
+
+ 		+

Creates parameters data for layout algorithm

+ + +
+ + + CreateOverlapRemovalAlgorithm(...) + +
+ Signature: (newAlgorithmType:OverlapRemovalAlgorithmTypeEnum * rectangles:IDictionary<'TVertex,Rect> * parameters:IOverlapRemovalParameters) -> IOverlapRemovalAlgorithm<'TVertex>
+ Modifiers: abstract
+
+ 		+

Create and initializes overlap removal algorithm

+ + +
+ + + CreateOverlapRemovalAlgorithm(...) + +
+ Signature: newAlgorithmType:OverlapRemovalAlgorithmTypeEnum -> IOverlapRemovalAlgorithm<'TVertex>
+ Modifiers: abstract
+
+ 		+

Create uninitialized overlap removal algorithm

+ + +
+ + + CreateOverlapRemovalParameters(...) + +
+ Signature: algorithmType:OverlapRemovalAlgorithmTypeEnum -> IOverlapRemovalParameters
+ Modifiers: abstract
+
+ 		+

Create overlap removal algorithm parameters

+ + +
+ + + NeedEdgeRouting(algorithmType) + +
+ Signature: algorithmType:LayoutAlgorithmTypeEnum -> bool
+ Modifiers: abstract
+
+ 		+

Returns True if specified layout algorithm ever needs edge routing pass

+ + +
+ + + NeedOverlapRemoval(algorithmType) + +
+ Signature: algorithmType:LayoutAlgorithmTypeEnum -> bool
+ Modifiers: abstract
+
+ 		+

Returns True if specified layout algorithm ever needs overlap removal pass

+ + +
+ + + NeedSizes(algorithmType) + +
+ Signature: algorithmType:LayoutAlgorithmTypeEnum -> bool
+ Modifiers: abstract
+
+ 		+

Returns True if specified layout algorithm needs vertex size data for its calculations

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-interfaces-ialgorithmparameters.html b/reference/graphx-pcl-common-interfaces-ialgorithmparameters.html new file mode 100644 index 000000000..5ee3e5640 --- /dev/null +++ b/reference/graphx-pcl-common-interfaces-ialgorithmparameters.html @@ -0,0 +1,68 @@ + + + + + IAlgorithmParameters - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

IAlgorithmParameters

+

+ Namespace: GraphX.PCL.Common.Interfaces
+

+
+
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-interfaces-ialgorithmstorage-2.html b/reference/graphx-pcl-common-interfaces-ialgorithmstorage-2.html new file mode 100644 index 000000000..88a828f0e --- /dev/null +++ b/reference/graphx-pcl-common-interfaces-ialgorithmstorage-2.html @@ -0,0 +1,189 @@ + + + + + IAlgorithmStorage<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

IAlgorithmStorage<'TVertex, 'TEdge>

+

+ Namespace: GraphX.PCL.Common.Interfaces
+

+
+

Base level interface for algorithm storage implementation

+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + AddSingleEdge(edge, routingPoints) + +
+ Signature: (edge:'TEdge * routingPoints:Point []) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + AddSingleVertex(vertex, position, size) + +
+ Signature: (vertex:'TVertex * position:Point * size:Rect) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + EdgeRouting + +
+ Signature: IExternalEdgeRouting<'TVertex,'TEdge>
+ Modifiers: abstract
+
+ 		+

Gets edge routing algorithm

+ + +
+ + + Layout + +
+ Signature: IExternalLayout<'TVertex,'TEdge>
+ Modifiers: abstract
+
+ 		+

Gets layout algorithm

+ + +
+ + + OverlapRemoval + +
+ Signature: IExternalOverlapRemoval<'TVertex>
+ Modifiers: abstract
+
+ 		+

Gets overlap removal algorithm

+ + +
+ + + RemoveSingleEdge(edge) + +
+ Signature: edge:'TEdge -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + RemoveSingleVertex(vertex) + +
+ Signature: vertex:'TVertex -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-interfaces-icloneable.html b/reference/graphx-pcl-common-interfaces-icloneable.html new file mode 100644 index 000000000..8f201efe7 --- /dev/null +++ b/reference/graphx-pcl-common-interfaces-icloneable.html @@ -0,0 +1,95 @@ + + + + + ICloneable - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

ICloneable

+

+ Namespace: GraphX.PCL.Common.Interfaces
+

+
+

Cloning interface

+ +
+

Instance members

+ + + + + + + + + + +
Instance memberDescription
+ + + Clone() + +
+ Signature: unit -> obj
+ Modifiers: abstract
+
+ 		+

Creates a new object that is a copy of the current instance.

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-interfaces-iedgeroutingparameters.html b/reference/graphx-pcl-common-interfaces-iedgeroutingparameters.html new file mode 100644 index 000000000..aa9cac7aa --- /dev/null +++ b/reference/graphx-pcl-common-interfaces-iedgeroutingparameters.html @@ -0,0 +1,70 @@ + + + + + IEdgeRoutingParameters - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

IEdgeRoutingParameters

+

+ Namespace: GraphX.PCL.Common.Interfaces
+

+
+

Base class for edge routing algorithm parameters

+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-interfaces-iexternaledgerouting-2.html b/reference/graphx-pcl-common-interfaces-iexternaledgerouting-2.html new file mode 100644 index 000000000..6c3da0ced --- /dev/null +++ b/reference/graphx-pcl-common-interfaces-iexternaledgerouting-2.html @@ -0,0 +1,197 @@ + + + + + IExternalEdgeRouting<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

IExternalEdgeRouting<'TVertex, 'TEdge>

+

+ Namespace: GraphX.PCL.Common.Interfaces
+

+
+

Base interface for an edge routing algorithm

+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + AreaRectangle() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets GraphArea allowed rendering size

+ + +
+ + + Compute(cancellationToken) + +
+ Signature: cancellationToken:CancellationToken -> unit
+ Modifiers: abstract
+
+ 		+

Run algorithm calculation

+ + +
+ + + ComputeSingle(edge) + +
+ Signature: edge:'TEdge -> Point []
+ Modifiers: abstract
+
+ 		+

Compute edge routing for single edge

+ + +
+ + + EdgeRoutes + +
+ Signature: IDictionary<'TEdge,Point []>
+ Modifiers: abstract
+
+ 		+

Gets resulting edge routes collection

+ + +
+ + + UpdateVertexData(vertex, position, size) + +
+ Signature: (vertex:'TVertex * position:Point * size:Rect) -> unit
+ Modifiers: abstract
+
+ 		+

Update data stored in algorithm for specified vertex

+ + +
+ + + VertexPositions() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets visual vertices positions (autofilled before Compute() call)

+ + +
+ + + VertexSizes() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets visual vertices sizes (autofilled before Compute() call)

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-interfaces-iexternallayout-2.html b/reference/graphx-pcl-common-interfaces-iexternallayout-2.html new file mode 100644 index 000000000..970203cc8 --- /dev/null +++ b/reference/graphx-pcl-common-interfaces-iexternallayout-2.html @@ -0,0 +1,180 @@ + + + + + IExternalLayout<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

IExternalLayout<'TVertex, 'TEdge>

+

+ Namespace: GraphX.PCL.Common.Interfaces
+

+
+

Base interface for layout algorithm

+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Compute(cancellationToken) + +
+ Signature: cancellationToken:CancellationToken -> unit
+ Modifiers: abstract
+
+ 		+

Run algorithm calculation

+ + +
+ + + NeedVertexSizes + +
+ Signature: bool
+ Modifiers: abstract
+
+ 		+

Gets if algorithm needs to know visual VertexControl size (if True VertexSizes property will be filled before calculation)

+ + +
+ + + ResetGraph(vertices, edges) + +
+ Signature: (vertices:IEnumerable<'TVertex> * edges:IEnumerable<'TEdge>) -> unit
+ Modifiers: abstract
+
+ 		+

Updates graph data of the existing algorithm from plain vertices and edges. Needed for easier inter-algorithm calls for complex algorithm.

+ + +
+ + + SupportsObjectFreeze + +
+ Signature: bool
+ Modifiers: abstract
+
+ 		+

Gets if algorithm supports vertex/edge freeze feature

+ + +
+ + + VertexPositions + +
+ Signature: IDictionary<'TVertex,Point>
+ Modifiers: abstract
+
+ 		+

Gets vertices positions: initial and resulting (after Compute)

+ + +
+ + + VertexSizes() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets visual vertices sizes (autofilled if NeedVertexSizes property is set to true)

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-interfaces-iexternaloverlapremoval-1.html b/reference/graphx-pcl-common-interfaces-iexternaloverlapremoval-1.html new file mode 100644 index 000000000..7be3f205d --- /dev/null +++ b/reference/graphx-pcl-common-interfaces-iexternaloverlapremoval-1.html @@ -0,0 +1,113 @@ + + + + + IExternalOverlapRemoval<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

IExternalOverlapRemoval<'TVertex>

+

+ Namespace: GraphX.PCL.Common.Interfaces
+

+
+

Base interface for overlap removal algorithm

+ +
+

Instance members

+ + + + + + + + + + + + + + +
Instance memberDescription
+ + + Compute(cancellationToken) + +
+ Signature: cancellationToken:CancellationToken -> unit
+ Modifiers: abstract
+
+ 		+

Implements algorithm computation

+ + +
+ + + Rectangles() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets vertices rectangle sizes +This property is filled automaticaly before calculation in GenerateGraph()/RelayoutGraph() methods

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-interfaces-igraphxcommonedge.html b/reference/graphx-pcl-common-interfaces-igraphxcommonedge.html new file mode 100644 index 000000000..0c16a761a --- /dev/null +++ b/reference/graphx-pcl-common-interfaces-igraphxcommonedge.html @@ -0,0 +1,146 @@ + + + + + IGraphXCommonEdge - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

IGraphXCommonEdge

+

+ Namespace: GraphX.PCL.Common.Interfaces
+

+
+

Core edge data interface

+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + IsSelfLoop + +
+ Signature: bool
+ Modifiers: abstract
+
+ 		+

Gets if edge is self-looped

+ + +
+ + + ReversePath() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Reverse the calculated routing path points.

+ + +
+ + + SourceConnectionPointId + +
+ Signature: Nullable<int>
+ Modifiers: abstract
+
+ 		+

Optional parameter to bind edge to static vertex connection point

+ + +
+ + + TargetConnectionPointId + +
+ Signature: Nullable<int>
+ Modifiers: abstract
+
+ 		+

Optional parameter to bind edge to static vertex connection point

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-interfaces-igraphxedge-1.html b/reference/graphx-pcl-common-interfaces-igraphxedge-1.html new file mode 100644 index 000000000..34f8664e3 --- /dev/null +++ b/reference/graphx-pcl-common-interfaces-igraphxedge-1.html @@ -0,0 +1,112 @@ + + + + + IGraphXEdge<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

IGraphXEdge<'TVertex>

+

+ Namespace: GraphX.PCL.Common.Interfaces
+

+
+

Core GraphX edge data interface

+ +
+

Instance members

+ + + + + + + + + + + + + + +
Instance memberDescription
+ + + Source() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets source vertex

+ + +
+ + + Target() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets target vertex

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-interfaces-igraphxvertex.html b/reference/graphx-pcl-common-interfaces-igraphxvertex.html new file mode 100644 index 000000000..65922c09b --- /dev/null +++ b/reference/graphx-pcl-common-interfaces-igraphxvertex.html @@ -0,0 +1,93 @@ + + + + + IGraphXVertex - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

IGraphXVertex

+

+ Namespace: GraphX.PCL.Common.Interfaces
+

+
+
+

Instance members

+ + + + + + + + + + +
Instance memberDescription
+ + + GroupId() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets optional group identificator

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-interfaces-igxlogiccore-3.html b/reference/graphx-pcl-common-interfaces-igxlogiccore-3.html new file mode 100644 index 000000000..da2790097 --- /dev/null +++ b/reference/graphx-pcl-common-interfaces-igxlogiccore-3.html @@ -0,0 +1,560 @@ + + + + + IGXLogicCore<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

IGXLogicCore<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Common.Interfaces
+

+
+
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + AlgorithmFactory + +
+ Signature: IAlgorithmFactory<'TVertex,'TEdge,'TGraph>
+ Modifiers: abstract
+
+ 		+

Get an algorithm factory that provides different algorithm creation methods

+ + +
+ + + AlgorithmStorage() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets algorithm storage that contain all currently defined algorithm objects by type (default or external) +Actual storage data is vital for correct edge routing operation after graph was regenerated.

+ + +
+ + + AreOverlapNeeded() + +
+ Signature: unit -> bool
+ Modifiers: abstract
+
+ 		+

Gets if current algorithms set actualy needs overlap removal algorithm

+ + +
+ + + AreVertexSizesNeeded() + +
+ Signature: unit -> bool
+ Modifiers: abstract
+
+ 		+

Gets if current algorithm set needs vertices sizes

+ + +
+ + + AsyncAlgorithmCompute() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets if async algorithm computations are enabled

+ + +
+ + + Clear(clearStorages) + +
+ Signature: clearStorages:bool -> unit
+ Modifiers: abstract
+
+ 		+

Clear LogicCore data

+ + +
+ + + Compute(cancellationToken) + +
+ Signature: cancellationToken:CancellationToken -> IDictionary<'TVertex,Point>
+ Modifiers: abstract
+
+ 		+

Computes graph using parameters set in LogicCore properties

+ + +
+ + + ComputeEdgeRoutesByVertex(...) + +
+ Signature: (dataVertex:'TVertex * vertexPosition:Nullable<Point> * vertexSize:Nullable<Size>) -> unit
+ Modifiers: abstract
+
+ 		+

Computes all edge routes related to specified vertex

+ + +
+ + + DefaultEdgeRoutingAlgorithm() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets default edge routing algorithm that will be used on graph generation/relayouting

+ + +
+ + + DefaultEdgeRoutingAlgorithmParams() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets default edge routing algorithm parameters that will be used on graph generation/relayouting

+ + +
+ + + DefaultLayoutAlgorithm() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets default layout algorithm that will be used on graph generation/relayouting

+ + +
+ + + DefaultLayoutAlgorithmParams() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets default layout algorithm parameters that will be used on graph generation/relayouting

+ + +
+ + + DefaultOverlapRemovalAlgorithm() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets default overlap removal algorithm that will be used on graph generation/relayouting

+ + +
+ + + DefaultOverlapRemovalAlgorithmParams() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets default overlap removal algorithm parameters that will be used on graph generation/relayouting

+ + +
+ + + EdgeCurvingEnabled() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets if edge curving technique enabled for smoother edges. Default value is True.

+ + +
+ + + EdgeCurvingTolerance() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets roughly the length of each line segment in the polyline +approximation to a continuous curve in WPF units. The smaller the +number the smoother the curve, but slower the performance. Default is 8.

+ + +
+ + + EnableParallelEdges() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets if parallel edges are enabled. All edges between the same nodes will be separated by ParallelEdgeDistance value. +This is post-process procedure and it may be performance-costly.

+ + +
+ + + ExternalEdgeRoutingAlgorithm() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets external edge routing algorithm that will be used instead of the default one. +Negates DefaultEdgeRoutingAlgorithm property value if set.

+ + +
+ + + ExternalLayoutAlgorithm() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets external layout algorithm that will be used instead of the default one. +Negates DefaultLayoutAlgorithm property value if set.

+ + +
+ + + ExternalOverlapRemovalAlgorithm() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets external overlap removal algorithm that will be used instead of the default one. +Negates DefaultOverlapRemovalAlgorithm property value if set.

+ + +
+ + + GenerateAlgorithmStorage(...) + +
+ Signature: (vertexSizes:Dictionary<'TVertex,Size> * vertexPositions:IDictionary<'TVertex,Point>) -> bool
+ Modifiers: abstract
+
+ 		+

Creates algorithm objects based on default/external LogicCore properies and stores them to be able to access them later by, for ex. edge recalculation logic. +Done automaticaly when graph is regenerated/relayouted.

+ + +
+ + + GenerateEdgeRoutingAlgorithm(...) + +
+ Signature: (desiredSize:Size * vertexPositions:IDictionary<'TVertex,Point> * rectangles:IDictionary<'TVertex,Rect>) -> IExternalEdgeRouting<'TVertex,'TEdge>
+ Modifiers: abstract
+
+ 		+

Generate layout algorithm according to LogicCore layout algorithm default/external properties set

+ + +
+ + + GenerateLayoutAlgorithm(...) + +
+ Signature: (vertexSizes:Dictionary<'TVertex,Size> * vertexPositions:IDictionary<'TVertex,Point>) -> IExternalLayout<'TVertex,'TEdge>
+ Modifiers: abstract
+
+ 		+

Generate layout algorithm according to LogicCore layout algorithm default/external properties set

+ + +
+ + + GenerateOverlapRemovalAlgorithm(...) + +
+ Signature: rectangles:Dictionary<'TVertex,Rect> -> IExternalOverlapRemoval<'TVertex>
+ Modifiers: abstract
+
+ 		+

Generate overlap removal algorithm according to LogicCore overlap removal algorithm default/external properties set

+ + +
+ + + Graph() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets main graph object

+ + +
+ + + IsCustomLayout + +
+ Signature: bool
+ Modifiers: abstract
+
+ 		+

Gets is LayoutAlgorithmTypeEnum.Custom (NOT external) layout selected and used. Custom layout used to manualy generate graph.

+ + +
+ + + IsEdgeRoutingEnabled + +
+ Signature: bool
+ Modifiers: abstract
+
+ 		+

Gets if edge routing will be performed on Compute() method execution

+ + +
+ + + ParallelEdgeDistance() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets distance by which edges are parallelized if EnableParallelEdges is true. Default value is 5.

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-interfaces-iidentifiablegraphdataobject.html b/reference/graphx-pcl-common-interfaces-iidentifiablegraphdataobject.html new file mode 100644 index 000000000..ccb1f2699 --- /dev/null +++ b/reference/graphx-pcl-common-interfaces-iidentifiablegraphdataobject.html @@ -0,0 +1,110 @@ + + + + + IIdentifiableGraphDataObject - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

IIdentifiableGraphDataObject

+

+ Namespace: GraphX.PCL.Common.Interfaces
+

+
+
+

Instance members

+ + + + + + + + + + + + + + +
Instance memberDescription
+ + + ID() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Unique object identifier

+ + +
+ + + SkipProcessing() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Skip object in algorithm calc and visual control generation

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-interfaces-ilayoutalgorithm-3.html b/reference/graphx-pcl-common-interfaces-ilayoutalgorithm-3.html new file mode 100644 index 000000000..4748add9a --- /dev/null +++ b/reference/graphx-pcl-common-interfaces-ilayoutalgorithm-3.html @@ -0,0 +1,93 @@ + + + + + ILayoutAlgorithm<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

ILayoutAlgorithm<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Common.Interfaces
+

+
+
+

Instance members

+ + + + + + + + + + +
Instance memberDescription
+ + + VisitedGraph + +
+ Signature: 'TGraph
+ Modifiers: abstract
+
+ 		+

Internal graph storage for layout algorithm

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-interfaces-ilayoutedgerouting-1.html b/reference/graphx-pcl-common-interfaces-ilayoutedgerouting-1.html new file mode 100644 index 000000000..7528a684c --- /dev/null +++ b/reference/graphx-pcl-common-interfaces-ilayoutedgerouting-1.html @@ -0,0 +1,96 @@ + + + + + ILayoutEdgeRouting<'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

ILayoutEdgeRouting<'TEdge>

+

+ Namespace: GraphX.PCL.Common.Interfaces
+

+
+

If added to layout algorithm specifies that it uses it's own edge routing and thus +should ignore edge routing algorithm

+ +
+

Instance members

+ + + + + + + + + + +
Instance memberDescription
+ + + EdgeRoutes + +
+ Signature: IDictionary<'TEdge,Point []>
+ Modifiers: abstract
+
+ 		+

Get resulting edge routes collection

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-interfaces-ilayoutparameters.html b/reference/graphx-pcl-common-interfaces-ilayoutparameters.html new file mode 100644 index 000000000..cee8c85e8 --- /dev/null +++ b/reference/graphx-pcl-common-interfaces-ilayoutparameters.html @@ -0,0 +1,94 @@ + + + + + ILayoutParameters - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

ILayoutParameters

+

+ Namespace: GraphX.PCL.Common.Interfaces
+

+
+
+

Instance members

+ + + + + + + + + + +
Instance memberDescription
+ + + Seed() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Seed to be used to initialize any random number generators in order to construct +more deterministic output.

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-interfaces-ioverlapremovalalgorithm-1.html b/reference/graphx-pcl-common-interfaces-ioverlapremovalalgorithm-1.html new file mode 100644 index 000000000..4c9782676 --- /dev/null +++ b/reference/graphx-pcl-common-interfaces-ioverlapremovalalgorithm-1.html @@ -0,0 +1,108 @@ + + + + + IOverlapRemovalAlgorithm<'TObject> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

IOverlapRemovalAlgorithm<'TObject>

+

+ Namespace: GraphX.PCL.Common.Interfaces
+

+
+
+

Instance members

+ + + + + + + + + + + + + + +
Instance memberDescription
+ + + GetParameters() + +
+ Signature: unit -> IOverlapRemovalParameters
+ Modifiers: abstract
+
+ 		+ +
+ + + Initialize(rectangles) + +
+ Signature: rectangles:IDictionary<'TObject,Rect> -> unit
+ Modifiers: abstract
+
+ 		+

Initialize algorithm initial data

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-interfaces-ioverlapremovalalgorithm-2.html b/reference/graphx-pcl-common-interfaces-ioverlapremovalalgorithm-2.html new file mode 100644 index 000000000..52393c30e --- /dev/null +++ b/reference/graphx-pcl-common-interfaces-ioverlapremovalalgorithm-2.html @@ -0,0 +1,110 @@ + + + + + IOverlapRemovalAlgorithm<'TObject, 'TParam> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

IOverlapRemovalAlgorithm<'TObject, 'TParam>

+

+ Namespace: GraphX.PCL.Common.Interfaces
+

+
+
+

Instance members

+ + + + + + + + + + + + + + +
Instance memberDescription
+ + + Initialize(rectangles, parameters) + +
+ Signature: (rectangles:IDictionary<'TObject,Rect> * parameters:'TParam) -> unit
+ Modifiers: abstract
+
+ 		+

Initialize algorithm initial data

+ + +
+ + + Parameters + +
+ Signature: 'TParam
+ Modifiers: abstract
+
+ 		+

Algorithm parameters

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-interfaces-ioverlapremovalparameters.html b/reference/graphx-pcl-common-interfaces-ioverlapremovalparameters.html new file mode 100644 index 000000000..999d57ee1 --- /dev/null +++ b/reference/graphx-pcl-common-interfaces-ioverlapremovalparameters.html @@ -0,0 +1,106 @@ + + + + + IOverlapRemovalParameters - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

IOverlapRemovalParameters

+

+ Namespace: GraphX.PCL.Common.Interfaces
+

+
+
+

Instance members

+ + + + + + + + + + + + + + +
Instance memberDescription
+ + + HorizontalGap() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + VerticalGap() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-interfaces-iroutinginfo.html b/reference/graphx-pcl-common-interfaces-iroutinginfo.html new file mode 100644 index 000000000..1315fad7a --- /dev/null +++ b/reference/graphx-pcl-common-interfaces-iroutinginfo.html @@ -0,0 +1,93 @@ + + + + + IRoutingInfo - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

IRoutingInfo

+

+ Namespace: GraphX.PCL.Common.Interfaces
+

+
+
+

Instance members

+ + + + + + + + + + +
Instance memberDescription
+ + + RoutingPoints() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Routing points collection used to make Path visual object

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-interfaces-iweightededge-1.html b/reference/graphx-pcl-common-interfaces-iweightededge-1.html new file mode 100644 index 000000000..196d0d0d8 --- /dev/null +++ b/reference/graphx-pcl-common-interfaces-iweightededge-1.html @@ -0,0 +1,93 @@ + + + + + IWeightedEdge<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

IWeightedEdge<'TVertex>

+

+ Namespace: GraphX.PCL.Common.Interfaces
+

+
+
+

Instance members

+ + + + + + + + + + +
Instance memberDescription
+ + + Weight() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Edge weight that can be used by some weight-related layout algorithms

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-models-edgebase-1.html b/reference/graphx-pcl-common-models-edgebase-1.html new file mode 100644 index 000000000..6a0a12a88 --- /dev/null +++ b/reference/graphx-pcl-common-models-edgebase-1.html @@ -0,0 +1,270 @@ + + + + + EdgeBase<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

EdgeBase<'TVertex>

+

+ Namespace: GraphX.PCL.Common.Models
+

+
+

Base class for graph edge

+ +
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(source, target, weight) + +
+ Signature: (source:'TVertex * target:'TVertex * weight:float) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + ID() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Unique edge ID

+ + +
+ + + IsSelfLoop + +
+ Signature: bool
+ Modifiers: abstract
+
+ 		+

Returns true if Source vertex equals Target vertex

+ + +
+ + + ReversePath() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Reverse the calculated routing path points.

+ + +
+ + + RoutingPoints() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Routing points collection used to make Path visual object

+ + +
+ + + SkipProcessing() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Skip edge in algo calc and visualization

+ + +
+ + + Source() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Source vertex

+ + +
+ + + SourceConnectionPointId() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Optional parameter to bind edge to static vertex connection point

+ + +
+ + + Target() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Target vertex

+ + +
+ + + TargetConnectionPointId() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Optional parameter to bind edge to static vertex connection point

+ + +
+ + + Weight() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Edge weight that can be used by some weight-related layout algorithms

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-models-edgeroutingvisualdata.html b/reference/graphx-pcl-common-models-edgeroutingvisualdata.html new file mode 100644 index 000000000..49b584aa8 --- /dev/null +++ b/reference/graphx-pcl-common-models-edgeroutingvisualdata.html @@ -0,0 +1,196 @@ + + + + + EdgeRoutingVisualData - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

EdgeRoutingVisualData

+

+ Namespace: GraphX.PCL.Common.Models
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + HaveTemplate() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + IsEdgeSelfLooped() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + IsEdgeVisible() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + SourcePosition() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + SourceSize() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + TargetPosition() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + TargetSize() + +
+ Signature: unit -> unit
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-models-graphserializationdata.html b/reference/graphx-pcl-common-models-graphserializationdata.html new file mode 100644 index 000000000..894a5449c --- /dev/null +++ b/reference/graphx-pcl-common-models-graphserializationdata.html @@ -0,0 +1,126 @@ + + + + + GraphSerializationData - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

GraphSerializationData

+

+ Namespace: GraphX.PCL.Common.Models
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + +
Instance memberDescription
+ + + Data() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + Position() + +
+ Signature: unit -> unit
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-models-graphstate-3.html b/reference/graphx-pcl-common-models-graphstate-3.html new file mode 100644 index 000000000..5b2921afa --- /dev/null +++ b/reference/graphx-pcl-common-models-graphstate-3.html @@ -0,0 +1,209 @@ + + + + + GraphState<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

GraphState<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Common.Models
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(...) + +
+ Signature: (id:string * graph:'TGraph * storage:IAlgorithmStorage<'TVertex,'TEdge> * vPos:Dictionary<'TVertex,Point> * vEdges:List<'TEdge> * description:string) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + AlgorithmStorage() + +
+ Signature: unit -> unit
+
+ 		+

Saved algorithm storage

+ + +
+ + + Description() + +
+ Signature: unit -> unit
+
+ 		+

State description

+ + +
+ + + Dispose() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + Graph() + +
+ Signature: unit -> unit
+
+ 		+

Saved data graph

+ + +
+ + + ID() + +
+ Signature: unit -> unit
+
+ 		+

Graph state unique identificator

+ + +
+ + + VertexPositions() + +
+ Signature: unit -> unit
+
+ 		+

Saved vertex positions

+ + +
+ + + VisibleEdges() + +
+ Signature: unit -> unit
+
+ 		+

Saved visible edges with route points

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-models-semaphore-semaphore.html b/reference/graphx-pcl-common-models-semaphore-semaphore.html new file mode 100644 index 000000000..993f39d22 --- /dev/null +++ b/reference/graphx-pcl-common-models-semaphore-semaphore.html @@ -0,0 +1,186 @@ + + + + + Semaphore - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

Semaphore

+

+ Namespace: GraphX.PCL.Common.Models.Semaphore
+

+
+
+

Constructors

+ + + + + + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + new(initialCount, maxCount) + +
+ Signature: (initialCount:int * maxCount:int) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Dispose() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + Release() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + WaitOne() + +
+ Signature: unit -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + WaitOne(timeout) + +
+ Signature: timeout:TimeSpan -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + WaitOne(millisecondsTimeout) + +
+ Signature: millisecondsTimeout:int -> bool
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-models-vertexbase.html b/reference/graphx-pcl-common-models-vertexbase.html new file mode 100644 index 000000000..598d6b9ce --- /dev/null +++ b/reference/graphx-pcl-common-models-vertexbase.html @@ -0,0 +1,164 @@ + + + + + VertexBase - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

VertexBase

+

+ Namespace: GraphX.PCL.Common.Models
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Equals(other) + +
+ Signature: other:IGraphXVertex -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + GroupId() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets optional group identificator

+ + +
+ + + ID() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Unique vertex ID

+ + +
+ + + SkipProcessing() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Skip vertex in algo calc and visualization

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-common-models-weightededge-1.html b/reference/graphx-pcl-common-models-weightededge-1.html new file mode 100644 index 000000000..38a349088 --- /dev/null +++ b/reference/graphx-pcl-common-models-weightededge-1.html @@ -0,0 +1,177 @@ + + + + + WeightedEdge<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

WeightedEdge<'TVertex>

+

+ Namespace: GraphX.PCL.Common.Models
+

+
+
+

Constructors

+ + + + + + + + + + + + + + +
ConstructorDescription
+ + + new(source, target) + +
+ Signature: (source:'TVertex * target:'TVertex) -> unit
+
+ 		+ +
+ + + new(source, target, weight) + +
+ Signature: (source:'TVertex * target:'TVertex * weight:float) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Source() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Source vertex data

+ + +
+ + + Target() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Target vertex data

+ + +
+ + + UpdateVertices(source, target) + +
+ Signature: (source:'TVertex * target:'TVertex) -> unit
+
+ 		+

Update vertices (probably needed for serialization TODO)

+ + +
+ + + Weight() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-algorithmbase.html b/reference/graphx-pcl-logic-algorithms-algorithmbase.html new file mode 100644 index 000000000..641851cbf --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-algorithmbase.html @@ -0,0 +1,113 @@ + + + + + AlgorithmBase - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

AlgorithmBase

+

+ Namespace: GraphX.PCL.Logic.Algorithms
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + +
Instance memberDescription
+ + + Compute(cancellationToken) + +
+ Signature: cancellationToken:CancellationToken -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-edgerouting-bundleedgerouting-3.html b/reference/graphx-pcl-logic-algorithms-edgerouting-bundleedgerouting-3.html new file mode 100644 index 000000000..c32f445ec --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-edgerouting-bundleedgerouting-3.html @@ -0,0 +1,327 @@ + + + + + BundleEdgeRouting<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

BundleEdgeRouting<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.EdgeRouting
+

+
+

EdgeBundler class is intended to be used for bundling and straightening of the edges of the graph. +The goal is to get the layout that is less clutered and more suitable for analiyzing.

+

This class is based on the paper "Force-Directed Edge Bundling for Graph Visualization" +by Danny Holten and Jarke J. van Wijk. +http://www.win.tue.nl/~dholten/papers/forcebundles_eurovis.pdf

+

It was implemented and modified by Luka Potkonjak. +Adapted for GraphX by PantheR.

+ +
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(...) + +
+ Signature: (graphArea:Rect * graph:'TGraph * vertexPositions:IDictionary<'TVertex,Point> * vertexSizes:IDictionary<'TVertex,Rect> * parameters:IEdgeRoutingParameters) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + BundleAllEdges(graph, cancellationToken) + +
+ Signature: (graph:'TGraph * cancellationToken:CancellationToken) -> unit
+
+ 		+

Bundles edges of the graph.

+ + +
+ + + BundleEdges(graph, edges) + +
+ Signature: (graph:'TGraph * edges:IEnumerable<'TEdge>) -> unit
+
+ 		+

Bundles specified edges. Shapes of all the other edges remain the same, +so this method is faster than the one for bundling all edges, but also produces less optimal layout.

+ + +
+ + + Compute(cancellationToken) + +
+ Signature: cancellationToken:CancellationToken -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + ComputeSingle(edge) + +
+ Signature: edge:'TEdge -> Point []
+ Modifiers: abstract
+
+ 		+ +
+ + + Iterations() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets the number of iterations for moving the control points. +Default value is 50.

+ + +
+ + + RepulseOpposite() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets the value indicating whether opposite edges should attracts or repulse each other. +Default value is false.

+ + +
+ + + RepulsionCoefficient() + +
+ Signature: unit -> unit
+
+ 		+

If repulseOpposite is true, this determines how much will opposite edges repulse eachother. +From -1 to 0. +Default is -0.1

+ + +
+ + + SpringConstant() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets the value for the spring constant. +Edges are more easely bent if the value is lower. +Default value is 10.

+ + +
+ + + StraightenEdges(graph, s) + +
+ Signature: (graph:'TGraph * s:float32) -> unit
+
+ 		+

Moves the control points of all the edges of the graph closer to their original position on the straight edge

+ + +
+ + + Straightening() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets the amount of straightening that will be applied after every bundling. +This can produce better-looking graphs. +Default value is 0.15, range is from 0 to 1.

+ + +
+ + + SubdivisionPoints() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets the number of subdivision points each edge should have. +Default value is 15.

+ + +
+ + + Threshold() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets the treshold for the edge compatibility. +Every pair of edges has the compatibility coefficient assigned to it. +Range of the coefficient is from 0 to 1. +Edges that have coefficient lower than the treshold between them are not considered for interaction. +Default value is 0.2.

+ + +
+ + + UseThreading() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets the the value that determines if multiple threads should be used for the calculations. +Default value is true.

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-edgerouting-bundleedgeroutingparameters.html b/reference/graphx-pcl-logic-algorithms-edgerouting-bundleedgeroutingparameters.html new file mode 100644 index 000000000..643367581 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-edgerouting-bundleedgeroutingparameters.html @@ -0,0 +1,240 @@ + + + + + BundleEdgeRoutingParameters - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

BundleEdgeRoutingParameters

+

+ Namespace: GraphX.PCL.Logic.Algorithms.EdgeRouting
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Iterations() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets the number of iterations for moving the control points. +Default value is 250.

+ + +
+ + + RepulseOpposite() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets the value indicating whether opposite edges should attracts or repulse each other. +Default value is false.

+ + +
+ + + RepulsionCoefficient() + +
+ Signature: unit -> unit
+
+ 		+

If repulseOpposite is true, this determines how much will opposite edges repulse eachother. +From -1 to 0. +Default is -0.1

+ + +
+ + + SpringConstant() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets the value for the spring constant. +Edges are more easely bent if the value is lower. +Default value is 10.

+ + +
+ + + Straightening() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets the amount of straightening that will be applied after every bundling. +This can produce better-looking graphs. +Default value is 0.15, range is from 0 to 1.

+ + +
+ + + SubdivisionPoints() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets the number of subdivision points each edge should have. +Default value is 15.

+ + +
+ + + Threshold() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets the treshold for the edge compatibility. +Every pair of edges has the compatibility coefficient assigned to it. +Range of the coefficient is from 0 to 1. +Edges that have coefficient lower than the treshold between them are not considered for interaction. +Default value is 0.2.

+ + +
+ + + UseThreading() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets the the value that determines if multiple threads should be used for the calculations. +Default value is true.

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-edgerouting-edgeroutingalgorithmbase-3.html b/reference/graphx-pcl-logic-algorithms-edgerouting-edgeroutingalgorithmbase-3.html new file mode 100644 index 000000000..8339ced4f --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-edgerouting-edgeroutingalgorithmbase-3.html @@ -0,0 +1,224 @@ + + + + + EdgeRoutingAlgorithmBase<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

EdgeRoutingAlgorithmBase<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.EdgeRouting
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(...) + +
+ Signature: (graph:'TGraph * vertexPositions:IDictionary<'TVertex,Point> * vertexSizes:IDictionary<'TVertex,Rect> * parameters:IEdgeRoutingParameters) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + AreaRectangle() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

GraphArea rendering size

+ + +
+ + + Compute(cancellationToken) + +
+ Signature: cancellationToken:CancellationToken -> unit
+ Modifiers: abstract
+
+ 		+

Run algorithm calculation

+ + +
+ + + ComputeSingle(edge) + +
+ Signature: edge:'TEdge -> Point []
+ Modifiers: abstract
+
+ 		+ +
+ + + Dispose() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + EdgeRoutes() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets the resulting routing points of the edges.

+ + +
+ + + UpdateVertexData(vertex, position, size) + +
+ Signature: (vertex:'TVertex * position:Point * size:Rect) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + VertexPositions() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + VertexSizes() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-edgerouting-edgeroutingparameters.html b/reference/graphx-pcl-logic-algorithms-edgerouting-edgeroutingparameters.html new file mode 100644 index 000000000..37548b4d2 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-edgerouting-edgeroutingparameters.html @@ -0,0 +1,126 @@ + + + + + EdgeRoutingParameters - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

EdgeRoutingParameters

+

+ Namespace: GraphX.PCL.Logic.Algorithms.EdgeRouting
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + +
Instance memberDescription
+ + + Clone() + +
+ Signature: unit -> obj
+
+ 		+ +
+ + + PropertyChanged + +
+ Signature: IEvent<PropertyChangedEventHandler,PropertyChangedEventArgs>
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-edgerouting-heuristicformula.html b/reference/graphx-pcl-logic-algorithms-edgerouting-heuristicformula.html new file mode 100644 index 000000000..a98f14a86 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-edgerouting-heuristicformula.html @@ -0,0 +1,68 @@ + + + + + HeuristicFormula - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

HeuristicFormula

+

+ Namespace: GraphX.PCL.Logic.Algorithms.EdgeRouting
+

+
+
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-edgerouting-ipriorityqueue-1.html b/reference/graphx-pcl-logic-algorithms-edgerouting-ipriorityqueue-1.html new file mode 100644 index 000000000..e46750b63 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-edgerouting-ipriorityqueue-1.html @@ -0,0 +1,136 @@ + + + + + IPriorityQueue<'T> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

IPriorityQueue<'T>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.EdgeRouting
+

+
+
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Peek() + +
+ Signature: unit -> 'T
+ Modifiers: abstract
+
+ 		+ +
+ + + Pop() + +
+ Signature: unit -> 'T
+ Modifiers: abstract
+
+ 		+ +
+ + + Push(item) + +
+ Signature: item:'T -> int
+ Modifiers: abstract
+
+ 		+ +
+ + + Update(i) + +
+ Signature: i:int -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-edgerouting-matrixitem.html b/reference/graphx-pcl-logic-algorithms-edgerouting-matrixitem.html new file mode 100644 index 000000000..853fd31cd --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-edgerouting-matrixitem.html @@ -0,0 +1,112 @@ + + + + + MatrixItem - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

MatrixItem

+

+ Namespace: GraphX.PCL.Logic.Algorithms.EdgeRouting
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(pt, inter, placeX, placeY) + +
+ Signature: (pt:Point * inter:bool * placeX:int * placeY:int) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + +
Instance memberDescription
+ + + Weight + +
+ Signature: int
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-edgerouting-pathfindalgorithm.html b/reference/graphx-pcl-logic-algorithms-edgerouting-pathfindalgorithm.html new file mode 100644 index 000000000..e36d100db --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-edgerouting-pathfindalgorithm.html @@ -0,0 +1,68 @@ + + + + + PathFindAlgorithm - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

PathFindAlgorithm

+

+ Namespace: GraphX.PCL.Logic.Algorithms.EdgeRouting
+

+
+
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-edgerouting-pathfinder.html b/reference/graphx-pcl-logic-algorithms-edgerouting-pathfinder.html new file mode 100644 index 000000000..9def710ed --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-edgerouting-pathfinder.html @@ -0,0 +1,308 @@ + + + + + PathFinder - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

PathFinder

+

+ Namespace: GraphX.PCL.Logic.Algorithms.EdgeRouting
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(grid) + +
+ Signature: (grid:MatrixItem [,]) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + CompletedTime() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + DebugFoundPath() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + DebugProgress() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + Diagonals() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + FindPath(start, end) + +
+ Signature: (start:Point * end:Point) -> List<PathFinderNode>
+ Modifiers: abstract
+
+ 		+ +
+ + + FindPathStop() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + Formula() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + HeavyDiagonals() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + HeuristicEstimate() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + PathFinderDebug + +
+ Signature: PathFinderDebugHandler
+ Modifiers: abstract
+
+ 		+ +
+ + + PunishChangeDirection() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + SearchLimit() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + Stopped + +
+ Signature: bool
+ Modifiers: abstract
+
+ 		+ +
+ + + TieBreaker() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-edgerouting-pathfinderdebughandler.html b/reference/graphx-pcl-logic-algorithms-edgerouting-pathfinderdebughandler.html new file mode 100644 index 000000000..598838d3f --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-edgerouting-pathfinderdebughandler.html @@ -0,0 +1,143 @@ + + + + + PathFinderDebugHandler - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

PathFinderDebugHandler

+

+ Namespace: GraphX.PCL.Logic.Algorithms.EdgeRouting
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(object, method) + +
+ Signature: (object:obj * method:nativeint) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + BeginInvoke(...) + +
+ Signature: (fromX:int * fromY:int * x:int * y:int * type:PathFinderNodeType * totalCost:int * cost:int * callback:AsyncCallback * object:obj) -> IAsyncResult
+ Modifiers: abstract
+
+ 		+ +
+ + + EndInvoke(result) + +
+ Signature: result:IAsyncResult -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + Invoke(...) + +
+ Signature: (fromX:int * fromY:int * x:int * y:int * type:PathFinderNodeType * totalCost:int * cost:int) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-edgerouting-pathfinderedgerouting-3.html b/reference/graphx-pcl-logic-algorithms-edgerouting-pathfinderedgerouting-3.html new file mode 100644 index 000000000..24320131e --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-edgerouting-pathfinderedgerouting-3.html @@ -0,0 +1,143 @@ + + + + + PathFinderEdgeRouting<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

PathFinderEdgeRouting<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.EdgeRouting
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(...) + +
+ Signature: (graph:'TGraph * vertexPositions:IDictionary<'TVertex,Point> * vertexSizes:IDictionary<'TVertex,Rect> * parameters:IEdgeRoutingParameters) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Compute(cancellationToken) + +
+ Signature: cancellationToken:CancellationToken -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + ComputeSingle(edge) + +
+ Signature: edge:'TEdge -> Point []
+ Modifiers: abstract
+
+ 		+ +
+ + + UpdateVertexData(vertex, position, size) + +
+ Signature: (vertex:'TVertex * position:Point * size:Rect) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-edgerouting-pathfinderedgeroutingparameters.html b/reference/graphx-pcl-logic-algorithms-edgerouting-pathfinderedgeroutingparameters.html new file mode 100644 index 000000000..b78bd847d --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-edgerouting-pathfinderedgeroutingparameters.html @@ -0,0 +1,258 @@ + + + + + PathFinderEdgeRoutingParameters - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

PathFinderEdgeRoutingParameters

+

+ Namespace: GraphX.PCL.Logic.Algorithms.EdgeRouting
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Heuristic() + +
+ Signature: unit -> unit
+
+ 		+

Heuristic level

+ + +
+ + + HorizontalGridSize() + +
+ Signature: unit -> unit
+
+ 		+

Controls horizontal grid density. Smaller the value more points will be available.

+ + +
+ + + PathFinderAlgorithm() + +
+ Signature: unit -> unit
+
+ 		+

Algorithm used to search for the path.

+ + +
+ + + PunishChangeDirection() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets if direction change is unpreferable

+ + +
+ + + SearchTriesLimit() + +
+ Signature: unit -> unit
+
+ 		+

Maximum number of tries

+ + +
+ + + SideGridOffset() + +
+ Signature: unit -> unit
+
+ 		+

Offset from the each side to enlarge grid and leave additional space for routing.

+ + +
+ + + UseDiagonals() + +
+ Signature: unit -> unit
+
+ 		+

Use diagonal point connections while searching for the path.

+ + +
+ + + UseHeavyDiagonals() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets if diagonal shortcuts must be preferred

+ + +
+ + + UseTieBreaker() + +
+ Signature: unit -> unit
+
+ 		+

Use special formula for tie breaking

+ + +
+ + + VerticalGridSize() + +
+ Signature: unit -> unit
+
+ 		+

Controls vertical grid density. Smaller the value more points will be available.

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-edgerouting-pathfindernode.html b/reference/graphx-pcl-logic-algorithms-edgerouting-pathfindernode.html new file mode 100644 index 000000000..f58f2ce51 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-edgerouting-pathfindernode.html @@ -0,0 +1,68 @@ + + + + + PathFinderNode - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

PathFinderNode

+

+ Namespace: GraphX.PCL.Logic.Algorithms.EdgeRouting
+

+
+
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-edgerouting-pathfindernodetype.html b/reference/graphx-pcl-logic-algorithms-edgerouting-pathfindernodetype.html new file mode 100644 index 000000000..725209f14 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-edgerouting-pathfindernodetype.html @@ -0,0 +1,68 @@ + + + + + PathFinderNodeType - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

PathFinderNodeType

+

+ Namespace: GraphX.PCL.Logic.Algorithms.EdgeRouting
+

+
+
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-edgerouting-priorityqueueb-1.html b/reference/graphx-pcl-logic-algorithms-edgerouting-priorityqueueb-1.html new file mode 100644 index 000000000..ad1492606 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-edgerouting-priorityqueueb-1.html @@ -0,0 +1,254 @@ + + + + + PriorityQueueB<'T> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

PriorityQueueB<'T>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.EdgeRouting
+

+
+
+

Constructors

+ + + + + + + + + + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + new(comparer) + +
+ Signature: comparer:IComparer<'T> -> unit
+
+ 		+ +
+ + + new(comparer, capacity) + +
+ Signature: (comparer:IComparer<'T> * capacity:int) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Clear() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + Count + +
+ Signature: int
+
+ 		+ +
+ + + [()] + +
+ Signature: unit -> int
+
+ 		+ +
+ + + Peek() + +
+ Signature: unit -> 'T
+ Modifiers: abstract
+
+ 		+

Get the smallest object without removing it.

+ + +
+ + + Pop() + +
+ Signature: unit -> 'T
+ Modifiers: abstract
+
+ 		+

Get the smallest object and remove it.

+ + +
+ + + Push(item) + +
+ Signature: item:'T -> int
+ Modifiers: abstract
+
+ 		+

Push an object onto the PQ

+ + +
+ + + RemoveLocation(item) + +
+ Signature: item:'T -> unit
+
+ 		+ +
+ + + Update(i) + +
+ Signature: i:int -> unit
+ Modifiers: abstract
+
+ 		+

Notify the PQ that the object at position i has changed +and the PQ needs to restore order. +Since you dont have access to any indexes (except by using the +explicit IList.this) you should not call this function without knowing exactly +what you do.

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-edgerouting-simpleedgerouting-3.html b/reference/graphx-pcl-logic-algorithms-edgerouting-simpleedgerouting-3.html new file mode 100644 index 000000000..258c56dd0 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-edgerouting-simpleedgerouting-3.html @@ -0,0 +1,221 @@ + + + + + SimpleEdgeRouting<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

SimpleEdgeRouting<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.EdgeRouting
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(...) + +
+ Signature: (graph:'TGraph * vertexPositions:IDictionary<'TVertex,Point> * vertexSizes:IDictionary<'TVertex,Rect> * parameters:IEdgeRoutingParameters) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Compute(cancellationToken) + +
+ Signature: cancellationToken:CancellationToken -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + ComputeSingle(edge) + +
+ Signature: edge:'TEdge -> Point []
+ Modifiers: abstract
+
+ 		+ +
+ + + UpdateVertexData(vertex, position, size) + +
+ Signature: (vertex:'TVertex * position:Point * size:Rect) -> unit
+ Modifiers: abstract
+
+ 		+ +
+

Static members

+ + + + + + + + + + + + + + + + + + + + + + + + + + +
Static memberDescription
+ + + GetCloserPoint(start, a, b) + +
+ Signature: (start:Point * a:Point * b:Point) -> Point
+
+ 		+ +
+ + + GetDistance(a, b) + +
+ Signature: (a:Point * b:Point) -> float
+
+ 		+ +
+ + + GetIntersectionData(r, p) + +
+ Signature: (r:Rect * p:Point) -> sides<'TVertex,'TEdge,'TGraph>
+
+ 		+ +
+ + + GetIntersectionPoint(r, a, b, pt) + +
+ Signature: (r:Rect * a:Point * b:Point * pt:byref<Point>) -> int
+
+ 		+ +
+ + + IsIntersected(r, a, b) + +
+ Signature: (r:Rect * a:Point * b:Point) -> bool
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-edgerouting-simpleerparameters.html b/reference/graphx-pcl-logic-algorithms-edgerouting-simpleerparameters.html new file mode 100644 index 000000000..42437593e --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-edgerouting-simpleerparameters.html @@ -0,0 +1,130 @@ + + + + + SimpleERParameters - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

SimpleERParameters

+

+ Namespace: GraphX.PCL.Logic.Algorithms.EdgeRouting
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + +
Instance memberDescription
+ + + BackStep() + +
+ Signature: unit -> unit
+
+ 		+

Get or set backward step when intersection is met

+ + +
+ + + SideStep() + +
+ Signature: unit -> unit
+
+ 		+

Get or set side step value when searching for way around vertex

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-edgetypes.html b/reference/graphx-pcl-logic-algorithms-edgetypes.html new file mode 100644 index 000000000..6bd044ea9 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-edgetypes.html @@ -0,0 +1,68 @@ + + + + + EdgeTypes - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

EdgeTypes

+

+ Namespace: GraphX.PCL.Logic.Algorithms
+

+
+
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-graphxextensions.html b/reference/graphx-pcl-logic-algorithms-graphxextensions.html new file mode 100644 index 000000000..d8bcf46be --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-graphxextensions.html @@ -0,0 +1,343 @@ + + + + + GraphXExtensions - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

GraphXExtensions

+

+ Namespace: GraphX.PCL.Logic.Algorithms
+

+
+
+

Static members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Static memberDescription
+ + + AddEdgeRange(graph, edges) + +
+ Signature: (graph:IMutableEdgeListGraph<'TVertex,'TEdge> * edges:IEnumerable<'TEdge>) -> unit
+ Type parameters: 'TVertex, 'TEdge
+ 		+ +
+ + + Convert(...) + +
+ Signature: (oldGraph:IVertexAndEdgeListGraph<'TOldVertex,'TOldEdge> * vertexMapperFunc:Func<'TOldVertex,'TNewVertex> * edgeMapperFunc:Func<'TOldEdge,'TNewEdge>) -> BidirectionalGraph<'TNewVertex,'TNewEdge>
+ Type parameters: 'TOldVertex, 'TOldEdge, 'TNewVertex, 'TNewEdge
+ 		+ +
+ + + Convert(oldGraph, edgeMapperFunc) + +
+ Signature: (oldGraph:IVertexAndEdgeListGraph<'TOldVertex,'TOldEdge> * edgeMapperFunc:Func<'TOldEdge,'TNewEdge>) -> BidirectionalGraph<'TOldVertex,'TNewEdge>
+ Type parameters: 'TOldVertex, 'TOldEdge, 'TNewEdge
+ 		+ +
+ + + Convert(...) + +
+ Signature: (oldGraph:IVertexAndEdgeListGraph<'TOldVertex,'TOldEdge> * newGraph:'TNewGraph * vertexMapperFunc:Func<'TOldVertex,'TNewVertex> * edgeMapperFunc:Func<'TOldEdge,'TNewEdge>) -> 'TNewGraph
+ Type parameters: 'TOldVertex, 'TOldEdge, 'TNewVertex, 'TNewEdge, 'TNewGraph
+ 		+ +
+ + + Convert(...) + +
+ Signature: (oldGraph:IVertexAndEdgeListGraph<'TOldVertex,'TOldEdge> * newGraph:'TNewGraph * edgeMapperFunc:Func<'TOldEdge,'TNewEdge>) -> 'TNewGraph
+ Type parameters: 'TOldVertex, 'TOldEdge, 'TNewEdge, 'TNewGraph
+ 		+ +
+ + + Convert(oldGraph, newGraph) + +
+ Signature: (oldGraph:IVertexAndEdgeListGraph<'TOldVertex,'TOldEdge> * newGraph:'TNewGraph) -> 'TNewGraph
+ Type parameters: 'TOldVertex, 'TOldEdge, 'TNewGraph
+ 		+ +
+ + + CopyToBidirectionalGraph(...) + +
+ Signature: (graph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * includeEmpty:bool) -> BidirectionalGraph<'TVertex,'TEdge>
+ Type parameters: 'TVertex, 'TEdge
+ 		+ +
+ + + GetAllEdges(graph, vertex) + +
+ Signature: (graph:IBidirectionalGraph<'TVertex,'TEdge> * vertex:'TVertex) -> IEnumerable<'TEdge>
+ Type parameters: 'TVertex, 'TEdge
+ 		+

Get all edges associated with the vertex

+ + +
+ + + GetDiameter(g) + +
+ Signature: g:'TGraph -> float
+ Type parameters: 'TVertex, 'TEdge, 'TGraph
+ 		+

Gets the diameter of a graph. +The diameter is the greatest distance between two vertices.

+ + +
+ + + GetDiameter(g, distances) + +
+ Signature: (g:'TGraph * distances:byref<float [,]>) -> float
+ Type parameters: 'TVertex, 'TEdge, 'TGraph
+ 		+

Gets the diameter of a graph. +The diameter is the greatest distance between two vertices.

+ + +
+ + + GetEdgesBetween(...) + +
+ Signature: (g:IVertexAndEdgeListGraph<'TVertex,'TEdge> * set1:List<'TVertex> * set2:List<'TVertex> * undirected:bool) -> IEnumerable<'TEdge>
+ Type parameters: 'TVertex, 'TEdge
+ 		+

If the graph g is directed, then returns every edges which source is one of the vertices in the set1 +and the target is one of the vertices in set2.

+ + +
+ + + GetInEdges(graph, vertex) + +
+ Signature: (graph:IBidirectionalGraph<'TVertex,'TEdge> * vertex:'TVertex) -> IEnumerable<'TEdge>
+ Type parameters: 'TVertex, 'TEdge
+ 		+ +
+ + + GetInNeighbours(g, vertex) + +
+ Signature: (g:IBidirectionalGraph<'TVertex,'TEdge> * vertex:'TVertex) -> IEnumerable<'TVertex>
+ Type parameters: 'TVertex, 'TEdge
+ 		+ +
+ + + GetNeighbours(g, vertex) + +
+ Signature: (g:IBidirectionalGraph<'TVertex,'TEdge> * vertex:'TVertex) -> IEnumerable<'TVertex>
+ Type parameters: 'TVertex, 'TEdge
+ 		+

Returns with the adjacent vertices of the vertex.

+ + +
+ + + GetOutEdges(graph, vertex) + +
+ Signature: (graph:IBidirectionalGraph<'TVertex,'TEdge> * vertex:'TVertex) -> IEnumerable<'TEdge>
+ Type parameters: 'TVertex, 'TEdge
+ 		+ +
+ + + GetOutNeighbours(g, vertex) + +
+ Signature: (g:IVertexAndEdgeListGraph<'TVertex,'TEdge> * vertex:'TVertex) -> IEnumerable<'TVertex>
+ Type parameters: 'TVertex, 'TEdge
+ 		+ +
+ + + GetSources(g) + +
+ Signature: g:IBidirectionalGraph<'TVertex,'TEdge> -> IEnumerable<'TVertex>
+ Type parameters: 'TVertex, 'TEdge
+ 		+

Returns with the sources in the graph.

+ + +
+ + + OtherVertex(edge, thisVertex) + +
+ Signature: (edge:IEdge<'TVertex> * thisVertex:'TVertex) -> 'TVertex
+ Type parameters: 'TVertex
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-hierarchicalgraph-2.html b/reference/graphx-pcl-logic-algorithms-hierarchicalgraph-2.html new file mode 100644 index 000000000..2e6e1bbf5 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-hierarchicalgraph-2.html @@ -0,0 +1,426 @@ + + + + + HierarchicalGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

HierarchicalGraph<'TVertex, 'TEdge>

+

+ Namespace: GraphX.PCL.Logic.Algorithms
+

+
+
+

Constructors

+ + + + + + + + + + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + new(allowParallelEdges) + +
+ Signature: allowParallelEdges:bool -> unit
+
+ 		+ +
+ + + new(allowParallelEdges, vertexCapacity) + +
+ Signature: (allowParallelEdges:bool * vertexCapacity:int) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + AddEdge(e) + +
+ Signature: e:'TEdge -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + AddVertex(v) + +
+ Signature: v:'TVertex -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + GeneralEdgeCount + +
+ Signature: int
+ Modifiers: abstract
+
+ 		+ +
+ + + GeneralEdgeCountFor(v) + +
+ Signature: v:'TVertex -> int
+ Modifiers: abstract
+
+ 		+ +
+ + + GeneralEdges + +
+ Signature: IEnumerable<'TEdge>
+ Modifiers: abstract
+
+ 		+ +
+ + + GeneralEdgesFor(v) + +
+ Signature: v:'TVertex -> IEnumerable<'TEdge>
+ Modifiers: abstract
+
+ 		+ +
+ + + HierarchicalEdgeCount + +
+ Signature: int
+ Modifiers: abstract
+
+ 		+ +
+ + + HierarchicalEdgeCountFor(v) + +
+ Signature: v:'TVertex -> int
+ Modifiers: abstract
+
+ 		+ +
+ + + HierarchicalEdges + +
+ Signature: IEnumerable<'TEdge>
+ Modifiers: abstract
+
+ 		+ +
+ + + HierarchicalEdgesFor(v) + +
+ Signature: v:'TVertex -> IEnumerable<'TEdge>
+ Modifiers: abstract
+
+ 		+ +
+ + + InGeneralEdgeCount(v) + +
+ Signature: v:'TVertex -> int
+ Modifiers: abstract
+
+ 		+ +
+ + + InGeneralEdges(v) + +
+ Signature: v:'TVertex -> IEnumerable<'TEdge>
+ Modifiers: abstract
+
+ 		+ +
+ + + InHierarchicalEdgeCount(v) + +
+ Signature: v:'TVertex -> int
+ Modifiers: abstract
+
+ 		+ +
+ + + InHierarchicalEdges(v) + +
+ Signature: v:'TVertex -> IEnumerable<'TEdge>
+ Modifiers: abstract
+
+ 		+ +
+ + + OutGeneralEdgeCount(v) + +
+ Signature: v:'TVertex -> int
+ Modifiers: abstract
+
+ 		+ +
+ + + OutGeneralEdges(v) + +
+ Signature: v:'TVertex -> IEnumerable<'TEdge>
+ Modifiers: abstract
+
+ 		+ +
+ + + OutHierarchicalEdgeCount(v) + +
+ Signature: v:'TVertex -> int
+ Modifiers: abstract
+
+ 		+ +
+ + + OutHierarchicalEdges(v) + +
+ Signature: v:'TVertex -> IEnumerable<'TEdge>
+ Modifiers: abstract
+
+ 		+ +
+ + + RemoveEdge(e) + +
+ Signature: e:'TEdge -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + RemoveVertex(v) + +
+ Signature: v:'TVertex -> bool
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-ialgorithm.html b/reference/graphx-pcl-logic-algorithms-ialgorithm.html new file mode 100644 index 000000000..33b14e79a --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-ialgorithm.html @@ -0,0 +1,93 @@ + + + + + IAlgorithm - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

IAlgorithm

+

+ Namespace: GraphX.PCL.Logic.Algorithms
+

+
+

Simple algorithm interface which is not connected to any graph.

+ +
+

Instance members

+ + + + + + + + + + +
Instance memberDescription
+ + + Compute(cancellationToken) + +
+ Signature: cancellationToken:CancellationToken -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-ihierarchicalbidirectionalgraph-2.html b/reference/graphx-pcl-logic-algorithms-ihierarchicalbidirectionalgraph-2.html new file mode 100644 index 000000000..c8f386389 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-ihierarchicalbidirectionalgraph-2.html @@ -0,0 +1,316 @@ + + + + + IHierarchicalBidirectionalGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

IHierarchicalBidirectionalGraph<'TVertex, 'TEdge>

+

+ Namespace: GraphX.PCL.Logic.Algorithms
+

+
+
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + GeneralEdgeCount + +
+ Signature: int
+ Modifiers: abstract
+
+ 		+ +
+ + + GeneralEdgeCountFor(v) + +
+ Signature: v:'TVertex -> int
+ Modifiers: abstract
+
+ 		+ +
+ + + GeneralEdges + +
+ Signature: IEnumerable<'TEdge>
+ Modifiers: abstract
+
+ 		+ +
+ + + GeneralEdgesFor(v) + +
+ Signature: v:'TVertex -> IEnumerable<'TEdge>
+ Modifiers: abstract
+
+ 		+ +
+ + + HierarchicalEdgeCount + +
+ Signature: int
+ Modifiers: abstract
+
+ 		+ +
+ + + HierarchicalEdgeCountFor(v) + +
+ Signature: v:'TVertex -> int
+ Modifiers: abstract
+
+ 		+ +
+ + + HierarchicalEdges + +
+ Signature: IEnumerable<'TEdge>
+ Modifiers: abstract
+
+ 		+ +
+ + + HierarchicalEdgesFor(v) + +
+ Signature: v:'TVertex -> IEnumerable<'TEdge>
+ Modifiers: abstract
+
+ 		+ +
+ + + InGeneralEdgeCount(v) + +
+ Signature: v:'TVertex -> int
+ Modifiers: abstract
+
+ 		+ +
+ + + InGeneralEdges(v) + +
+ Signature: v:'TVertex -> IEnumerable<'TEdge>
+ Modifiers: abstract
+
+ 		+ +
+ + + InHierarchicalEdgeCount(v) + +
+ Signature: v:'TVertex -> int
+ Modifiers: abstract
+
+ 		+ +
+ + + InHierarchicalEdges(v) + +
+ Signature: v:'TVertex -> IEnumerable<'TEdge>
+ Modifiers: abstract
+
+ 		+ +
+ + + OutGeneralEdgeCount(v) + +
+ Signature: v:'TVertex -> int
+ Modifiers: abstract
+
+ 		+ +
+ + + OutGeneralEdges(v) + +
+ Signature: v:'TVertex -> IEnumerable<'TEdge>
+ Modifiers: abstract
+
+ 		+ +
+ + + OutHierarchicalEdgeCount(v) + +
+ Signature: v:'TVertex -> int
+ Modifiers: abstract
+
+ 		+ +
+ + + OutHierarchicalEdges(v) + +
+ Signature: v:'TVertex -> IEnumerable<'TEdge>
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-isoftmutablegraph-2.html b/reference/graphx-pcl-logic-algorithms-isoftmutablegraph-2.html new file mode 100644 index 000000000..2918f62d2 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-isoftmutablegraph-2.html @@ -0,0 +1,453 @@ + + + + + ISoftMutableGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

ISoftMutableGraph<'TVertex, 'TEdge>

+

+ Namespace: GraphX.PCL.Logic.Algorithms
+

+
+

Soft mutation means: We can hide the vertices or the edges.

+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + HiddenEdgeCount + +
+ Signature: int
+ Modifiers: abstract
+
+ 		+ +
+ + + HiddenEdgeCountOf(v) + +
+ Signature: v:'TVertex -> int
+ Modifiers: abstract
+
+ 		+ +
+ + + HiddenEdges + +
+ Signature: IEnumerable<'TEdge>
+ Modifiers: abstract
+
+ 		+ +
+ + + HiddenEdgesOf(v) + +
+ Signature: v:'TVertex -> IEnumerable<'TEdge>
+ Modifiers: abstract
+
+ 		+ +
+ + + HiddenVertexCount + +
+ Signature: int
+ Modifiers: abstract
+
+ 		+ +
+ + + HiddenVertices + +
+ Signature: IEnumerable<'TVertex>
+ Modifiers: abstract
+
+ 		+ +
+ + + HideEdge(e) + +
+ Signature: e:'TEdge -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + HideEdge(e, tag) + +
+ Signature: (e:'TEdge * tag:string) -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + HideEdges(edges) + +
+ Signature: edges:IEnumerable<'TEdge> -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + HideEdges(edges, tag) + +
+ Signature: (edges:IEnumerable<'TEdge> * tag:string) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + HideEdgesIf(predicate, tag) + +
+ Signature: (predicate:Func<'TEdge,bool> * tag:string) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + HideVertex(v) + +
+ Signature: v:'TVertex -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + HideVertex(v, tag) + +
+ Signature: (v:'TVertex * tag:string) -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + HideVertices(vertices) + +
+ Signature: vertices:IEnumerable<'TVertex> -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + HideVertices(vertices, tag) + +
+ Signature: (vertices:IEnumerable<'TVertex> * tag:string) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + HideVerticesIf(predicate, tag) + +
+ Signature: (predicate:Func<'TVertex,bool> * tag:string) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + IsHiddenEdge(e) + +
+ Signature: e:'TEdge -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + IsHiddenVertex(v) + +
+ Signature: v:'TVertex -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + Unhide(tag) + +
+ Signature: tag:string -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + UnhideAll() + +
+ Signature: unit -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + UnhideEdge(e) + +
+ Signature: e:'TEdge -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + UnhideEdges(edges) + +
+ Signature: edges:IEnumerable<'TEdge> -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + UnhideEdgesIf(predicate) + +
+ Signature: predicate:Func<'TEdge,bool> -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + UnhideVertex(v) + +
+ Signature: v:'TVertex -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + UnhideVertexAndEdges(v) + +
+ Signature: v:'TVertex -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-itypededge.html b/reference/graphx-pcl-logic-algorithms-itypededge.html new file mode 100644 index 000000000..8d903579f --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-itypededge.html @@ -0,0 +1,91 @@ + + + + + ITypedEdge - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

ITypedEdge

+

+ Namespace: GraphX.PCL.Logic.Algorithms
+

+
+
+

Instance members

+ + + + + + + + + + +
Instance memberDescription
+ + + Type + +
+ Signature: EdgeTypes
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layeredtopologicalsortalgorithm-2.html b/reference/graphx-pcl-logic-algorithms-layeredtopologicalsortalgorithm-2.html new file mode 100644 index 000000000..d334c25b2 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layeredtopologicalsortalgorithm-2.html @@ -0,0 +1,160 @@ + + + + + LayeredTopologicalSortAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

LayeredTopologicalSortAlgorithm<'TVertex, 'TEdge>

+

+ Namespace: GraphX.PCL.Logic.Algorithms
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(g) + +
+ Signature: g:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + LayerCount + +
+ Signature: int
+
+ 		+

The count of the layers in the graph.

+ + +
+ + + LayerFinished + +
+ Signature: IEvent<LayerFinishedDelegate<'TVertex,'TEdge>,LayeredTopologicalSortEventArgs<'TVertex,'TEdge>>
+
+ 		+ +
+ + + LayerIndices + +
+ Signature: IDictionary<'TVertex,int>
+
+ 		+

This dictionary contains the layer-index for every vertices.

+ + +
+ + + Layers + +
+ Signature: IList<IList<'TVertex>>
+
+ 		+

The vertices grouped by their LayerIndex.

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-balloontreelayoutalgorithm-3.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-balloontreelayoutalgorithm-3.html new file mode 100644 index 000000000..a64c8a846 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-balloontreelayoutalgorithm-3.html @@ -0,0 +1,128 @@ + + + + + BalloonTreeLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

BalloonTreeLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(...) + +
+ Signature: (visitedGraph:'TGraph * vertexPositions:IDictionary<'TVertex,Point> * oldParameters:BalloonTreeLayoutParameters * selectedVertex:'TVertex) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + +
Instance memberDescription
+ + + Compute(cancellationToken) + +
+ Signature: cancellationToken:CancellationToken -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + ResetGraph(vertices, edges) + +
+ Signature: (vertices:IEnumerable<'TVertex> * edges:IEnumerable<'TEdge>) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-balloontreelayoutparameters.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-balloontreelayoutparameters.html new file mode 100644 index 000000000..56426c659 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-balloontreelayoutparameters.html @@ -0,0 +1,126 @@ + + + + + BalloonTreeLayoutParameters - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

BalloonTreeLayoutParameters

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + +
Instance memberDescription
+ + + Border() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + MinRadius() + +
+ Signature: unit -> unit
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-boundedfrlayoutparameters.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-boundedfrlayoutparameters.html new file mode 100644 index 000000000..cc14e4d3d --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-boundedfrlayoutparameters.html @@ -0,0 +1,166 @@ + + + + + BoundedFRLayoutParameters - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

BoundedFRLayoutParameters

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+

Parameters of the Fruchterman-Reingold Algorithm (FDP), bounded version.

+ +
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Height() + +
+ Signature: unit -> unit
+
+ 		+

Height of the bounding box.

+ + +
+ + + InitialTemperature + +
+ Signature: float
+ Modifiers: abstract
+
+ 		+

Gets the initial temperature of the mass.

+ + +
+ + + K + +
+ Signature: float
+ Modifiers: abstract
+
+ 		+

Constant. IdealEdgeLength = sqrt(height * width / vertexCount)

+ + +
+ + + Width() + +
+ Signature: unit -> unit
+
+ 		+

Width of the bounding box.

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-circularlayoutalgorithm-3.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-circularlayoutalgorithm-3.html new file mode 100644 index 000000000..75cba9e23 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-circularlayoutalgorithm-3.html @@ -0,0 +1,145 @@ + + + + + CircularLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

CircularLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(...) + +
+ Signature: (visitedGraph:'TGraph * vertexPositions:IDictionary<'TVertex,Point> * vertexSizes:IDictionary<'TVertex,Size> * parameters:CircularLayoutParameters) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Compute(cancellationToken) + +
+ Signature: cancellationToken:CancellationToken -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + ResetGraph(vertices, edges) + +
+ Signature: (vertices:IEnumerable<'TVertex> * edges:IEnumerable<'TEdge>) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + SupportsObjectFreeze + +
+ Signature: bool
+ Modifiers: abstract
+
+ 		+

Gets if current algorithm supports vertex freeze feature (part of VAESPS)

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-circularlayoutparameters.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-circularlayoutparameters.html new file mode 100644 index 000000000..6078ce5c3 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-circularlayoutparameters.html @@ -0,0 +1,90 @@ + + + + + CircularLayoutParameters - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

CircularLayoutParameters

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-compoundfdplayoutalgorithm-3.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-compoundfdplayoutalgorithm-3.html new file mode 100644 index 000000000..ede414168 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-compoundfdplayoutalgorithm-3.html @@ -0,0 +1,187 @@ + + + + + CompoundFDPLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

CompoundFDPLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + + + + + +
ConstructorDescription
+ + + new(...) + +
+ Signature: (visitedGraph:'TGraph * vertexSizes:IDictionary<'TVertex,Size> * vertexBorders:IDictionary<'TVertex,Thickness> * layoutTypes:IDictionary<'TVertex,CompoundVertexInnerLayoutType>) -> unit
+
+ 		+ +
+ + + new(...) + +
+ Signature: (visitedGraph:'TGraph * vertexSizes:IDictionary<'TVertex,Size> * vertexBorders:IDictionary<'TVertex,Thickness> * layoutTypes:IDictionary<'TVertex,CompoundVertexInnerLayoutType> * vertexPositions:IDictionary<'TVertex,Point> * oldParameters:CompoundFDPLayoutParameters) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Compute(cancellationToken) + +
+ Signature: cancellationToken:CancellationToken -> unit
+ Modifiers: abstract
+
+ 		+

This method is the skeleton of the layout algorithm.

+ + +
+ + + InnerCanvasSizes + +
+ Signature: IDictionary<'TVertex,Size>
+ Modifiers: abstract
+
+ 		+ +
+ + + LevelOfVertex(vertex) + +
+ Signature: vertex:'TVertex -> int
+
+ 		+ +
+ + + Levels + +
+ Signature: IList<HashSet<'TVertex>>
+
+ 		+ +
+ + + ResetGraph(vertices, edges) + +
+ Signature: (vertices:IEnumerable<'TVertex> * edges:IEnumerable<'TEdge>) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-compoundfdplayoutparameters.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-compoundfdplayoutparameters.html new file mode 100644 index 000000000..3dcbd365d --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-compoundfdplayoutparameters.html @@ -0,0 +1,306 @@ + + + + + CompoundFDPLayoutParameters - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

CompoundFDPLayoutParameters

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + DisplacementLimitMultiplier() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + ElasticConstant() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets the elastic constant for the edges.

+ + +
+ + + GravitationFactor() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets the factor of the gravitation.

+ + +
+ + + IdealEdgeLength() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets the ideal edge length.

+ + +
+ + + NestingFactor() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets the factor of the ideal edge length for the +inter-graph edges.

+ + +
+ + + Phase1Iterations() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + Phase2Iterations() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + Phase2TemperatureInitialMultiplier() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + Phase3Iterations() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + Phase3TemperatureInitialMultiplier() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + RepulsionConstant() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets the repulsion constant for the node-node +repulsion.

+ + +
+ + + SeparationMultiplier() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + TemperatureDecreasing() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + TemperatureFactor() + +
+ Signature: unit -> unit
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-compoundgraph-2.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-compoundgraph-2.html new file mode 100644 index 000000000..dfc41842f --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-compoundgraph-2.html @@ -0,0 +1,304 @@ + + + + + CompoundGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

CompoundGraph<'TVertex, 'TEdge>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + + + + + + + + + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + new(allowParallelEdges) + +
+ Signature: allowParallelEdges:bool -> unit
+
+ 		+ +
+ + + new(allowParallelEdges, vertexCapacity) + +
+ Signature: (allowParallelEdges:bool * vertexCapacity:int) -> unit
+
+ 		+ +
+ + + new(graph) + +
+ Signature: graph:IBidirectionalGraph<'TVertex,'TEdge> -> unit
+
+ 		+ +
+ + + new(graph) + +
+ Signature: graph:ICompoundGraph<'TVertex,'TEdge> -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + AddChildVertex(parent, child) + +
+ Signature: (parent:'TVertex * child:'TVertex) -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + AddChildVertexRange(parent, children) + +
+ Signature: (parent:'TVertex * children:IEnumerable<'TVertex>) -> int
+ Modifiers: abstract
+
+ 		+ +
+ + + CompoundVertices + +
+ Signature: IEnumerable<'TVertex>
+ Modifiers: abstract
+
+ 		+ +
+ + + GetChildrenCount(vertex) + +
+ Signature: vertex:'TVertex -> int
+ Modifiers: abstract
+
+ 		+ +
+ + + GetChildrenVertices(vertex) + +
+ Signature: vertex:'TVertex -> IEnumerable<'TVertex>
+ Modifiers: abstract
+
+ 		+ +
+ + + GetParent(vertex) + +
+ Signature: vertex:'TVertex -> 'TVertex
+ Modifiers: abstract
+
+ 		+ +
+ + + IsChildVertex(vertex) + +
+ Signature: vertex:'TVertex -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + IsCompoundVertex(vertex) + +
+ Signature: vertex:'TVertex -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + RemoveVertex(v) + +
+ Signature: v:'TVertex -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + SimpleVertices + +
+ Signature: IEnumerable<'TVertex>
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-compoundlayoutcontext-3.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-compoundlayoutcontext-3.html new file mode 100644 index 000000000..c6925ae80 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-compoundlayoutcontext-3.html @@ -0,0 +1,128 @@ + + + + + CompoundLayoutContext<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

CompoundLayoutContext<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(...) + +
+ Signature: (graph:'TGraph * positions:IDictionary<'TVertex,Point> * sizes:IDictionary<'TVertex,Size> * mode:LayoutMode * vertexBorders:IDictionary<'TVertex,Thickness> * layoutTypes:IDictionary<'TVertex,CompoundVertexInnerLayoutType>) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + +
Instance memberDescription
+ + + LayoutTypes() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + VertexBorders() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-compoundlayoutiterationeventargs-2.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-compoundlayoutiterationeventargs-2.html new file mode 100644 index 000000000..99a1af779 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-compoundlayoutiterationeventargs-2.html @@ -0,0 +1,113 @@ + + + + + CompoundLayoutIterationEventArgs<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

CompoundLayoutIterationEventArgs<'TVertex, 'TEdge>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(...) + +
+ Signature: (iteration:int * statusInPercent:float * message:string * vertexPositions:IDictionary<'TVertex,Point> * innerCanvasSizes:IDictionary<'TVertex,Size>) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + +
Instance memberDescription
+ + + InnerCanvasSizes() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-compoundvertexinnerlayouttype.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-compoundvertexinnerlayouttype.html new file mode 100644 index 000000000..89ff46e93 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-compoundvertexinnerlayouttype.html @@ -0,0 +1,68 @@ + + + + + CompoundVertexInnerLayoutType - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

CompoundVertexInnerLayoutType

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-defaultparameterizedlayoutalgorithmbase-4.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-defaultparameterizedlayoutalgorithmbase-4.html new file mode 100644 index 000000000..90d31d315 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-defaultparameterizedlayoutalgorithmbase-4.html @@ -0,0 +1,130 @@ + + + + + DefaultParameterizedLayoutAlgorithmBase<'TVertex, 'TEdge, 'TGraph, 'TParam> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

DefaultParameterizedLayoutAlgorithmBase<'TVertex, 'TEdge, 'TGraph, 'TParam>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+

Use this class as a base class for your layout algorithm +if it's parameter class has a default contstructor.

+ +
+

Constructors

+ + + + + + + + + + + + + + +
ConstructorDescription
+ + + new(visitedGraph) + +
+ Signature: visitedGraph:'TGraph -> unit
+
+ 		+ +
+ + + new(...) + +
+ Signature: (visitedGraph:'TGraph * vertexPositions:IDictionary<'TVertex,Point> * oldParameters:'TParam) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + +
Instance memberDescription
+ + + DefaultParameters + +
+ Signature: 'TParam
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-efficientsugiyamalayoutalgorithm-3.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-efficientsugiyamalayoutalgorithm-3.html new file mode 100644 index 000000000..010c063d2 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-efficientsugiyamalayoutalgorithm-3.html @@ -0,0 +1,157 @@ + + + + + EfficientSugiyamaLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

EfficientSugiyamaLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + + + + + +
ConstructorDescription
+ + + new(...) + +
+ Signature: (visitedGraph:'TGraph * parameters:EfficientSugiyamaLayoutParameters * vertexSizes:IDictionary<'TVertex,Size>) -> unit
+
+ 		+ +
+ + + new(...) + +
+ Signature: (visitedGraph:'TGraph * parameters:EfficientSugiyamaLayoutParameters * vertexPositions:IDictionary<'TVertex,Point> * vertexSizes:IDictionary<'TVertex,Size>) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Compute(cancellationToken) + +
+ Signature: cancellationToken:CancellationToken -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + EdgeRoutes + +
+ Signature: IDictionary<'TEdge,Point []>
+ Modifiers: abstract
+
+ 		+ +
+ + + ResetGraph(vertices, edges) + +
+ Signature: (vertices:IEnumerable<'TVertex> * edges:IEnumerable<'TEdge>) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-efficientsugiyamalayoutparameters.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-efficientsugiyamalayoutparameters.html new file mode 100644 index 000000000..99e842275 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-efficientsugiyamalayoutparameters.html @@ -0,0 +1,212 @@ + + + + + EfficientSugiyamaLayoutParameters - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

EfficientSugiyamaLayoutParameters

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Direction() + +
+ Signature: unit -> unit
+
+ 		+

Layout direction

+ + +
+ + + EdgeRouting() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + LayerDistance() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + MinimizeEdgeLength() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + OptimizeWidth() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + PositionMode() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + VertexDistance() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + WidthPerHeight() + +
+ Signature: unit -> unit
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-frcoolingfunction.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-frcoolingfunction.html new file mode 100644 index 000000000..340c57cae --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-frcoolingfunction.html @@ -0,0 +1,68 @@ + + + + + FRCoolingFunction - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

FRCoolingFunction

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-freefrlayoutparameters.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-freefrlayoutparameters.html new file mode 100644 index 000000000..7f5f85c57 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-freefrlayoutparameters.html @@ -0,0 +1,144 @@ + + + + + FreeFRLayoutParameters - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

FreeFRLayoutParameters

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + IdealEdgeLength() + +
+ Signature: unit -> unit
+
+ 		+

Constant. Represents the ideal length of the edges.

+ + +
+ + + InitialTemperature + +
+ Signature: float
+ Modifiers: abstract
+
+ 		+ +
+ + + K + +
+ Signature: float
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-frlayoutalgorithm-3.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-frlayoutalgorithm-3.html new file mode 100644 index 000000000..2e0e122e7 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-frlayoutalgorithm-3.html @@ -0,0 +1,159 @@ + + + + + FRLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

FRLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + + + + + +
ConstructorDescription
+ + + new(visitedGraph) + +
+ Signature: visitedGraph:'TGraph -> unit
+
+ 		+ +
+ + + new(...) + +
+ Signature: (visitedGraph:'TGraph * vertexPositions:IDictionary<'TVertex,Point> * parameters:FRLayoutParametersBase) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Compute(cancellationToken) + +
+ Signature: cancellationToken:CancellationToken -> unit
+ Modifiers: abstract
+
+ 		+

It computes the layout of the vertices.

+ + +
+ + + DefaultParameters + +
+ Signature: FRLayoutParametersBase
+ Modifiers: abstract
+
+ 		+ +
+ + + ResetGraph(vertices, edges) + +
+ Signature: (vertices:IEnumerable<'TVertex> * edges:IEnumerable<'TEdge>) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-frlayoutparametersbase.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-frlayoutparametersbase.html new file mode 100644 index 000000000..a42e1d873 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-frlayoutparametersbase.html @@ -0,0 +1,248 @@ + + + + + FRLayoutParametersBase - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

FRLayoutParametersBase

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+

Parameters base for the Fruchterman-Reingold Algorithm (FDP).

+ +
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+

Default constructor

+ + +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + AttractionMultiplier() + +
+ Signature: unit -> unit
+
+ 		+

Multiplier of the attraction. Default value is 2.

+ + +
+ + + ConstantOfAttraction() + +
+ Signature: unit -> unit
+
+ 		+

Constant. Equals with K * attractionMultiplier

+ + +
+ + + ConstantOfRepulsion() + +
+ Signature: unit -> unit
+
+ 		+

Constant. Equals with Pow(K * repulsiveMultiplier, 2)

+ + +
+ + + CoolingFunction() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets the cooling function which could be Linear or Exponential.

+ + +
+ + + InitialTemperature + +
+ Signature: float
+ Modifiers: abstract
+
+ 		+

Gets the initial temperature of the mass.

+ + +
+ + + IterationLimit() + +
+ Signature: unit -> unit
+
+ 		+

Limit of the iterations. Default value is 200.

+ + +
+ + + K + +
+ Signature: float
+ Modifiers: abstract
+
+ 		+

Gets the computed ideal edge length.

+ + +
+ + + Lambda() + +
+ Signature: unit -> unit
+
+ 		+

Lambda for the cooling. Default value is 0.95.

+ + +
+ + + RepulsiveMultiplier() + +
+ Signature: unit -> unit
+
+ 		+

Multiplier of the repulsion. Default value is 1.

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-grouped-algorithmgroupparameters-2.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-grouped-algorithmgroupparameters-2.html new file mode 100644 index 000000000..e740b8f6d --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-grouped-algorithmgroupparameters-2.html @@ -0,0 +1,164 @@ + + + + + AlgorithmGroupParameters<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

AlgorithmGroupParameters<'TVertex, 'TEdge>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms.Grouped
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + GroupId() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets group Id for parameters to apply

+ + +
+ + + IsAlgorithmBounded() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets if specified algorithm directly places vertices in a specified bounds or overwise should grouping algorithm offset its vertices to a ZoneRectangle +For ex. RandomLayoutAlgorithm or BoundedFR can layout vertices in a custom bounds with no need to additionaly offset vertices. And LinLog algorithm do not have bounds and all its vertices layouted +in a 0 - 1000+ positions by default so if you set ZoneRectangle for the group you will need to offset generated vertices into the custom bounds.

+ + +
+ + + LayoutAlgorithm() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets layout algorithm that will be used to calculate vertices positions inside the group

+ + +
+ + + ZoneRectangle() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets rectangular area in which vertices will be placed. If not set then vertices will not be bound.

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-grouped-groupinglayoutalgorithm-3.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-grouped-groupinglayoutalgorithm-3.html new file mode 100644 index 000000000..b9cf616cc --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-grouped-groupinglayoutalgorithm-3.html @@ -0,0 +1,143 @@ + + + + + GroupingLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

GroupingLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms.Grouped
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(graph, positions, groupParams) + +
+ Signature: (graph:'TGraph * positions:IDictionary<'TVertex,Point> * groupParams:GroupingLayoutAlgorithmParameters<'TVertex,'TEdge>) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Compute(cancellationToken) + +
+ Signature: cancellationToken:CancellationToken -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + NeedVertexSizes + +
+ Signature: bool
+ Modifiers: abstract
+
+ 		+ +
+ + + ResetGraph(vertices, edges) + +
+ Signature: (vertices:IEnumerable<'TVertex> * edges:IEnumerable<'TEdge>) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-grouped-groupinglayoutalgorithmparameters-2.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-grouped-groupinglayoutalgorithmparameters-2.html new file mode 100644 index 000000000..7d272972d --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-grouped-groupinglayoutalgorithmparameters-2.html @@ -0,0 +1,194 @@ + + + + + GroupingLayoutAlgorithmParameters<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

GroupingLayoutAlgorithmParameters<'TVertex, 'TEdge>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms.Grouped
+

+
+
+

Constructors

+ + + + + + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + new(paramsList, arrangeGroups) + +
+ Signature: (paramsList:List<AlgorithmGroupParameters<'TVertex,'TEdge>> * arrangeGroups:bool) -> unit
+
+ 		+

Creates grouping algorithm parameters

+ + +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + ArrangeGroups() + +
+ Signature: unit -> unit
+
+ 		+

If true runs layouting pass for resulting group zone rectangles (auto calc if not specified) to eliminate overlaps

+ + +
+ + + ArrangeHorizontalGap() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets minimum horizontal gap between arranged groups. If ArrangeGroups = True.

+ + +
+ + + ArrangeVerticalGap() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets minimum vertical gap between arranged groups. If ArrangeGroups = True.

+ + +
+ + + GroupParametersList() + +
+ Signature: unit -> unit
+
+ 		+

Gets ort sets parameters list containing parameters for vertex groups

+ + +
+ + + OverlapRemovalAlgorithm() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets overlap removal algorithm to use for vertex groups

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-icompoundgraph-2.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-icompoundgraph-2.html new file mode 100644 index 000000000..b375f6c50 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-icompoundgraph-2.html @@ -0,0 +1,211 @@ + + + + + ICompoundGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

ICompoundGraph<'TVertex, 'TEdge>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + AddChildVertex(parent, child) + +
+ Signature: (parent:'TVertex * child:'TVertex) -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + AddChildVertexRange(parent, children) + +
+ Signature: (parent:'TVertex * children:IEnumerable<'TVertex>) -> int
+ Modifiers: abstract
+
+ 		+ +
+ + + CompoundVertices + +
+ Signature: IEnumerable<'TVertex>
+ Modifiers: abstract
+
+ 		+ +
+ + + GetChildrenCount(vertex) + +
+ Signature: vertex:'TVertex -> int
+ Modifiers: abstract
+
+ 		+ +
+ + + GetChildrenVertices(vertex) + +
+ Signature: vertex:'TVertex -> IEnumerable<'TVertex>
+ Modifiers: abstract
+
+ 		+ +
+ + + GetParent(vertex) + +
+ Signature: vertex:'TVertex -> 'TVertex
+ Modifiers: abstract
+
+ 		+ +
+ + + IsChildVertex(vertex) + +
+ Signature: vertex:'TVertex -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + IsCompoundVertex(vertex) + +
+ Signature: vertex:'TVertex -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + SimpleVertices + +
+ Signature: IEnumerable<'TVertex>
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-icompoundlayoutalgorithm-3.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-icompoundlayoutalgorithm-3.html new file mode 100644 index 000000000..aa3aac0c7 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-icompoundlayoutalgorithm-3.html @@ -0,0 +1,91 @@ + + + + + ICompoundLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

ICompoundLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Instance members

+ + + + + + + + + + +
Instance memberDescription
+ + + InnerCanvasSizes + +
+ Signature: IDictionary<'TVertex,Size>
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-icompoundlayoutcontext-3.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-icompoundlayoutcontext-3.html new file mode 100644 index 000000000..96d7d0002 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-icompoundlayoutcontext-3.html @@ -0,0 +1,106 @@ + + + + + ICompoundLayoutContext<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

ICompoundLayoutContext<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Instance members

+ + + + + + + + + + + + + + +
Instance memberDescription
+ + + LayoutTypes + +
+ Signature: IDictionary<'TVertex,CompoundVertexInnerLayoutType>
+ Modifiers: abstract
+
+ 		+ +
+ + + VertexBorders + +
+ Signature: IDictionary<'TVertex,Thickness>
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-icompoundlayoutiterationeventargs-1.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-icompoundlayoutiterationeventargs-1.html new file mode 100644 index 000000000..dcdc8c806 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-icompoundlayoutiterationeventargs-1.html @@ -0,0 +1,91 @@ + + + + + ICompoundLayoutIterationEventArgs<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

ICompoundLayoutIterationEventArgs<'TVertex>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Instance members

+ + + + + + + + + + +
Instance memberDescription
+ + + InnerCanvasSizes + +
+ Signature: IDictionary<'TVertex,Size>
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-ilayoutcontext-3.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-ilayoutcontext-3.html new file mode 100644 index 000000000..adca871c6 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-ilayoutcontext-3.html @@ -0,0 +1,136 @@ + + + + + ILayoutContext<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

ILayoutContext<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Graph + +
+ Signature: 'TGraph
+ Modifiers: abstract
+
+ 		+ +
+ + + Mode + +
+ Signature: LayoutMode
+ Modifiers: abstract
+
+ 		+ +
+ + + Positions + +
+ Signature: IDictionary<'TVertex,Point>
+ Modifiers: abstract
+
+ 		+ +
+ + + Sizes + +
+ Signature: IDictionary<'TVertex,Size>
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-ilayoutinfoiterationeventargs-2.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-ilayoutinfoiterationeventargs-2.html new file mode 100644 index 000000000..b95e20423 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-ilayoutinfoiterationeventargs-2.html @@ -0,0 +1,106 @@ + + + + + ILayoutInfoIterationEventArgs<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

ILayoutInfoIterationEventArgs<'TVertex, 'TEdge>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Instance members

+ + + + + + + + + + + + + + +
Instance memberDescription
+ + + GetEdgeInfo(edge) + +
+ Signature: edge:'TEdge -> obj
+ Modifiers: abstract
+
+ 		+ +
+ + + GetVertexInfo(vertex) + +
+ Signature: vertex:'TVertex -> obj
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-ilayoutinfoiterationeventargs-4.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-ilayoutinfoiterationeventargs-4.html new file mode 100644 index 000000000..2754836c7 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-ilayoutinfoiterationeventargs-4.html @@ -0,0 +1,106 @@ + + + + + ILayoutInfoIterationEventArgs<'TVertex, 'TEdge, 'TVertexInfo, 'TEdgeInfo> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

ILayoutInfoIterationEventArgs<'TVertex, 'TEdge, 'TVertexInfo, 'TEdgeInfo>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Instance members

+ + + + + + + + + + + + + + +
Instance memberDescription
+ + + EdgeInfos + +
+ Signature: IDictionary<'TEdge,'TEdgeInfo>
+ Modifiers: abstract
+
+ 		+ +
+ + + VertexInfos + +
+ Signature: IDictionary<'TVertex,'TVertexInfo>
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-ilayoutiterationeventargs-1.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-ilayoutiterationeventargs-1.html new file mode 100644 index 000000000..93bf4d3f9 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-ilayoutiterationeventargs-1.html @@ -0,0 +1,159 @@ + + + + + ILayoutIterationEventArgs<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

ILayoutIterationEventArgs<'TVertex>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Abort() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

If the user sets this value to true, the algorithm aborts ASAP.

+ + +
+ + + Iteration + +
+ Signature: int
+ Modifiers: abstract
+
+ 		+

Number of the actual iteration.

+ + +
+ + + Message + +
+ Signature: string
+ Modifiers: abstract
+
+ 		+

Message, textual representation of the status of the algorithm.

+ + +
+ + + StatusInPercent + +
+ Signature: float
+ Modifiers: abstract
+
+ 		+

Represent the status of the layout algorithm in percent.

+ + +
+ + + VertexPositions + +
+ Signature: IDictionary<'TVertex,Point>
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-imutablecompoundgraph-2.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-imutablecompoundgraph-2.html new file mode 100644 index 000000000..34f9d1e4e --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-imutablecompoundgraph-2.html @@ -0,0 +1,68 @@ + + + + + IMutableCompoundGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

IMutableCompoundGraph<'TVertex, 'TEdge>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-iparameterizedlayoutalgorithm-1.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-iparameterizedlayoutalgorithm-1.html new file mode 100644 index 000000000..ab9425561 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-iparameterizedlayoutalgorithm-1.html @@ -0,0 +1,91 @@ + + + + + IParameterizedLayoutAlgorithm<'TParam> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

IParameterizedLayoutAlgorithm<'TParam>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Instance members

+ + + + + + + + + + +
Instance memberDescription
+ + + Parameters + +
+ Signature: 'TParam
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-iparameterizedlayoutalgorithm.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-iparameterizedlayoutalgorithm.html new file mode 100644 index 000000000..cf49c036c --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-iparameterizedlayoutalgorithm.html @@ -0,0 +1,91 @@ + + + + + IParameterizedLayoutAlgorithm - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

IParameterizedLayoutAlgorithm

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Instance members

+ + + + + + + + + + +
Instance memberDescription
+ + + GetParameters() + +
+ Signature: unit -> ILayoutParameters
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-isomlayoutalgorithm-3.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-isomlayoutalgorithm-3.html new file mode 100644 index 000000000..fc8c3365b --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-isomlayoutalgorithm-3.html @@ -0,0 +1,142 @@ + + + + + ISOMLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

ISOMLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + + + + + +
ConstructorDescription
+ + + new(visitedGraph, oldParameters) + +
+ Signature: (visitedGraph:'TGraph * oldParameters:ISOMLayoutParameters) -> unit
+
+ 		+ +
+ + + new(...) + +
+ Signature: (visitedGraph:'TGraph * vertexPositions:IDictionary<'TVertex,Point> * oldParameters:ISOMLayoutParameters) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + +
Instance memberDescription
+ + + Compute(cancellationToken) + +
+ Signature: cancellationToken:CancellationToken -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + ResetGraph(vertices, edges) + +
+ Signature: (vertices:IEnumerable<'TVertex> * edges:IEnumerable<'TEdge>) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-isomlayoutparameters.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-isomlayoutparameters.html new file mode 100644 index 000000000..e302164bd --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-isomlayoutparameters.html @@ -0,0 +1,242 @@ + + + + + ISOMLayoutParameters - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

ISOMLayoutParameters

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + CoolingFactor() + +
+ Signature: unit -> unit
+
+ 		+

Default value is 2.

+ + +
+ + + Height() + +
+ Signature: unit -> unit
+
+ 		+

Height of the bounding box. Default value is 300.

+ + +
+ + + InitialAdaption() + +
+ Signature: unit -> unit
+
+ 		+

Default value is 0.9.

+ + +
+ + + InitialRadius() + +
+ Signature: unit -> unit
+
+ 		+

Default value is 5.

+ + +
+ + + MaxEpoch() + +
+ Signature: unit -> unit
+
+ 		+

Maximum iteration number. Default value is 2000.

+ + +
+ + + MinAdaption() + +
+ Signature: unit -> unit
+
+ 		+

Default value is 0.

+ + +
+ + + MinRadius() + +
+ Signature: unit -> unit
+
+ 		+

Minimal radius. Default value is 1.

+ + +
+ + + RadiusConstantTime() + +
+ Signature: unit -> unit
+
+ 		+

Radius constant time. Default value is 100.

+ + +
+ + + Width() + +
+ Signature: unit -> unit
+
+ 		+

Width of the bounding box. Default value is 300.

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-kklayoutalgorithm-3.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-kklayoutalgorithm-3.html new file mode 100644 index 000000000..c386fb58d --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-kklayoutalgorithm-3.html @@ -0,0 +1,142 @@ + + + + + KKLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

KKLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + + + + + +
ConstructorDescription
+ + + new(visitedGraph, oldParameters) + +
+ Signature: (visitedGraph:'TGraph * oldParameters:KKLayoutParameters) -> unit
+
+ 		+ +
+ + + new(...) + +
+ Signature: (visitedGraph:'TGraph * vertexPositions:IDictionary<'TVertex,Point> * oldParameters:KKLayoutParameters) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + +
Instance memberDescription
+ + + Compute(cancellationToken) + +
+ Signature: cancellationToken:CancellationToken -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + ResetGraph(vertices, edges) + +
+ Signature: (vertices:IEnumerable<'TVertex> * edges:IEnumerable<'TEdge>) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-kklayoutparameters.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-kklayoutparameters.html new file mode 100644 index 000000000..0b7f0cf1c --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-kklayoutparameters.html @@ -0,0 +1,223 @@ + + + + + KKLayoutParameters - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

KKLayoutParameters

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + AdjustForGravity() + +
+ Signature: unit -> unit
+
+ 		+

If true, then after the layout process, the vertices will be moved, so the barycenter will be +in the center point of the bounding box.

+ + +
+ + + DisconnectedMultiplier() + +
+ Signature: unit -> unit
+
+ 		+

Ideal distance between the disconnected points (1 is equal the ideal edge length).

+ + +
+ + + ExchangeVertices() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + Height() + +
+ Signature: unit -> unit
+
+ 		+

Height of the bounding box.

+ + +
+ + + K() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + LengthFactor() + +
+ Signature: unit -> unit
+
+ 		+

Multiplier of the ideal edge length. (With this parameter the user can modify the ideal edge length).

+ + +
+ + + MaxIterations() + +
+ Signature: unit -> unit
+
+ 		+

Maximum number of the iterations.

+ + +
+ + + Width() + +
+ Signature: unit -> unit
+
+ 		+

Width of the bounding box.

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutalgorithmbase-3.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutalgorithmbase-3.html new file mode 100644 index 000000000..da7df6dbc --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutalgorithmbase-3.html @@ -0,0 +1,192 @@ + + + + + LayoutAlgorithmBase<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

LayoutAlgorithmBase<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(visitedGraph, vertexPositions) + +
+ Signature: (visitedGraph:'TGraph * vertexPositions:IDictionary<'TVertex,Point>) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + NeedVertexSizes + +
+ Signature: bool
+ Modifiers: abstract
+
+ 		+ +
+ + + ResetGraph(vertices, edges) + +
+ Signature: (vertices:IEnumerable<'TVertex> * edges:IEnumerable<'TEdge>) -> unit
+ Modifiers: abstract
+
+ 		+

Updates graph from plain vertices and edges. Needed for easier inter-algorithm calls for complex algorithms.

+ + +
+ + + SupportsObjectFreeze + +
+ Signature: bool
+ Modifiers: abstract
+
+ 		+

Gets if current algorithm supports vertex freeze feature (part of VAESPS)

+ + +
+ + + VertexPositions() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + VertexSizes() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + VisitedGraph() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutcontext-3.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutcontext-3.html new file mode 100644 index 000000000..7ecd5a6d0 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutcontext-3.html @@ -0,0 +1,158 @@ + + + + + LayoutContext<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

LayoutContext<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(graph, positions, sizes, mode) + +
+ Signature: (graph:'TGraph * positions:IDictionary<'TVertex,Point> * sizes:IDictionary<'TVertex,Size> * mode:LayoutMode) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Graph() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + Mode() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + Positions() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + Sizes() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutdirection.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutdirection.html new file mode 100644 index 000000000..fa3ffd93f --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutdirection.html @@ -0,0 +1,68 @@ + + + + + LayoutDirection - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

LayoutDirection

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutiterationeventargs-2.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutiterationeventargs-2.html new file mode 100644 index 000000000..007e56713 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutiterationeventargs-2.html @@ -0,0 +1,267 @@ + + + + + LayoutIterationEventArgs<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

LayoutIterationEventArgs<'TVertex, 'TEdge>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + + + + + + + + + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + new(iteration, statusInPercent) + +
+ Signature: (iteration:int * statusInPercent:float) -> unit
+
+ 		+ +
+ + + new(iteration, statusInPercent, message) + +
+ Signature: (iteration:int * statusInPercent:float * message:string) -> unit
+
+ 		+ +
+ + + new(...) + +
+ Signature: (iteration:int * statusInPercent:float * vertexPositions:IDictionary<'TVertex,Point>) -> unit
+
+ 		+ +
+ + + new(...) + +
+ Signature: (iteration:int * statusInPercent:float * message:string * vertexPositions:IDictionary<'TVertex,Point>) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Abort() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

If the user sets this value to true, the algorithm aborts ASAP.

+ + +
+ + + GetEdgeInfo(edge) + +
+ Signature: edge:'TEdge -> obj
+ Modifiers: abstract
+
+ 		+ +
+ + + GetVertexInfo(vertex) + +
+ Signature: vertex:'TVertex -> obj
+ Modifiers: abstract
+
+ 		+ +
+ + + Iteration() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Number of the actual iteration.

+ + +
+ + + Message() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Message, textual representation of the status of the algorithm.

+ + +
+ + + StatusInPercent() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Represent the status of the layout algorithm in percent.

+ + +
+ + + VertexPositions() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutiterationeventargs-4.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutiterationeventargs-4.html new file mode 100644 index 000000000..e0abb9367 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutiterationeventargs-4.html @@ -0,0 +1,214 @@ + + + + + LayoutIterationEventArgs<'TVertex, 'TEdge, 'TVertexInfo, 'TEdgeInfo> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

LayoutIterationEventArgs<'TVertex, 'TEdge, 'TVertexInfo, 'TEdgeInfo>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + + + + + + + + + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + new(iteration, statusInPercent) + +
+ Signature: (iteration:int * statusInPercent:float) -> unit
+
+ 		+ +
+ + + new(iteration, statusInPercent, message) + +
+ Signature: (iteration:int * statusInPercent:float * message:string) -> unit
+
+ 		+ +
+ + + new(...) + +
+ Signature: (iteration:int * statusInPercent:float * vertexPositions:IDictionary<'TVertex,Point>) -> unit
+
+ 		+ +
+ + + new(...) + +
+ Signature: (iteration:int * statusInPercent:float * message:string * vertexPositions:IDictionary<'TVertex,Point> * vertexInfos:IDictionary<'TVertex,'TVertexInfo> * edgeInfos:IDictionary<'TEdge,'TEdgeInfo>) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + EdgeInfos() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + GetEdgeInfo(edge) + +
+ Signature: edge:'TEdge -> obj
+ Modifiers: abstract
+
+ 		+ +
+ + + GetVertexInfo(vertex) + +
+ Signature: vertex:'TVertex -> obj
+ Modifiers: abstract
+
+ 		+ +
+ + + VertexInfos() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutmode.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutmode.html new file mode 100644 index 000000000..af5173e94 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutmode.html @@ -0,0 +1,68 @@ + + + + + LayoutMode - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

LayoutMode

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutparametersbase.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutparametersbase.html new file mode 100644 index 000000000..40299c6be --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoutparametersbase.html @@ -0,0 +1,142 @@ + + + + + LayoutParametersBase - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

LayoutParametersBase

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Clone() + +
+ Signature: unit -> obj
+ Modifiers: abstract
+
+ 		+ +
+ + + PropertyChanged + +
+ Signature: IEvent<PropertyChangedEventHandler,PropertyChangedEventArgs>
+
+ 		+ +
+ + + Seed() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoututil.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoututil.html new file mode 100644 index 000000000..9022af15a --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-layoututil.html @@ -0,0 +1,132 @@ + + + + + LayoutUtil - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

LayoutUtil

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Static members

+ + + + + + + + + + + + + + + + + + + + + + +
Static memberDescription
+ + + BiLayerCrossCount(...) + +
+ Signature: (pairs:IEnumerable<Pair> * firstLayerVertexCount:int * secondLayerVertexCount:int) -> int
+
+ 		+ +
+ + + BiLayerCrossCount(edgePairs) + +
+ Signature: edgePairs:List<Pair> -> int
+
+ 		+ +
+ + + GetClippingPoint(size, s, t) + +
+ Signature: (size:Size * s:Point * t:Point) -> Point
+
+ 		+ +
+ + + IsSameDirection(a, b) + +
+ Signature: (a:Vector * b:Vector) -> bool
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-linloglayoutalgorithm-3.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-linloglayoutalgorithm-3.html new file mode 100644 index 000000000..08fe7b52d --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-linloglayoutalgorithm-3.html @@ -0,0 +1,142 @@ + + + + + LinLogLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

LinLogLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + + + + + +
ConstructorDescription
+ + + new(visitedGraph) + +
+ Signature: visitedGraph:'TGraph -> unit
+
+ 		+ +
+ + + new(visitedGraph, positions, parameters) + +
+ Signature: (visitedGraph:'TGraph * positions:IDictionary<'TVertex,Point> * parameters:LinLogLayoutParameters) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + +
Instance memberDescription
+ + + Compute(cancellationToken) + +
+ Signature: cancellationToken:CancellationToken -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + ResetGraph(vertices, edges) + +
+ Signature: (vertices:IEnumerable<'TVertex> * edges:IEnumerable<'TEdge>) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-linloglayoutparameters.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-linloglayoutparameters.html new file mode 100644 index 000000000..a8e844e29 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-linloglayoutparameters.html @@ -0,0 +1,154 @@ + + + + + LinLogLayoutParameters - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

LinLogLayoutParameters

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + AttractionExponent() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + GravitationMultiplier() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + IterationCount() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + RepulsiveExponent() + +
+ Signature: unit -> unit
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-pair.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-pair.html new file mode 100644 index 000000000..8db2d17a1 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-pair.html @@ -0,0 +1,90 @@ + + + + + Pair - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

Pair

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-parameterizedlayoutalgorithmbase-4.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-parameterizedlayoutalgorithmbase-4.html new file mode 100644 index 000000000..121c3e489 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-parameterizedlayoutalgorithmbase-4.html @@ -0,0 +1,159 @@ + + + + + ParameterizedLayoutAlgorithmBase<'TVertex, 'TEdge, 'TGraph, 'TParam> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

ParameterizedLayoutAlgorithmBase<'TVertex, 'TEdge, 'TGraph, 'TParam>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + + + + + +
ConstructorDescription
+ + + new(visitedGraph) + +
+ Signature: visitedGraph:'TGraph -> unit
+
+ 		+ +
+ + + new(...) + +
+ Signature: (visitedGraph:'TGraph * vertexPositions:IDictionary<'TVertex,Point> * oldParameters:'TParam) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + DefaultParameters + +
+ Signature: 'TParam
+ Modifiers: abstract
+
+ 		+ +
+ + + GetParameters() + +
+ Signature: unit -> ILayoutParameters
+ Modifiers: abstract
+
+ 		+ +
+ + + Parameters() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Parameters of the algorithm. For more information see .

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-positioncalculationmethodtypes.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-positioncalculationmethodtypes.html new file mode 100644 index 000000000..a619c0329 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-positioncalculationmethodtypes.html @@ -0,0 +1,68 @@ + + + + + PositionCalculationMethodTypes - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

PositionCalculationMethodTypes

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-randomlayoutalgorithm-3.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-randomlayoutalgorithm-3.html new file mode 100644 index 000000000..fdb06d7cc --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-randomlayoutalgorithm-3.html @@ -0,0 +1,172 @@ + + + + + RandomLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

RandomLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + + + + + +
ConstructorDescription
+ + + new(graph, positions, prms) + +
+ Signature: (graph:'TGraph * positions:IDictionary<'TVertex,Point> * prms:RandomLayoutAlgorithmParams) -> unit
+
+ 		+ +
+ + + new(prms) + +
+ Signature: prms:RandomLayoutAlgorithmParams -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Compute(cancellationToken) + +
+ Signature: cancellationToken:CancellationToken -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + NeedVertexSizes + +
+ Signature: bool
+ Modifiers: abstract
+
+ 		+ +
+ + + ResetGraph(vertices, edges) + +
+ Signature: (vertices:IEnumerable<'TVertex> * edges:IEnumerable<'TEdge>) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + SupportsObjectFreeze + +
+ Signature: bool
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-randomlayoutalgorithmparams.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-randomlayoutalgorithmparams.html new file mode 100644 index 000000000..b0cac3859 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-randomlayoutalgorithmparams.html @@ -0,0 +1,114 @@ + + + + + RandomLayoutAlgorithmParams - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

RandomLayoutAlgorithmParams

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + +
Instance memberDescription
+ + + Bounds() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets layout bounds

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-simpletreelayoutalgorithm-3.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-simpletreelayoutalgorithm-3.html new file mode 100644 index 000000000..438d04d6f --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-simpletreelayoutalgorithm-3.html @@ -0,0 +1,128 @@ + + + + + SimpleTreeLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

SimpleTreeLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(...) + +
+ Signature: (visitedGraph:'TGraph * vertexPositions:IDictionary<'TVertex,Point> * vertexSizes:IDictionary<'TVertex,Size> * parameters:SimpleTreeLayoutParameters) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + +
Instance memberDescription
+ + + Compute(cancellationToken) + +
+ Signature: cancellationToken:CancellationToken -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + ResetGraph(vertices, edges) + +
+ Signature: (vertices:IEnumerable<'TVertex> * edges:IEnumerable<'TEdge>) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-simpletreelayoutparameters.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-simpletreelayoutparameters.html new file mode 100644 index 000000000..0b63969ee --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-simpletreelayoutparameters.html @@ -0,0 +1,190 @@ + + + + + SimpleTreeLayoutParameters - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

SimpleTreeLayoutParameters

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Direction() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets the direction of the layout.

+ + +
+ + + LayerGap() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets the gap between the layers.

+ + +
+ + + OptimizeWidthAndHeight() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + SpanningTreeGeneration() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets the direction of the layout.

+ + +
+ + + VertexGap() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets the gap between the vertices.

+ + +
+ + + WidthPerHeight() + +
+ Signature: unit -> unit
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-spanningtreegeneration.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-spanningtreegeneration.html new file mode 100644 index 000000000..22d2bd2f8 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-spanningtreegeneration.html @@ -0,0 +1,68 @@ + + + + + SpanningTreeGeneration - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

SpanningTreeGeneration

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-sugiyamaedgeroutings.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-sugiyamaedgeroutings.html new file mode 100644 index 000000000..2fe021a64 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-sugiyamaedgeroutings.html @@ -0,0 +1,68 @@ + + + + + SugiyamaEdgeRoutings - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

SugiyamaEdgeRoutings

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-sugiyamalayoutalgorithm-3.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-sugiyamalayoutalgorithm-3.html new file mode 100644 index 000000000..66c1e68f7 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-sugiyamalayoutalgorithm-3.html @@ -0,0 +1,156 @@ + + + + + SugiyamaLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

SugiyamaLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + + + + + +
ConstructorDescription
+ + + new(...) + +
+ Signature: (visitedGraph:'TGraph * vertexSizes:IDictionary<'TVertex,Size> * vertexPositions:IDictionary<'TVertex,Point> * parameters:SugiyamaLayoutParameters * edgePredicate:Func<'TEdge,EdgeTypes>) -> unit
+
+ 		+ +
+ + + new(...) + +
+ Signature: (visitedGraph:'TGraph * vertexSizes:IDictionary<'TVertex,Size> * parameters:SugiyamaLayoutParameters * edgePredicate:Func<'TEdge,EdgeTypes>) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Compute(cancellationToken) + +
+ Signature: cancellationToken:CancellationToken -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + EdgeRoutes() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + ResetGraph(vertices, edges) + +
+ Signature: (vertices:IEnumerable<'TVertex> * edges:IEnumerable<'TEdge>) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-sugiyamalayoutparameters.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-sugiyamalayoutparameters.html new file mode 100644 index 000000000..fc5b75ad2 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-sugiyamalayoutparameters.html @@ -0,0 +1,272 @@ + + + + + SugiyamaLayoutParameters - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

SugiyamaLayoutParameters

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+

Parameters of the Sugiyama layout.

+ +
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + BaryCenteringByPosition() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + DirtyRound() + +
+ Signature: unit -> unit
+
+ 		+

Start with a dirty round (allow to increase the number of the edge-crossings, but +try to put the vertices to it's barycenter).

+ + +
+ + + HorizontalGap() + +
+ Signature: unit -> unit
+
+ 		+

Minimal horizontal gap between the vertices.

+ + +
+ + + MaxWidth() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + MinimizeHierarchicalEdgeLong() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + Phase1IterationCount() + +
+ Signature: unit -> unit
+
+ 		+

Maximum iteration count in the Phase 1 of the Sugiyama algo.

+ + +
+ + + Phase2IterationCount() + +
+ Signature: unit -> unit
+
+ 		+

Maximum iteration count in the Phase 2 of the Sugiyama algo.

+ + +
+ + + PositionCalculationMethod() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + Prompting() + +
+ Signature: unit -> unit
+
+ 		+

Prompting constraint type for the starting positions.

+ + +
+ + + Simplify() + +
+ Signature: unit -> unit
+
+ 		+

Gets or sets the 'Simplify' parameter. +If true than the edges which directly goes to a vertex which could +be reached on another path (which is not directly goes to that vertex, there's some plus vertices) +will not be count in the layout algorithm.

+ + +
+ + + VerticalGap() + +
+ Signature: unit -> unit
+
+ 		+

Minimal vertical gap between the vertices.

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-testingcompoundlayoutiterationeventargs-4.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-testingcompoundlayoutiterationeventargs-4.html new file mode 100644 index 000000000..274d03eba --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-testingcompoundlayoutiterationeventargs-4.html @@ -0,0 +1,157 @@ + + + + + TestingCompoundLayoutIterationEventArgs<'TVertex, 'TEdge, 'TVertexInfo, 'TEdgeInfo> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

TestingCompoundLayoutIterationEventArgs<'TVertex, 'TEdge, 'TVertexInfo, 'TEdgeInfo>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(...) + +
+ Signature: (iteration:int * statusInPercent:float * message:string * vertexPositions:IDictionary<'TVertex,Point> * innerCanvasSizes:IDictionary<'TVertex,Size> * vertexInfos:IDictionary<'TVertex,'TVertexInfo> * gravitationCenter:Point) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + EdgeInfos + +
+ Signature: IDictionary<'TEdge,'TEdgeInfo>
+ Modifiers: abstract
+
+ 		+ +
+ + + GetVertexInfo(vertex) + +
+ Signature: vertex:'TVertex -> obj
+ Modifiers: abstract
+
+ 		+ +
+ + + GravitationCenter() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + VertexInfos + +
+ Signature: IDictionary<'TVertex,'TVertexInfo>
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-layoutalgorithms-testingcompoundvertexinfo.html b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-testingcompoundvertexinfo.html new file mode 100644 index 000000000..b37fb16a8 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-layoutalgorithms-testingcompoundvertexinfo.html @@ -0,0 +1,154 @@ + + + + + TestingCompoundVertexInfo - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

TestingCompoundVertexInfo

+

+ Namespace: GraphX.PCL.Logic.Algorithms.LayoutAlgorithms
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(...) + +
+ Signature: (springForce:Vector * repulsionForce:Vector * gravityForce:Vector * applicationForce:Vector) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + ApplicationForce() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + GravityForce() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + RepulsionForce() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + SpringForce() + +
+ Signature: unit -> unit
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-overlapremoval-fsaalgorithm-1.html b/reference/graphx-pcl-logic-algorithms-overlapremoval-fsaalgorithm-1.html new file mode 100644 index 000000000..92a05a8bd --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-overlapremoval-fsaalgorithm-1.html @@ -0,0 +1,104 @@ + + + + + FSAAlgorithm<'TObject> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

FSAAlgorithm<'TObject>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.OverlapRemoval
+

+
+
+

Constructors

+ + + + + + + + + + + + + + +
ConstructorDescription
+ + + new(rectangles, parameters) + +
+ Signature: (rectangles:IDictionary<'TObject,Rect> * parameters:IOverlapRemovalParameters) -> unit
+
+ 		+ +
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-overlapremoval-fsaalgorithm-2.html b/reference/graphx-pcl-logic-algorithms-overlapremoval-fsaalgorithm-2.html new file mode 100644 index 000000000..6d0c130ae --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-overlapremoval-fsaalgorithm-2.html @@ -0,0 +1,92 @@ + + + + + FSAAlgorithm<'TObject, 'TParam> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

FSAAlgorithm<'TObject, 'TParam>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.OverlapRemoval
+

+
+

http://adaptagrams.svn.sourceforge.net/viewvc/adaptagrams/trunk/RectangleOverlapSolver/placement/FSA.java?view=markup

+ +
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(rectangles, parameters) + +
+ Signature: (rectangles:IDictionary<'TObject,Rect> * parameters:'TParam) -> unit
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-overlapremoval-ioverlapremovalcontext-1.html b/reference/graphx-pcl-logic-algorithms-overlapremoval-ioverlapremovalcontext-1.html new file mode 100644 index 000000000..79a86c9e8 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-overlapremoval-ioverlapremovalcontext-1.html @@ -0,0 +1,91 @@ + + + + + IOverlapRemovalContext<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

IOverlapRemovalContext<'TVertex>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.OverlapRemoval
+

+
+
+

Instance members

+ + + + + + + + + + +
Instance memberDescription
+ + + Rectangles + +
+ Signature: IDictionary<'TVertex,Rect>
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-overlapremoval-onewayfsaalgorithm-1.html b/reference/graphx-pcl-logic-algorithms-overlapremoval-onewayfsaalgorithm-1.html new file mode 100644 index 000000000..f853e1bee --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-overlapremoval-onewayfsaalgorithm-1.html @@ -0,0 +1,90 @@ + + + + + OneWayFSAAlgorithm<'TObject> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

OneWayFSAAlgorithm<'TObject>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.OverlapRemoval
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(rectangles, parameters) + +
+ Signature: (rectangles:IDictionary<'TObject,Rect> * parameters:OneWayFSAParameters) -> unit
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-overlapremoval-onewayfsaparameters.html b/reference/graphx-pcl-logic-algorithms-overlapremoval-onewayfsaparameters.html new file mode 100644 index 000000000..2cdea592b --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-overlapremoval-onewayfsaparameters.html @@ -0,0 +1,112 @@ + + + + + OneWayFSAParameters - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

OneWayFSAParameters

+

+ Namespace: GraphX.PCL.Logic.Algorithms.OverlapRemoval
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + +
Instance memberDescription
+ + + Way() + +
+ Signature: unit -> unit
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-overlapremoval-onewayfsawayenum.html b/reference/graphx-pcl-logic-algorithms-overlapremoval-onewayfsawayenum.html new file mode 100644 index 000000000..776a795a2 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-overlapremoval-onewayfsawayenum.html @@ -0,0 +1,68 @@ + + + + + OneWayFSAWayEnum - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

OneWayFSAWayEnum

+

+ Namespace: GraphX.PCL.Logic.Algorithms.OverlapRemoval
+

+
+
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-overlapremoval-overlapremovalalgorithmbase-2.html b/reference/graphx-pcl-logic-algorithms-overlapremoval-overlapremovalalgorithmbase-2.html new file mode 100644 index 000000000..d31fcab72 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-overlapremoval-overlapremovalalgorithmbase-2.html @@ -0,0 +1,194 @@ + + + + + OverlapRemovalAlgorithmBase<'TObject, 'TParam> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

OverlapRemovalAlgorithmBase<'TObject, 'TParam>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.OverlapRemoval
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(rectangles, parameters) + +
+ Signature: (rectangles:IDictionary<'TObject,Rect> * parameters:'TParam) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Compute(cancellationToken) + +
+ Signature: cancellationToken:CancellationToken -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + GetParameters() + +
+ Signature: unit -> IOverlapRemovalParameters
+ Modifiers: abstract
+
+ 		+ +
+ + + Initialize(rectangles, parameters) + +
+ Signature: (rectangles:IDictionary<'TObject,Rect> * parameters:'TParam) -> unit
+ Modifiers: abstract
+
+ 		+

Initialize algorithm initial data

+ + +
+ + + Initialize(rectangles) + +
+ Signature: rectangles:IDictionary<'TObject,Rect> -> unit
+ Modifiers: abstract
+
+ 		+

Initialize algorithm initial data

+ + +
+ + + Parameters() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Algorithm parameters

+ + +
+ + + Rectangles() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-overlapremoval-overlapremovalcontext-1.html b/reference/graphx-pcl-logic-algorithms-overlapremoval-overlapremovalcontext-1.html new file mode 100644 index 000000000..ceb8b41a7 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-overlapremoval-overlapremovalcontext-1.html @@ -0,0 +1,113 @@ + + + + + OverlapRemovalContext<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

OverlapRemovalContext<'TVertex>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.OverlapRemoval
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(rectangles) + +
+ Signature: rectangles:IDictionary<'TVertex,Rect> -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + +
Instance memberDescription
+ + + Rectangles() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-overlapremoval-overlapremovalhelper.html b/reference/graphx-pcl-logic-algorithms-overlapremoval-overlapremovalhelper.html new file mode 100644 index 000000000..534be7040 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-overlapremoval-overlapremovalhelper.html @@ -0,0 +1,90 @@ + + + + + OverlapRemovalHelper - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

OverlapRemovalHelper

+

+ Namespace: GraphX.PCL.Logic.Algorithms.OverlapRemoval
+

+
+
+

Static members

+ + + + + + + + + + +
Static memberDescription
+ + + GetCenter(r) + +
+ Signature: r:Rect -> Point
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-overlapremoval-overlapremovalparameters.html b/reference/graphx-pcl-logic-algorithms-overlapremoval-overlapremovalparameters.html new file mode 100644 index 000000000..35f7b30e1 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-overlapremoval-overlapremovalparameters.html @@ -0,0 +1,161 @@ + + + + + OverlapRemovalParameters - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

OverlapRemovalParameters

+

+ Namespace: GraphX.PCL.Logic.Algorithms.OverlapRemoval
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Clone() + +
+ Signature: unit -> obj
+ Modifiers: abstract
+
+ 		+ +
+ + + HorizontalGap() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets minimal horizontal distance between vertices

+ + +
+ + + PropertyChanged + +
+ Signature: IEvent<PropertyChangedEventHandler,PropertyChangedEventArgs>
+
+ 		+ +
+ + + VerticalGap() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets minimal vertical distance between vertices

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-overlapremoval-rectanglewrapper-1.html b/reference/graphx-pcl-logic-algorithms-overlapremoval-rectanglewrapper-1.html new file mode 100644 index 000000000..7f380ab07 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-overlapremoval-rectanglewrapper-1.html @@ -0,0 +1,159 @@ + + + + + RectangleWrapper<'TObject> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

RectangleWrapper<'TObject>

+

+ Namespace: GraphX.PCL.Logic.Algorithms.OverlapRemoval
+

+
+

A System.Windows.Rect egy struktъra, ezйrt a heap-en tбrolуdik. Bizonyos esetekben ez nem +szerencsйs, нgy szьksйg van erre a wrapper osztбlyra. Mivel ez class, ezйrt nem +йrtйk szerinti бtadбs van.

+ +
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(rectangle, id) + +
+ Signature: (rectangle:Rect * id:'TObject) -> unit
+
+ 		+ + +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + Center + +
+ Signature: Point
+
+ 		+ +
+ + + CenterX + +
+ Signature: float
+
+ 		+ +
+ + + CenterY + +
+ Signature: float
+
+ 		+ +
+ + + Id + +
+ Signature: 'TObject
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-softmutablebidirectionalgraph-2.html b/reference/graphx-pcl-logic-algorithms-softmutablebidirectionalgraph-2.html new file mode 100644 index 000000000..357dc8cde --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-softmutablebidirectionalgraph-2.html @@ -0,0 +1,557 @@ + + + + + SoftMutableBidirectionalGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

SoftMutableBidirectionalGraph<'TVertex, 'TEdge>

+

+ Namespace: GraphX.PCL.Logic.Algorithms
+

+
+
+

Constructors

+ + + + + + + + + + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + new(allowParallelEdges) + +
+ Signature: allowParallelEdges:bool -> unit
+
+ 		+ +
+ + + new(allowParallelEdges, vertexCapacity) + +
+ Signature: (allowParallelEdges:bool * vertexCapacity:int) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + EdgeHidden + +
+ Signature: EdgeAction<'TVertex,'TEdge>
+
+ 		+ +
+ + + EdgeUnhidden + +
+ Signature: EdgeAction<'TVertex,'TEdge>
+
+ 		+ +
+ + + HiddenEdgeCount + +
+ Signature: int
+ Modifiers: abstract
+
+ 		+ +
+ + + HiddenEdgeCountOf(v) + +
+ Signature: v:'TVertex -> int
+ Modifiers: abstract
+
+ 		+ +
+ + + HiddenEdges + +
+ Signature: IEnumerable<'TEdge>
+ Modifiers: abstract
+
+ 		+ +
+ + + HiddenEdgesOf(v) + +
+ Signature: v:'TVertex -> IEnumerable<'TEdge>
+ Modifiers: abstract
+
+ 		+ +
+ + + HiddenVertexCount + +
+ Signature: int
+ Modifiers: abstract
+
+ 		+ +
+ + + HiddenVertices + +
+ Signature: IEnumerable<'TVertex>
+ Modifiers: abstract
+
+ 		+ +
+ + + HideEdge(e) + +
+ Signature: e:'TEdge -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + HideEdge(e, tag) + +
+ Signature: (e:'TEdge * tag:string) -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + HideEdges(edges) + +
+ Signature: edges:IEnumerable<'TEdge> -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + HideEdges(edges, tag) + +
+ Signature: (edges:IEnumerable<'TEdge> * tag:string) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + HideEdgesIf(predicate, tag) + +
+ Signature: (predicate:Func<'TEdge,bool> * tag:string) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + HideVertex(v) + +
+ Signature: v:'TVertex -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + HideVertex(v, tag) + +
+ Signature: (v:'TVertex * tag:string) -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + HideVertices(vertices) + +
+ Signature: vertices:IEnumerable<'TVertex> -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + HideVertices(vertices, tag) + +
+ Signature: (vertices:IEnumerable<'TVertex> * tag:string) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + HideVerticesIf(predicate, tag) + +
+ Signature: (predicate:Func<'TVertex,bool> * tag:string) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + IsHiddenEdge(e) + +
+ Signature: e:'TEdge -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + IsHiddenVertex(v) + +
+ Signature: v:'TVertex -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + Unhide(tag) + +
+ Signature: tag:string -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + UnhideAll() + +
+ Signature: unit -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + UnhideEdge(e) + +
+ Signature: e:'TEdge -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + UnhideEdges(edges) + +
+ Signature: edges:IEnumerable<'TEdge> -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + UnhideEdgesIf(predicate) + +
+ Signature: predicate:Func<'TEdge,bool> -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + UnhideVertex(v) + +
+ Signature: v:'TVertex -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + UnhideVertexAndEdges(v) + +
+ Signature: v:'TVertex -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + VertexHidden + +
+ Signature: VertexAction<'TVertex>
+
+ 		+ +
+ + + VertexUnhidden + +
+ Signature: VertexAction<'TVertex>
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-softmutablehierarchicalgraph-2.html b/reference/graphx-pcl-logic-algorithms-softmutablehierarchicalgraph-2.html new file mode 100644 index 000000000..1804682af --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-softmutablehierarchicalgraph-2.html @@ -0,0 +1,557 @@ + + + + + SoftMutableHierarchicalGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

SoftMutableHierarchicalGraph<'TVertex, 'TEdge>

+

+ Namespace: GraphX.PCL.Logic.Algorithms
+

+
+
+

Constructors

+ + + + + + + + + + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+ + + new(allowParallelEdges) + +
+ Signature: allowParallelEdges:bool -> unit
+
+ 		+ +
+ + + new(allowParallelEdges, vertexCapacity) + +
+ Signature: (allowParallelEdges:bool * vertexCapacity:int) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + EdgeHidden + +
+ Signature: EdgeAction<'TVertex,'TEdge>
+
+ 		+ +
+ + + EdgeUnhidden + +
+ Signature: EdgeAction<'TVertex,'TEdge>
+
+ 		+ +
+ + + HiddenEdgeCount + +
+ Signature: int
+ Modifiers: abstract
+
+ 		+ +
+ + + HiddenEdgeCountOf(v) + +
+ Signature: v:'TVertex -> int
+ Modifiers: abstract
+
+ 		+ +
+ + + HiddenEdges + +
+ Signature: IEnumerable<'TEdge>
+ Modifiers: abstract
+
+ 		+ +
+ + + HiddenEdgesOf(v) + +
+ Signature: v:'TVertex -> IEnumerable<'TEdge>
+ Modifiers: abstract
+
+ 		+ +
+ + + HiddenVertexCount + +
+ Signature: int
+ Modifiers: abstract
+
+ 		+ +
+ + + HiddenVertices + +
+ Signature: IEnumerable<'TVertex>
+ Modifiers: abstract
+
+ 		+ +
+ + + HideEdge(e) + +
+ Signature: e:'TEdge -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + HideEdge(e, tag) + +
+ Signature: (e:'TEdge * tag:string) -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + HideEdges(edges) + +
+ Signature: edges:IEnumerable<'TEdge> -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + HideEdges(edges, tag) + +
+ Signature: (edges:IEnumerable<'TEdge> * tag:string) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + HideEdgesIf(predicate, tag) + +
+ Signature: (predicate:Func<'TEdge,bool> * tag:string) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + HideVertex(v) + +
+ Signature: v:'TVertex -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + HideVertex(v, tag) + +
+ Signature: (v:'TVertex * tag:string) -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + HideVertices(vertices) + +
+ Signature: vertices:IEnumerable<'TVertex> -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + HideVertices(vertices, tag) + +
+ Signature: (vertices:IEnumerable<'TVertex> * tag:string) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + HideVerticesIf(predicate, tag) + +
+ Signature: (predicate:Func<'TVertex,bool> * tag:string) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + IsHiddenEdge(e) + +
+ Signature: e:'TEdge -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + IsHiddenVertex(v) + +
+ Signature: v:'TVertex -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + Unhide(tag) + +
+ Signature: tag:string -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + UnhideAll() + +
+ Signature: unit -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + UnhideEdge(e) + +
+ Signature: e:'TEdge -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + UnhideEdges(edges) + +
+ Signature: edges:IEnumerable<'TEdge> -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + UnhideEdgesIf(predicate) + +
+ Signature: predicate:Func<'TEdge,bool> -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + UnhideVertex(v) + +
+ Signature: v:'TVertex -> bool
+ Modifiers: abstract
+
+ 		+ +
+ + + UnhideVertexAndEdges(v) + +
+ Signature: v:'TVertex -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + VertexHidden + +
+ Signature: VertexAction<'TVertex>
+
+ 		+ +
+ + + VertexUnhidden + +
+ Signature: VertexAction<'TVertex>
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-typededge-1.html b/reference/graphx-pcl-logic-algorithms-typededge-1.html new file mode 100644 index 000000000..716437be9 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-typededge-1.html @@ -0,0 +1,128 @@ + + + + + TypedEdge<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

TypedEdge<'TVertex>

+

+ Namespace: GraphX.PCL.Logic.Algorithms
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(source, target, type) + +
+ Signature: (source:'TVertex * target:'TVertex * type:EdgeTypes) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + +
Instance memberDescription
+ + + ToString() + +
+ Signature: unit -> string
+ Modifiers: abstract
+
+ 		+ +
+ + + Type + +
+ Signature: EdgeTypes
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-algorithms-wrappedvertex-1.html b/reference/graphx-pcl-logic-algorithms-wrappedvertex-1.html new file mode 100644 index 000000000..bce55b124 --- /dev/null +++ b/reference/graphx-pcl-logic-algorithms-wrappedvertex-1.html @@ -0,0 +1,112 @@ + + + + + WrappedVertex<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

WrappedVertex<'TVertex>

+

+ Namespace: GraphX.PCL.Logic.Algorithms
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(original) + +
+ Signature: original:'TVertex -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + +
Instance memberDescription
+ + + Original + +
+ Signature: 'TVertex
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-helpers-reflectionhelper.html b/reference/graphx-pcl-logic-helpers-reflectionhelper.html new file mode 100644 index 000000000..dbaf60c69 --- /dev/null +++ b/reference/graphx-pcl-logic-helpers-reflectionhelper.html @@ -0,0 +1,90 @@ + + + + + ReflectionHelper - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

ReflectionHelper

+

+ Namespace: GraphX.PCL.Logic.Helpers
+

+
+
+

Static members

+ + + + + + + + + + +
Static memberDescription
+ + + CreateDefaultGraphInstance() + +
+ Signature: unit -> 'T
+ Type parameters: 'T
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-helpers-typeextensions.html b/reference/graphx-pcl-logic-helpers-typeextensions.html new file mode 100644 index 000000000..8eb4ed435 --- /dev/null +++ b/reference/graphx-pcl-logic-helpers-typeextensions.html @@ -0,0 +1,90 @@ + + + + + TypeExtensions - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

TypeExtensions

+

+ Namespace: GraphX.PCL.Logic.Helpers
+

+
+
+

Static members

+ + + + + + + + + + +
Static memberDescription
+ + + ForEach(list, func) + +
+ Signature: (list:IEnumerable<'T> * func:Action<'T>) -> unit
+ Type parameters: 'T
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-models-algorithmfactory-3.html b/reference/graphx-pcl-logic-models-algorithmfactory-3.html new file mode 100644 index 000000000..122bb85b4 --- /dev/null +++ b/reference/graphx-pcl-logic-models-algorithmfactory-3.html @@ -0,0 +1,296 @@ + + + + + AlgorithmFactory<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

AlgorithmFactory<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Logic.Models
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + CreateEdgeRoutingAlgorithm(...) + +
+ Signature: (newAlgorithmType:EdgeRoutingAlgorithmTypeEnum * graphArea:Rect * iGraph:'TGraph * positions:IDictionary<'TVertex,Point> * rectangles:IDictionary<'TVertex,Rect> * parameters:IEdgeRoutingParameters) -> IExternalEdgeRouting<'TVertex,'TEdge>
+ Modifiers: abstract
+
+ 		+ +
+ + + CreateEdgeRoutingParameters(...) + +
+ Signature: algorithmType:EdgeRoutingAlgorithmTypeEnum -> IEdgeRoutingParameters
+ Modifiers: abstract
+
+ 		+ +
+ + + CreateFSAA(rectangles, horGap, vertGap) + +
+ Signature: (rectangles:IDictionary<'T,Rect> * horGap:float32 * vertGap:float32) -> IOverlapRemovalAlgorithm<'T>
+ Modifiers: abstract
+
+ 		+ +
+ + + CreateFSAA(horGap, vertGap) + +
+ Signature: (horGap:float32 * vertGap:float32) -> IOverlapRemovalAlgorithm<'T,IOverlapRemovalParameters>
+ Modifiers: abstract
+
+ 		+

Creates uninitialized FSAA overlap removal algorithm instance

+ + +
+ + + CreateLayoutAlgorithm(...) + +
+ Signature: (newAlgorithmType:LayoutAlgorithmTypeEnum * iGraph:'TGraph * positions:IDictionary<'TVertex,Point> * sizes:IDictionary<'TVertex,Size> * parameters:ILayoutParameters) -> ILayoutAlgorithm<'TVertex,'TEdge,'TGraph>
+ Modifiers: abstract
+
+ 		+

Generate and initialize layout algorithm

+ + +
+ + + CreateLayoutParameters(algorithmType) + +
+ Signature: algorithmType:LayoutAlgorithmTypeEnum -> ILayoutParameters
+ Modifiers: abstract
+
+ 		+

Creates parameters data for layout algorithm

+ + +
+ + + CreateOverlapRemovalAlgorithm(...) + +
+ Signature: newAlgorithmType:OverlapRemovalAlgorithmTypeEnum -> IOverlapRemovalAlgorithm<'TVertex>
+ Modifiers: abstract
+
+ 		+

Creates uninitialized overlap removal algorithm

+ + +
+ + + CreateOverlapRemovalAlgorithm(...) + +
+ Signature: (newAlgorithmType:OverlapRemovalAlgorithmTypeEnum * rectangles:IDictionary<'TVertex,Rect> * parameters:IOverlapRemovalParameters) -> IOverlapRemovalAlgorithm<'TVertex>
+ Modifiers: abstract
+
+ 		+

Create and initialize overlap removal algorithm

+ + +
+ + + CreateOverlapRemovalParameters(...) + +
+ Signature: algorithmType:OverlapRemovalAlgorithmTypeEnum -> IOverlapRemovalParameters
+ Modifiers: abstract
+
+ 		+

Create overlap removal algorithm parameters

+ + +
+ + + NeedEdgeRouting(algorithmType) + +
+ Signature: algorithmType:LayoutAlgorithmTypeEnum -> bool
+ Modifiers: abstract
+
+ 		+

Returns True if specified layout algorithm ever needs edge routing pass

+ + +
+ + + NeedOverlapRemoval(algorithmType) + +
+ Signature: algorithmType:LayoutAlgorithmTypeEnum -> bool
+ Modifiers: abstract
+
+ 		+

Returns True if specified layout algorithm ever needs overlap removal pass

+ + +
+ + + NeedSizes(algorithmType) + +
+ Signature: algorithmType:LayoutAlgorithmTypeEnum -> bool
+ Modifiers: abstract
+
+ 		+

Returns True if specified layout algorithm needs vertex size data for its calculations

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-models-algorithmstorage-2.html b/reference/graphx-pcl-logic-models-algorithmstorage-2.html new file mode 100644 index 000000000..08b3a718f --- /dev/null +++ b/reference/graphx-pcl-logic-models-algorithmstorage-2.html @@ -0,0 +1,203 @@ + + + + + AlgorithmStorage<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

AlgorithmStorage<'TVertex, 'TEdge>

+

+ Namespace: GraphX.PCL.Logic.Models
+

+
+
+

Constructors

+ + + + + + + + + + +
ConstructorDescription
+ + + new(layout, or, er) + +
+ Signature: (layout:IExternalLayout<'TVertex,'TEdge> * or:IExternalOverlapRemoval<'TVertex> * er:IExternalEdgeRouting<'TVertex,'TEdge>) -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + AddSingleEdge(edge, routingPoints) + +
+ Signature: (edge:'TEdge * routingPoints:Point []) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + AddSingleVertex(vertex, position, size) + +
+ Signature: (vertex:'TVertex * position:Point * size:Rect) -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + EdgeRouting() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + Layout() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + OverlapRemoval() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + RemoveSingleEdge(edge) + +
+ Signature: edge:'TEdge -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + RemoveSingleVertex(vertex) + +
+ Signature: vertex:'TVertex -> unit
+ Modifiers: abstract
+
+ 		+ +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/graphx-pcl-logic-models-gxlogiccore-3.html b/reference/graphx-pcl-logic-models-gxlogiccore-3.html new file mode 100644 index 000000000..1535fe130 --- /dev/null +++ b/reference/graphx-pcl-logic-models-gxlogiccore-3.html @@ -0,0 +1,656 @@ + + + + + GXLogicCore<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + + + +

GXLogicCore<'TVertex, 'TEdge, 'TGraph>

+

+ Namespace: GraphX.PCL.Logic.Models
+

+
+
+

Constructors

+ + + + + + + + + + + + + + +
ConstructorDescription
+ + + new(graph) + +
+ Signature: graph:'TGraph -> unit
+
+ 		+ +
+ + + new() + +
+ Signature: unit -> unit
+
+ 		+ +
+

Instance members

+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
Instance memberDescription
+ + + AlgorithmFactory() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Get an algorithm factory that provides different algorithm creation methods

+ + +
+ + + AlgorithmStorage() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets algorithm storage that contain all currently defined algorithm objects by type (default or external) +Actual storage data is vital for correct edge routing operation after graph was regenerated.

+ + +
+ + + AreOverlapNeeded() + +
+ Signature: unit -> bool
+ Modifiers: abstract
+
+ 		+

Gets if current algorithms set actualy needs overlap removal algorithm

+ + +
+ + + AreVertexSizesNeeded() + +
+ Signature: unit -> bool
+ Modifiers: abstract
+
+ 		+

Gets if current algorithms set needs vertices sizes

+ + +
+ + + AsyncAlgorithmCompute() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets if async algorithm computations are enabled

+ + +
+ + + Clear(clearStorages) + +
+ Signature: clearStorages:bool -> unit
+ Modifiers: abstract
+
+ 		+

Clear LogicCore data

+ + +
+ + + Compute(cancellationToken) + +
+ Signature: cancellationToken:CancellationToken -> IDictionary<'TVertex,Point>
+ Modifiers: abstract
+
+ 		+ +
+ + + ComputeEdgeRoutesByVertex(...) + +
+ Signature: (dataVertex:'TVertex * vertexPosition:Nullable<Point> * vertexSize:Nullable<Size>) -> unit
+ Modifiers: abstract
+
+ 		+

Computes all edge routes related to specified vertex

+ + +
+ + + CreateNewAlgorithmFactory() + +
+ Signature: unit -> unit
+
+ 		+

Creates new algorithm factory

+ + +
+ + + CreateNewAlgorithmStorage(...) + +
+ Signature: (layout:IExternalLayout<'TVertex,'TEdge> * or:IExternalOverlapRemoval<'TVertex> * er:IExternalEdgeRouting<'TVertex,'TEdge>) -> unit
+
+ 		+

Creates new algorithm storage

+ + +
+ + + DefaultEdgeRoutingAlgorithm() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets default edge routing algorithm that will be used on graph generation/relayouting

+ + +
+ + + DefaultEdgeRoutingAlgorithmParams() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets default edge routing algorithm parameters that will be used on graph generation/relayouting

+ + +
+ + + DefaultLayoutAlgorithm() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets default layout algorithm that will be used on graph generation/relayouting

+ + +
+ + + DefaultLayoutAlgorithmParams() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets default layout algorithm parameters that will be used on graph generation/relayouting

+ + +
+ + + DefaultOverlapRemovalAlgorithm() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets default overlap removal algorithm that will be used on graph generation/relayouting

+ + +
+ + + DefaultOverlapRemovalAlgorithmParams() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets default overlap removal algorithm parameters that will be used on graph generation/relayouting

+ + +
+ + + Dispose() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+ +
+ + + EdgeCurvingEnabled() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets if edge curving technique enabled for smoother edges. Default value is True.

+ + +
+ + + EdgeCurvingTolerance() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets roughly the length of each line segment in the polyline +approximation to a continuous curve in WPF units. The smaller the +number the smoother the curve, but slower the performance. Default is 8.

+ + +
+ + + EnableParallelEdges() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets if parallel edges are enabled. All edges between the same nodes will be separated by ParallelEdgeDistance value. +This is post-process procedure and it may be performance-costly.

+ + +
+ + + ExternalEdgeRoutingAlgorithm() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets external edge routing algorithm that will be used instead of the default one. +Negates DefaultEdgeRoutingAlgorithm property value if set.

+ + +
+ + + ExternalLayoutAlgorithm() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets external layout algorithm that will be used instead of the default one. +Negates DefaultLayoutAlgorithm property value if set.

+ + +
+ + + ExternalOverlapRemovalAlgorithm() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets external overlap removal algorithm that will be used instead of the default one. +Negates DefaultOverlapRemovalAlgorithm property value if set.

+ + +
+ + + GenerateAlgorithmStorage(...) + +
+ Signature: (vertexSizes:Dictionary<'TVertex,Size> * vertexPositions:IDictionary<'TVertex,Point>) -> bool
+ Modifiers: abstract
+
+ 		+

Creates algorithms by values in LogicCore properties and generates new AlgorithmStorage object

+ + +
+ + + GenerateEdgeRoutingAlgorithm(...) + +
+ Signature: (desiredSize:Size * vertexPositions:IDictionary<'TVertex,Point> * rectangles:IDictionary<'TVertex,Rect>) -> IExternalEdgeRouting<'TVertex,'TEdge>
+ Modifiers: abstract
+
+ 		+

Generate layout algorithm according to LogicCore layout algorithm default/external properties set

+ + +
+ + + GenerateLayoutAlgorithm(...) + +
+ Signature: (vertexSizes:Dictionary<'TVertex,Size> * vertexPositions:IDictionary<'TVertex,Point>) -> IExternalLayout<'TVertex,'TEdge>
+ Modifiers: abstract
+
+ 		+

Generate layout algorithm according to LogicCore layout algorithm default/external properties set

+ + +
+ + + GenerateOverlapRemovalAlgorithm(...) + +
+ Signature: rectangles:Dictionary<'TVertex,Rect> -> IExternalOverlapRemoval<'TVertex>
+ Modifiers: abstract
+
+ 		+

Generate overlap removal algorithm according to LogicCore overlap removal algorithm default/external properties set

+ + +
+ + + GetVertexSizeRectangles(...) + +
+ Signature: (positions:IDictionary<'TVertex,Point> * vertexSizes:Dictionary<'TVertex,Size> * getCenterPoints:bool) -> Dictionary<'TVertex,Rect>
+
+ 		+

Get visual vertex size rectangles (can be used by some algorithms)

+ + +
+ + + Graph() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets main graph object

+ + +
+ + + IsCustomLayout + +
+ Signature: bool
+ Modifiers: abstract
+
+ 		+

Gets is LayoutAlgorithmTypeEnum.Custom (NOT external) layout selected and used. Custom layout used to manualy generate graph.

+ + +
+ + + IsEdgeRoutingEnabled + +
+ Signature: bool
+ Modifiers: abstract
+
+ 		+

Gets if edge routing will be performed on Compute() method execution

+ + +
+ + + ParallelEdgeDistance() + +
+ Signature: unit -> unit
+ Modifiers: abstract
+
+ 		+

Gets or sets distance by which edges are parallelized if EnableParallelEdges is true. Default value is 5.

+ + +
+ +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/reference/index.html b/reference/index.html new file mode 100644 index 000000000..c95135610 --- /dev/null +++ b/reference/index.html @@ -0,0 +1,1226 @@ + + + + + Namespaces - QuickGraph + + + + + + + + + + + + + + + +
+
+ +

QuickGraph

+
+
+
+
+ + +

QuickGraph

+ + +

GraphX Namespace

+
+ + + + + + + + + + + + + + + + + + +
TypeDescription
+ BAutoResetEvent +
+ BManualResetEvent +
+ BWaitHandle +
+ +
+

GraphX.Measure Namespace

+
+ + + + + + + + + + + + + + + + + + + + + + + + + + +
TypeDescription
+ Point +

Custom PCL implementation of Point class

+ +
+ Rect +

Custom PCL implementation of Rect class

+ +
+ Size +
+ Thickness +
+ Vector +
+ +
+

GraphX.PCL.Common Namespace

+
+ + + + + + + + + + +
TypeDescription
+ CommonExtensions +
+ +
+

GraphX.PCL.Common.Enums Namespace

+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
TypeDescription
+ EdgeRoutingAlgorithmTypeEnum +
+ EdgesType +
+ EventType +
+ GraphControlType +
+ ImageType +
+ LayoutAlgorithmTypeEnum +

Built-in layout algorithm types

+ +
+ OverlapRemovalAlgorithmTypeEnum +
+ ProcessingOptionEnum +

Specifies how object will be treated in calculations and visualization

+ +
+ VertexShape +
+ +
+

GraphX.PCL.Common.Exceptions Namespace

+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
TypeDescription
+ GX_ConsistencyException +
+ GX_GeneralException +
+ GX_InvalidDataException +
+ GX_ObjectNotFoundException +
+ GX_ObsoleteException +
+ GX_SerializationException +
+ +
+

GraphX.PCL.Common.Interfaces Namespace

+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
TypeDescription
+ IAlgorithmFactory<'TVertex, 'TEdge, 'TGraph> +
+ IAlgorithmParameters +
+ IAlgorithmStorage<'TVertex, 'TEdge> +

Base level interface for algorithm storage implementation

+ +
+ ICloneable +

Cloning interface

+ +
+ IEdgeRoutingParameters +

Base class for edge routing algorithm parameters

+ +
+ IExternalEdgeRouting<'TVertex, 'TEdge> +

Base interface for an edge routing algorithm

+ +
+ IExternalLayout<'TVertex, 'TEdge> +

Base interface for layout algorithm

+ +
+ IExternalOverlapRemoval<'TVertex> +

Base interface for overlap removal algorithm

+ +
+ IGXLogicCore<'TVertex, 'TEdge, 'TGraph> +
+ IGraphXCommonEdge +

Core edge data interface

+ +
+ IGraphXEdge<'TVertex> +

Core GraphX edge data interface

+ +
+ IGraphXVertex +
+ IIdentifiableGraphDataObject +
+ ILayoutAlgorithm<'TVertex, 'TEdge, 'TGraph> +
+ ILayoutEdgeRouting<'TEdge> +

If added to layout algorithm specifies that it uses it's own edge routing and thus +should ignore edge routing algorithm

+ +
+ ILayoutParameters +
+ IOverlapRemovalAlgorithm<'TObject> +
+ IOverlapRemovalAlgorithm<'TObject, 'TParam> +
+ IOverlapRemovalParameters +
+ IRoutingInfo +
+ IWeightedEdge<'TVertex> +
+ +
+

GraphX.PCL.Common.Models Namespace

+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
TypeDescription
+ EdgeBase<'TVertex> +

Base class for graph edge

+ +
+ EdgeRoutingVisualData +
+ GraphSerializationData +
+ GraphState<'TVertex, 'TEdge, 'TGraph> +
+ VertexBase +
+ WeightedEdge<'TVertex> +
+ +
+

GraphX.PCL.Common.Models.Semaphore Namespace

+
+ + + + + + + + + + +
TypeDescription
+ Semaphore +
+ +
+

GraphX.PCL.Logic.Algorithms Namespace

+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
TypeDescription
+ AlgorithmBase +
+ EdgeTypes +
+ GraphXExtensions +
+ HierarchicalGraph<'TVertex, 'TEdge> +
+ IAlgorithm +

Simple algorithm interface which is not connected to any graph.

+ +
+ IHierarchicalBidirectionalGraph<'TVertex, 'TEdge> +
+ ISoftMutableGraph<'TVertex, 'TEdge> +

Soft mutation means: We can hide the vertices or the edges.

+ +
+ ITypedEdge +
+ LayeredTopologicalSortAlgorithm<'TVertex, 'TEdge> +
+ SoftMutableBidirectionalGraph<'TVertex, 'TEdge> +
+ SoftMutableHierarchicalGraph<'TVertex, 'TEdge> +
+ TypedEdge<'TVertex> +
+ WrappedVertex<'TVertex> +
+ +
+

GraphX.PCL.Logic.Algorithms.EdgeRouting Namespace

+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
TypeDescription
+ BundleEdgeRouting<'TVertex, 'TEdge, 'TGraph> +

EdgeBundler class is intended to be used for bundling and straightening of the edges of the graph. +The goal is to get the layout that is less clutered and more suitable for analiyzing.

+

This class is based on the paper "Force-Directed Edge Bundling for Graph Visualization" +by Danny Holten and Jarke J. van Wijk. +http://www.win.tue.nl/~dholten/papers/forcebundles_eurovis.pdf

+

It was implemented and modified by Luka Potkonjak. +Adapted for GraphX by PantheR.

+ +
+ BundleEdgeRoutingParameters +
+ EdgeRoutingAlgorithmBase<'TVertex, 'TEdge, 'TGraph> +
+ EdgeRoutingParameters +
+ HeuristicFormula +
+ IPriorityQueue<'T> +
+ MatrixItem +
+ PathFindAlgorithm +
+ PathFinder +
+ PathFinderDebugHandler +
+ PathFinderEdgeRouting<'TVertex, 'TEdge, 'TGraph> +
+ PathFinderEdgeRoutingParameters +
+ PathFinderNode +
+ PathFinderNodeType +
+ PriorityQueueB<'T> +
+ SimpleERParameters +
+ SimpleEdgeRouting<'TVertex, 'TEdge, 'TGraph> +
+ +
+

GraphX.PCL.Logic.Algorithms.LayoutAlgorithms Namespace

+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
TypeDescription
+ BalloonTreeLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph> +
+ BalloonTreeLayoutParameters +
+ BoundedFRLayoutParameters +

Parameters of the Fruchterman-Reingold Algorithm (FDP), bounded version.

+ +
+ CircularLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph> +
+ CircularLayoutParameters +
+ CompoundFDPLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph> +
+ CompoundFDPLayoutParameters +
+ CompoundGraph<'TVertex, 'TEdge> +
+ CompoundLayoutContext<'TVertex, 'TEdge, 'TGraph> +
+ CompoundLayoutIterationEventArgs<'TVertex, 'TEdge> +
+ CompoundVertexInnerLayoutType +
+ DefaultParameterizedLayoutAlgorithmBase<'TVertex, 'TEdge, 'TGraph, 'TParam> +

Use this class as a base class for your layout algorithm +if it's parameter class has a default contstructor.

+ +
+ EfficientSugiyamaLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph> +
+ EfficientSugiyamaLayoutParameters +
+ FRCoolingFunction +
+ FRLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph> +
+ FRLayoutParametersBase +

Parameters base for the Fruchterman-Reingold Algorithm (FDP).

+ +
+ FreeFRLayoutParameters +
+ ICompoundGraph<'TVertex, 'TEdge> +
+ ICompoundLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph> +
+ ICompoundLayoutContext<'TVertex, 'TEdge, 'TGraph> +
+ ICompoundLayoutIterationEventArgs<'TVertex> +
+ ILayoutContext<'TVertex, 'TEdge, 'TGraph> +
+ ILayoutInfoIterationEventArgs<'TVertex, 'TEdge, 'TVertexInfo, 'TEdgeInfo> +
+ ILayoutInfoIterationEventArgs<'TVertex, 'TEdge> +
+ ILayoutIterationEventArgs<'TVertex> +
+ IMutableCompoundGraph<'TVertex, 'TEdge> +
+ IParameterizedLayoutAlgorithm<'TParam> +
+ IParameterizedLayoutAlgorithm +
+ ISOMLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph> +
+ ISOMLayoutParameters +
+ KKLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph> +
+ KKLayoutParameters +
+ LayoutAlgorithmBase<'TVertex, 'TEdge, 'TGraph> +
+ LayoutContext<'TVertex, 'TEdge, 'TGraph> +
+ LayoutDirection +
+ LayoutIterationEventArgs<'TVertex, 'TEdge, 'TVertexInfo, 'TEdgeInfo> +
+ LayoutIterationEventArgs<'TVertex, 'TEdge> +
+ LayoutMode +
+ LayoutParametersBase +
+ LayoutUtil +
+ LinLogLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph> +
+ LinLogLayoutParameters +
+ Pair +
+ ParameterizedLayoutAlgorithmBase<'TVertex, 'TEdge, 'TGraph, 'TParam> +
+ PositionCalculationMethodTypes +
+ RandomLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph> +
+ RandomLayoutAlgorithmParams +
+ SimpleTreeLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph> +
+ SimpleTreeLayoutParameters +
+ SpanningTreeGeneration +
+ SugiyamaEdgeRoutings +
+ SugiyamaLayoutAlgorithm<'TVertex, 'TEdge, 'TGraph> +
+ SugiyamaLayoutParameters +

Parameters of the Sugiyama layout.

+ +
+ TestingCompoundLayoutIterationEventArgs<'TVertex, 'TEdge, 'TVertexInfo, 'TEdgeInfo> +
+ TestingCompoundVertexInfo +
+ +
+

GraphX.PCL.Logic.Algorithms.LayoutAlgorithms.Grouped Namespace

+ +

GraphX.PCL.Logic.Algorithms.OverlapRemoval Namespace

+
+ + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
TypeDescription
+ FSAAlgorithm<'TObject> +
+ FSAAlgorithm<'TObject, 'TParam> +

http://adaptagrams.svn.sourceforge.net/viewvc/adaptagrams/trunk/RectangleOverlapSolver/placement/FSA.java?view=markup

+ +
+ IOverlapRemovalContext<'TVertex> +
+ OneWayFSAAlgorithm<'TObject> +
+ OneWayFSAParameters +
+ OneWayFSAWayEnum +
+ OverlapRemovalAlgorithmBase<'TObject, 'TParam> +
+ OverlapRemovalContext<'TVertex> +
+ OverlapRemovalHelper +
+ OverlapRemovalParameters +
+ RectangleWrapper<'TObject> +

A System.Windows.Rect egy struktъra, ezйrt a heap-en tбrolуdik. Bizonyos esetekben ez nem +szerencsйs, нgy szьksйg van erre a wrapper osztбlyra. Mivel ez class, ezйrt nem +йrtйk szerinti бtadбs van.

+ +
+ +
+

GraphX.PCL.Logic.Helpers Namespace

+
+ + + + + + + + + + + + + + +
TypeDescription
+ ReflectionHelper +
+ TypeExtensions +
+ +
+

GraphX.PCL.Logic.Models Namespace

+ + +
+
+ F# Project + +
+
+
+ Fork me on GitHub + + diff --git a/release-notes.html b/release-notes.html index a4f53b36e..994ac61c4 100644 --- a/release-notes.html +++ b/release-notes.html @@ -32,10 +32,11 @@

QuickGraph

-

0.0.1-beta - October 24 2013

- +

3.7.0 July 12 2016

    -
  • Initial release
    • +
  • New graph algorithms for graph partition, coloring, searching paths, etc
    • +
  • Graphs now can be loaded from DOT
    • +
  • Drop Portable Class Library support
diff --git a/tutorial.html b/tutorial.html index b175f2335..103d46e58 100644 --- a/tutorial.html +++ b/tutorial.html @@ -34,9 +34,7 @@

QuickGraph

Introducing your project

-

Say more

- 
1: 
 2: 
 3: 
@@ -49,7 +47,6 @@ 
QuickGraph

       

         

           
-
3.7.0 July 12 2016

+
3.7.1 July 12 2016

Some more info

Samples & documentation

-

The library comes with comprehensible documentation. -It can include tutorials automatically generated from *.fsx files in the content folder. -The API reference is automatically generated from Markdown comments in the library implementation.

-
    -

  • Tutorial contains a further explanation of this sample library.

    • -
  • -

    API Reference contains automatically generated documentation for all types, modules -and functions in the library. This includes additional brief samples on using most of the -functions.

    -
    • -
+

The library is fork of original QuickGraph project and migration is not finished. So, please use original documentation.

Contributing and copyright

-

The project is hosted on GitHub where you can report issues, fork +

The project is hosted on GitHub where you can report issues, fork the project and submit pull requests. If you're adding a new public API, please also -consider adding samples that can be turned into a documentation. You might -also want to read the library design notes to understand how it works.

-

The library is available under Public Domain license, which allows modification and +consider adding samples that can be turned into a documentation. You might +also want to read the library design notes to understand how it works.

+

The library is available under Ms-PL license, which allows modification and redistribution for both commercial and non-commercial purposes. For more information see the -License file in the GitHub repository.

+License file in the GitHub repository.

val printfn : format:Printf.TextWriterFormat<'T> -> 'T

Full name: Microsoft.FSharp.Core.ExtraTopLevelOperators.printfn
@@ -90,7 +79,7 @@

QuickGraph
  • Home page
  • -
  • Get Library via NuGet
    • +
  • Get Library via NuGet
  • Source Code on GitHub
  • License
  • Release Notes
    • diff --git a/license.html b/license.html index bac2498fe..918206eee 100644 --- a/license.html +++ b/license.html @@ -23,7 +23,7 @@

    QuickGraph

    @@ -77,7 +77,7 @@

    QuickGraph

  • QuickGraph
  • Home page
  • -
  • Get Library via NuGet
    • +
  • Get Library via NuGet
  • Source Code on GitHub
  • License
  • Release Notes
    • diff --git a/reference/index.html b/reference/index.html index e4d28529d..eec375f90 100644 --- a/reference/index.html +++ b/reference/index.html @@ -23,7 +23,7 @@

    QuickGraph

    @@ -44,7 +44,7 @@

    QuickGraph

  • QuickGraph
  • Home page
  • -
  • Get Library via NuGet
    • +
  • Get Library via NuGet
  • Source Code on GitHub
  • License
  • Release Notes
    • diff --git a/release-notes.html b/release-notes.html index c7d1c0259..9f5a4de89 100644 --- a/release-notes.html +++ b/release-notes.html @@ -23,7 +23,7 @@

    QuickGraph

    @@ -54,7 +54,7 @@

    3.7.0
  • QuickGraph
  • Home page
  • -
  • Get Library via NuGet
    • +
  • Get Library via NuGet
  • Source Code on GitHub
  • License
  • Release Notes
    • diff --git a/tutorial.html b/tutorial.html index dade7c41c..1b814741a 100644 --- a/tutorial.html +++ b/tutorial.html @@ -24,7 +24,7 @@

    QuickGraph

    @@ -57,7 +57,7 @@

    QuickGraph
  • Home page
  • -
  • Get Library via NuGet
    • +
  • Get Library via NuGet
  • Source Code on GitHub
  • License
  • Release Notes
    • From 1ddc9baf465308f5511937c1b24edb4e1107f51d Mon Sep 17 00:00:00 2001 From: rsdpisuy Date: Tue, 19 Jul 2016 10:50:11 +0300 Subject: [PATCH 12/15] Update generated documentation for version 3.7.1 --- reference/global-helpertypes.html | 137 + reference/helpertypes-eqclass.html | 95 + reference/helpertypes-eqclassfuns.html | 170 + reference/helpertypes-markedval-1.html | 113 + reference/helpertypes-markedvalfuns.html | 116 + reference/helpertypes-statefromfsa.html | 95 + reference/helpertypes-statefromfsafuns.html | 152 + reference/helpertypes-twosets-1.html | 113 + reference/helpertypes-twosetsfuns.html | 134 + reference/index.html | 2936 +++++++++++++++++ reference/quickgraph-adjacencygraph-2.html | 771 +++++ ...quickgraph-algorithms-algorithmbase-1.html | 294 ++ ...ph-algorithms-algorithmeventhandler-1.html | 143 + ...kgraph-algorithms-algorithmextensions.html | 745 +++++ ...ithms-approxcompletecoloringalgorithm.html | 121 + ...gershorminimumfeedbackarcsetalgorithm.html | 94 + ...lgorithms-bipartitedimensionalgorithm.html | 140 + ...ms-centralityapproximationalgorithm-2.html | 140 + ...gorithms-chromaticpolynomial-basenode.html | 162 + ...h-algorithms-chromaticpolynomial-leaf.html | 96 + ...h-algorithms-chromaticpolynomial-node.html | 180 + ...kgraph-algorithms-chromaticpolynomial.html | 144 + .../quickgraph-algorithms-chromosome.html | 68 + ...-cliques-maximumcliquealgorithmbase-2.html | 104 + ...uickgraph-algorithms-computationstate.html | 70 + ...ensation-condensationgraphalgorithm-3.html | 126 + ...gorithms-condensation-condensededge-3.html | 112 + ...edgemergecondensationgraphalgorithm-2.html | 126 + ...-algorithms-condensation-mergededge-2.html | 134 + ...onents-connectedcomponentsalgorithm-2.html | 156 + ...ementalconnectedcomponentsalgorithm-2.html | 143 + ...tronglyconnectedcomponentsalgorithm-2.html | 184 ++ ...-weaklyconnectedcomponentsalgorithm-2.html | 156 + ...uickgraph-algorithms-distancerelaxers.html | 68 + ...ckgraph-algorithms-domaticpartition-2.html | 157 + ...raph-algorithms-edgecoloringalgorithm.html | 94 + ...h-algorithms-euleriantrailalgorithm-2.html | 260 ++ ...oneablevertexgraphexploreralgorithm-2.html | 267 ++ ...thms-exploration-itransitionfactory-2.html | 106 + ...tion-transitionfactoryimplicitgraph-2.html | 260 ++ reference/quickgraph-algorithms-fitness.html | 68 + ...uickgraph-algorithms-geneticconstants.html | 205 ++ ...hcoloring-vertexcoloring-inputmodel-2.html | 112 + ...coloring-vertexcoloring-outputmodel-2.html | 112 + ...texcoloring-vertexcoloringalgorithm-2.html | 112 + .../quickgraph-algorithms-ialgorithm-1.html | 91 + .../quickgraph-algorithms-icomputation.html | 196 ++ ...rithms-iconnectedcomponentalgorithm-3.html | 106 + ...gorithms-idistancerecorderalgorithm-2.html | 108 + ...uickgraph-algorithms-idistancerelaxer.html | 106 + ...-algorithms-iedgecolorizeralgorithm-2.html | 91 + ...s-iedgepredecessorrecorderalgorithm-2.html | 106 + ...ithms-iendpathedgerecorderalgorithm-2.html | 68 + .../quickgraph-algorithms-individual.html | 68 + ...graph-algorithms-inducedpathalgorithm.html | 97 + ...algorithms-iseuleriangraphalgorithm-2.html | 112 + ...orithms-ishamiltoniangraphalgorithm-2.html | 112 + ...ph-algorithms-itreebuilderalgorithm-2.html | 91 + ...hms-iundirectedtreebuilderalgorithm-2.html | 91 + ...dvertexpredecessorrecorderalgorithm-2.html | 106 + ...lgorithms-ivertexcolorizeralgorithm-2.html | 91 + ...ivertexpredecessorrecorderalgorithm-2.html | 106 + ...orithms-ivertextimestamperalgorithm-2.html | 106 + ...hanlinalgoritm-kernighanlinalgoritm-2.html | 126 + ...thms-kernighanlinalgoritm-partition-1.html | 140 + ...s-maximumbipartitematchingalgorithm-2.html | 168 + ...-allverticesgraphaugmentoralgorithm-2.html | 104 + ...low-edmondskarpmaximumflowalgorithm-2.html | 108 + ...mumflow-graphaugmentoralgorithmbase-3.html | 254 ++ ...-maximumflow-graphbalanceralgorithm-2.html | 434 +++ ...ms-maximumflow-maximumflowalgorithm-2.html | 255 ++ ...tisourcesinkgraphaugmentoralgorithm-2.html | 104 + ...flow-reversededgeaugmentoralgorithm-2.html | 224 ++ ...rithms-maximumindependentsetalgorithm.html | 112 + ...-minimumdominatingsetgeneticalgorithm.html | 121 + ...gtree-iminimumspanningtreealgorithm-2.html | 68 + ...kruskalminimumspanningtreealgorithm-2.html | 141 + ...ee-primminimumspanningtreealgorithm-2.html | 141 + ...ers-edgepredecessorrecorderobserver-2.html | 212 ++ ...thms-observers-edgerecorderobserver-2.html | 142 + ...raph-algorithms-observers-iobserver-1.html | 97 + ...ectedvertexdistancerecorderobserver-2.html | 171 + ...edvertexpredecessorrecorderobserver-2.html | 156 + ...vers-vertexdistancerecorderobserver-2.html | 171 + ...rtexpredecessorpathrecorderobserver-2.html | 170 + ...s-vertexpredecessorrecorderobserver-2.html | 156 + ...ms-observers-vertexrecorderobserver-2.html | 142 + ...observers-vertextimestamperobserver-2.html | 170 + .../quickgraph-algorithms-population.html | 68 + ...ckgraph-algorithms-randomgraphfactory.html | 160 + ...lks-cyclepoppingrandomtreealgorithm-2.html | 286 ++ ...h-algorithms-randomwalks-iedgechain-2.html | 106 + ...rithms-randomwalks-imarkovedgechain-2.html | 91 + ...hms-randomwalks-markovedgechainbase-2.html | 143 + ...ndomwalks-normalizedmarkovedgechain-2.html | 128 + ...hms-randomwalks-randomwalkalgorithm-2.html | 225 ++ ...hms-randomwalks-roundrobinedgechain-2.html | 128 + ...ks-vanishingweightedmarkovedgechain-2.html | 156 + ...randomwalks-weightedmarkovedgechain-2.html | 128 + ...omwalks-weightedmarkovedgechainbase-2.html | 112 + ...anpavleyrankedshortestpathalgorithm-2.html | 156 + ...ath-rankedshortestpathalgorithmbase-3.html | 154 + ...lgorithms-ranking-pagerankalgorithm-2.html | 196 ++ ...raph-algorithms-rootedalgorithmbase-2.html | 168 + ...lgorithms-rootedsearchalgorithmbase-2.html | 182 + ...ch-bestfirstfrontiersearchalgorithm-2.html | 115 + ...irectionaldepthfirstsearchalgorithm-2.html | 298 ++ ...-search-breadthfirstsearchalgorithm-2.html | 344 ++ ...ms-search-depthfirstsearchalgorithm-2.html | 354 ++ ...earch-edgedepthfirstsearchalgorithm-2.html | 300 ++ ...h-implicitdepthfirstsearchalgorithm-2.html | 268 ++ ...plicitedgedepthfirstsearchalgorithm-2.html | 264 ++ ...directedbreadthfirstsearchalgorithm-2.html | 316 ++ ...undirecteddepthfirstsearchalgorithm-2.html | 352 ++ ...gorithms-services-ialgorithmcomponent.html | 121 + ...lgorithms-services-ialgorithmservices.html | 93 + ...ph-algorithms-services-icancelmanager.html | 161 + ...ickgraph-algorithms-services-iservice.html | 70 + ...testpath-astarshortestpathalgorithm-2.html | 259 ++ ...th-bellmanfordshortestpathalgorithm-2.html | 245 ++ ...ortestpath-dagshortestpathalgorithm-2.html | 245 ++ ...tpath-dijkstrashortestpathalgorithm-2.html | 245 ++ ...oydwarshallallshortestpathalgorithm-2.html | 170 + ...rtestpath-shortestpathalgorithmbase-3.html | 216 ++ ...recteddijkstrashortestpathalgorithm-2.html | 245 ++ ...undirectedshortestpathalgorithmbase-2.html | 216 ++ ...tpath-yen-yenshortestpathsalgorithm-1.html | 112 + ...offlineleastcommonancestoralgorithm-2.html | 170 + ...directionaltopologicalsortalgorithm-2.html | 182 + ...sourcefirsttopologicalsortalgorithm-2.html | 168 + ...ogicalsort-topologicalsortalgorithm-2.html | 154 + ...ologicalsort-topologicalsortdirection.html | 68 + ...rectedfirsttopologicalsortalgorithm-2.html | 182 + ...-undirectedtopologicalsortalgorithm-2.html | 154 + ...uickgraph-algorithms-tsp-taskpriority.html | 113 + .../quickgraph-algorithms-tsp-tsp-3.html | 90 + .../quickgraph-arrayadjacencygraph-2.html | 387 +++ .../quickgraph-arraybidirectionalgraph-2.html | 480 +++ .../quickgraph-arrayequalitycomparer-1.html | 168 + .../quickgraph-arrayundirectedgraph-2.html | 371 +++ .../quickgraph-bidirectionadaptergraph-2.html | 460 +++ .../quickgraph-bidirectionalgraph-2.html | 927 ++++++ ...quickgraph-bidirectionalmatrixgraph-1.html | 647 ++++ .../quickgraph-clusteredadjacencygraph-2.html | 708 ++++ .../quickgraph-collections-binaryheap-2.html | 356 ++ .../quickgraph-collections-binaryqueue-2.html | 245 ++ ...raph-collections-edgeedgedictionary-2.html | 140 + .../quickgraph-collections-edgelist-2.html | 140 + ...uickgraph-collections-fibonacciheap-2.html | 309 ++ ...graph-collections-fibonacciheapcell-2.html | 112 + ...collections-fibonacciheaplinkedlist-2.html | 105 + ...ickgraph-collections-fibonacciqueue-2.html | 259 ++ ...graph-collections-forestdisjointset-1.html | 222 ++ .../quickgraph-collections-heapdirection.html | 70 + ...quickgraph-collections-idisjointset-1.html | 197 ++ .../quickgraph-collections-iedgelist-2.html | 112 + ...ickgraph-collections-ipriorityqueue-1.html | 91 + .../quickgraph-collections-iqueue-1.html | 166 + ...h-collections-ivertexedgedictionary-2.html | 95 + reference/quickgraph-collections-queue-1.html | 90 + .../quickgraph-collections-softheap-2.html | 225 ++ ...quickgraph-collections-termedgelist-2.html | 335 ++ ...ph-collections-vertexedgedictionary-2.html | 140 + .../quickgraph-collections-vertexlist-1.html | 140 + ...quickgraph-compressedsparserowgraph-1.html | 385 +++ .../quickgraph-contracts-graphcontract.html | 148 + .../quickgraph-createedgedelegate-2.html | 145 + .../quickgraph-createvertexdelegate-2.html | 145 + .../quickgraph-data-datarelationedge.html | 142 + reference/quickgraph-data-datasetgraph.html | 90 + ...uickgraph-data-datasetgraphextensions.html | 104 + ...h-data-datasetgraphpopulatoralgorithm.html | 112 + ...ckgraph-data-datasetgraphvizalgorithm.html | 106 + ...delegatebidirectionalincidencegraph-2.html | 204 ++ .../quickgraph-delegateimplicitgraph-2.html | 234 ++ ...aph-delegateimplicitundirectedgraph-2.html | 278 ++ .../quickgraph-delegateincidencegraph-2.html | 145 + .../quickgraph-delegateundirectedgraph-2.html | 205 ++ ...raph-delegatevertexandedgelistgraph-2.html | 205 ++ reference/quickgraph-dotparseradapter.html | 90 + .../quickgraph-doubleequalitycomparer.html | 192 ++ reference/quickgraph-edge-1.html | 153 + reference/quickgraph-edgeaction-2.html | 145 + reference/quickgraph-edgeedgeaction-2.html | 145 + .../quickgraph-edgeequalitycomparer-2.html | 143 + reference/quickgraph-edgeeventargs-2.html | 118 + reference/quickgraph-edgeextensions.html | 282 ++ reference/quickgraph-edgefactory-2.html | 145 + reference/quickgraph-edgeidentity-2.html | 143 + reference/quickgraph-edgelistgraph-2.html | 409 +++ reference/quickgraph-edgepredicate-2.html | 143 + reference/quickgraph-enumerablecontract.html | 104 + reference/quickgraph-equalityextensions.html | 328 ++ reference/quickgraph-equatableedge-1.html | 145 + reference/quickgraph-equatabletermedge-1.html | 159 + reference/quickgraph-equategraphs.html | 126 + .../quickgraph-floatequalitycomparer.html | 192 ++ ...uickgraph-fsa-graphbasedfsa-dfanode-1.html | 168 + ...uickgraph-fsa-graphbasedfsa-edgefsa-1.html | 96 + .../quickgraph-fsa-graphbasedfsa-fsa-1.html | 524 +++ ...ckgraph-fsa-graphbasedfsa-fsaparams-2.html | 185 ++ ...ickgraph-fsa-graphbasedfsa-multimap-2.html | 149 + ...ickgraph-fsa-graphbasedfsa-nodesetset.html | 137 + ...graph-fsa-graphbasedfsa-replaceamount.html | 113 + ...aph-fsa-graphbasedfsa-replaceappetite.html | 131 + ...kgraph-fsa-graphbasedfsa-replaceorder.html | 113 + ...ph-fsa-graphbasedfsa-replacesemantics.html | 69 + .../quickgraph-fsa-graphbasedfsa-symb-1.html | 113 + reference/quickgraph-fsa-graphbasedfsa.html | 246 ++ reference/quickgraph-fst-fsttable-edge-2.html | 176 + reference/quickgraph-fst-fsttable-fst-2.html | 234 ++ .../quickgraph-fst-fsttable-simplefst-2.html | 158 + reference/quickgraph-fst-fsttable.html | 144 + ...uickgraph-fst-graphbasedfst-edgefst-2.html | 96 + .../quickgraph-fst-graphbasedfst-fst-2.html | 430 +++ .../quickgraph-fst-graphbasedfst-test-2.html | 113 + reference/quickgraph-fst-graphbasedfst.html | 144 + ...raph-glee-gleedefaultgraphpopulator-2.html | 90 + .../quickgraph-glee-gleeedgeeventargs-2.html | 112 + ...uickgraph-glee-gleeedgeeventhandler-2.html | 143 + .../quickgraph-glee-gleegraphextensions.html | 160 + .../quickgraph-glee-gleegraphpopulator-2.html | 140 + ...lee-gleeindentifiablegraphpopulator-2.html | 90 + ...aph-glee-gleetostringgraphpopulator-2.html | 126 + ...quickgraph-glee-gleevertexeventargs-1.html | 112 + ...aph-glee-gleevertexnodeeventhandler-1.html | 143 + reference/quickgraph-graphcolor.html | 70 + reference/quickgraph-graphextensions.html | 578 ++++ ...h-graphviz-condensatedgraphrenderer-3.html | 90 + ...quickgraph-graphviz-dot-graphvizarrow.html | 183 + ...ph-graphviz-dot-graphvizarrowclipping.html | 68 + ...aph-graphviz-dot-graphvizarrowfilling.html | 68 + ...graph-graphviz-dot-graphvizarrowshape.html | 68 + ...raph-graphviz-dot-graphvizclustermode.html | 68 + .../quickgraph-graphviz-dot-graphvizedge.html | 421 +++ ...ph-graphviz-dot-graphvizedgedirection.html | 68 + ...ph-graphviz-dot-graphvizedgeextremity.html | 210 ++ ...kgraph-graphviz-dot-graphvizedgelabel.html | 196 ++ ...kgraph-graphviz-dot-graphvizedgestyle.html | 68 + ...quickgraph-graphviz-dot-graphvizgraph.html | 603 ++++ ...kgraph-graphviz-dot-graphvizimagetype.html | 68 + ...aphviz-dot-graphvizlabeljustification.html | 68 + ...ph-graphviz-dot-graphvizlabellocation.html | 68 + ...quickgraph-graphviz-dot-graphvizlayer.html | 112 + ...-graphviz-dot-graphvizlayercollection.html | 154 + ...graph-graphviz-dot-graphvizoutputmode.html | 68 + ...ph-graphviz-dot-graphvizpagedirection.html | 68 + ...ph-graphviz-dot-graphvizrankdirection.html | 68 + ...kgraph-graphviz-dot-graphvizratiomode.html | 68 + ...uickgraph-graphviz-dot-graphvizrecord.html | 141 + ...graph-graphviz-dot-graphvizrecordcell.html | 211 ++ ...hviz-dot-graphvizrecordcellcollection.html | 118 + ...ph-graphviz-dot-graphvizrecordescaper.html | 126 + ...uickgraph-graphviz-dot-graphvizvertex.html | 477 +++ ...raph-graphviz-dot-graphvizvertexshape.html | 68 + ...raph-graphviz-dot-graphvizvertexstyle.html | 68 + ...z-edgemergecondensatedgraphrenderer-2.html | 90 + .../quickgraph-graphviz-filedotengine.html | 115 + ...aph-graphviz-formatclustereventargs-2.html | 128 + ...-graphviz-formatclustereventhandler-2.html | 143 + ...uickgraph-graphviz-formatedgeaction-2.html | 143 + ...kgraph-graphviz-formatedgeeventargs-2.html | 92 + ...raph-graphviz-formatvertexeventargs-1.html | 90 + ...h-graphviz-formatvertexeventhandler-1.html | 143 + ...ickgraph-graphviz-graphrendererbase-2.html | 140 + ...ickgraph-graphviz-graphvizalgorithm-2.html | 286 ++ ...uickgraph-graphviz-graphvizextensions.html | 161 + reference/quickgraph-graphviz-idotengine.html | 91 + .../quickgraph-graphviz-svghtmlwrapper.html | 120 + .../quickgraph-ibidirectionalgraph-2.html | 71 + ...kgraph-ibidirectionalincidencegraph-2.html | 182 + reference/quickgraph-icloneableedge-2.html | 96 + reference/quickgraph-iclusteredgraph.html | 151 + .../quickgraph-identifiableedgefactory-2.html | 145 + ...uickgraph-identifiablevertexfactory-1.html | 145 + reference/quickgraph-iedge-1.html | 112 + ...ickgraph-iedgelistandincidencegraph-2.html | 70 + reference/quickgraph-iedgelistgraph-2.html | 70 + reference/quickgraph-iedgeset-2.html | 146 + reference/quickgraph-igraph-2.html | 113 + reference/quickgraph-ihierarchy-2.html | 253 ++ reference/quickgraph-ihyperedge-1.html | 106 + reference/quickgraph-iimplicitgraph-2.html | 163 + ...quickgraph-iimplicitundirectedgraph-2.html | 181 + .../quickgraph-iimplicitvertexset-1.html | 95 + reference/quickgraph-iincidencegraph-2.html | 121 + ...ickgraph-imutablebidirectionalgraph-2.html | 130 + .../quickgraph-imutableedgelistgraph-2.html | 180 + reference/quickgraph-imutablegraph-2.html | 95 + .../quickgraph-imutableincidencegraph-2.html | 130 + ...raph-imutabletermbidirectionalgraph-2.html | 68 + .../quickgraph-imutableundirectedgraph-2.html | 108 + ...raph-imutablevertexandedgelistgraph-2.html | 70 + ...quickgraph-imutablevertexandedgeset-2.html | 112 + .../quickgraph-imutablevertexlistgraph-2.html | 70 + reference/quickgraph-imutablevertexset-1.html | 168 + reference/quickgraph-itagged-1.html | 112 + .../quickgraph-itermbidirectionalgraph-2.html | 226 ++ reference/quickgraph-itermedge-1.html | 112 + reference/quickgraph-iundirectededge-1.html | 70 + reference/quickgraph-iundirectedgraph-2.html | 70 + .../quickgraph-ivertexandedgelistgraph-2.html | 70 + reference/quickgraph-ivertexlistgraph-2.html | 71 + reference/quickgraph-ivertexset-1.html | 129 + ...uickgraph-negativecyclegraphexception.html | 132 + .../quickgraph-negativeweightexception.html | 132 + .../quickgraph-nonacyclicgraphexception.html | 132 + ...ph-nonstronglyconnectedgraphexception.html | 134 + .../quickgraph-nopathfoundexception.html | 90 + ...graph-paralleledgenotallowedexception.html | 132 + ...etri-allwaystrueconditionexpression-1.html | 113 + reference/quickgraph-petri-iarc-1.html | 151 + ...ickgraph-petri-iconditionexpression-1.html | 91 + ...quickgraph-petri-identityexpression-1.html | 113 + reference/quickgraph-petri-iexpression-1.html | 91 + .../quickgraph-petri-imutablepetrinet-1.html | 136 + reference/quickgraph-petri-ipetrigraph-1.html | 68 + reference/quickgraph-petri-ipetrinet-1.html | 144 + reference/quickgraph-petri-ipetrivertex.html | 95 + reference/quickgraph-petri-iplace-1.html | 108 + reference/quickgraph-petri-itransition-1.html | 95 + reference/quickgraph-petri-petrinet-1.html | 247 ++ .../quickgraph-petri-petrinetsimulator-1.html | 140 + ...edicates-filteredbidirectionalgraph-3.html | 248 ++ ...ph-predicates-filterededgelistgraph-3.html | 203 ++ ...quickgraph-predicates-filteredgraph-3.html | 174 + ...ph-predicates-filteredimplicitgraph-3.html | 173 + ...redicates-filteredimplicitvertexset-3.html | 113 + ...h-predicates-filteredincidencegraph-3.html | 143 + ...-predicates-filteredundirectedgraph-3.html | 323 ++ ...ates-filteredvertexandedgelistgraph-3.html | 158 + ...-predicates-filteredvertexlistgraph-3.html | 143 + ...dicates-indictionaryvertexpredicate-2.html | 112 + ...-predicates-isolatedvertexpredicate-2.html | 114 + ...ph-predicates-residualedgepredicate-2.html | 126 + ...cates-reversedresidualedgepredicate-2.html | 144 + ...raph-predicates-sinkvertexpredicate-2.html | 112 + reference/quickgraph-quickgraphexception.html | 132 + .../quickgraph-quickgraphresourcemanager.html | 118 + ...uickgraph-referenceequalitycomparer-1.html | 136 + ...ickgraph-reversedbidirectionalgraph-2.html | 472 +++ .../quickgraph-samples-graphcreation.html | 126 + .../quickgraph-samples-graphvizsamples.html | 112 + reference/quickgraph-samples-wikisamples.html | 112 + reference/quickgraph-sedge-1.html | 153 + reference/quickgraph-sequatableedge-1.html | 204 ++ ...quickgraph-sequatableundirectededge-1.html | 204 ++ ...ialization-directedgraphml-clrboolean.html | 68 + ...ization-directedgraphml-directedgraph.html | 364 ++ ...on-directedgraphml-directedgraphalias.html | 140 + ...directedgraphml-directedgraphcategory.html | 644 ++++ ...ion-directedgraphml-directedgraphlink.html | 392 +++ ...ctedgraphml-directedgraphlinkcategory.html | 112 + ...ion-directedgraphml-directedgraphname.html | 154 + ...ion-directedgraphml-directedgraphnode.html | 2100 ++++++++++++ ...ctedgraphml-directedgraphnodecategory.html | 112 + ...ion-directedgraphml-directedgraphpath.html | 126 + ...directedgraphml-directedgraphproperty.html | 210 ++ ...on-directedgraphml-directedgraphstyle.html | 210 ++ ...edgraphml-directedgraphstylecondition.html | 112 + ...ectedgraphml-directedgraphstylesetter.html | 140 + ...ization-directedgraphml-fontstyleenum.html | 68 + ...zation-directedgraphml-fontweightenum.html | 68 + ...ization-directedgraphml-framekindenum.html | 68 + ...on-directedgraphml-graphdirectionenum.html | 68 + ...rialization-directedgraphml-groupenum.html | 68 + ...rectedgraphml-horizontalalignmentenum.html | 68 + ...ialization-directedgraphml-layoutenum.html | 68 + ...lization-directedgraphml-propertytype.html | 68 + ...zation-directedgraphml-targettypeenum.html | 68 + ...directedgraphml-verticalalignmentenum.html | 68 + ...zation-directedgraphml-visibilityenum.html | 68 + ...ialization-directedgraphmlalgorithm-2.html | 160 + ...rialization-directedgraphmlextensions.html | 236 ++ ...h-serialization-graphmldeserializer-3.html | 114 + ...graph-serialization-graphmlextensions.html | 188 ++ ...aph-serialization-graphmlserializer-3.html | 136 + ...raph-serialization-graphmlxmlresolver.html | 145 + ...serialization-serializationextensions.html | 188 ++ ...kgraph-serialization-serializerbase-2.html | 112 + ...aph-serialization-xmlreaderextensions.html | 176 + ...h-serialization-xmlserializableedge-1.html | 128 + ...-serialization-xmlserializablegraph-3.html | 142 + ...aph-serialization-xmlwriterextensions.html | 178 + reference/quickgraph-sreversededge-2.html | 204 ++ reference/quickgraph-staggededge-2.html | 177 + .../quickgraph-staggedequatableedge-2.html | 228 ++ reference/quickgraph-sundirectededge-1.html | 153 + .../quickgraph-sundirectedtaggededge-2.html | 183 + reference/quickgraph-taggededge-2.html | 128 + .../quickgraph-taggedequatableedge-2.html | 130 + .../quickgraph-taggedundirectededge-2.html | 153 + .../quickgraph-termbidirectionalgraph-2.html | 248 ++ reference/quickgraph-termedge-1.html | 203 ++ reference/quickgraph-tryfunc-2.html | 143 + reference/quickgraph-tryfunc-3.html | 143 + reference/quickgraph-tryfunc-4.html | 143 + reference/quickgraph-tryfunc-5.html | 143 + ...kgraph-undirectedbidirectionalgraph-2.html | 367 +++ reference/quickgraph-undirectededge-1.html | 153 + .../quickgraph-undirectededgeaction-2.html | 143 + .../quickgraph-undirectededgeeventargs-2.html | 140 + reference/quickgraph-undirectedgraph-2.html | 728 ++++ reference/quickgraph-vertexaction-1.html | 143 + reference/quickgraph-vertexeventargs-1.html | 112 + .../quickgraph-vertexeventhandler-1.html | 143 + reference/quickgraph-vertexfactory-1.html | 143 + reference/quickgraph-vertexidentity-1.html | 143 + reference/quickgraph-vertexindexer-1.html | 143 + reference/quickgraph-vertexpredicate-1.html | 143 + 410 files changed, 72746 insertions(+) create mode 100644 reference/global-helpertypes.html create mode 100644 reference/helpertypes-eqclass.html create mode 100644 reference/helpertypes-eqclassfuns.html create mode 100644 reference/helpertypes-markedval-1.html create mode 100644 reference/helpertypes-markedvalfuns.html create mode 100644 reference/helpertypes-statefromfsa.html create mode 100644 reference/helpertypes-statefromfsafuns.html create mode 100644 reference/helpertypes-twosets-1.html create mode 100644 reference/helpertypes-twosetsfuns.html create mode 100644 reference/quickgraph-adjacencygraph-2.html create mode 100644 reference/quickgraph-algorithms-algorithmbase-1.html create mode 100644 reference/quickgraph-algorithms-algorithmeventhandler-1.html create mode 100644 reference/quickgraph-algorithms-algorithmextensions.html create mode 100644 reference/quickgraph-algorithms-approxcompletecoloringalgorithm.html create mode 100644 reference/quickgraph-algorithms-bergershorminimumfeedbackarcsetalgorithm.html create mode 100644 reference/quickgraph-algorithms-bipartitedimensionalgorithm.html create mode 100644 reference/quickgraph-algorithms-centralityapproximationalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-chromaticpolynomial-basenode.html create mode 100644 reference/quickgraph-algorithms-chromaticpolynomial-leaf.html create mode 100644 reference/quickgraph-algorithms-chromaticpolynomial-node.html create mode 100644 reference/quickgraph-algorithms-chromaticpolynomial.html create mode 100644 reference/quickgraph-algorithms-chromosome.html create mode 100644 reference/quickgraph-algorithms-cliques-maximumcliquealgorithmbase-2.html create mode 100644 reference/quickgraph-algorithms-computationstate.html create mode 100644 reference/quickgraph-algorithms-condensation-condensationgraphalgorithm-3.html create mode 100644 reference/quickgraph-algorithms-condensation-condensededge-3.html create mode 100644 reference/quickgraph-algorithms-condensation-edgemergecondensationgraphalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-condensation-mergededge-2.html create mode 100644 reference/quickgraph-algorithms-connectedcomponents-connectedcomponentsalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-connectedcomponents-incrementalconnectedcomponentsalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-connectedcomponents-stronglyconnectedcomponentsalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-connectedcomponents-weaklyconnectedcomponentsalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-distancerelaxers.html create mode 100644 reference/quickgraph-algorithms-domaticpartition-2.html create mode 100644 reference/quickgraph-algorithms-edgecoloringalgorithm.html create mode 100644 reference/quickgraph-algorithms-euleriantrailalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-exploration-cloneablevertexgraphexploreralgorithm-2.html create mode 100644 reference/quickgraph-algorithms-exploration-itransitionfactory-2.html create mode 100644 reference/quickgraph-algorithms-exploration-transitionfactoryimplicitgraph-2.html create mode 100644 reference/quickgraph-algorithms-fitness.html create mode 100644 reference/quickgraph-algorithms-geneticconstants.html create mode 100644 reference/quickgraph-algorithms-graphcoloring-vertexcoloring-inputmodel-2.html create mode 100644 reference/quickgraph-algorithms-graphcoloring-vertexcoloring-outputmodel-2.html create mode 100644 reference/quickgraph-algorithms-graphcoloring-vertexcoloring-vertexcoloringalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-ialgorithm-1.html create mode 100644 reference/quickgraph-algorithms-icomputation.html create mode 100644 reference/quickgraph-algorithms-iconnectedcomponentalgorithm-3.html create mode 100644 reference/quickgraph-algorithms-idistancerecorderalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-idistancerelaxer.html create mode 100644 reference/quickgraph-algorithms-iedgecolorizeralgorithm-2.html create mode 100644 reference/quickgraph-algorithms-iedgepredecessorrecorderalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-iendpathedgerecorderalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-individual.html create mode 100644 reference/quickgraph-algorithms-inducedpathalgorithm.html create mode 100644 reference/quickgraph-algorithms-iseuleriangraphalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-ishamiltoniangraphalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-itreebuilderalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-iundirectedtreebuilderalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-iundirectedvertexpredecessorrecorderalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-ivertexcolorizeralgorithm-2.html create mode 100644 reference/quickgraph-algorithms-ivertexpredecessorrecorderalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-ivertextimestamperalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-kernighanlinalgoritm-kernighanlinalgoritm-2.html create mode 100644 reference/quickgraph-algorithms-kernighanlinalgoritm-partition-1.html create mode 100644 reference/quickgraph-algorithms-maximumbipartitematchingalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-maximumflow-allverticesgraphaugmentoralgorithm-2.html create mode 100644 reference/quickgraph-algorithms-maximumflow-edmondskarpmaximumflowalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-maximumflow-graphaugmentoralgorithmbase-3.html create mode 100644 reference/quickgraph-algorithms-maximumflow-graphbalanceralgorithm-2.html create mode 100644 reference/quickgraph-algorithms-maximumflow-maximumflowalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-maximumflow-multisourcesinkgraphaugmentoralgorithm-2.html create mode 100644 reference/quickgraph-algorithms-maximumflow-reversededgeaugmentoralgorithm-2.html create mode 100644 reference/quickgraph-algorithms-maximumindependentsetalgorithm.html create mode 100644 reference/quickgraph-algorithms-minimumdominatingsetgeneticalgorithm.html create mode 100644 reference/quickgraph-algorithms-minimumspanningtree-iminimumspanningtreealgorithm-2.html create mode 100644 reference/quickgraph-algorithms-minimumspanningtree-kruskalminimumspanningtreealgorithm-2.html create mode 100644 reference/quickgraph-algorithms-minimumspanningtree-primminimumspanningtreealgorithm-2.html create mode 100644 reference/quickgraph-algorithms-observers-edgepredecessorrecorderobserver-2.html create mode 100644 reference/quickgraph-algorithms-observers-edgerecorderobserver-2.html create mode 100644 reference/quickgraph-algorithms-observers-iobserver-1.html create mode 100644 reference/quickgraph-algorithms-observers-undirectedvertexdistancerecorderobserver-2.html create mode 100644 reference/quickgraph-algorithms-observers-undirectedvertexpredecessorrecorderobserver-2.html create mode 100644 reference/quickgraph-algorithms-observers-vertexdistancerecorderobserver-2.html create mode 100644 reference/quickgraph-algorithms-observers-vertexpredecessorpathrecorderobserver-2.html create mode 100644 reference/quickgraph-algorithms-observers-vertexpredecessorrecorderobserver-2.html create mode 100644 reference/quickgraph-algorithms-observers-vertexrecorderobserver-2.html create mode 100644 reference/quickgraph-algorithms-observers-vertextimestamperobserver-2.html create mode 100644 reference/quickgraph-algorithms-population.html create mode 100644 reference/quickgraph-algorithms-randomgraphfactory.html create mode 100644 reference/quickgraph-algorithms-randomwalks-cyclepoppingrandomtreealgorithm-2.html create mode 100644 reference/quickgraph-algorithms-randomwalks-iedgechain-2.html create mode 100644 reference/quickgraph-algorithms-randomwalks-imarkovedgechain-2.html create mode 100644 reference/quickgraph-algorithms-randomwalks-markovedgechainbase-2.html create mode 100644 reference/quickgraph-algorithms-randomwalks-normalizedmarkovedgechain-2.html create mode 100644 reference/quickgraph-algorithms-randomwalks-randomwalkalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-randomwalks-roundrobinedgechain-2.html create mode 100644 reference/quickgraph-algorithms-randomwalks-vanishingweightedmarkovedgechain-2.html create mode 100644 reference/quickgraph-algorithms-randomwalks-weightedmarkovedgechain-2.html create mode 100644 reference/quickgraph-algorithms-randomwalks-weightedmarkovedgechainbase-2.html create mode 100644 reference/quickgraph-algorithms-rankedshortestpath-hoffmanpavleyrankedshortestpathalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-rankedshortestpath-rankedshortestpathalgorithmbase-3.html create mode 100644 reference/quickgraph-algorithms-ranking-pagerankalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-rootedalgorithmbase-2.html create mode 100644 reference/quickgraph-algorithms-rootedsearchalgorithmbase-2.html create mode 100644 reference/quickgraph-algorithms-search-bestfirstfrontiersearchalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-search-bidirectionaldepthfirstsearchalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-search-breadthfirstsearchalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-search-depthfirstsearchalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-search-edgedepthfirstsearchalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-search-implicitdepthfirstsearchalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-search-implicitedgedepthfirstsearchalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-search-undirectedbreadthfirstsearchalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-search-undirecteddepthfirstsearchalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-services-ialgorithmcomponent.html create mode 100644 reference/quickgraph-algorithms-services-ialgorithmservices.html create mode 100644 reference/quickgraph-algorithms-services-icancelmanager.html create mode 100644 reference/quickgraph-algorithms-services-iservice.html create mode 100644 reference/quickgraph-algorithms-shortestpath-astarshortestpathalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-shortestpath-bellmanfordshortestpathalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-shortestpath-dagshortestpathalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-shortestpath-dijkstrashortestpathalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-shortestpath-floydwarshallallshortestpathalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-shortestpath-shortestpathalgorithmbase-3.html create mode 100644 reference/quickgraph-algorithms-shortestpath-undirecteddijkstrashortestpathalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-shortestpath-undirectedshortestpathalgorithmbase-2.html create mode 100644 reference/quickgraph-algorithms-shortestpath-yen-yenshortestpathsalgorithm-1.html create mode 100644 reference/quickgraph-algorithms-tarjanofflineleastcommonancestoralgorithm-2.html create mode 100644 reference/quickgraph-algorithms-topologicalsort-sourcefirstbidirectionaltopologicalsortalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-topologicalsort-sourcefirsttopologicalsortalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-topologicalsort-topologicalsortalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-topologicalsort-topologicalsortdirection.html create mode 100644 reference/quickgraph-algorithms-topologicalsort-undirectedfirsttopologicalsortalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-topologicalsort-undirectedtopologicalsortalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-tsp-taskpriority.html create mode 100644 reference/quickgraph-algorithms-tsp-tsp-3.html create mode 100644 reference/quickgraph-arrayadjacencygraph-2.html create mode 100644 reference/quickgraph-arraybidirectionalgraph-2.html create mode 100644 reference/quickgraph-arrayequalitycomparer-1.html create mode 100644 reference/quickgraph-arrayundirectedgraph-2.html create mode 100644 reference/quickgraph-bidirectionadaptergraph-2.html create mode 100644 reference/quickgraph-bidirectionalgraph-2.html create mode 100644 reference/quickgraph-bidirectionalmatrixgraph-1.html create mode 100644 reference/quickgraph-clusteredadjacencygraph-2.html create mode 100644 reference/quickgraph-collections-binaryheap-2.html create mode 100644 reference/quickgraph-collections-binaryqueue-2.html create mode 100644 reference/quickgraph-collections-edgeedgedictionary-2.html create mode 100644 reference/quickgraph-collections-edgelist-2.html create mode 100644 reference/quickgraph-collections-fibonacciheap-2.html create mode 100644 reference/quickgraph-collections-fibonacciheapcell-2.html create mode 100644 reference/quickgraph-collections-fibonacciheaplinkedlist-2.html create mode 100644 reference/quickgraph-collections-fibonacciqueue-2.html create mode 100644 reference/quickgraph-collections-forestdisjointset-1.html create mode 100644 reference/quickgraph-collections-heapdirection.html create mode 100644 reference/quickgraph-collections-idisjointset-1.html create mode 100644 reference/quickgraph-collections-iedgelist-2.html create mode 100644 reference/quickgraph-collections-ipriorityqueue-1.html create mode 100644 reference/quickgraph-collections-iqueue-1.html create mode 100644 reference/quickgraph-collections-ivertexedgedictionary-2.html create mode 100644 reference/quickgraph-collections-queue-1.html create mode 100644 reference/quickgraph-collections-softheap-2.html create mode 100644 reference/quickgraph-collections-termedgelist-2.html create mode 100644 reference/quickgraph-collections-vertexedgedictionary-2.html create mode 100644 reference/quickgraph-collections-vertexlist-1.html create mode 100644 reference/quickgraph-compressedsparserowgraph-1.html create mode 100644 reference/quickgraph-contracts-graphcontract.html create mode 100644 reference/quickgraph-createedgedelegate-2.html create mode 100644 reference/quickgraph-createvertexdelegate-2.html create mode 100644 reference/quickgraph-data-datarelationedge.html create mode 100644 reference/quickgraph-data-datasetgraph.html create mode 100644 reference/quickgraph-data-datasetgraphextensions.html create mode 100644 reference/quickgraph-data-datasetgraphpopulatoralgorithm.html create mode 100644 reference/quickgraph-data-datasetgraphvizalgorithm.html create mode 100644 reference/quickgraph-delegatebidirectionalincidencegraph-2.html create mode 100644 reference/quickgraph-delegateimplicitgraph-2.html create mode 100644 reference/quickgraph-delegateimplicitundirectedgraph-2.html create mode 100644 reference/quickgraph-delegateincidencegraph-2.html create mode 100644 reference/quickgraph-delegateundirectedgraph-2.html create mode 100644 reference/quickgraph-delegatevertexandedgelistgraph-2.html create mode 100644 reference/quickgraph-dotparseradapter.html create mode 100644 reference/quickgraph-doubleequalitycomparer.html create mode 100644 reference/quickgraph-edge-1.html create mode 100644 reference/quickgraph-edgeaction-2.html create mode 100644 reference/quickgraph-edgeedgeaction-2.html create mode 100644 reference/quickgraph-edgeequalitycomparer-2.html create mode 100644 reference/quickgraph-edgeeventargs-2.html create mode 100644 reference/quickgraph-edgeextensions.html create mode 100644 reference/quickgraph-edgefactory-2.html create mode 100644 reference/quickgraph-edgeidentity-2.html create mode 100644 reference/quickgraph-edgelistgraph-2.html create mode 100644 reference/quickgraph-edgepredicate-2.html create mode 100644 reference/quickgraph-enumerablecontract.html create mode 100644 reference/quickgraph-equalityextensions.html create mode 100644 reference/quickgraph-equatableedge-1.html create mode 100644 reference/quickgraph-equatabletermedge-1.html create mode 100644 reference/quickgraph-equategraphs.html create mode 100644 reference/quickgraph-floatequalitycomparer.html create mode 100644 reference/quickgraph-fsa-graphbasedfsa-dfanode-1.html create mode 100644 reference/quickgraph-fsa-graphbasedfsa-edgefsa-1.html create mode 100644 reference/quickgraph-fsa-graphbasedfsa-fsa-1.html create mode 100644 reference/quickgraph-fsa-graphbasedfsa-fsaparams-2.html create mode 100644 reference/quickgraph-fsa-graphbasedfsa-multimap-2.html create mode 100644 reference/quickgraph-fsa-graphbasedfsa-nodesetset.html create mode 100644 reference/quickgraph-fsa-graphbasedfsa-replaceamount.html create mode 100644 reference/quickgraph-fsa-graphbasedfsa-replaceappetite.html create mode 100644 reference/quickgraph-fsa-graphbasedfsa-replaceorder.html create mode 100644 reference/quickgraph-fsa-graphbasedfsa-replacesemantics.html create mode 100644 reference/quickgraph-fsa-graphbasedfsa-symb-1.html create mode 100644 reference/quickgraph-fsa-graphbasedfsa.html create mode 100644 reference/quickgraph-fst-fsttable-edge-2.html create mode 100644 reference/quickgraph-fst-fsttable-fst-2.html create mode 100644 reference/quickgraph-fst-fsttable-simplefst-2.html create mode 100644 reference/quickgraph-fst-fsttable.html create mode 100644 reference/quickgraph-fst-graphbasedfst-edgefst-2.html create mode 100644 reference/quickgraph-fst-graphbasedfst-fst-2.html create mode 100644 reference/quickgraph-fst-graphbasedfst-test-2.html create mode 100644 reference/quickgraph-fst-graphbasedfst.html create mode 100644 reference/quickgraph-glee-gleedefaultgraphpopulator-2.html create mode 100644 reference/quickgraph-glee-gleeedgeeventargs-2.html create mode 100644 reference/quickgraph-glee-gleeedgeeventhandler-2.html create mode 100644 reference/quickgraph-glee-gleegraphextensions.html create mode 100644 reference/quickgraph-glee-gleegraphpopulator-2.html create mode 100644 reference/quickgraph-glee-gleeindentifiablegraphpopulator-2.html create mode 100644 reference/quickgraph-glee-gleetostringgraphpopulator-2.html create mode 100644 reference/quickgraph-glee-gleevertexeventargs-1.html create mode 100644 reference/quickgraph-glee-gleevertexnodeeventhandler-1.html create mode 100644 reference/quickgraph-graphcolor.html create mode 100644 reference/quickgraph-graphextensions.html create mode 100644 reference/quickgraph-graphviz-condensatedgraphrenderer-3.html create mode 100644 reference/quickgraph-graphviz-dot-graphvizarrow.html create mode 100644 reference/quickgraph-graphviz-dot-graphvizarrowclipping.html create mode 100644 reference/quickgraph-graphviz-dot-graphvizarrowfilling.html create mode 100644 reference/quickgraph-graphviz-dot-graphvizarrowshape.html create mode 100644 reference/quickgraph-graphviz-dot-graphvizclustermode.html create mode 100644 reference/quickgraph-graphviz-dot-graphvizedge.html create mode 100644 reference/quickgraph-graphviz-dot-graphvizedgedirection.html create mode 100644 reference/quickgraph-graphviz-dot-graphvizedgeextremity.html create mode 100644 reference/quickgraph-graphviz-dot-graphvizedgelabel.html create mode 100644 reference/quickgraph-graphviz-dot-graphvizedgestyle.html create mode 100644 reference/quickgraph-graphviz-dot-graphvizgraph.html create mode 100644 reference/quickgraph-graphviz-dot-graphvizimagetype.html create mode 100644 reference/quickgraph-graphviz-dot-graphvizlabeljustification.html create mode 100644 reference/quickgraph-graphviz-dot-graphvizlabellocation.html create mode 100644 reference/quickgraph-graphviz-dot-graphvizlayer.html create mode 100644 reference/quickgraph-graphviz-dot-graphvizlayercollection.html create mode 100644 reference/quickgraph-graphviz-dot-graphvizoutputmode.html create mode 100644 reference/quickgraph-graphviz-dot-graphvizpagedirection.html create mode 100644 reference/quickgraph-graphviz-dot-graphvizrankdirection.html create mode 100644 reference/quickgraph-graphviz-dot-graphvizratiomode.html create mode 100644 reference/quickgraph-graphviz-dot-graphvizrecord.html create mode 100644 reference/quickgraph-graphviz-dot-graphvizrecordcell.html create mode 100644 reference/quickgraph-graphviz-dot-graphvizrecordcellcollection.html create mode 100644 reference/quickgraph-graphviz-dot-graphvizrecordescaper.html create mode 100644 reference/quickgraph-graphviz-dot-graphvizvertex.html create mode 100644 reference/quickgraph-graphviz-dot-graphvizvertexshape.html create mode 100644 reference/quickgraph-graphviz-dot-graphvizvertexstyle.html create mode 100644 reference/quickgraph-graphviz-edgemergecondensatedgraphrenderer-2.html create mode 100644 reference/quickgraph-graphviz-filedotengine.html create mode 100644 reference/quickgraph-graphviz-formatclustereventargs-2.html create mode 100644 reference/quickgraph-graphviz-formatclustereventhandler-2.html create mode 100644 reference/quickgraph-graphviz-formatedgeaction-2.html create mode 100644 reference/quickgraph-graphviz-formatedgeeventargs-2.html create mode 100644 reference/quickgraph-graphviz-formatvertexeventargs-1.html create mode 100644 reference/quickgraph-graphviz-formatvertexeventhandler-1.html create mode 100644 reference/quickgraph-graphviz-graphrendererbase-2.html create mode 100644 reference/quickgraph-graphviz-graphvizalgorithm-2.html create mode 100644 reference/quickgraph-graphviz-graphvizextensions.html create mode 100644 reference/quickgraph-graphviz-idotengine.html create mode 100644 reference/quickgraph-graphviz-svghtmlwrapper.html create mode 100644 reference/quickgraph-ibidirectionalgraph-2.html create mode 100644 reference/quickgraph-ibidirectionalincidencegraph-2.html create mode 100644 reference/quickgraph-icloneableedge-2.html create mode 100644 reference/quickgraph-iclusteredgraph.html create mode 100644 reference/quickgraph-identifiableedgefactory-2.html create mode 100644 reference/quickgraph-identifiablevertexfactory-1.html create mode 100644 reference/quickgraph-iedge-1.html create mode 100644 reference/quickgraph-iedgelistandincidencegraph-2.html create mode 100644 reference/quickgraph-iedgelistgraph-2.html create mode 100644 reference/quickgraph-iedgeset-2.html create mode 100644 reference/quickgraph-igraph-2.html create mode 100644 reference/quickgraph-ihierarchy-2.html create mode 100644 reference/quickgraph-ihyperedge-1.html create mode 100644 reference/quickgraph-iimplicitgraph-2.html create mode 100644 reference/quickgraph-iimplicitundirectedgraph-2.html create mode 100644 reference/quickgraph-iimplicitvertexset-1.html create mode 100644 reference/quickgraph-iincidencegraph-2.html create mode 100644 reference/quickgraph-imutablebidirectionalgraph-2.html create mode 100644 reference/quickgraph-imutableedgelistgraph-2.html create mode 100644 reference/quickgraph-imutablegraph-2.html create mode 100644 reference/quickgraph-imutableincidencegraph-2.html create mode 100644 reference/quickgraph-imutabletermbidirectionalgraph-2.html create mode 100644 reference/quickgraph-imutableundirectedgraph-2.html create mode 100644 reference/quickgraph-imutablevertexandedgelistgraph-2.html create mode 100644 reference/quickgraph-imutablevertexandedgeset-2.html create mode 100644 reference/quickgraph-imutablevertexlistgraph-2.html create mode 100644 reference/quickgraph-imutablevertexset-1.html create mode 100644 reference/quickgraph-itagged-1.html create mode 100644 reference/quickgraph-itermbidirectionalgraph-2.html create mode 100644 reference/quickgraph-itermedge-1.html create mode 100644 reference/quickgraph-iundirectededge-1.html create mode 100644 reference/quickgraph-iundirectedgraph-2.html create mode 100644 reference/quickgraph-ivertexandedgelistgraph-2.html create mode 100644 reference/quickgraph-ivertexlistgraph-2.html create mode 100644 reference/quickgraph-ivertexset-1.html create mode 100644 reference/quickgraph-negativecyclegraphexception.html create mode 100644 reference/quickgraph-negativeweightexception.html create mode 100644 reference/quickgraph-nonacyclicgraphexception.html create mode 100644 reference/quickgraph-nonstronglyconnectedgraphexception.html create mode 100644 reference/quickgraph-nopathfoundexception.html create mode 100644 reference/quickgraph-paralleledgenotallowedexception.html create mode 100644 reference/quickgraph-petri-allwaystrueconditionexpression-1.html create mode 100644 reference/quickgraph-petri-iarc-1.html create mode 100644 reference/quickgraph-petri-iconditionexpression-1.html create mode 100644 reference/quickgraph-petri-identityexpression-1.html create mode 100644 reference/quickgraph-petri-iexpression-1.html create mode 100644 reference/quickgraph-petri-imutablepetrinet-1.html create mode 100644 reference/quickgraph-petri-ipetrigraph-1.html create mode 100644 reference/quickgraph-petri-ipetrinet-1.html create mode 100644 reference/quickgraph-petri-ipetrivertex.html create mode 100644 reference/quickgraph-petri-iplace-1.html create mode 100644 reference/quickgraph-petri-itransition-1.html create mode 100644 reference/quickgraph-petri-petrinet-1.html create mode 100644 reference/quickgraph-petri-petrinetsimulator-1.html create mode 100644 reference/quickgraph-predicates-filteredbidirectionalgraph-3.html create mode 100644 reference/quickgraph-predicates-filterededgelistgraph-3.html create mode 100644 reference/quickgraph-predicates-filteredgraph-3.html create mode 100644 reference/quickgraph-predicates-filteredimplicitgraph-3.html create mode 100644 reference/quickgraph-predicates-filteredimplicitvertexset-3.html create mode 100644 reference/quickgraph-predicates-filteredincidencegraph-3.html create mode 100644 reference/quickgraph-predicates-filteredundirectedgraph-3.html create mode 100644 reference/quickgraph-predicates-filteredvertexandedgelistgraph-3.html create mode 100644 reference/quickgraph-predicates-filteredvertexlistgraph-3.html create mode 100644 reference/quickgraph-predicates-indictionaryvertexpredicate-2.html create mode 100644 reference/quickgraph-predicates-isolatedvertexpredicate-2.html create mode 100644 reference/quickgraph-predicates-residualedgepredicate-2.html create mode 100644 reference/quickgraph-predicates-reversedresidualedgepredicate-2.html create mode 100644 reference/quickgraph-predicates-sinkvertexpredicate-2.html create mode 100644 reference/quickgraph-quickgraphexception.html create mode 100644 reference/quickgraph-quickgraphresourcemanager.html create mode 100644 reference/quickgraph-referenceequalitycomparer-1.html create mode 100644 reference/quickgraph-reversedbidirectionalgraph-2.html create mode 100644 reference/quickgraph-samples-graphcreation.html create mode 100644 reference/quickgraph-samples-graphvizsamples.html create mode 100644 reference/quickgraph-samples-wikisamples.html create mode 100644 reference/quickgraph-sedge-1.html create mode 100644 reference/quickgraph-sequatableedge-1.html create mode 100644 reference/quickgraph-sequatableundirectededge-1.html create mode 100644 reference/quickgraph-serialization-directedgraphml-clrboolean.html create mode 100644 reference/quickgraph-serialization-directedgraphml-directedgraph.html create mode 100644 reference/quickgraph-serialization-directedgraphml-directedgraphalias.html create mode 100644 reference/quickgraph-serialization-directedgraphml-directedgraphcategory.html create mode 100644 reference/quickgraph-serialization-directedgraphml-directedgraphlink.html create mode 100644 reference/quickgraph-serialization-directedgraphml-directedgraphlinkcategory.html create mode 100644 reference/quickgraph-serialization-directedgraphml-directedgraphname.html create mode 100644 reference/quickgraph-serialization-directedgraphml-directedgraphnode.html create mode 100644 reference/quickgraph-serialization-directedgraphml-directedgraphnodecategory.html create mode 100644 reference/quickgraph-serialization-directedgraphml-directedgraphpath.html create mode 100644 reference/quickgraph-serialization-directedgraphml-directedgraphproperty.html create mode 100644 reference/quickgraph-serialization-directedgraphml-directedgraphstyle.html create mode 100644 reference/quickgraph-serialization-directedgraphml-directedgraphstylecondition.html create mode 100644 reference/quickgraph-serialization-directedgraphml-directedgraphstylesetter.html create mode 100644 reference/quickgraph-serialization-directedgraphml-fontstyleenum.html create mode 100644 reference/quickgraph-serialization-directedgraphml-fontweightenum.html create mode 100644 reference/quickgraph-serialization-directedgraphml-framekindenum.html create mode 100644 reference/quickgraph-serialization-directedgraphml-graphdirectionenum.html create mode 100644 reference/quickgraph-serialization-directedgraphml-groupenum.html create mode 100644 reference/quickgraph-serialization-directedgraphml-horizontalalignmentenum.html create mode 100644 reference/quickgraph-serialization-directedgraphml-layoutenum.html create mode 100644 reference/quickgraph-serialization-directedgraphml-propertytype.html create mode 100644 reference/quickgraph-serialization-directedgraphml-targettypeenum.html create mode 100644 reference/quickgraph-serialization-directedgraphml-verticalalignmentenum.html create mode 100644 reference/quickgraph-serialization-directedgraphml-visibilityenum.html create mode 100644 reference/quickgraph-serialization-directedgraphmlalgorithm-2.html create mode 100644 reference/quickgraph-serialization-directedgraphmlextensions.html create mode 100644 reference/quickgraph-serialization-graphmldeserializer-3.html create mode 100644 reference/quickgraph-serialization-graphmlextensions.html create mode 100644 reference/quickgraph-serialization-graphmlserializer-3.html create mode 100644 reference/quickgraph-serialization-graphmlxmlresolver.html create mode 100644 reference/quickgraph-serialization-serializationextensions.html create mode 100644 reference/quickgraph-serialization-serializerbase-2.html create mode 100644 reference/quickgraph-serialization-xmlreaderextensions.html create mode 100644 reference/quickgraph-serialization-xmlserializableedge-1.html create mode 100644 reference/quickgraph-serialization-xmlserializablegraph-3.html create mode 100644 reference/quickgraph-serialization-xmlwriterextensions.html create mode 100644 reference/quickgraph-sreversededge-2.html create mode 100644 reference/quickgraph-staggededge-2.html create mode 100644 reference/quickgraph-staggedequatableedge-2.html create mode 100644 reference/quickgraph-sundirectededge-1.html create mode 100644 reference/quickgraph-sundirectedtaggededge-2.html create mode 100644 reference/quickgraph-taggededge-2.html create mode 100644 reference/quickgraph-taggedequatableedge-2.html create mode 100644 reference/quickgraph-taggedundirectededge-2.html create mode 100644 reference/quickgraph-termbidirectionalgraph-2.html create mode 100644 reference/quickgraph-termedge-1.html create mode 100644 reference/quickgraph-tryfunc-2.html create mode 100644 reference/quickgraph-tryfunc-3.html create mode 100644 reference/quickgraph-tryfunc-4.html create mode 100644 reference/quickgraph-tryfunc-5.html create mode 100644 reference/quickgraph-undirectedbidirectionalgraph-2.html create mode 100644 reference/quickgraph-undirectededge-1.html create mode 100644 reference/quickgraph-undirectededgeaction-2.html create mode 100644 reference/quickgraph-undirectededgeeventargs-2.html create mode 100644 reference/quickgraph-undirectedgraph-2.html create mode 100644 reference/quickgraph-vertexaction-1.html create mode 100644 reference/quickgraph-vertexeventargs-1.html create mode 100644 reference/quickgraph-vertexeventhandler-1.html create mode 100644 reference/quickgraph-vertexfactory-1.html create mode 100644 reference/quickgraph-vertexidentity-1.html create mode 100644 reference/quickgraph-vertexindexer-1.html create mode 100644 reference/quickgraph-vertexpredicate-1.html diff --git a/reference/global-helpertypes.html b/reference/global-helpertypes.html new file mode 100644 index 000000000..eeb54e1be --- /dev/null +++ b/reference/global-helpertypes.html @@ -0,0 +1,137 @@ + + + + + HelperTypes - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    HelperTypes

    +

    + Namespace: global
    +

    +
    +
    + + +

    Nested types and modules

    +
    + + + + + + + + + + + + + + + + + + + + + + +
    TypeDescription
    + EqClass +
    + MarkedVal<'a> +
    + StateFromFsa +
    + TwoSets<'a> +
    + + + + + + + + + + + + + + + + + + + + + + +
    ModuleDescription
    + EqClassFuns +
    + MarkedValFuns +
    + StateFromFsaFuns +
    + TwoSetsFuns +
    + +
    + + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/helpertypes-eqclass.html b/reference/helpertypes-eqclass.html new file mode 100644 index 000000000..8d133c574 --- /dev/null +++ b/reference/helpertypes-eqclass.html @@ -0,0 +1,95 @@ + + + + + EqClass - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EqClass

    +

    + Namespace: global
    + Parent Module: HelperTypes +

    +
    +
    +

    Union Cases

    + + + + + + + + + + +
    Union CaseDescription
    + + + EqClass(TwoSets<int>) + +
    + Signature: TwoSets<int>
    +
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/helpertypes-eqclassfuns.html b/reference/helpertypes-eqclassfuns.html new file mode 100644 index 000000000..915657f13 --- /dev/null +++ b/reference/helpertypes-eqclassfuns.html @@ -0,0 +1,170 @@ + + + + + EqClassFuns - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EqClassFuns

    +

    + Namespace: global
    + Parent Module: HelperTypes +

    +
    +
    + + + +

    Functions and values

    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Function or valueDescription
    + + + add arg1 arg2 + +
    + Signature: StateFromFsa -> EqClass -> EqClass
    +
    +     		+ + + + + +
    + + + contains v arg2 + +
    + Signature: v:int -> EqClass -> bool
    +
    +     		+ + + + + +
    + + + empty + +
    + Signature: EqClass
    +
    +     		+ + + + + +
    + + + fsa1States arg1 + +
    + Signature: EqClass -> Set<int>
    +
    +     		+ + + + + +
    + + + fsa2States arg1 + +
    + Signature: EqClass -> Set<int>
    +
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/helpertypes-markedval-1.html b/reference/helpertypes-markedval-1.html new file mode 100644 index 000000000..2050294e2 --- /dev/null +++ b/reference/helpertypes-markedval-1.html @@ -0,0 +1,113 @@ + + + + + MarkedVal<'a> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    MarkedVal<'a>

    +

    + Namespace: global
    + Parent Module: HelperTypes +

    +
    +
    +

    Record Fields

    + + + + + + + + + + + + + + +
    Record FieldDescription
    + + + Marked + +
    + Signature: bool
    +
    +     		+ + + + + +
    + + + Value + +
    + Signature: 'a
    +
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/helpertypes-markedvalfuns.html b/reference/helpertypes-markedvalfuns.html new file mode 100644 index 000000000..8dfc151eb --- /dev/null +++ b/reference/helpertypes-markedvalfuns.html @@ -0,0 +1,116 @@ + + + + + MarkedValFuns - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    MarkedValFuns

    +

    + Namespace: global
    + Parent Module: HelperTypes +

    +
    +
    + + + +

    Functions and values

    + + + + + + + + + + + + + + +
    Function or valueDescription
    + + + marked v + +
    + Signature: v:'?7535 -> MarkedVal<'?7535>
    + Type parameters: '?7535
    +     		+ + + + + +
    + + + notMarked v + +
    + Signature: v:'?7537 -> MarkedVal<'?7537>
    + Type parameters: '?7537
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/helpertypes-statefromfsa.html b/reference/helpertypes-statefromfsa.html new file mode 100644 index 000000000..f7f8db7f2 --- /dev/null +++ b/reference/helpertypes-statefromfsa.html @@ -0,0 +1,95 @@ + + + + + StateFromFsa - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    StateFromFsa

    +

    + Namespace: global
    + Parent Module: HelperTypes +

    +
    +
    +

    Union Cases

    + + + + + + + + + + +
    Union CaseDescription
    + + + StateFromFsa(MarkedVal<int>) + +
    + Signature: MarkedVal<int>
    +
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/helpertypes-statefromfsafuns.html b/reference/helpertypes-statefromfsafuns.html new file mode 100644 index 000000000..08261d812 --- /dev/null +++ b/reference/helpertypes-statefromfsafuns.html @@ -0,0 +1,152 @@ + + + + + StateFromFsaFuns - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    StateFromFsaFuns

    +

    + Namespace: global
    + Parent Module: HelperTypes +

    +
    +
    + + + +

    Functions and values

    + + + + + + + + + + + + + + + + + + + + + + +
    Function or valueDescription
    + + + fromFsa1 id + +
    + Signature: id:int -> StateFromFsa
    +
    +     		+ + + + + +
    + + + fromFsa2 id + +
    + Signature: id:int -> StateFromFsa
    +
    +     		+ + + + + +
    + + + isFromFsa1 arg1 + +
    + Signature: StateFromFsa -> bool
    +
    +     		+ + + + + +
    + + + isFromFsa2 arg1 + +
    + Signature: StateFromFsa -> bool
    +
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/helpertypes-twosets-1.html b/reference/helpertypes-twosets-1.html new file mode 100644 index 000000000..83380b3b8 --- /dev/null +++ b/reference/helpertypes-twosets-1.html @@ -0,0 +1,113 @@ + + + + + TwoSets<'a> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    TwoSets<'a>

    +

    + Namespace: global
    + Parent Module: HelperTypes +

    +
    +
    +

    Record Fields

    + + + + + + + + + + + + + + +
    Record FieldDescription
    + + + Marked + +
    + Signature: Set<'a>
    +
    +     		+ + + + + +
    + + + NotMarked + +
    + Signature: Set<'a>
    +
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/helpertypes-twosetsfuns.html b/reference/helpertypes-twosetsfuns.html new file mode 100644 index 000000000..2152c039e --- /dev/null +++ b/reference/helpertypes-twosetsfuns.html @@ -0,0 +1,134 @@ + + + + + TwoSetsFuns - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    TwoSetsFuns

    +

    + Namespace: global
    + Parent Module: HelperTypes +

    +
    +
    + + + +

    Functions and values

    + + + + + + + + + + + + + + + + + + +
    Function or valueDescription
    + + + add mv ts + +
    + Signature: mv:MarkedVal<'?7552> -> ts:TwoSets<'?7552> -> TwoSets<'?7552>
    + Type parameters: '?7552
    +     		+ + + + + +
    + + + contains v ts + +
    + Signature: v:'?7554 -> ts:TwoSets<'?7554> -> bool
    + Type parameters: '?7554
    +     		+ + + + + +
    + + + empty + +
    + Signature: TwoSets<'?7550>
    + Type parameters: '?7550
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/index.html b/reference/index.html index eec375f90..7d31e2ec4 100644 --- a/reference/index.html +++ b/reference/index.html @@ -36,6 +36,2942 @@

    QuickGraph

    QuickGraph

    +

    QuickGraph Namespace

    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    TypeDescription
    + AdjacencyGraph<'TVertex, 'TEdge> +

    A mutable directed graph data structure efficient for sparse +graph representation where out-edge need to be enumerated only.

    + +
    + ArrayAdjacencyGraph<'TVertex, 'TEdge> +

    An immutable directed graph data structure efficient for large sparse +graph representation where out-edge need to be enumerated only.

    + +
    + ArrayBidirectionalGraph<'TVertex, 'TEdge> +

    An immutable directed graph data structure efficient for large sparse +graph representation where out-edge need to be enumerated only.

    + +
    + ArrayEqualityComparer<'T> +

    Equality comparer for array of T using Equals1 method.

    + +
    + ArrayUndirectedGraph<'TVertex, 'TEdge> +

    An immutable undirected graph data structure based on arrays.

    + +
    + BidirectionAdapterGraph<'TVertex, 'TEdge> +

    Wraps a vertex list graph (out-edges only) and caches the in-edge dictionary.

    + +
    + BidirectionalGraph<'TVertex, 'TEdge> +

    A mutable directed graph data structure efficient for sparse +graph representation where out-edge and in-edges need to be enumerated. Requires +twice as much memory as the adjacency graph.

    + +
    + BidirectionalMatrixGraph<'TEdge> +
    + ClusteredAdjacencyGraph<'TVertex, 'TEdge> +
    + CompressedSparseRowGraph<'TVertex> +

    Directed graph representation using a Compressed Sparse Row representation +(http://www.cs.utk.edu/~dongarra/etemplates/node373.html)

    + +
    + CreateEdgeDelegate<'TVertex, 'TEdge> +

    An edge factory delegate

    + +
    + CreateVertexDelegate<'TVertex, 'TEdge> +

    A vertex factory delegate.

    + +
    + DelegateBidirectionalIncidenceGraph<'TVertex, 'TEdge> +

    A delegate based bidirectional implicit graph

    + +
    + DelegateImplicitGraph<'TVertex, 'TEdge> +

    A delegate-based implicit graph

    + +
    + DelegateImplicitUndirectedGraph<'TVertex, 'TEdge> +

    A functional implicit undirected graph

    + +
    + DelegateIncidenceGraph<'TVertex, 'TEdge> +

    A delegate-based incidence graph

    + +
    + DelegateUndirectedGraph<'TVertex, 'TEdge> +

    A functional implicit undirected graph

    + +
    + DelegateVertexAndEdgeListGraph<'TVertex, 'TEdge> +

    A delegate-based incidence graph

    + +
    + DotParserAdapter +
    + DoubleEqualityComparer +

    IEqualityComparer for floats with user-specified tolerance.

    + +
    + Edge<'TVertex> +

    The default implementation.

    + +
    + EdgeAction<'TVertex, 'TEdge> +

    The handler for events involving edges

    + +
    + EdgeEdgeAction<'TVertex, 'TEdge> +

    The handler for events involving two edges

    + +
    + EdgeEqualityComparer<'TVertex, 'TEdge> +
    + EdgeEventArgs<'TVertex, 'TEdge> +

    An event involving an edge.

    + +
    + EdgeExtensions +
    + EdgeFactory<'TVertex, 'TEdge> +

    An edge factory

    + +
    + EdgeIdentity<'TVertex, 'TEdge> +
    + EdgeListGraph<'TVertex, 'TEdge> +
    + EdgePredicate<'TVertex, 'TEdge> +
    + EnumerableContract +
    + EqualityExtensions +

    Deep equality methods for collections (arrays, dictionaries) implemented as extension methods.

    + +
    + EquatableEdge<'TVertex> +

    An equatable edge implementation

    + +
    + EquatableTermEdge<'TVertex> +

    An equatable term edge implementation

    + +
    + EquateGraphs +
    + FloatEqualityComparer +

    IEqualityComparer for floats with user-specified tolerance.

    + +
    + GraphColor +

    Colors used in vertex coloring algorithms

    + +
    + GraphExtensions +

    Extension methods for populating graph datastructures

    + +
    + IBidirectionalGraph<'TVertex, 'TEdge> +

    A directed graph datastructure that is efficient +to traverse both in and out edges.

    + +
    + IBidirectionalIncidenceGraph<'TVertex, 'TEdge> +

    A directed graph datastructure that is efficient +to traverse both in and out edges.

    + +
    + ICloneableEdge<'TVertex, 'TEdge> +

    A cloneable edge

    + +
    + IClusteredGraph +
    + IEdge<'TVertex> +

    A directed edge

    + +
    + IEdgeListAndIncidenceGraph<'TVertex, 'TEdge> +

    An incidence graph whose edges can be enumerated

    + +
    + IEdgeListGraph<'TVertex, 'TEdge> +

    A graph whose edges can be enumerated

    + +
    + IEdgeSet<'TVertex, 'TEdge> +

    A set of edges

    + +
    + IGraph<'TVertex, 'TEdge> +

    A graph with vertices of type +and edges of type

    + +
    + IHierarchy<'TVertex, 'TEdge> +
    + IHyperEdge<'TVertex> +
    + IImplicitGraph<'TVertex, 'TEdge> +

    A implicit directed graph datastructure

    + +
    + IImplicitUndirectedGraph<'TVertex, 'TEdge> +
    + IImplicitVertexSet<'TVertex> +

    An implicit set of vertices

    + +
    + IIncidenceGraph<'TVertex, 'TEdge> +
    + IMutableBidirectionalGraph<'TVertex, 'TEdge> +

    A mutable bidirectional directed graph

    + +
    + IMutableEdgeListGraph<'TVertex, 'TEdge> +

    A mutable edge list graph.

    + +
    + IMutableGraph<'TVertex, 'TEdge> +

    A mutable graph instance

    + +
    + IMutableIncidenceGraph<'TVertex, 'TEdge> +

    A mutable incidence graph

    + +
    + IMutableTermBidirectionalGraph<'TVertex, 'TEdge> +
    + IMutableUndirectedGraph<'TVertex, 'TEdge> +

    A mutable indirect graph

    + +
    + IMutableVertexAndEdgeListGraph<'TVertex, 'TEdge> +

    A mutable vertex and edge list graph

    + +
    + IMutableVertexAndEdgeSet<'TVertex, 'TEdge> +

    A mutable vertex and edge set

    + +
    + IMutableVertexListGraph<'TVertex, 'TEdge> +

    A mutable vertex list graph

    + +
    + IMutableVertexSet<'TVertex> +

    A mutable vertex set

    + +
    + ITagged<'TTag> +

    An instance holding a tag

    + +
    + ITermBidirectionalGraph<'TVertex, 'TEdge> +
    + ITermEdge<'TVertex> +

    A directed edge with terminal indices

    + +
    + IUndirectedEdge<'TVertex> +

    An undirected edge.

    + +
    + IUndirectedGraph<'TVertex, 'TEdge> +

    An undirected graph

    + +
    + IVertexAndEdgeListGraph<'TVertex, 'TEdge> +

    A directed graph where vertices and edges can be enumerated efficiently.

    + +
    + IVertexListGraph<'TVertex, 'TEdge> +

    A directed graph datastructure where out-edges can be traversed, +i.e. a vertex set + implicit graph.

    + +
    + IVertexSet<'TVertex> +

    A set of vertices

    + +
    + IdentifiableEdgeFactory<'TVertex, 'TEdge> +

    A factory of identifiable edges.

    + +
    + IdentifiableVertexFactory<'TVertex> +

    A factory of identifiable vertices.

    + +
    + NegativeCycleGraphException +
    + NegativeWeightException +
    + NoPathFoundException +
    + NonAcyclicGraphException +
    + NonStronglyConnectedGraphException +

    Exception raised when an algorithm detects a non-strongly connected graph.

    + +
    + ParallelEdgeNotAllowedException +
    + QuickGraphException +
    + QuickGraphResourceManager +
    + ReferenceEqualityComparer<'T> +

    EqualityComparer that uses Object.ReferenceEquals to compare items.

    + +
    + ReversedBidirectionalGraph<'TVertex, 'TEdge> +
    + SEdge<'TVertex> +

    An struct based implementation.

    + +
    + SEquatableEdge<'TVertex> +

    An struct based implementation.

    + +
    + SEquatableUndirectedEdge<'TVertex> +

    An struct based implementation.

    + +
    + SReversedEdge<'TVertex, 'TEdge> +

    A reversed edge

    + +
    + STaggedEdge<'TVertex, 'TTag> +

    A tagged edge as value type.

    + +
    + STaggedEquatableEdge<'TVertex, 'TTag> +

    A tagged edge as value type.

    + +
    + SUndirectedEdge<'TVertex> +

    An struct based implementation.

    + +
    + SUndirectedTaggedEdge<'TVertex, 'TTag> +

    An struct based implementation.

    + +
    + TaggedEdge<'TVertex, 'TTag> +
    + TaggedEquatableEdge<'TVertex, 'TTag> +

    An equatable, tagged, edge

    + +
    + TaggedUndirectedEdge<'TVertex, 'TTag> +

    A tagged undirected edge.

    + +
    + TermBidirectionalGraph<'TVertex, 'TEdge> +
    + TermEdge<'TVertex> +

    The default implementation.

    + +
    + TryFunc<'T1, 'T2, 'T3, 'T4, 'TResult> +
    + TryFunc<'T1, 'T2, 'T3, 'TResult> +
    + TryFunc<'T1, 'T2, 'TResult> +
    + TryFunc<'T, 'TResult> +
    + UndirectedBidirectionalGraph<'TVertex, 'TEdge> +
    + UndirectedEdge<'TVertex> +

    The default implementation.

    + +
    + UndirectedEdgeAction<'TVertex, 'TEdge> +
    + UndirectedEdgeEventArgs<'TVertex, 'TEdge> +
    + UndirectedGraph<'TVertex, 'TEdge> +
    + VertexAction<'TVertex> +
    + VertexEventArgs<'TVertex> +
    + VertexEventHandler<'TVertex> +
    + VertexFactory<'TVertex> +
    + VertexIdentity<'TVertex> +
    + VertexIndexer<'TVertex> +
    + VertexPredicate<'TVertex> +
    + +
    +

    QuickGraph.Algorithms Namespace

    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    TypeDescription
    + AlgorithmBase<'TGraph> +
    + AlgorithmEventHandler<'TGraph> +
    + AlgorithmExtensions +

    Various extension methods to build algorithms

    + +
    + CentralityApproximationAlgorithm<'TVertex, 'TEdge> +
    + ComputationState +

    The computation state of a graph algorithm

    + +
    + DistanceRelaxers +
    + EulerianTrailAlgorithm<'TVertex, 'TEdge> +
    + IAlgorithm<'TGraph> +
    + IComputation +
    + IConnectedComponentAlgorithm<'TVertex, 'TEdge, 'TGraph> +
    + IDistanceRecorderAlgorithm<'TVertex, 'TEdge> +

    An algorithm that exposes events to compute a distance map between vertices

    + +
    + IDistanceRelaxer +
    + IEdgeColorizerAlgorithm<'TVertex, 'TEdge> +
    + IEdgePredecessorRecorderAlgorithm<'TVertex, 'TEdge> +
    + IEndPathEdgeRecorderAlgorithm<'TVertex, 'TEdge> +
    + ITreeBuilderAlgorithm<'TVertex, 'TEdge> +
    + IUndirectedTreeBuilderAlgorithm<'TVertex, 'TEdge> +
    + IUndirectedVertexPredecessorRecorderAlgorithm<'TVertex, 'TEdge> +
    + IVertexColorizerAlgorithm<'TVertex, 'TEdge> +
    + IVertexPredecessorRecorderAlgorithm<'TVertex, 'TEdge> +
    + IVertexTimeStamperAlgorithm<'TVertex, 'TEdge> +
    + IsEulerianGraphAlgorithm<'TVertex, 'TEdge> +
    + IsHamiltonianGraphAlgorithm<'TVertex, 'TEdge> +
    + MaximumBipartiteMatchingAlgorithm<'TVertex, 'TEdge> +
    + RandomGraphFactory +
    + RootedAlgorithmBase<'TVertex, 'TGraph> +
    + RootedSearchAlgorithmBase<'TVertex, 'TGraph> +
    + TarjanOfflineLeastCommonAncestorAlgorithm<'TVertex, 'TEdge> +

    Offline least common ancestor in a rooted tre

    + +
    + ApproxCompleteColoringAlgorithm +
    + BergerShorMinimumFeedbackArcSetAlgorithm +
    + BipartiteDimensionAlgorithm +
    + Chromosome +
    + DomaticPartition<'Vertex, 'Edge> +
    + EdgeColoringAlgorithm +
    + Fitness +
    + Individual +
    + MaximumIndependentSetAlgorithm +
    + MinimumDominatingSetGeneticAlgorithm +
    + Population +
    + + + + + + + + + + + + + + + + + + +
    ModuleDescription
    + ChromaticPolynomial +
    + GeneticConstants +
    + InducedPathAlgorithm +
    + +
    +

    QuickGraph.Algorithms.Cliques Namespace

    +
    + + + + + + + + + + +
    TypeDescription
    + MaximumCliqueAlgorithmBase<'TVertex, 'TEdge> +
    + +
    +

    QuickGraph.Algorithms.Condensation Namespace

    + +

    QuickGraph.Algorithms.ConnectedComponents Namespace

    + +

    QuickGraph.Algorithms.Exploration Namespace

    + +

    QuickGraph.Algorithms.GraphColoring.VertexColoring Namespace

    +
    + + + + + + + + + + + + + + + + + + +
    TypeDescription
    + InputModel<'TVertex, 'TEdge> +
    + OutputModel<'TVertex, 'TEdge> +
    + VertexColoringAlgorithm<'TVertex, 'TEdge> +
    + +
    +

    QuickGraph.Algorithms.KernighanLinAlgoritm Namespace

    +
    + + + + + + + + + + + + + + +
    TypeDescription
    + KernighanLinAlgoritm<'TVertex, 'TEdge> +
    + Partition<'TVertex> +
    + +
    +

    QuickGraph.Algorithms.MaximumFlow Namespace

    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    TypeDescription
    + AllVerticesGraphAugmentorAlgorithm<'TVertex, 'TEdge> +
    + EdmondsKarpMaximumFlowAlgorithm<'TVertex, 'TEdge> +

    Edmond and Karp maximum flow algorithm +for directed graph with positive capacities and +flows.

    + +
    + GraphAugmentorAlgorithmBase<'TVertex, 'TEdge, 'TGraph> +
    + GraphBalancerAlgorithm<'TVertex, 'TEdge> +
    + MaximumFlowAlgorithm<'TVertex, 'TEdge> +

    Abstract base class for maximum flow algorithms.

    + +
    + MultiSourceSinkGraphAugmentorAlgorithm<'TVertex, 'TEdge> +
    + ReversedEdgeAugmentorAlgorithm<'TVertex, 'TEdge> +
    + +
    +

    QuickGraph.Algorithms.MinimumSpanningTree Namespace

    + +

    QuickGraph.Algorithms.Observers Namespace

    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    TypeDescription
    + EdgePredecessorRecorderObserver<'TVertex, 'TEdge> + +
    + EdgeRecorderObserver<'TVertex, 'TEdge> + +
    + IObserver<'TAlgorithm> +

    An algorithm observer

    + +
    + UndirectedVertexDistanceRecorderObserver<'TVertex, 'TEdge> +

    A distance recorder for undirected tree builder algorithms

    + +
    + UndirectedVertexPredecessorRecorderObserver<'TVertex, 'TEdge> + +
    + VertexDistanceRecorderObserver<'TVertex, 'TEdge> +

    A distance recorder for directed tree builder algorithms

    + +
    + VertexPredecessorPathRecorderObserver<'TVertex, 'TEdge> + +
    + VertexPredecessorRecorderObserver<'TVertex, 'TEdge> + +
    + VertexRecorderObserver<'TVertex, 'TEdge> + +
    + VertexTimeStamperObserver<'TVertex, 'TEdge> + +
    + +
    +

    QuickGraph.Algorithms.RandomWalks Namespace

    + +

    QuickGraph.Algorithms.RankedShortestPath Namespace

    +
    + + + + + + + + + + + + + + +
    TypeDescription
    + HoffmanPavleyRankedShortestPathAlgorithm<'TVertex, 'TEdge> +

    Hoffman and Pavley K-shortest path algorithm.

    + +
    + RankedShortestPathAlgorithmBase<'TVertex, 'TEdge, 'TGraph> +
    + +
    +

    QuickGraph.Algorithms.Ranking Namespace

    +
    + + + + + + + + + + +
    TypeDescription
    + PageRankAlgorithm<'TVertex, 'TEdge> +
    + +
    +

    QuickGraph.Algorithms.Search Namespace

    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    TypeDescription
    + BestFirstFrontierSearchAlgorithm<'TVertex, 'TEdge> +

    Best first frontier search

    + +
    + BidirectionalDepthFirstSearchAlgorithm<'TVertex, 'TEdge> +

    A depth and height first search algorithm for directed graphs

    + +
    + BreadthFirstSearchAlgorithm<'TVertex, 'TEdge> +

    A breath first search algorithm for directed graphs

    + +
    + DepthFirstSearchAlgorithm<'TVertex, 'TEdge> +

    A depth first search algorithm for directed graph

    + +
    + EdgeDepthFirstSearchAlgorithm<'TVertex, 'TEdge> +

    A edge depth first search algorithm for directed graphs

    + +
    + ImplicitDepthFirstSearchAlgorithm<'TVertex, 'TEdge> +

    A depth first search algorithm for implicit directed graphs

    + +
    + ImplicitEdgeDepthFirstSearchAlgorithm<'TVertex, 'TEdge> +

    A edge depth first search algorithm for implicit directed graphs

    + +
    + UndirectedBreadthFirstSearchAlgorithm<'TVertex, 'TEdge> +

    A breath first search algorithm for undirected graphs

    + +
    + UndirectedDepthFirstSearchAlgorithm<'TVertex, 'TEdge> +

    A depth first search algorithm for directed graph

    + +
    + +
    +

    QuickGraph.Algorithms.Services Namespace

    +
    + + + + + + + + + + + + + + + + + + + + + + +
    TypeDescription
    + IAlgorithmComponent +
    + IAlgorithmServices +

    Common services available to algorithm instances

    + +
    + ICancelManager +
    + IService +

    Interface implemented by graph services

    + +
    + +
    +

    QuickGraph.Algorithms.ShortestPath Namespace

    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    TypeDescription
    + AStarShortestPathAlgorithm<'TVertex, 'TEdge> +

    A* single-source shortest path algorithm for directed graph +with positive distance.

    + +
    + BellmanFordShortestPathAlgorithm<'TVertex, 'TEdge> +

    Bellman Ford shortest path algorithm.

    + +
    + DagShortestPathAlgorithm<'TVertex, 'TEdge> +

    A single-source shortest path algorithm for directed acyclic +graph.

    + +
    + DijkstraShortestPathAlgorithm<'TVertex, 'TEdge> +

    Dijkstra single-source shortest path algorithm for directed graph +with positive distance.

    + +
    + FloydWarshallAllShortestPathAlgorithm<'TVertex, 'TEdge> +

    Floyd-Warshall all shortest path algorith,

    + +
    + ShortestPathAlgorithmBase<'TVertex, 'TEdge, 'TGraph> +
    + UndirectedDijkstraShortestPathAlgorithm<'TVertex, 'TEdge> +

    A single-source shortest path algorithm for undirected graph +with positive distance.

    + +
    + UndirectedShortestPathAlgorithmBase<'TVertex, 'TEdge> +
    + +
    +

    QuickGraph.Algorithms.ShortestPath.Yen Namespace

    +
    + + + + + + + + + + +
    TypeDescription
    + YenShortestPathsAlgorithm<'TVertex> +
    + +
    +

    QuickGraph.Algorithms.TSP Namespace

    +
    + + + + + + + + + + + + + + +
    TypeDescription
    + TSP<'TVertex, 'TEdge, 'TGraph> +
    + TaskPriority +
    + +
    +

    QuickGraph.Algorithms.TopologicalSort Namespace

    + +

    QuickGraph.Collections Namespace

    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    TypeDescription
    + BinaryHeap<'TPriority, 'TValue> +

    Binary heap

    + +
    + BinaryQueue<'TVertex, 'TDistance> +
    + EdgeEdgeDictionary<'TVertex, 'TEdge> +
    + EdgeList<'TVertex, 'TEdge> +
    + FibonacciHeap<'TPriority, 'TValue> +
    + FibonacciHeapCell<'TPriority, 'TValue> +
    + FibonacciHeapLinkedList<'TPriority, 'TValue> +
    + FibonacciQueue<'TVertex, 'TDistance> +
    + ForestDisjointSet<'T> +

    Disjoint-set implementation with path compression and union-by-rank optimizations. +optimization

    + +
    + HeapDirection +

    Specifies the order in which a Heap will Dequeue items.

    + +
    + IDisjointSet<'T> +

    A disjoint-set data structure

    + +
    + IEdgeList<'TVertex, 'TEdge> +

    A cloneable list of edges

    + +
    + IPriorityQueue<'T> +
    + IQueue<'T> +
    + IVertexEdgeDictionary<'TVertex, 'TEdge> +

    A dictionary of vertices to a list of edges

    + +
    + Queue<'T> +
    + SoftHeap<'TKey, 'TValue> +
    + TermEdgeList<'TVertex, 'TEdge> +
    + VertexEdgeDictionary<'TVertex, 'TEdge> +
    + VertexList<'TVertex> +
    + +
    +

    QuickGraph.Contracts Namespace

    +
    + + + + + + + + + + +
    TypeDescription
    + GraphContract +

    Debug only assertions and assumptions

    + +
    + +
    +

    QuickGraph.Data Namespace

    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    TypeDescription
    + DataRelationEdge +
    + DataSetGraph +
    + DataSetGraphExtensions +
    + DataSetGraphPopulatorAlgorithm +
    + DataSetGraphvizAlgorithm +

    An algorithm that renders a DataSet graph to the Graphviz DOT format.

    + +
    + +
    +

    QuickGraph.FSA Namespace

    +
    + + + + + + + + + + +
    ModuleDescription
    + GraphBasedFsa +
    + +
    +

    QuickGraph.FST Namespace

    +
    + + + + + + + + + + + + + + +
    ModuleDescription
    + FstTable +
    + GraphBasedFst +
    + +
    +

    QuickGraph.Glee Namespace

    + +

    QuickGraph.Graphviz Namespace

    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    TypeDescription
    + CondensatedGraphRenderer<'TVertex, 'TEdge, 'TGraph> +
    + EdgeMergeCondensatedGraphRenderer<'TVertex, 'TEdge> +
    + FileDotEngine +

    Default dot engine implementation, writes dot code to disk

    + +
    + FormatClusterEventArgs<'TVertex, 'TEdge> +

    A clustered graph event argument.

    + +
    + FormatClusterEventHandler<'TVertex, 'TEdge> +
    + FormatEdgeAction<'TVertex, 'TEdge> +
    + FormatEdgeEventArgs<'TVertex, 'TEdge> +
    + FormatVertexEventArgs<'TVertex> +
    + FormatVertexEventHandler<'TVertex> +
    + GraphRendererBase<'TVertex, 'TEdge> +
    + GraphvizAlgorithm<'TVertex, 'TEdge> +

    An algorithm that renders a graph to the Graphviz DOT format.

    + +
    + GraphvizExtensions +

    Helper extensions to render graphs to graphviz

    + +
    + IDotEngine +
    + SvgHtmlWrapper +
    + +
    +

    QuickGraph.Graphviz.Dot Namespace

    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    TypeDescription
    + GraphvizArrow +
    + GraphvizArrowClipping +
    + GraphvizArrowFilling +
    + GraphvizArrowShape +
    + GraphvizClusterMode +
    + GraphvizEdge +
    + GraphvizEdgeDirection +
    + GraphvizEdgeExtremity +
    + GraphvizEdgeLabel +
    + GraphvizEdgeStyle +
    + GraphvizGraph +
    + GraphvizImageType +
    + GraphvizLabelJustification +
    + GraphvizLabelLocation +
    + GraphvizLayer +
    + GraphvizLayerCollection +
    + GraphvizOutputMode +
    + GraphvizPageDirection +
    + GraphvizRankDirection +
    + GraphvizRatioMode +
    + GraphvizRecord +
    + GraphvizRecordCell +
    + GraphvizRecordCellCollection +
    + GraphvizRecordEscaper +
    + GraphvizVertex +
    + GraphvizVertexShape +
    + GraphvizVertexStyle +
    + +
    +

    QuickGraph.Petri Namespace

    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    TypeDescription
    + AllwaysTrueConditionExpression<'Token> +
    + IArc<'Token> +

    A directed edge of a net which may connect a +to a or a to +a .

    + +
    + IConditionExpression<'Token> +
    + IExpression<'Token> +
    + IMutablePetriNet<'Token> +
    + IPetriGraph<'Token> +
    + IPetriNet<'Token> +

    A High Level Petri Graph.

    + +
    + IPetriVertex +

    A vertex (node) of a Petri Graph.

    + +
    + IPlace<'Token> +

    A Place in the HLPN framework

    + +
    + ITransition<'Token> +

    A node of a net, taken from the transition kind.

    + +
    + IdentityExpression<'Token> +
    + PetriNet<'Token> +
    + PetriNetSimulator<'Token> +
    + +
    +

    QuickGraph.Predicates Namespace

    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    TypeDescription
    + FilteredBidirectionalGraph<'TVertex, 'TEdge, 'TGraph> +
    + FilteredEdgeListGraph<'TVertex, 'TEdge, 'TGraph> +
    + FilteredGraph<'TVertex, 'TEdge, 'TGraph> +
    + FilteredImplicitGraph<'TVertex, 'TEdge, 'TGraph> +
    + FilteredImplicitVertexSet<'TVertex, 'TEdge, 'TGraph> +
    + FilteredIncidenceGraph<'TVertex, 'TEdge, 'TGraph> +
    + FilteredUndirectedGraph<'TVertex, 'TEdge, 'TGraph> +
    + FilteredVertexAndEdgeListGraph<'TVertex, 'TEdge, 'TGraph> +
    + FilteredVertexListGraph<'TVertex, 'TEdge, 'Graph> +
    + InDictionaryVertexPredicate<'TVertex, 'TValue> +
    + IsolatedVertexPredicate<'TVertex, 'TEdge> +

    A vertex predicate that detects vertex with no in or out edges.

    + +
    + ResidualEdgePredicate<'TVertex, 'TEdge> +
    + ReversedResidualEdgePredicate<'TVertex, 'TEdge> +
    + SinkVertexPredicate<'TVertex, 'TEdge> +
    + +
    +

    QuickGraph.Samples Namespace

    +
    + + + + + + + + + + + + + + + + + + +
    TypeDescription
    + GraphCreation +
    + GraphvizSamples +
    + WikiSamples +
    + +
    +

    QuickGraph.Serialization Namespace

    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    TypeDescription
    + DirectedGraphMLAlgorithm<'TVertex, 'TEdge> +
    + DirectedGraphMLExtensions +

    Directed Graph Markup Language extensions

    + +
    + GraphMLDeserializer<'TVertex, 'TEdge, 'TGraph> +

    A GraphML ( http://graphml.graphdrawing.org/ ) format deserializer.

    + +
    + GraphMLExtensions +
    + GraphMLSerializer<'TVertex, 'TEdge, 'TGraph> +

    A GraphML ( http://graphml.graphdrawing.org/ ) format serializer.

    + +
    + GraphMLXmlResolver +

    A resolver that loads graphml DTD and XSD schemas +from embedded resources.

    + +
    + SerializationExtensions +
    + SerializerBase<'TVertex, 'TEdge> +
    + XmlReaderExtensions +
    + XmlSerializableEdge<'TVertex> +
    + XmlSerializableGraph<'TVertex, 'TEdge, 'TGraph> +

    A base class that creates a proxy to a graph that is xml serializable

    + +
    + XmlWriterExtensions +
    + +
    +

    QuickGraph.Serialization.DirectedGraphML Namespace

    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    TypeDescription
    + ClrBoolean +
    + DirectedGraph +
    + DirectedGraphAlias +
    + DirectedGraphCategory +
    + DirectedGraphLink +
    + DirectedGraphLinkCategory +
    + DirectedGraphName +
    + DirectedGraphNode +
    + DirectedGraphNodeCategory +
    + DirectedGraphPath +
    + DirectedGraphProperty +
    + DirectedGraphStyle +
    + DirectedGraphStyleCondition +
    + DirectedGraphStyleSetter +
    + FontStyleEnum +
    + FontWeightEnum +
    + FrameKindEnum +
    + GraphDirectionEnum +
    + GroupEnum +
    + HorizontalAlignmentEnum +
    + LayoutEnum +
    + PropertyType +
    + TargetTypeEnum +
    + VerticalAlignmentEnum +
    + VisibilityEnum +
    + +
    +

    global Namespace

    +
    + + + + + + + + + + +
    ModuleDescription
    + HelperTypes +
    + +

    diff --git a/reference/quickgraph-adjacencygraph-2.html b/reference/quickgraph-adjacencygraph-2.html new file mode 100644 index 000000000..f4737964c --- /dev/null +++ b/reference/quickgraph-adjacencygraph-2.html @@ -0,0 +1,771 @@ + + + + + AdjacencyGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    AdjacencyGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A mutable directed graph data structure efficient for sparse +graph representation where out-edge need to be enumerated only.

    + +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + new(allowParallelEdges) + +
    + Signature: allowParallelEdges:bool -> unit
    +
    +     		+ +
    + + + new(allowParallelEdges, capacity) + +
    + Signature: (allowParallelEdges:bool * capacity:int) -> unit
    +
    +     		+ +
    + + + new(...) + +
    + Signature: (allowParallelEdges:bool * capacity:int * edgeCapacity:int) -> unit
    +
    +     		+ +
    + + + new(...) + +
    + Signature: (allowParallelEdges:bool * capacity:int * edgeCapacity:int * vertexEdgesDictionaryFactory:Func<int,IVertexEdgeDictionary<'TVertex,'TEdge>>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AddEdge(e) + +
    + Signature: e:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+

    Adds the edge to the graph

    + + +
    + + + AddEdgeRange(edges) + +
    + Signature: edges:IEnumerable<'TEdge> -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddVertex(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddVertexRange(vertices) + +
    + Signature: vertices:IEnumerable<'TVertex> -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddVerticesAndEdge(e) + +
    + Signature: e:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddVerticesAndEdgeRange(edges) + +
    + Signature: edges:IEnumerable<'TEdge> -> int
    + Modifiers: abstract
    +
    +     		+

    Adds a range of edges to the graph

    + + +
    + + + AllowParallelEdges + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Clear() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + ClearOutEdges(v) + +
    + Signature: v:'TVertex -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + Clone() + +
    + Signature: unit -> AdjacencyGraph<'TVertex,'TEdge>
    +
    +     		+ +
    + + + ContainsEdge(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsVertex(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeAdded + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeCapacity() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + EdgeCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+

    Gets the edge count.

    + + +
    + + + EdgeRemoved + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + Edges + +
    + Signature: IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+

    Gets the edges.

    + + +
    + + + IsDirected + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsEdgesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+

    Gets a value indicating whether this instance is edges empty.

    + + +
    + + + IsOutEdgesEmpty(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsVerticesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutDegree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutEdge(v, index) + +
    + Signature: (v:'TVertex * index:int) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutEdges(v) + +
    + Signature: v:'TVertex -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveEdge(e) + +
    + Signature: e:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveEdgeIf(predicate) + +
    + Signature: predicate:EdgePredicate<'TVertex,'TEdge> -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveOutEdgeIf(v, predicate) + +
    + Signature: (v:'TVertex * predicate:EdgePredicate<'TVertex,'TEdge>) -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveVertex(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveVertexIf(predicate) + +
    + Signature: predicate:VertexPredicate<'TVertex> -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + TrimEdgeExcess() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetEdge(source, target, edge) + +
    + Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetEdges(source, target, edges) + +
    + Signature: (source:'TVertex * target:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetOutEdges(v, edges) + +
    + Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexAdded + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexRemoved + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + Vertices + +
    + Signature: IEnumerable<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    +

    Static members

    + + + + + + + + + + + + + + +
    Static memberDescription
    + + + EdgeType + +
    + Signature: Type
    +
    +     		+ +
    + + + LoadDot(dotSource, vertexFunc, edgeFunc) + +
    + Signature: (dotSource:string * vertexFunc:Func<string,IDictionary<string,string>,'TVertex> * edgeFunc:Func<'TVertex,'TVertex,IDictionary<string,string>,'TEdge>) -> AdjacencyGraph<'TVertex,'TEdge>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-algorithmbase-1.html b/reference/quickgraph-algorithms-algorithmbase-1.html new file mode 100644 index 000000000..9b5f6aae8 --- /dev/null +++ b/reference/quickgraph-algorithms-algorithmbase-1.html @@ -0,0 +1,294 @@ + + + + + AlgorithmBase<'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    AlgorithmBase<'TGraph>

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(host, visitedGraph) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:'TGraph) -> unit
    +
    +     		+

    Creates a new algorithm with an (optional) host.

    + + +
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:'TGraph -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Abort() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + Aborted + +
    + Signature: IEvent<EventHandler,EventArgs>
    + Modifiers: abstract
    +
    +     		+ +
    + + + Compute() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + Finished + +
    + Signature: IEvent<EventHandler,EventArgs>
    + Modifiers: abstract
    +
    +     		+ +
    + + + GetService() + +
    + Signature: unit -> 'T
    + Modifiers: abstract
    +
    +     		+ +
    + + + Services + +
    + Signature: IAlgorithmServices
    + Modifiers: abstract
    +
    +     		+ +
    + + + Started + +
    + Signature: IEvent<EventHandler,EventArgs>
    + Modifiers: abstract
    +
    +     		+ +
    + + + State + +
    + Signature: ComputationState
    + Modifiers: abstract
    +
    +     		+ +
    + + + StateChanged + +
    + Signature: IEvent<EventHandler,EventArgs>
    + Modifiers: abstract
    +
    +     		+ +
    + + + SyncRoot + +
    + Signature: obj
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetService(service) + +
    + Signature: service:byref<'T> -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + VisitedGraph + +
    + Signature: 'TGraph
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-algorithmeventhandler-1.html b/reference/quickgraph-algorithms-algorithmeventhandler-1.html new file mode 100644 index 000000000..84c137321 --- /dev/null +++ b/reference/quickgraph-algorithms-algorithmeventhandler-1.html @@ -0,0 +1,143 @@ + + + + + AlgorithmEventHandler<'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    AlgorithmEventHandler<'TGraph>

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(object, method) + +
    + Signature: (object:obj * method:nativeint) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BeginInvoke(sender, e, callback, object) + +
    + Signature: (sender:IAlgorithm<'TGraph> * e:EventArgs * callback:AsyncCallback * object:obj) -> IAsyncResult
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndInvoke(result) + +
    + Signature: result:IAsyncResult -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + Invoke(sender, e) + +
    + Signature: (sender:IAlgorithm<'TGraph> * e:EventArgs) -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-algorithmextensions.html b/reference/quickgraph-algorithms-algorithmextensions.html new file mode 100644 index 000000000..776e17e23 --- /dev/null +++ b/reference/quickgraph-algorithms-algorithmextensions.html @@ -0,0 +1,745 @@ + + + + + AlgorithmExtensions - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    AlgorithmExtensions

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +

    Various extension methods to build algorithms

    + +
    +

    Static members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Static memberDescription
    + + + Clone(...) + +
    + Signature: (g:IVertexAndEdgeListGraph<'TVertex,'TEdge> * vertexCloner:Func<'TVertex,'TVertex> * edgeCloner:Func<'TEdge,'TVertex,'TVertex,'TEdge> * clone:IMutableVertexAndEdgeSet<'TVertex,'TEdge>) -> unit
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Clones a graph to another graph

    + + +
    + + + ComputeDisjointSet(visitedGraph) + +
    + Signature: visitedGraph:IUndirectedGraph<'TVertex,'TEdge> -> IDisjointSet<'TVertex>
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + ComputePredecessorCost(...) + +
    + Signature: (predecessors:IDictionary<'TVertex,'TEdge> * edgeCosts:IDictionary<'TEdge,float> * target:'TVertex) -> float
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Given a edge cost map, computes +the predecessor cost.

    + + +
    + + + CondensateEdges(...) + +
    + Signature: (visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> * vertexPredicate:VertexPredicate<'TVertex>) -> IMutableBidirectionalGraph<'TVertex,MergedEdge<'TVertex,'TEdge>>
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + CondensateStronglyConnected(g) + +
    + Signature: g:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> IMutableBidirectionalGraph<'TGraph,CondensedEdge<'TVertex,'TEdge,'TGraph>>
    + Type parameters: 'TVertex, 'TEdge, 'TGraph
    +     		+

    Condensates the strongly connected components of a directed graph

    + + +
    + + + CondensateWeaklyConnected(g) + +
    + Signature: g:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> IMutableBidirectionalGraph<'TGraph,CondensedEdge<'TVertex,'TEdge,'TGraph>>
    + Type parameters: 'TVertex, 'TEdge, 'TGraph
    +     		+

    Condensates the weakly connected components of a graph

    + + +
    + + + ConnectedComponents(g, components) + +
    + Signature: (g:IUndirectedGraph<'TVertex,'TEdge> * components:IDictionary<'TVertex,int>) -> int
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Computes the connected components of a graph

    + + +
    + + + GetEdgeIdentity(graph) + +
    + Signature: graph:IEdgeSet<'TVertex,'TEdge> -> EdgeIdentity<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Gets the edge identity.

    + + +
    + + + GetIndexer(dictionary) + +
    + Signature: dictionary:Dictionary<'TKey,'TValue> -> Func<'TKey,'TValue>
    + Type parameters: 'TKey, 'TValue
    +     		+

    Returns the method that implement the access indexer.

    + + +
    + + + GetVertexIdentity(graph) + +
    + Signature: graph:IVertexSet<'TVertex> -> VertexIdentity<'TVertex>
    + Type parameters: 'TVertex
    +     		+

    Gets the vertex identity.

    + + +
    + + + IncrementalConnectedComponents(g) + +
    + Signature: g:IMutableVertexAndEdgeSet<'TVertex,'TEdge> -> Func<KeyValuePair<int,IDictionary<'TVertex,int>>>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Computes the incremental connected components for a growing graph (edge added only). +Each call to the delegate re-computes the component dictionary. The returned dictionary +is shared accross multiple calls of the method.

    + + +
    + + + IsDirectedAcyclicGraph(g) + +
    + Signature: g:IVertexListGraph<'TVertex,'TEdge> -> bool
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Gets a value indicating whether the graph is acyclic

    + + +
    + + + IsolatedVertices(visitedGraph) + +
    + Signature: visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> -> IEnumerable<'TVertex>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Gets the list of isolated vertices (no incoming or outcoming vertices)

    + + +
    + + + MaximumFlowEdmondsKarp(...) + +
    + Signature: (visitedGraph:IMutableVertexAndEdgeListGraph<'TVertex,'TEdge> * edgeCapacities:Func<'TEdge,float> * source:'TVertex * sink:'TVertex * flowPredecessors:byref<TryFunc<'TVertex,'TEdge>> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> float
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Computes the Edmonds-Karp maximums flow +for a graph with positive capacities and +flows.

    + + +
    + + + MinimumSpanningTreeKruskal(...) + +
    + Signature: (visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float>) -> IEnumerable<'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Computes the minimum spanning tree using Kruskal's algorithm.

    + + +
    + + + MinimumSpanningTreePrim(...) + +
    + Signature: (visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float>) -> IEnumerable<'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Computes the minimum spanning tree using Prim's algorithm. +Prim's algorithm is simply implemented by calling Dijkstra shortest path.

    + + +
    + + + OddVertices(g) + +
    + Signature: g:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> List<'TVertex>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Create a collection of odd vertices

    + + +
    + + + OfflineLeastCommonAncestorTarjan(...) + +
    + Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * root:'TVertex * pairs:IEnumerable<SEquatableEdge<'TVertex>>) -> TryFunc<SEquatableEdge<'TVertex>,'TVertex>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Computes the offline least common ancestor between pairs of vertices in a rooted tree +using Tarjan algorithm.

    + + +
    + + + RankedShortestPathHoffmanPavley(...) + +
    + Signature: (visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> * edgeWeights:Func<'TEdge,float> * source:'TVertex * target:'TVertex * pathCount:int) -> IEnumerable<IEnumerable<'TEdge>>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Computes the k-shortest path from using Hoffman-Pavley algorithm.

    + + +
    + + + Roots(visitedGraph) + +
    + Signature: visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> -> IEnumerable<'TVertex>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Gets the list of root vertices

    + + +
    + + + Roots(visitedGraph) + +
    + Signature: visitedGraph:IVertexListGraph<'TVertex,'TEdge> -> IEnumerable<'TVertex>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Gets the list of roots

    + + +
    + + + ShortestPathsAStar(...) + +
    + Signature: (visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * edgeWeights:Func<'TEdge,float> * costHeuristic:Func<'TVertex,float> * source:'TVertex) -> TryFunc<'TVertex,IEnumerable<'TEdge>>
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + ShortestPathsBellmanFord(...) + +
    + Signature: (visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * edgeWeights:Func<'TEdge,float> * source:'TVertex) -> TryFunc<'TVertex,IEnumerable<'TEdge>>
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + ShortestPathsDag(...) + +
    + Signature: (visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * edgeWeights:Func<'TEdge,float> * source:'TVertex) -> TryFunc<'TVertex,IEnumerable<'TEdge>>
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + ShortestPathsDijkstra(...) + +
    + Signature: (visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * edgeWeights:Func<'TEdge,float> * source:'TVertex) -> TryFunc<'TVertex,IEnumerable<'TEdge>>
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + ShortestPathsDijkstra(...) + +
    + Signature: (visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * edgeWeights:Func<'TEdge,float> * source:'TVertex) -> TryFunc<'TVertex,IEnumerable<'TEdge>>
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + Sinks(visitedGraph) + +
    + Signature: visitedGraph:IVertexListGraph<'TVertex,'TEdge> -> IEnumerable<'TVertex>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Gets the list of sink vertices

    + + +
    + + + SourceFirstBidirectionalTopologicalSort(...) + +
    + Signature: (visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> * direction:TopologicalSortDirection) -> IEnumerable<'TVertex>
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + SourceFirstBidirectionalTopologicalSort(...) + +
    + Signature: visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> -> IEnumerable<'TVertex>
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + SourceFirstBidirectionalTopologicalSort(...) + +
    + Signature: (visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> * vertices:IList<'TVertex> * direction:TopologicalSortDirection) -> unit
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + SourceFirstBidirectionalTopologicalSort(...) + +
    + Signature: (visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> * vertices:IList<'TVertex>) -> unit
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + SourceFirstTopologicalSort(visitedGraph) + +
    + Signature: visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> IEnumerable<'TVertex>
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + SourceFirstTopologicalSort(...) + +
    + Signature: (visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * vertices:IList<'TVertex>) -> unit
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + StronglyConnectedComponents(...) + +
    + Signature: (g:IVertexListGraph<'TVertex,'TEdge> * components:byref<IDictionary<'TVertex,int>>) -> int
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Computes the strongly connected components of a graph

    + + +
    + + + TopologicalSort(visitedGraph) + +
    + Signature: visitedGraph:IUndirectedGraph<'TVertex,'TEdge> -> IEnumerable<'TVertex>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Creates a topological sort of a undirected +acyclic graph.

    + + +
    + + + TopologicalSort(visitedGraph, vertices) + +
    + Signature: (visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * vertices:IList<'TVertex>) -> unit
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Creates a topological sort of a undirected +acyclic graph.

    + + +
    + + + TopologicalSort(visitedGraph) + +
    + Signature: visitedGraph:IVertexListGraph<'TVertex,'TEdge> -> IEnumerable<'TVertex>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Creates a topological sort of a directed +acyclic graph.

    + + +
    + + + TopologicalSort(visitedGraph, vertices) + +
    + Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * vertices:IList<'TVertex>) -> unit
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Creates a topological sort of a directed +acyclic graph.

    + + +
    + + + TreeBreadthFirstSearch(...) + +
    + Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * root:'TVertex) -> TryFunc<'TVertex,IEnumerable<'TEdge>>
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + TreeCyclePoppingRandom(...) + +
    + Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * root:'TVertex) -> TryFunc<'TVertex,IEnumerable<'TEdge>>
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + TreeCyclePoppingRandom(...) + +
    + Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * root:'TVertex * edgeChain:IMarkovEdgeChain<'TVertex,'TEdge>) -> TryFunc<'TVertex,IEnumerable<'TEdge>>
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + TreeDepthFirstSearch(visitedGraph, root) + +
    + Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * root:'TVertex) -> TryFunc<'TVertex,IEnumerable<'TEdge>>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Computes a depth first tree.

    + + +
    + + + WeaklyConnectedComponents(g, components) + +
    + Signature: (g:IVertexListGraph<'TVertex,'TEdge> * components:IDictionary<'TVertex,int>) -> int
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Computes the weakly connected components of a graph

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-approxcompletecoloringalgorithm.html b/reference/quickgraph-algorithms-approxcompletecoloringalgorithm.html new file mode 100644 index 000000000..2fc1b7920 --- /dev/null +++ b/reference/quickgraph-algorithms-approxcompletecoloringalgorithm.html @@ -0,0 +1,121 @@ + + + + + ApproxCompleteColoringAlgorithm - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ApproxCompleteColoringAlgorithm

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> ApproxCompleteColoringAlgorithm
    +
    +     		+ + + + + +

    CompiledName: .ctor

    +
    +

    Static members

    + + + + + + + + + + +
    Static memberDescription
    + + + Compute(graph) + +
    + Signature: graph:IUndirectedGraph<int,SEdge<int>> -> List<List<int>>
    +
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-bergershorminimumfeedbackarcsetalgorithm.html b/reference/quickgraph-algorithms-bergershorminimumfeedbackarcsetalgorithm.html new file mode 100644 index 000000000..4412d88c9 --- /dev/null +++ b/reference/quickgraph-algorithms-bergershorminimumfeedbackarcsetalgorithm.html @@ -0,0 +1,94 @@ + + + + + BergerShorMinimumFeedbackArcSetAlgorithm - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    BergerShorMinimumFeedbackArcSetAlgorithm

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Static members

    + + + + + + + + + + +
    Static memberDescription
    + + + Compute(graph) + +
    + Signature: graph:AdjacencyGraph<string,Edge<string>> -> AdjacencyGraph<string,Edge<string>>
    +
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-bipartitedimensionalgorithm.html b/reference/quickgraph-algorithms-bipartitedimensionalgorithm.html new file mode 100644 index 000000000..edc5cf935 --- /dev/null +++ b/reference/quickgraph-algorithms-bipartitedimensionalgorithm.html @@ -0,0 +1,140 @@ + + + + + BipartiteDimensionAlgorithm - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    BipartiteDimensionAlgorithm

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(graph) + +
    + Signature: graph:UndirectedGraph<int,IEdge<int>> -> BipartiteDimensionAlgorithm
    +
    +     		+ + + + + +

    CompiledName: .ctor

    +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BipartiteDimensionValue + +
    + Signature: int
    +
    +     		+ + + + + +

    CompiledName: get_BipartiteDimensionValue

    +
    + + + GetNthBiclique(i) + +
    + Signature: i:int -> int list
    +
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-centralityapproximationalgorithm-2.html b/reference/quickgraph-algorithms-centralityapproximationalgorithm-2.html new file mode 100644 index 000000000..be7b4a9d7 --- /dev/null +++ b/reference/quickgraph-algorithms-centralityapproximationalgorithm-2.html @@ -0,0 +1,140 @@ + + + + + CentralityApproximationAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    CentralityApproximationAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph, distances) + +
    + Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * distances:Func<'TEdge,float>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Distances + +
    + Signature: Func<'TEdge,float>
    +
    +     		+ +
    + + + MaxIterationCount() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Rand() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-chromaticpolynomial-basenode.html b/reference/quickgraph-algorithms-chromaticpolynomial-basenode.html new file mode 100644 index 000000000..bb90ff518 --- /dev/null +++ b/reference/quickgraph-algorithms-chromaticpolynomial-basenode.html @@ -0,0 +1,162 @@ + + + + + BaseNode - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    BaseNode

    +

    + Namespace: QuickGraph.Algorithms
    + Parent Module: ChromaticPolynomial +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(graph, parent) + +
    + Signature: (graph:UndirectedGraph<obj,UndirectedEdge<obj>> * parent:BaseNode option) -> BaseNode
    +
    +     		+ + + + + +

    CompiledName: .ctor

    +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + CromaticPolinomial + +
    + Signature: int list
    + Modifiers: abstract
    +
    +     		+ + + + + +

    CompiledName: get_CromaticPolinomial

    +
    + + + Graph + +
    + Signature: UndirectedGraph<obj,UndirectedEdge<obj>>
    +
    +     		+ + + + + +

    CompiledName: get_Graph

    +
    + + + Parent + +
    + Signature: BaseNode option
    +
    +     		+ + + + + +

    CompiledName: get_Parent

    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-chromaticpolynomial-leaf.html b/reference/quickgraph-algorithms-chromaticpolynomial-leaf.html new file mode 100644 index 000000000..81fecd9bf --- /dev/null +++ b/reference/quickgraph-algorithms-chromaticpolynomial-leaf.html @@ -0,0 +1,96 @@ + + + + + Leaf - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    Leaf

    +

    + Namespace: QuickGraph.Algorithms
    + Parent Module: ChromaticPolynomial +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(graph, parent) + +
    + Signature: (graph:UndirectedGraph<obj,UndirectedEdge<obj>> * parent:BaseNode option) -> Leaf
    +
    +     		+ + + + + +

    CompiledName: .ctor

    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-chromaticpolynomial-node.html b/reference/quickgraph-algorithms-chromaticpolynomial-node.html new file mode 100644 index 000000000..d6efbde84 --- /dev/null +++ b/reference/quickgraph-algorithms-chromaticpolynomial-node.html @@ -0,0 +1,180 @@ + + + + + Node - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    Node

    +

    + Namespace: QuickGraph.Algorithms
    + Parent Module: ChromaticPolynomial +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(graph, parent) + +
    + Signature: (graph:UndirectedGraph<obj,UndirectedEdge<obj>> * parent:BaseNode option) -> Node
    +
    +     		+ + + + + +

    CompiledName: .ctor

    +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + LeftChild() + +
    + Signature: unit -> BaseNode
    +
    +     		+ + + + + +

    CompiledName: set_LeftChild

    +
    + + + LeftChild() + +
    + Signature: unit -> unit
    +
    +     		+ + + + + +

    CompiledName: get_LeftChild

    +
    + + + RightChild() + +
    + Signature: unit -> BaseNode
    +
    +     		+ + + + + +

    CompiledName: set_RightChild

    +
    + + + RightChild() + +
    + Signature: unit -> unit
    +
    +     		+ + + + + +

    CompiledName: get_RightChild

    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-chromaticpolynomial.html b/reference/quickgraph-algorithms-chromaticpolynomial.html new file mode 100644 index 000000000..4d842effa --- /dev/null +++ b/reference/quickgraph-algorithms-chromaticpolynomial.html @@ -0,0 +1,144 @@ + + + + + ChromaticPolynomial - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ChromaticPolynomial

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    + + +

    Nested types and modules

    +
    + + + + + + + + + + + + + + + + + + +
    TypeDescription
    + BaseNode +
    + Leaf +
    + Node +
    + +
    + +

    Functions and values

    + + + + + + + + + + + + + + +
    Function or valueDescription
    + + + buildTree graph + +
    + Signature: graph:UndirectedGraph<obj,UndirectedEdge<obj>> -> BaseNode
    +
    +     		+ + + + + +
    + + + findChromaticPolynomial graph + +
    + Signature: graph:UndirectedGraph<obj,UndirectedEdge<obj>> -> int []
    +
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-chromosome.html b/reference/quickgraph-algorithms-chromosome.html new file mode 100644 index 000000000..96383519c --- /dev/null +++ b/reference/quickgraph-algorithms-chromosome.html @@ -0,0 +1,68 @@ + + + + + Chromosome - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    Chromosome

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-cliques-maximumcliquealgorithmbase-2.html b/reference/quickgraph-algorithms-cliques-maximumcliquealgorithmbase-2.html new file mode 100644 index 000000000..420fb6a6f --- /dev/null +++ b/reference/quickgraph-algorithms-cliques-maximumcliquealgorithmbase-2.html @@ -0,0 +1,104 @@ + + + + + MaximumCliqueAlgorithmBase<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    MaximumCliqueAlgorithmBase<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.Cliques
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(host, visitedGraph) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IUndirectedGraph<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:IUndirectedGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-computationstate.html b/reference/quickgraph-algorithms-computationstate.html new file mode 100644 index 000000000..0de1e9c8a --- /dev/null +++ b/reference/quickgraph-algorithms-computationstate.html @@ -0,0 +1,70 @@ + + + + + ComputationState - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ComputationState

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +

    The computation state of a graph algorithm

    + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-condensation-condensationgraphalgorithm-3.html b/reference/quickgraph-algorithms-condensation-condensationgraphalgorithm-3.html new file mode 100644 index 000000000..6fb65d416 --- /dev/null +++ b/reference/quickgraph-algorithms-condensation-condensationgraphalgorithm-3.html @@ -0,0 +1,126 @@ + + + + + CondensationGraphAlgorithm<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    CondensationGraphAlgorithm<'TVertex, 'TEdge, 'TGraph>

    +

    + Namespace: QuickGraph.Algorithms.Condensation
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + CondensedGraph + +
    + Signature: IMutableBidirectionalGraph<'TGraph,CondensedEdge<'TVertex,'TEdge,'TGraph>>
    +
    +     		+ +
    + + + StronglyConnected() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-condensation-condensededge-3.html b/reference/quickgraph-algorithms-condensation-condensededge-3.html new file mode 100644 index 000000000..fee4b9491 --- /dev/null +++ b/reference/quickgraph-algorithms-condensation-condensededge-3.html @@ -0,0 +1,112 @@ + + + + + CondensedEdge<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    CondensedEdge<'TVertex, 'TEdge, 'TGraph>

    +

    + Namespace: QuickGraph.Algorithms.Condensation
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(source, target) + +
    + Signature: (source:'TGraph * target:'TGraph) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Edges + +
    + Signature: IList<'TEdge>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-condensation-edgemergecondensationgraphalgorithm-2.html b/reference/quickgraph-algorithms-condensation-edgemergecondensationgraphalgorithm-2.html new file mode 100644 index 000000000..5e056627c --- /dev/null +++ b/reference/quickgraph-algorithms-condensation-edgemergecondensationgraphalgorithm-2.html @@ -0,0 +1,126 @@ + + + + + EdgeMergeCondensationGraphAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EdgeMergeCondensationGraphAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.Condensation
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(...) + +
    + Signature: (visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> * condensatedGraph:IMutableBidirectionalGraph<'TVertex,MergedEdge<'TVertex,'TEdge>> * vertexPredicate:VertexPredicate<'TVertex>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + CondensatedGraph + +
    + Signature: IMutableBidirectionalGraph<'TVertex,MergedEdge<'TVertex,'TEdge>>
    +
    +     		+ +
    + + + VertexPredicate + +
    + Signature: VertexPredicate<'TVertex>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-condensation-mergededge-2.html b/reference/quickgraph-algorithms-condensation-mergededge-2.html new file mode 100644 index 000000000..9a2d4e175 --- /dev/null +++ b/reference/quickgraph-algorithms-condensation-mergededge-2.html @@ -0,0 +1,134 @@ + + + + + MergedEdge<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    MergedEdge<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.Condensation
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Edges + +
    + Signature: IList<'TEdge>
    +
    +     		+ +
    +

    Static members

    + + + + + + + + + + +
    Static memberDescription
    + + + Merge(inEdge, outEdge) + +
    + Signature: (inEdge:MergedEdge<'TVertex,'TEdge> * outEdge:MergedEdge<'TVertex,'TEdge>) -> MergedEdge<'TVertex,'TEdge>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-connectedcomponents-connectedcomponentsalgorithm-2.html b/reference/quickgraph-algorithms-connectedcomponents-connectedcomponentsalgorithm-2.html new file mode 100644 index 000000000..ebfc162cc --- /dev/null +++ b/reference/quickgraph-algorithms-connectedcomponents-connectedcomponentsalgorithm-2.html @@ -0,0 +1,156 @@ + + + + + ConnectedComponentsAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ConnectedComponentsAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.ConnectedComponents
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(g) + +
    + Signature: g:IUndirectedGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    + + + new(visitedGraph, components) + +
    + Signature: (visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * components:IDictionary<'TVertex,int>) -> unit
    +
    +     		+ +
    + + + new(host, visitedGraph, components) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * components:IDictionary<'TVertex,int>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ComponentCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Components + +
    + Signature: IDictionary<'TVertex,int>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-connectedcomponents-incrementalconnectedcomponentsalgorithm-2.html b/reference/quickgraph-algorithms-connectedcomponents-incrementalconnectedcomponentsalgorithm-2.html new file mode 100644 index 000000000..af7b40c72 --- /dev/null +++ b/reference/quickgraph-algorithms-connectedcomponents-incrementalconnectedcomponentsalgorithm-2.html @@ -0,0 +1,143 @@ + + + + + IncrementalConnectedComponentsAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IncrementalConnectedComponentsAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.ConnectedComponents
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:IMutableVertexAndEdgeSet<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    + + + new(host, visitedGraph) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IMutableVertexAndEdgeSet<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ComponentCount + +
    + Signature: int
    +
    +     		+ +
    + + + GetComponents() + +
    + Signature: unit -> KeyValuePair<int,IDictionary<'TVertex,int>>
    +
    +     		+

    Gets a copy of the connected components. Key is the number of components, +Value contains the vertex -> component index map.

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-connectedcomponents-stronglyconnectedcomponentsalgorithm-2.html b/reference/quickgraph-algorithms-connectedcomponents-stronglyconnectedcomponentsalgorithm-2.html new file mode 100644 index 000000000..3070c8f22 --- /dev/null +++ b/reference/quickgraph-algorithms-connectedcomponents-stronglyconnectedcomponentsalgorithm-2.html @@ -0,0 +1,184 @@ + + + + + StronglyConnectedComponentsAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    StronglyConnectedComponentsAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.ConnectedComponents
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(g) + +
    + Signature: g:IVertexListGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    + + + new(g, components) + +
    + Signature: (g:IVertexListGraph<'TVertex,'TEdge> * components:IDictionary<'TVertex,int>) -> unit
    +
    +     		+ +
    + + + new(host, g, components) + +
    + Signature: (host:IAlgorithmComponent * g:IVertexListGraph<'TVertex,'TEdge> * components:IDictionary<'TVertex,int>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ComponentCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Components + +
    + Signature: IDictionary<'TVertex,int>
    + Modifiers: abstract
    +
    +     		+ +
    + + + DiscoverTimes + +
    + Signature: IDictionary<'TVertex,int>
    +
    +     		+ +
    + + + Roots + +
    + Signature: IDictionary<'TVertex,'TVertex>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-connectedcomponents-weaklyconnectedcomponentsalgorithm-2.html b/reference/quickgraph-algorithms-connectedcomponents-weaklyconnectedcomponentsalgorithm-2.html new file mode 100644 index 000000000..9b48c4624 --- /dev/null +++ b/reference/quickgraph-algorithms-connectedcomponents-weaklyconnectedcomponentsalgorithm-2.html @@ -0,0 +1,156 @@ + + + + + WeaklyConnectedComponentsAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    WeaklyConnectedComponentsAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.ConnectedComponents
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:IVertexListGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    + + + new(visitedGraph, components) + +
    + Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * components:IDictionary<'TVertex,int>) -> unit
    +
    +     		+ +
    + + + new(host, visitedGraph, components) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IVertexListGraph<'TVertex,'TEdge> * components:IDictionary<'TVertex,int>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ComponentCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Components + +
    + Signature: IDictionary<'TVertex,int>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-distancerelaxers.html b/reference/quickgraph-algorithms-distancerelaxers.html new file mode 100644 index 000000000..f9294569e --- /dev/null +++ b/reference/quickgraph-algorithms-distancerelaxers.html @@ -0,0 +1,68 @@ + + + + + DistanceRelaxers - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DistanceRelaxers

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-domaticpartition-2.html b/reference/quickgraph-algorithms-domaticpartition-2.html new file mode 100644 index 000000000..8444fac5d --- /dev/null +++ b/reference/quickgraph-algorithms-domaticpartition-2.html @@ -0,0 +1,157 @@ + + + + + DomaticPartition<'Vertex, 'Edge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DomaticPartition<'Vertex, 'Edge>

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(graph) + +
    + Signature: graph:UndirectedGraph<'Vertex,'Edge> -> DomaticPartition<'Vertex,'Edge>
    +
    +     		+ + + + + +

    CompiledName: .ctor

    +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + GetMaxSizePartition() + +
    + Signature: unit -> seq<seq<'Vertex>>
    +
    +     		+ + + + + +
    + + + MinimalDominatingSets() + +
    + Signature: unit -> Set<Set<'Vertex>>
    +
    +     		+ + + + + +
    + + + MSCs(u sSrc) + +
    + Signature: u:Set<'Vertex> -> sSrc:Set<Set<'Vertex>> -> Set<Set<Set<'Vertex>>>
    +
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-edgecoloringalgorithm.html b/reference/quickgraph-algorithms-edgecoloringalgorithm.html new file mode 100644 index 000000000..d4b5ac7be --- /dev/null +++ b/reference/quickgraph-algorithms-edgecoloringalgorithm.html @@ -0,0 +1,94 @@ + + + + + EdgeColoringAlgorithm - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EdgeColoringAlgorithm

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Static members

    + + + + + + + + + + +
    Static memberDescription
    + + + Compute(graph) + +
    + Signature: graph:UndirectedGraph<int,TaggedEdge<int,int>> -> UndirectedGraph<int,TaggedEdge<int,int>>
    +
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-euleriantrailalgorithm-2.html b/reference/quickgraph-algorithms-euleriantrailalgorithm-2.html new file mode 100644 index 000000000..ef8a1c698 --- /dev/null +++ b/reference/quickgraph-algorithms-euleriantrailalgorithm-2.html @@ -0,0 +1,260 @@ + + + + + EulerianTrailAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EulerianTrailAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:IMutableVertexAndEdgeListGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    + + + new(host, visitedGraph) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IMutableVertexAndEdgeListGraph<'TVertex,'TEdge>) -> unit
    +
    +     		+

    Construct an eulerian trail builder

    + + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AddTemporaryEdges(edgeFactory) + +
    + Signature: edgeFactory:EdgeFactory<'TVertex,'TEdge> -> List<'TEdge>
    +
    +     		+

    Adds temporary edges to the graph to make all vertex even.

    + + +
    + + + Circuit + +
    + Signature: List<'TEdge>
    +
    +     		+ +
    + + + CircuitEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + RemoveTemporaryEdges() + +
    + Signature: unit -> unit
    +
    +     		+

    Removes temporary edges

    + + +
    + + + Trails() + +
    + Signature: unit -> ICollection<ICollection<'TEdge>>
    +
    +     		+

    Computes the set of eulerian trails that traverse the edge set.

    + + +
    + + + Trails(s) + +
    + Signature: s:'TVertex -> ICollection<ICollection<'TEdge>>
    +
    +     		+

    Computes a set of eulerian trail, starting at +that spans the entire graph.

    + + +
    + + + TreeEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + VisitEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    +

    Static members

    + + + + + + + + + + +
    Static memberDescription
    + + + ComputeEulerianPathCount(g) + +
    + Signature: g:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> int
    +
    +     		+

    Computes the number of eulerian trail in the graph.

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-exploration-cloneablevertexgraphexploreralgorithm-2.html b/reference/quickgraph-algorithms-exploration-cloneablevertexgraphexploreralgorithm-2.html new file mode 100644 index 000000000..a35bdd2e9 --- /dev/null +++ b/reference/quickgraph-algorithms-exploration-cloneablevertexgraphexploreralgorithm-2.html @@ -0,0 +1,267 @@ + + + + + CloneableVertexGraphExplorerAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    CloneableVertexGraphExplorerAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.Exploration
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:IMutableVertexAndEdgeListGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    + + + new(host, visitedGraph) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IMutableVertexAndEdgeSet<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AddEdgePredicate() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + AddVertexPredicate() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + BackEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + DiscoverVertex + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+ +
    + + + EdgeSkipped + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + ExploreVertexPredicate() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FinishedPredicate() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FinishedSuccessfully + +
    + Signature: bool
    +
    +     		+ +
    + + + TransitionFactories + +
    + Signature: IList<ITransitionFactory<'TVertex,'TEdge>>
    +
    +     		+ +
    + + + TreeEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + UnexploredVertices + +
    + Signature: IEnumerable<'TVertex>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-exploration-itransitionfactory-2.html b/reference/quickgraph-algorithms-exploration-itransitionfactory-2.html new file mode 100644 index 000000000..932b3a9e0 --- /dev/null +++ b/reference/quickgraph-algorithms-exploration-itransitionfactory-2.html @@ -0,0 +1,106 @@ + + + + + ITransitionFactory<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ITransitionFactory<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.Exploration
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Apply(source) + +
    + Signature: source:'TVertex -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsValid(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-exploration-transitionfactoryimplicitgraph-2.html b/reference/quickgraph-algorithms-exploration-transitionfactoryimplicitgraph-2.html new file mode 100644 index 000000000..74ee49264 --- /dev/null +++ b/reference/quickgraph-algorithms-exploration-transitionfactoryimplicitgraph-2.html @@ -0,0 +1,260 @@ + + + + + TransitionFactoryImplicitGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    TransitionFactoryImplicitGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.Exploration
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AllowParallelEdges + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsVertex(vertex) + +
    + Signature: vertex:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsDirected + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsOutEdgesEmpty(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutDegree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutEdge(v, index) + +
    + Signature: (v:'TVertex * index:int) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutEdges(v) + +
    + Signature: v:'TVertex -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + SuccessorEdgePredicate() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + SuccessorVertexPredicate() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + TransitionFactories + +
    + Signature: IList<ITransitionFactory<'TVertex,'TEdge>>
    +
    +     		+ +
    + + + TryGetOutEdges(v, edges) + +
    + Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-fitness.html b/reference/quickgraph-algorithms-fitness.html new file mode 100644 index 000000000..ed8a66d2c --- /dev/null +++ b/reference/quickgraph-algorithms-fitness.html @@ -0,0 +1,68 @@ + + + + + Fitness - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    Fitness

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-geneticconstants.html b/reference/quickgraph-algorithms-geneticconstants.html new file mode 100644 index 000000000..bccd0a06c --- /dev/null +++ b/reference/quickgraph-algorithms-geneticconstants.html @@ -0,0 +1,205 @@ + + + + + GeneticConstants - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GeneticConstants

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    + + + +

    Functions and values

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Function or valueDescription
    + + + gMax + +
    + Signature: int
    +
    +     		+ + + + + +
    + + + M + +
    + Signature: int
    +
    +     		+ + + + + +
    + + + nCore + +
    + Signature: int
    +
    +     		+ + + + + +
    + + + nDS + +
    + Signature: int
    +
    +     		+ + + + + +
    + + + nl + +
    + Signature: int
    +
    +     		+ + + + + +
    + + + pc + +
    + Signature: float<MeasureOne>
    +
    +     		+ + + + + +
    + + + pm + +
    + Signature: float<MeasureOne>
    +
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-graphcoloring-vertexcoloring-inputmodel-2.html b/reference/quickgraph-algorithms-graphcoloring-vertexcoloring-inputmodel-2.html new file mode 100644 index 000000000..6e346225b --- /dev/null +++ b/reference/quickgraph-algorithms-graphcoloring-vertexcoloring-inputmodel-2.html @@ -0,0 +1,112 @@ + + + + + InputModel<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    InputModel<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.GraphColoring.VertexColoring
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Graph() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-graphcoloring-vertexcoloring-outputmodel-2.html b/reference/quickgraph-algorithms-graphcoloring-vertexcoloring-outputmodel-2.html new file mode 100644 index 000000000..2295624a8 --- /dev/null +++ b/reference/quickgraph-algorithms-graphcoloring-vertexcoloring-outputmodel-2.html @@ -0,0 +1,112 @@ + + + + + OutputModel<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    OutputModel<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.GraphColoring.VertexColoring
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Colors() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-graphcoloring-vertexcoloring-vertexcoloringalgorithm-2.html b/reference/quickgraph-algorithms-graphcoloring-vertexcoloring-vertexcoloringalgorithm-2.html new file mode 100644 index 000000000..3acfb4e13 --- /dev/null +++ b/reference/quickgraph-algorithms-graphcoloring-vertexcoloring-vertexcoloringalgorithm-2.html @@ -0,0 +1,112 @@ + + + + + VertexColoringAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    VertexColoringAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.GraphColoring.VertexColoring
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(input) + +
    + Signature: input:InputModel<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Compute() + +
    + Signature: unit -> OutputModel<'TVertex,'TEdge>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-ialgorithm-1.html b/reference/quickgraph-algorithms-ialgorithm-1.html new file mode 100644 index 000000000..360d378c1 --- /dev/null +++ b/reference/quickgraph-algorithms-ialgorithm-1.html @@ -0,0 +1,91 @@ + + + + + IAlgorithm<'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IAlgorithm<'TGraph>

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + VisitedGraph + +
    + Signature: 'TGraph
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-icomputation.html b/reference/quickgraph-algorithms-icomputation.html new file mode 100644 index 000000000..0dd0fff3c --- /dev/null +++ b/reference/quickgraph-algorithms-icomputation.html @@ -0,0 +1,196 @@ + + + + + IComputation - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IComputation

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Abort() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + Aborted + +
    + Signature: IEvent<EventHandler,EventArgs>
    + Modifiers: abstract
    +
    +     		+ +
    + + + Compute() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + Finished + +
    + Signature: IEvent<EventHandler,EventArgs>
    + Modifiers: abstract
    +
    +     		+ +
    + + + Started + +
    + Signature: IEvent<EventHandler,EventArgs>
    + Modifiers: abstract
    +
    +     		+ +
    + + + State + +
    + Signature: ComputationState
    + Modifiers: abstract
    +
    +     		+ +
    + + + StateChanged + +
    + Signature: IEvent<EventHandler,EventArgs>
    + Modifiers: abstract
    +
    +     		+ +
    + + + SyncRoot + +
    + Signature: obj
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-iconnectedcomponentalgorithm-3.html b/reference/quickgraph-algorithms-iconnectedcomponentalgorithm-3.html new file mode 100644 index 000000000..9cd3c74c3 --- /dev/null +++ b/reference/quickgraph-algorithms-iconnectedcomponentalgorithm-3.html @@ -0,0 +1,106 @@ + + + + + IConnectedComponentAlgorithm<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IConnectedComponentAlgorithm<'TVertex, 'TEdge, 'TGraph>

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ComponentCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Components + +
    + Signature: IDictionary<'TVertex,int>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-idistancerecorderalgorithm-2.html b/reference/quickgraph-algorithms-idistancerecorderalgorithm-2.html new file mode 100644 index 000000000..f1ba4e0af --- /dev/null +++ b/reference/quickgraph-algorithms-idistancerecorderalgorithm-2.html @@ -0,0 +1,108 @@ + + + + + IDistanceRecorderAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IDistanceRecorderAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +

    An algorithm that exposes events to compute a distance map between vertices

    + +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + DiscoverVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + InitializeVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-idistancerelaxer.html b/reference/quickgraph-algorithms-idistancerelaxer.html new file mode 100644 index 000000000..01e2d5c1d --- /dev/null +++ b/reference/quickgraph-algorithms-idistancerelaxer.html @@ -0,0 +1,106 @@ + + + + + IDistanceRelaxer - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IDistanceRelaxer

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Combine(distance, weight) + +
    + Signature: (distance:float * weight:float) -> float
    + Modifiers: abstract
    +
    +     		+ +
    + + + InitialDistance + +
    + Signature: float
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-iedgecolorizeralgorithm-2.html b/reference/quickgraph-algorithms-iedgecolorizeralgorithm-2.html new file mode 100644 index 000000000..55518b9ca --- /dev/null +++ b/reference/quickgraph-algorithms-iedgecolorizeralgorithm-2.html @@ -0,0 +1,91 @@ + + + + + IEdgeColorizerAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IEdgeColorizerAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + EdgeColors + +
    + Signature: IDictionary<'TEdge,GraphColor>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-iedgepredecessorrecorderalgorithm-2.html b/reference/quickgraph-algorithms-iedgepredecessorrecorderalgorithm-2.html new file mode 100644 index 000000000..32e5fcf32 --- /dev/null +++ b/reference/quickgraph-algorithms-iedgepredecessorrecorderalgorithm-2.html @@ -0,0 +1,106 @@ + + + + + IEdgePredecessorRecorderAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IEdgePredecessorRecorderAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + DiscoverTreeEdge + +
    + Signature: EdgeEdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + FinishEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-iendpathedgerecorderalgorithm-2.html b/reference/quickgraph-algorithms-iendpathedgerecorderalgorithm-2.html new file mode 100644 index 000000000..1dbf1b1bc --- /dev/null +++ b/reference/quickgraph-algorithms-iendpathedgerecorderalgorithm-2.html @@ -0,0 +1,68 @@ + + + + + IEndPathEdgeRecorderAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IEndPathEdgeRecorderAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-individual.html b/reference/quickgraph-algorithms-individual.html new file mode 100644 index 000000000..48eb5a9cb --- /dev/null +++ b/reference/quickgraph-algorithms-individual.html @@ -0,0 +1,68 @@ + + + + + Individual - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    Individual

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-inducedpathalgorithm.html b/reference/quickgraph-algorithms-inducedpathalgorithm.html new file mode 100644 index 000000000..f1df021cf --- /dev/null +++ b/reference/quickgraph-algorithms-inducedpathalgorithm.html @@ -0,0 +1,97 @@ + + + + + InducedPathAlgorithm - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    InducedPathAlgorithm

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    + + + +

    Functions and values

    + + + + + + + + + + +
    Function or valueDescription
    + + + findInducedPaths graph + +
    + Signature: graph:UndirectedGraph<'?8044,IEdge<'?8044>> -> List<List<'?8044>>
    + Type parameters: '?8044
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-iseuleriangraphalgorithm-2.html b/reference/quickgraph-algorithms-iseuleriangraphalgorithm-2.html new file mode 100644 index 000000000..02c8fa936 --- /dev/null +++ b/reference/quickgraph-algorithms-iseuleriangraphalgorithm-2.html @@ -0,0 +1,112 @@ + + + + + IsEulerianGraphAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IsEulerianGraphAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(graph) + +
    + Signature: graph:UndirectedGraph<'TVertex,UndirectedEdge<'TVertex>> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + isEulerian() + +
    + Signature: unit -> bool
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-ishamiltoniangraphalgorithm-2.html b/reference/quickgraph-algorithms-ishamiltoniangraphalgorithm-2.html new file mode 100644 index 000000000..01657dbd9 --- /dev/null +++ b/reference/quickgraph-algorithms-ishamiltoniangraphalgorithm-2.html @@ -0,0 +1,112 @@ + + + + + IsHamiltonianGraphAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IsHamiltonianGraphAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(graph) + +
    + Signature: graph:UndirectedGraph<'TVertex,UndirectedEdge<'TVertex>> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + IsHamiltonian() + +
    + Signature: unit -> bool
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-itreebuilderalgorithm-2.html b/reference/quickgraph-algorithms-itreebuilderalgorithm-2.html new file mode 100644 index 000000000..76d5d0aef --- /dev/null +++ b/reference/quickgraph-algorithms-itreebuilderalgorithm-2.html @@ -0,0 +1,91 @@ + + + + + ITreeBuilderAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ITreeBuilderAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + TreeEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-iundirectedtreebuilderalgorithm-2.html b/reference/quickgraph-algorithms-iundirectedtreebuilderalgorithm-2.html new file mode 100644 index 000000000..e92cbc00a --- /dev/null +++ b/reference/quickgraph-algorithms-iundirectedtreebuilderalgorithm-2.html @@ -0,0 +1,91 @@ + + + + + IUndirectedTreeBuilderAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IUndirectedTreeBuilderAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + TreeEdge + +
    + Signature: IEvent<UndirectedEdgeAction<'TVertex,'TEdge>,UndirectedEdgeEventArgs<'TVertex,'TEdge>>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-iundirectedvertexpredecessorrecorderalgorithm-2.html b/reference/quickgraph-algorithms-iundirectedvertexpredecessorrecorderalgorithm-2.html new file mode 100644 index 000000000..62e5d8902 --- /dev/null +++ b/reference/quickgraph-algorithms-iundirectedvertexpredecessorrecorderalgorithm-2.html @@ -0,0 +1,106 @@ + + + + + IUndirectedVertexPredecessorRecorderAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IUndirectedVertexPredecessorRecorderAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + FinishVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + StartVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-ivertexcolorizeralgorithm-2.html b/reference/quickgraph-algorithms-ivertexcolorizeralgorithm-2.html new file mode 100644 index 000000000..29a26f29a --- /dev/null +++ b/reference/quickgraph-algorithms-ivertexcolorizeralgorithm-2.html @@ -0,0 +1,91 @@ + + + + + IVertexColorizerAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IVertexColorizerAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + GetVertexColor(v) + +
    + Signature: v:'TVertex -> GraphColor
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-ivertexpredecessorrecorderalgorithm-2.html b/reference/quickgraph-algorithms-ivertexpredecessorrecorderalgorithm-2.html new file mode 100644 index 000000000..73d79a9cf --- /dev/null +++ b/reference/quickgraph-algorithms-ivertexpredecessorrecorderalgorithm-2.html @@ -0,0 +1,106 @@ + + + + + IVertexPredecessorRecorderAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IVertexPredecessorRecorderAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + FinishVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + StartVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-ivertextimestamperalgorithm-2.html b/reference/quickgraph-algorithms-ivertextimestamperalgorithm-2.html new file mode 100644 index 000000000..050f218b1 --- /dev/null +++ b/reference/quickgraph-algorithms-ivertextimestamperalgorithm-2.html @@ -0,0 +1,106 @@ + + + + + IVertexTimeStamperAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IVertexTimeStamperAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + DiscoverVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + FinishVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-kernighanlinalgoritm-kernighanlinalgoritm-2.html b/reference/quickgraph-algorithms-kernighanlinalgoritm-kernighanlinalgoritm-2.html new file mode 100644 index 000000000..eb5d401f5 --- /dev/null +++ b/reference/quickgraph-algorithms-kernighanlinalgoritm-kernighanlinalgoritm-2.html @@ -0,0 +1,126 @@ + + + + + KernighanLinAlgoritm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    KernighanLinAlgoritm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.KernighanLinAlgoritm
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(g, itersNum) + +
    + Signature: (g:UndirectedGraph<'TVertex,'TEdge> * itersNum:int) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Execute() + +
    + Signature: unit -> Partition<'TVertex>
    +
    +     		+ +
    + + + getStartPartition() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-kernighanlinalgoritm-partition-1.html b/reference/quickgraph-algorithms-kernighanlinalgoritm-partition-1.html new file mode 100644 index 000000000..1ce215951 --- /dev/null +++ b/reference/quickgraph-algorithms-kernighanlinalgoritm-partition-1.html @@ -0,0 +1,140 @@ + + + + + Partition<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    Partition<'TVertex>

    +

    + Namespace: QuickGraph.Algorithms.KernighanLinAlgoritm
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(A, B, cutCost) + +
    + Signature: (A:SortedSet<'TVertex> * B:SortedSet<'TVertex> * cutCost:float) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + A() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + B() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + cutCost() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-maximumbipartitematchingalgorithm-2.html b/reference/quickgraph-algorithms-maximumbipartitematchingalgorithm-2.html new file mode 100644 index 000000000..d3c63d119 --- /dev/null +++ b/reference/quickgraph-algorithms-maximumbipartitematchingalgorithm-2.html @@ -0,0 +1,168 @@ + + + + + MaximumBipartiteMatchingAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    MaximumBipartiteMatchingAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(...) + +
    + Signature: (visitedGraph:IMutableVertexAndEdgeListGraph<'TVertex,'TEdge> * vertexSetA:IEnumerable<'TVertex> * vertexSetB:IEnumerable<'TVertex> * vertexFactory:VertexFactory<'TVertex> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + EdgeFactory() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + MatchedEdges() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + VertexFactory() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + VertexSetA() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + VertexSetB() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-maximumflow-allverticesgraphaugmentoralgorithm-2.html b/reference/quickgraph-algorithms-maximumflow-allverticesgraphaugmentoralgorithm-2.html new file mode 100644 index 000000000..622ab2ec0 --- /dev/null +++ b/reference/quickgraph-algorithms-maximumflow-allverticesgraphaugmentoralgorithm-2.html @@ -0,0 +1,104 @@ + + + + + AllVerticesGraphAugmentorAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    AllVerticesGraphAugmentorAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.MaximumFlow
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(...) + +
    + Signature: (visitedGraph:IMutableVertexAndEdgeSet<'TVertex,'TEdge> * vertexFactory:VertexFactory<'TVertex> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    + + + new(...) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IMutableVertexAndEdgeSet<'TVertex,'TEdge> * vertexFactory:VertexFactory<'TVertex> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-maximumflow-edmondskarpmaximumflowalgorithm-2.html b/reference/quickgraph-algorithms-maximumflow-edmondskarpmaximumflowalgorithm-2.html new file mode 100644 index 000000000..668812e08 --- /dev/null +++ b/reference/quickgraph-algorithms-maximumflow-edmondskarpmaximumflowalgorithm-2.html @@ -0,0 +1,108 @@ + + + + + EdmondsKarpMaximumFlowAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EdmondsKarpMaximumFlowAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.MaximumFlow
    +

    +
    +

    Edmond and Karp maximum flow algorithm +for directed graph with positive capacities and +flows.

    + +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(g, capacities, edgeFactory) + +
    + Signature: (g:IMutableVertexAndEdgeListGraph<'TVertex,'TEdge> * capacities:Func<'TEdge,float> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    + + + new(host, g, capacities, edgeFactory) + +
    + Signature: (host:IAlgorithmComponent * g:IMutableVertexAndEdgeListGraph<'TVertex,'TEdge> * capacities:Func<'TEdge,float> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-maximumflow-graphaugmentoralgorithmbase-3.html b/reference/quickgraph-algorithms-maximumflow-graphaugmentoralgorithmbase-3.html new file mode 100644 index 000000000..e8ca158e0 --- /dev/null +++ b/reference/quickgraph-algorithms-maximumflow-graphaugmentoralgorithmbase-3.html @@ -0,0 +1,254 @@ + + + + + GraphAugmentorAlgorithmBase<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphAugmentorAlgorithmBase<'TVertex, 'TEdge, 'TGraph>

    +

    + Namespace: QuickGraph.Algorithms.MaximumFlow
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(...) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:'TGraph * vertexFactory:VertexFactory<'TVertex> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Augmented + +
    + Signature: bool
    +
    +     		+ +
    + + + AugmentedEdges + +
    + Signature: ICollection<'TEdge>
    +
    +     		+ +
    + + + Dispose() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeAdded + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + EdgeFactory + +
    + Signature: EdgeFactory<'TVertex,'TEdge>
    +
    +     		+ +
    + + + Rollback() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + SuperSink + +
    + Signature: 'TVertex
    +
    +     		+ +
    + + + SuperSinkAdded + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+ +
    + + + SuperSource + +
    + Signature: 'TVertex
    +
    +     		+ +
    + + + SuperSourceAdded + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+ +
    + + + VertexFactory + +
    + Signature: VertexFactory<'TVertex>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-maximumflow-graphbalanceralgorithm-2.html b/reference/quickgraph-algorithms-maximumflow-graphbalanceralgorithm-2.html new file mode 100644 index 000000000..ae73c2bcb --- /dev/null +++ b/reference/quickgraph-algorithms-maximumflow-graphbalanceralgorithm-2.html @@ -0,0 +1,434 @@ + + + + + GraphBalancerAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphBalancerAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.MaximumFlow
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(...) + +
    + Signature: (visitedGraph:IMutableBidirectionalGraph<'TVertex,'TEdge> * source:'TVertex * sink:'TVertex * vertexFactory:VertexFactory<'TVertex> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    + + + new(...) + +
    + Signature: (visitedGraph:IMutableBidirectionalGraph<'TVertex,'TEdge> * vertexFactory:VertexFactory<'TVertex> * edgeFactory:EdgeFactory<'TVertex,'TEdge> * source:'TVertex * sink:'TVertex * capacities:IDictionary<'TEdge,float>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Balance() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Balanced + +
    + Signature: bool
    +
    +     		+ +
    + + + BalancingSink + +
    + Signature: 'TVertex
    +
    +     		+ +
    + + + BalancingSinkAdded + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+ +
    + + + BalancingSinkEdge + +
    + Signature: 'TEdge
    +
    +     		+ +
    + + + BalancingSource + +
    + Signature: 'TVertex
    +
    +     		+ +
    + + + BalancingSourceAdded + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+ +
    + + + BalancingSourceEdge + +
    + Signature: 'TEdge
    +
    +     		+ +
    + + + Capacities + +
    + Signature: IDictionary<'TEdge,float>
    +
    +     		+ +
    + + + DeficientEdges + +
    + Signature: ICollection<'TEdge>
    +
    +     		+ +
    + + + DeficientVertexAdded + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+ +
    + + + DeficientVertices + +
    + Signature: ICollection<'TVertex>
    +
    +     		+ +
    + + + EdgeAdded + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + EdgeFactory + +
    + Signature: EdgeFactory<'TVertex,'TEdge>
    +
    +     		+ +
    + + + GetBalancingIndex(v) + +
    + Signature: v:'TVertex -> int
    +
    +     		+ +
    + + + Sink + +
    + Signature: 'TVertex
    +
    +     		+ +
    + + + Source + +
    + Signature: 'TVertex
    +
    +     		+ +
    + + + SurplusEdges + +
    + Signature: ICollection<'TEdge>
    +
    +     		+ +
    + + + SurplusVertexAdded + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+ +
    + + + SurplusVertices + +
    + Signature: ICollection<'TVertex>
    +
    +     		+ +
    + + + UnBalance() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + VertexFactory + +
    + Signature: VertexFactory<'TVertex>
    +
    +     		+ +
    + + + VisitedGraph + +
    + Signature: IMutableBidirectionalGraph<'TVertex,'TEdge>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-maximumflow-maximumflowalgorithm-2.html b/reference/quickgraph-algorithms-maximumflow-maximumflowalgorithm-2.html new file mode 100644 index 000000000..6cab24535 --- /dev/null +++ b/reference/quickgraph-algorithms-maximumflow-maximumflowalgorithm-2.html @@ -0,0 +1,255 @@ + + + + + MaximumFlowAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    MaximumFlowAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.MaximumFlow
    +

    +
    +

    Abstract base class for maximum flow algorithms.

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(...) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IMutableVertexAndEdgeListGraph<'TVertex,'TEdge> * capacities:Func<'TEdge,float> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Capacities() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Compute(source, sink) + +
    + Signature: (source:'TVertex * sink:'TVertex) -> float
    +
    +     		+ +
    + + + EdgeFactory() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + GetVertexColor(vertex) + +
    + Signature: vertex:'TVertex -> GraphColor
    + Modifiers: abstract
    +
    +     		+ +
    + + + MaxFlow() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Predecessors() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + ResidualCapacities() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + ReversedEdges() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Sink() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Source() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + VertexColors() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-maximumflow-multisourcesinkgraphaugmentoralgorithm-2.html b/reference/quickgraph-algorithms-maximumflow-multisourcesinkgraphaugmentoralgorithm-2.html new file mode 100644 index 000000000..cbed2326f --- /dev/null +++ b/reference/quickgraph-algorithms-maximumflow-multisourcesinkgraphaugmentoralgorithm-2.html @@ -0,0 +1,104 @@ + + + + + MultiSourceSinkGraphAugmentorAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    MultiSourceSinkGraphAugmentorAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.MaximumFlow
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(...) + +
    + Signature: (visitedGraph:IMutableBidirectionalGraph<'TVertex,'TEdge> * vertexFactory:VertexFactory<'TVertex> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    + + + new(...) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IMutableBidirectionalGraph<'TVertex,'TEdge> * vertexFactory:VertexFactory<'TVertex> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-maximumflow-reversededgeaugmentoralgorithm-2.html b/reference/quickgraph-algorithms-maximumflow-reversededgeaugmentoralgorithm-2.html new file mode 100644 index 000000000..4408ee05a --- /dev/null +++ b/reference/quickgraph-algorithms-maximumflow-reversededgeaugmentoralgorithm-2.html @@ -0,0 +1,224 @@ + + + + + ReversedEdgeAugmentorAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ReversedEdgeAugmentorAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.MaximumFlow
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph, edgeFactory) + +
    + Signature: (visitedGraph:IMutableVertexAndEdgeListGraph<'TVertex,'TEdge> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    + + + new(host, visitedGraph, edgeFactory) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IMutableVertexAndEdgeListGraph<'TVertex,'TEdge> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AddReversedEdges() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Augmented + +
    + Signature: bool
    +
    +     		+ +
    + + + AugmentedEdges + +
    + Signature: ICollection<'TEdge>
    +
    +     		+ +
    + + + EdgeFactory + +
    + Signature: EdgeFactory<'TVertex,'TEdge>
    +
    +     		+ +
    + + + RemoveReversedEdges() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + ReversedEdgeAdded + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + ReversedEdges + +
    + Signature: Dictionary<'TEdge,'TEdge>
    +
    +     		+ +
    + + + VisitedGraph + +
    + Signature: IMutableVertexAndEdgeListGraph<'TVertex,'TEdge>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-maximumindependentsetalgorithm.html b/reference/quickgraph-algorithms-maximumindependentsetalgorithm.html new file mode 100644 index 000000000..ed504eef3 --- /dev/null +++ b/reference/quickgraph-algorithms-maximumindependentsetalgorithm.html @@ -0,0 +1,112 @@ + + + + + MaximumIndependentSetAlgorithm - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    MaximumIndependentSetAlgorithm

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Static members

    + + + + + + + + + + + + + + +
    Static memberDescription
    + + + Compute(graph) + +
    + Signature: graph:UndirectedGraph<int,Edge<int>> -> seq<int>
    +
    +     		+ + + + + +
    + + + Compute(vertices, edges) + +
    + Signature: (vertices:int list * edges:Edge<int> list) -> seq<int>
    +
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-minimumdominatingsetgeneticalgorithm.html b/reference/quickgraph-algorithms-minimumdominatingsetgeneticalgorithm.html new file mode 100644 index 000000000..f756943da --- /dev/null +++ b/reference/quickgraph-algorithms-minimumdominatingsetgeneticalgorithm.html @@ -0,0 +1,121 @@ + + + + + MinimumDominatingSetGeneticAlgorithm - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    MinimumDominatingSetGeneticAlgorithm

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(graph) + +
    + Signature: graph:IUndirectedGraph<int,IUndirectedEdge<int>> -> MinimumDominatingSetGeneticAlgorithm
    +
    +     		+ + + + + +

    CompiledName: .ctor

    +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Compute() + +
    + Signature: unit -> Chromosome
    +
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-minimumspanningtree-iminimumspanningtreealgorithm-2.html b/reference/quickgraph-algorithms-minimumspanningtree-iminimumspanningtreealgorithm-2.html new file mode 100644 index 000000000..654094653 --- /dev/null +++ b/reference/quickgraph-algorithms-minimumspanningtree-iminimumspanningtreealgorithm-2.html @@ -0,0 +1,68 @@ + + + + + IMinimumSpanningTreeAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IMinimumSpanningTreeAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.MinimumSpanningTree
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-minimumspanningtree-kruskalminimumspanningtreealgorithm-2.html b/reference/quickgraph-algorithms-minimumspanningtree-kruskalminimumspanningtreealgorithm-2.html new file mode 100644 index 000000000..52207a7ed --- /dev/null +++ b/reference/quickgraph-algorithms-minimumspanningtree-kruskalminimumspanningtreealgorithm-2.html @@ -0,0 +1,141 @@ + + + + + KruskalMinimumSpanningTreeAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    KruskalMinimumSpanningTreeAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.MinimumSpanningTree
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph, edgeWeights) + +
    + Signature: (visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * edgeWeights:Func<'TEdge,float>) -> unit
    +
    +     		+ +
    + + + new(host, visitedGraph, edgeWeights) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * edgeWeights:Func<'TEdge,float>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ExamineEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + TreeEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-minimumspanningtree-primminimumspanningtreealgorithm-2.html b/reference/quickgraph-algorithms-minimumspanningtree-primminimumspanningtreealgorithm-2.html new file mode 100644 index 000000000..dc16c703d --- /dev/null +++ b/reference/quickgraph-algorithms-minimumspanningtree-primminimumspanningtreealgorithm-2.html @@ -0,0 +1,141 @@ + + + + + PrimMinimumSpanningTreeAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    PrimMinimumSpanningTreeAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.MinimumSpanningTree
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph, edgeWeights) + +
    + Signature: (visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * edgeWeights:Func<'TEdge,float>) -> unit
    +
    +     		+ +
    + + + new(host, visitedGraph, edgeWeights) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * edgeWeights:Func<'TEdge,float>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ExamineEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + TreeEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-observers-edgepredecessorrecorderobserver-2.html b/reference/quickgraph-algorithms-observers-edgepredecessorrecorderobserver-2.html new file mode 100644 index 000000000..673436e51 --- /dev/null +++ b/reference/quickgraph-algorithms-observers-edgepredecessorrecorderobserver-2.html @@ -0,0 +1,212 @@ + + + + + EdgePredecessorRecorderObserver<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EdgePredecessorRecorderObserver<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.Observers
    +

    +
    + +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + new(edgePredecessors, endPathEdges) + +
    + Signature: (edgePredecessors:IDictionary<'TEdge,'TEdge> * endPathEdges:IList<'TEdge>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AllMergedPaths() + +
    + Signature: unit -> ICollection<ICollection<'TEdge>>
    +
    +     		+ +
    + + + AllPaths() + +
    + Signature: unit -> ICollection<ICollection<'TEdge>>
    +
    +     		+ +
    + + + Attach(algorithm) + +
    + Signature: algorithm:IEdgePredecessorRecorderAlgorithm<'TVertex,'TEdge> -> IDisposable
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgePredecessors + +
    + Signature: IDictionary<'TEdge,'TEdge>
    +
    +     		+ +
    + + + EndPathEdges + +
    + Signature: IList<'TEdge>
    +
    +     		+ +
    + + + MergedPath(se, colors) + +
    + Signature: (se:'TEdge * colors:IDictionary<'TEdge,GraphColor>) -> ICollection<'TEdge>
    +
    +     		+ +
    + + + Path(se) + +
    + Signature: se:'TEdge -> ICollection<'TEdge>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-observers-edgerecorderobserver-2.html b/reference/quickgraph-algorithms-observers-edgerecorderobserver-2.html new file mode 100644 index 000000000..648780c73 --- /dev/null +++ b/reference/quickgraph-algorithms-observers-edgerecorderobserver-2.html @@ -0,0 +1,142 @@ + + + + + EdgeRecorderObserver<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EdgeRecorderObserver<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.Observers
    +

    +
    + +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + new(edges) + +
    + Signature: edges:IList<'TEdge> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Attach(algorithm) + +
    + Signature: algorithm:ITreeBuilderAlgorithm<'TVertex,'TEdge> -> IDisposable
    + Modifiers: abstract
    +
    +     		+ +
    + + + Edges + +
    + Signature: IList<'TEdge>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-observers-iobserver-1.html b/reference/quickgraph-algorithms-observers-iobserver-1.html new file mode 100644 index 000000000..7c26612ca --- /dev/null +++ b/reference/quickgraph-algorithms-observers-iobserver-1.html @@ -0,0 +1,97 @@ + + + + + IObserver<'TAlgorithm> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IObserver<'TAlgorithm>

    +

    + Namespace: QuickGraph.Algorithms.Observers
    +

    +
    +

    An algorithm observer

    + +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Attach(algorithm) + +
    + Signature: algorithm:'TAlgorithm -> IDisposable
    + Modifiers: abstract
    +
    +     		+

    Attaches to the algorithm events +and returns a disposable object that can be used +to detach from the events

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-observers-undirectedvertexdistancerecorderobserver-2.html b/reference/quickgraph-algorithms-observers-undirectedvertexdistancerecorderobserver-2.html new file mode 100644 index 000000000..e2c9db93d --- /dev/null +++ b/reference/quickgraph-algorithms-observers-undirectedvertexdistancerecorderobserver-2.html @@ -0,0 +1,171 @@ + + + + + UndirectedVertexDistanceRecorderObserver<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    UndirectedVertexDistanceRecorderObserver<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.Observers
    +

    +
    +

    A distance recorder for undirected tree builder algorithms

    + +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(edgeWeights) + +
    + Signature: edgeWeights:Func<'TEdge,float> -> unit
    +
    +     		+ +
    + + + new(...) + +
    + Signature: (edgeWeights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer * distances:IDictionary<'TVertex,float>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Attach(algorithm) + +
    + Signature: algorithm:IUndirectedTreeBuilderAlgorithm<'TVertex,'TEdge> -> IDisposable
    + Modifiers: abstract
    +
    +     		+ +
    + + + DistanceRelaxer + +
    + Signature: IDistanceRelaxer
    +
    +     		+ +
    + + + Distances + +
    + Signature: IDictionary<'TVertex,float>
    +
    +     		+ +
    + + + EdgeWeights + +
    + Signature: Func<'TEdge,float>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-observers-undirectedvertexpredecessorrecorderobserver-2.html b/reference/quickgraph-algorithms-observers-undirectedvertexpredecessorrecorderobserver-2.html new file mode 100644 index 000000000..ab91da2b1 --- /dev/null +++ b/reference/quickgraph-algorithms-observers-undirectedvertexpredecessorrecorderobserver-2.html @@ -0,0 +1,156 @@ + + + + + UndirectedVertexPredecessorRecorderObserver<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    UndirectedVertexPredecessorRecorderObserver<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.Observers
    +

    +
    + +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + new(vertexPredecessors) + +
    + Signature: vertexPredecessors:IDictionary<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Attach(algorithm) + +
    + Signature: algorithm:IUndirectedTreeBuilderAlgorithm<'TVertex,'TEdge> -> IDisposable
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetPath(vertex, path) + +
    + Signature: (vertex:'TVertex * path:byref<IEnumerable<'TEdge>>) -> bool
    +
    +     		+ +
    + + + VertexPredecessors + +
    + Signature: IDictionary<'TVertex,'TEdge>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-observers-vertexdistancerecorderobserver-2.html b/reference/quickgraph-algorithms-observers-vertexdistancerecorderobserver-2.html new file mode 100644 index 000000000..7d0c8bdb8 --- /dev/null +++ b/reference/quickgraph-algorithms-observers-vertexdistancerecorderobserver-2.html @@ -0,0 +1,171 @@ + + + + + VertexDistanceRecorderObserver<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    VertexDistanceRecorderObserver<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.Observers
    +

    +
    +

    A distance recorder for directed tree builder algorithms

    + +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(edgeWeights) + +
    + Signature: edgeWeights:Func<'TEdge,float> -> unit
    +
    +     		+ +
    + + + new(...) + +
    + Signature: (edgeWeights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer * distances:IDictionary<'TVertex,float>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Attach(algorithm) + +
    + Signature: algorithm:ITreeBuilderAlgorithm<'TVertex,'TEdge> -> IDisposable
    + Modifiers: abstract
    +
    +     		+ +
    + + + DistanceRelaxer + +
    + Signature: IDistanceRelaxer
    +
    +     		+ +
    + + + Distances + +
    + Signature: IDictionary<'TVertex,float>
    +
    +     		+ +
    + + + EdgeWeights + +
    + Signature: Func<'TEdge,float>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-observers-vertexpredecessorpathrecorderobserver-2.html b/reference/quickgraph-algorithms-observers-vertexpredecessorpathrecorderobserver-2.html new file mode 100644 index 000000000..c72924ff6 --- /dev/null +++ b/reference/quickgraph-algorithms-observers-vertexpredecessorpathrecorderobserver-2.html @@ -0,0 +1,170 @@ + + + + + VertexPredecessorPathRecorderObserver<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    VertexPredecessorPathRecorderObserver<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.Observers
    +

    +
    + +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + new(vertexPredecessors) + +
    + Signature: vertexPredecessors:IDictionary<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AllPaths() + +
    + Signature: unit -> IEnumerable<IEnumerable<'TEdge>>
    +
    +     		+ +
    + + + Attach(algorithm) + +
    + Signature: algorithm:IVertexPredecessorRecorderAlgorithm<'TVertex,'TEdge> -> IDisposable
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndPathVertices + +
    + Signature: ICollection<'TVertex>
    +
    +     		+ +
    + + + VertexPredecessors + +
    + Signature: IDictionary<'TVertex,'TEdge>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-observers-vertexpredecessorrecorderobserver-2.html b/reference/quickgraph-algorithms-observers-vertexpredecessorrecorderobserver-2.html new file mode 100644 index 000000000..d008f0cf8 --- /dev/null +++ b/reference/quickgraph-algorithms-observers-vertexpredecessorrecorderobserver-2.html @@ -0,0 +1,156 @@ + + + + + VertexPredecessorRecorderObserver<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    VertexPredecessorRecorderObserver<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.Observers
    +

    +
    + +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + new(vertexPredecessors) + +
    + Signature: vertexPredecessors:Dictionary<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Attach(algorithm) + +
    + Signature: algorithm:ITreeBuilderAlgorithm<'TVertex,'TEdge> -> IDisposable
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetPath(vertex, path) + +
    + Signature: (vertex:'TVertex * path:byref<IEnumerable<'TEdge>>) -> bool
    +
    +     		+ +
    + + + VertexPredecessors + +
    + Signature: IDictionary<'TVertex,'TEdge>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-observers-vertexrecorderobserver-2.html b/reference/quickgraph-algorithms-observers-vertexrecorderobserver-2.html new file mode 100644 index 000000000..3f43761c4 --- /dev/null +++ b/reference/quickgraph-algorithms-observers-vertexrecorderobserver-2.html @@ -0,0 +1,142 @@ + + + + + VertexRecorderObserver<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    VertexRecorderObserver<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.Observers
    +

    +
    + +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + new(vertices) + +
    + Signature: vertices:IList<'TVertex> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Attach(algorithm) + +
    + Signature: algorithm:IVertexTimeStamperAlgorithm<'TVertex,'TEdge> -> IDisposable
    + Modifiers: abstract
    +
    +     		+ +
    + + + Vertices + +
    + Signature: IEnumerable<'TVertex>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-observers-vertextimestamperobserver-2.html b/reference/quickgraph-algorithms-observers-vertextimestamperobserver-2.html new file mode 100644 index 000000000..bd8f83a03 --- /dev/null +++ b/reference/quickgraph-algorithms-observers-vertextimestamperobserver-2.html @@ -0,0 +1,170 @@ + + + + + VertexTimeStamperObserver<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    VertexTimeStamperObserver<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.Observers
    +

    +
    + +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + new(discoverTimes) + +
    + Signature: discoverTimes:Dictionary<'TVertex,int> -> unit
    +
    +     		+ +
    + + + new(discoverTimes, finishTimes) + +
    + Signature: (discoverTimes:Dictionary<'TVertex,int> * finishTimes:Dictionary<'TVertex,int>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Attach(algorithm) + +
    + Signature: algorithm:IVertexTimeStamperAlgorithm<'TVertex,'TEdge> -> IDisposable
    + Modifiers: abstract
    +
    +     		+ +
    + + + DiscoverTimes + +
    + Signature: IDictionary<'TVertex,int>
    +
    +     		+ +
    + + + FinishTimes + +
    + Signature: IDictionary<'TVertex,int>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-population.html b/reference/quickgraph-algorithms-population.html new file mode 100644 index 000000000..8a13b1560 --- /dev/null +++ b/reference/quickgraph-algorithms-population.html @@ -0,0 +1,68 @@ + + + + + Population - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    Population

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-randomgraphfactory.html b/reference/quickgraph-algorithms-randomgraphfactory.html new file mode 100644 index 000000000..444cec768 --- /dev/null +++ b/reference/quickgraph-algorithms-randomgraphfactory.html @@ -0,0 +1,160 @@ + + + + + RandomGraphFactory - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    RandomGraphFactory

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Static members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Static memberDescription
    + + + Create(...) + +
    + Signature: (g:IMutableVertexAndEdgeListGraph<'TVertex,'TEdge> * vertexFactory:VertexFactory<'TVertex> * edgeFactory:EdgeFactory<'TVertex,'TEdge> * rnd:Random * vertexCount:int * edgeCount:int * selfEdges:bool) -> unit
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + Create(...) + +
    + Signature: (g:IMutableUndirectedGraph<'TVertex,'TEdge> * vertexFactory:VertexFactory<'TVertex> * edgeFactory:EdgeFactory<'TVertex,'TEdge> * rnd:Random * vertexCount:int * edgeCount:int * selfEdges:bool) -> unit
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + GetEdge(g, rnd) + +
    + Signature: (g:IEdgeSet<'TVertex,'TEdge> * rnd:Random) -> 'TEdge
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + GetEdge(edges, count, rnd) + +
    + Signature: (edges:IEnumerable<'TEdge> * count:int * rnd:Random) -> 'TEdge
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + GetVertex(g, rnd) + +
    + Signature: (g:IVertexListGraph<'TVertex,'TEdge> * rnd:Random) -> 'TVertex
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + GetVertex(vertices, count, rnd) + +
    + Signature: (vertices:IEnumerable<'TVertex> * count:int * rnd:Random) -> 'TVertex
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-randomwalks-cyclepoppingrandomtreealgorithm-2.html b/reference/quickgraph-algorithms-randomwalks-cyclepoppingrandomtreealgorithm-2.html new file mode 100644 index 000000000..7acbac88b --- /dev/null +++ b/reference/quickgraph-algorithms-randomwalks-cyclepoppingrandomtreealgorithm-2.html @@ -0,0 +1,286 @@ + + + + + CyclePoppingRandomTreeAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    CyclePoppingRandomTreeAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.RandomWalks
    +

    +
    +

    Wilson-Propp Cycle-Popping Algorithm for Random Tree Generation.

    + +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:IVertexListGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    + + + new(visitedGraph, edgeChain) + +
    + Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * edgeChain:IMarkovEdgeChain<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    + + + new(host, visitedGraph, edgeChain) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IVertexListGraph<'TVertex,'TEdge> * edgeChain:IMarkovEdgeChain<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ClearTreeVertex + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+ +
    + + + EdgeChain + +
    + Signature: IMarkovEdgeChain<'TVertex,'TEdge>
    +
    +     		+ +
    + + + FinishVertex + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+ +
    + + + GetVertexColor(v) + +
    + Signature: v:'TVertex -> GraphColor
    + Modifiers: abstract
    +
    +     		+ +
    + + + InitializeVertex + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+ +
    + + + RandomTree() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + RandomTreeWithRoot(root) + +
    + Signature: root:'TVertex -> unit
    +
    +     		+ +
    + + + Rnd() + +
    + Signature: unit -> unit
    +
    +     		+

    Gets or sets the random number generator used in RandomTree.

    + + +
    + + + Successors + +
    + Signature: IDictionary<'TVertex,'TEdge>
    +
    +     		+ +
    + + + TreeEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexColors + +
    + Signature: IDictionary<'TVertex,GraphColor>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-randomwalks-iedgechain-2.html b/reference/quickgraph-algorithms-randomwalks-iedgechain-2.html new file mode 100644 index 000000000..da873f294 --- /dev/null +++ b/reference/quickgraph-algorithms-randomwalks-iedgechain-2.html @@ -0,0 +1,106 @@ + + + + + IEdgeChain<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IEdgeChain<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.RandomWalks
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + TryGetSuccessor(g, u, successor) + +
    + Signature: (g:IImplicitGraph<'TVertex,'TEdge> * u:'TVertex * successor:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetSuccessor(edges, u, successor) + +
    + Signature: (edges:IEnumerable<'TEdge> * u:'TVertex * successor:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-randomwalks-imarkovedgechain-2.html b/reference/quickgraph-algorithms-randomwalks-imarkovedgechain-2.html new file mode 100644 index 000000000..71bb7c714 --- /dev/null +++ b/reference/quickgraph-algorithms-randomwalks-imarkovedgechain-2.html @@ -0,0 +1,91 @@ + + + + + IMarkovEdgeChain<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IMarkovEdgeChain<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.RandomWalks
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Rand() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-randomwalks-markovedgechainbase-2.html b/reference/quickgraph-algorithms-randomwalks-markovedgechainbase-2.html new file mode 100644 index 000000000..3bf532c2b --- /dev/null +++ b/reference/quickgraph-algorithms-randomwalks-markovedgechainbase-2.html @@ -0,0 +1,143 @@ + + + + + MarkovEdgeChainBase<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    MarkovEdgeChainBase<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.RandomWalks
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Rand() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetSuccessor(g, u, successor) + +
    + Signature: (g:IImplicitGraph<'TVertex,'TEdge> * u:'TVertex * successor:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetSuccessor(edges, u, successor) + +
    + Signature: (edges:IEnumerable<'TEdge> * u:'TVertex * successor:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-randomwalks-normalizedmarkovedgechain-2.html b/reference/quickgraph-algorithms-randomwalks-normalizedmarkovedgechain-2.html new file mode 100644 index 000000000..d8342f5b6 --- /dev/null +++ b/reference/quickgraph-algorithms-randomwalks-normalizedmarkovedgechain-2.html @@ -0,0 +1,128 @@ + + + + + NormalizedMarkovEdgeChain<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    NormalizedMarkovEdgeChain<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.RandomWalks
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + TryGetSuccessor(g, u, successor) + +
    + Signature: (g:IImplicitGraph<'TVertex,'TEdge> * u:'TVertex * successor:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetSuccessor(edges, u, successor) + +
    + Signature: (edges:IEnumerable<'TEdge> * u:'TVertex * successor:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-randomwalks-randomwalkalgorithm-2.html b/reference/quickgraph-algorithms-randomwalks-randomwalkalgorithm-2.html new file mode 100644 index 000000000..86f251dfe --- /dev/null +++ b/reference/quickgraph-algorithms-randomwalks-randomwalkalgorithm-2.html @@ -0,0 +1,225 @@ + + + + + RandomWalkAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    RandomWalkAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.RandomWalks
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:IImplicitGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    + + + new(visitedGraph, edgeChain) + +
    + Signature: (visitedGraph:IImplicitGraph<'TVertex,'TEdge> * edgeChain:IEdgeChain<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + EdgeChain() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + EndPredicate() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + EndVertex + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+ +
    + + + Generate(root) + +
    + Signature: root:'TVertex -> unit
    +
    +     		+ +
    + + + Generate(root, walkCount) + +
    + Signature: (root:'TVertex * walkCount:int) -> unit
    +
    +     		+ +
    + + + StartVertex + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+ +
    + + + TreeEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + VisitedGraph + +
    + Signature: IImplicitGraph<'TVertex,'TEdge>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-randomwalks-roundrobinedgechain-2.html b/reference/quickgraph-algorithms-randomwalks-roundrobinedgechain-2.html new file mode 100644 index 000000000..55d5f60ff --- /dev/null +++ b/reference/quickgraph-algorithms-randomwalks-roundrobinedgechain-2.html @@ -0,0 +1,128 @@ + + + + + RoundRobinEdgeChain<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    RoundRobinEdgeChain<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.RandomWalks
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + TryGetSuccessor(g, u, successor) + +
    + Signature: (g:IImplicitGraph<'TVertex,'TEdge> * u:'TVertex * successor:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetSuccessor(edges, u, successor) + +
    + Signature: (edges:IEnumerable<'TEdge> * u:'TVertex * successor:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-randomwalks-vanishingweightedmarkovedgechain-2.html b/reference/quickgraph-algorithms-randomwalks-vanishingweightedmarkovedgechain-2.html new file mode 100644 index 000000000..659c2dd67 --- /dev/null +++ b/reference/quickgraph-algorithms-randomwalks-vanishingweightedmarkovedgechain-2.html @@ -0,0 +1,156 @@ + + + + + VanishingWeightedMarkovEdgeChain<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    VanishingWeightedMarkovEdgeChain<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.RandomWalks
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(weights) + +
    + Signature: weights:IDictionary<'TEdge,float> -> unit
    +
    +     		+ +
    + + + new(weights, factor) + +
    + Signature: (weights:IDictionary<'TEdge,float> * factor:float) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Factor() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + TryGetSuccessor(g, u, successor) + +
    + Signature: (g:IImplicitGraph<'TVertex,'TEdge> * u:'TVertex * successor:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetSuccessor(edges, u, successor) + +
    + Signature: (edges:IEnumerable<'TEdge> * u:'TVertex * successor:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-randomwalks-weightedmarkovedgechain-2.html b/reference/quickgraph-algorithms-randomwalks-weightedmarkovedgechain-2.html new file mode 100644 index 000000000..0f9a204ab --- /dev/null +++ b/reference/quickgraph-algorithms-randomwalks-weightedmarkovedgechain-2.html @@ -0,0 +1,128 @@ + + + + + WeightedMarkovEdgeChain<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    WeightedMarkovEdgeChain<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.RandomWalks
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(weights) + +
    + Signature: weights:IDictionary<'TEdge,float> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + TryGetSuccessor(g, u, successor) + +
    + Signature: (g:IImplicitGraph<'TVertex,'TEdge> * u:'TVertex * successor:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetSuccessor(edges, u, sucessor) + +
    + Signature: (edges:IEnumerable<'TEdge> * u:'TVertex * sucessor:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-randomwalks-weightedmarkovedgechainbase-2.html b/reference/quickgraph-algorithms-randomwalks-weightedmarkovedgechainbase-2.html new file mode 100644 index 000000000..a317b5f1d --- /dev/null +++ b/reference/quickgraph-algorithms-randomwalks-weightedmarkovedgechainbase-2.html @@ -0,0 +1,112 @@ + + + + + WeightedMarkovEdgeChainBase<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    WeightedMarkovEdgeChainBase<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.RandomWalks
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(weights) + +
    + Signature: weights:IDictionary<'TEdge,float> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Weights() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-rankedshortestpath-hoffmanpavleyrankedshortestpathalgorithm-2.html b/reference/quickgraph-algorithms-rankedshortestpath-hoffmanpavleyrankedshortestpathalgorithm-2.html new file mode 100644 index 000000000..7cb36c51e --- /dev/null +++ b/reference/quickgraph-algorithms-rankedshortestpath-hoffmanpavleyrankedshortestpathalgorithm-2.html @@ -0,0 +1,156 @@ + + + + + HoffmanPavleyRankedShortestPathAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    HoffmanPavleyRankedShortestPathAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.RankedShortestPath
    +

    +
    +

    Hoffman and Pavley K-shortest path algorithm.

    + +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph, edgeWeights) + +
    + Signature: (visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> * edgeWeights:Func<'TEdge,float>) -> unit
    +
    +     		+ +
    + + + new(...) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> * edgeWeights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Compute(rootVertex, goalVertex) + +
    + Signature: (rootVertex:'TVertex * goalVertex:'TVertex) -> unit
    +
    +     		+ +
    + + + SetGoalVertex(goalVertex) + +
    + Signature: goalVertex:'TVertex -> unit
    +
    +     		+ +
    + + + TryGetGoalVertex(goalVertex) + +
    + Signature: goalVertex:byref<'TVertex> -> bool
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-rankedshortestpath-rankedshortestpathalgorithmbase-3.html b/reference/quickgraph-algorithms-rankedshortestpath-rankedshortestpathalgorithmbase-3.html new file mode 100644 index 000000000..dbde45235 --- /dev/null +++ b/reference/quickgraph-algorithms-rankedshortestpath-rankedshortestpathalgorithmbase-3.html @@ -0,0 +1,154 @@ + + + + + RankedShortestPathAlgorithmBase<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    RankedShortestPathAlgorithmBase<'TVertex, 'TEdge, 'TGraph>

    +

    + Namespace: QuickGraph.Algorithms.RankedShortestPath
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(host, visitedGraph, distanceRelaxer) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:'TGraph * distanceRelaxer:IDistanceRelaxer) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ComputedShortestPathCount + +
    + Signature: int
    +
    +     		+ +
    + + + ComputedShortestPaths + +
    + Signature: IEnumerable<IEnumerable<'TEdge>>
    +
    +     		+ +
    + + + DistanceRelaxer + +
    + Signature: IDistanceRelaxer
    +
    +     		+ +
    + + + ShortestPathCount() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-ranking-pagerankalgorithm-2.html b/reference/quickgraph-algorithms-ranking-pagerankalgorithm-2.html new file mode 100644 index 000000000..f70e4ee4f --- /dev/null +++ b/reference/quickgraph-algorithms-ranking-pagerankalgorithm-2.html @@ -0,0 +1,196 @@ + + + + + PageRankAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    PageRankAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.Ranking
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Damping() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + GetRanksMean() + +
    + Signature: unit -> float
    +
    +     		+ +
    + + + GetRanksSum() + +
    + Signature: unit -> float
    +
    +     		+ +
    + + + InitializeRanks() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + MaxIteration() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Ranks + +
    + Signature: IDictionary<'TVertex,float>
    +
    +     		+ +
    + + + Tolerance() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-rootedalgorithmbase-2.html b/reference/quickgraph-algorithms-rootedalgorithmbase-2.html new file mode 100644 index 000000000..9af8763dc --- /dev/null +++ b/reference/quickgraph-algorithms-rootedalgorithmbase-2.html @@ -0,0 +1,168 @@ + + + + + RootedAlgorithmBase<'TVertex, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    RootedAlgorithmBase<'TVertex, 'TGraph>

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(host, visitedGraph) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:'TGraph) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ClearRootVertex() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Compute(rootVertex) + +
    + Signature: rootVertex:'TVertex -> unit
    +
    +     		+ +
    + + + RootVertexChanged + +
    + Signature: IEvent<EventHandler,EventArgs>
    +
    +     		+ +
    + + + SetRootVertex(rootVertex) + +
    + Signature: rootVertex:'TVertex -> unit
    +
    +     		+ +
    + + + TryGetRootVertex(rootVertex) + +
    + Signature: rootVertex:byref<'TVertex> -> bool
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-rootedsearchalgorithmbase-2.html b/reference/quickgraph-algorithms-rootedsearchalgorithmbase-2.html new file mode 100644 index 000000000..e07697c6e --- /dev/null +++ b/reference/quickgraph-algorithms-rootedsearchalgorithmbase-2.html @@ -0,0 +1,182 @@ + + + + + RootedSearchAlgorithmBase<'TVertex, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    RootedSearchAlgorithmBase<'TVertex, 'TGraph>

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(host, visitedGraph) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:'TGraph) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ClearGoalVertex() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Compute(root, goal) + +
    + Signature: (root:'TVertex * goal:'TVertex) -> unit
    +
    +     		+ +
    + + + GoalReached + +
    + Signature: IEvent<EventHandler,EventArgs>
    +
    +     		+ +
    + + + GoalVertexChanged + +
    + Signature: IEvent<EventHandler,EventArgs>
    +
    +     		+ +
    + + + SetGoalVertex(goalVertex) + +
    + Signature: goalVertex:'TVertex -> unit
    +
    +     		+ +
    + + + TryGetGoalVertex(goalVertex) + +
    + Signature: goalVertex:byref<'TVertex> -> bool
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-search-bestfirstfrontiersearchalgorithm-2.html b/reference/quickgraph-algorithms-search-bestfirstfrontiersearchalgorithm-2.html new file mode 100644 index 000000000..845f80e92 --- /dev/null +++ b/reference/quickgraph-algorithms-search-bestfirstfrontiersearchalgorithm-2.html @@ -0,0 +1,115 @@ + + + + + BestFirstFrontierSearchAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    BestFirstFrontierSearchAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.Search
    +

    +
    +

    Best first frontier search

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(...) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IBidirectionalIncidenceGraph<'TVertex,'TEdge> * edgeWeights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + TreeEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-search-bidirectionaldepthfirstsearchalgorithm-2.html b/reference/quickgraph-algorithms-search-bidirectionaldepthfirstsearchalgorithm-2.html new file mode 100644 index 000000000..ede595a48 --- /dev/null +++ b/reference/quickgraph-algorithms-search-bidirectionaldepthfirstsearchalgorithm-2.html @@ -0,0 +1,298 @@ + + + + + BidirectionalDepthFirstSearchAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    BidirectionalDepthFirstSearchAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.Search
    +

    +
    +

    A depth and height first search algorithm for directed graphs

    + +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(g) + +
    + Signature: g:IBidirectionalGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    + + + new(visitedGraph, colors) + +
    + Signature: (visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> * colors:IDictionary<'TVertex,GraphColor>) -> unit
    +
    +     		+ +
    + + + new(host, visitedGraph, colors) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> * colors:IDictionary<'TVertex,GraphColor>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BackEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + DiscoverVertex + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+ +
    + + + ExamineEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + FinishVertex + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+ +
    + + + ForwardOrCrossEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + GetVertexColor(vertex) + +
    + Signature: vertex:'TVertex -> GraphColor
    + Modifiers: abstract
    +
    +     		+ +
    + + + InitializeVertex + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+ +
    + + + MaxDepth() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + StartVertex + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+ +
    + + + TreeEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexColors + +
    + Signature: IDictionary<'TVertex,GraphColor>
    +
    +     		+ +
    + + + Visit(u, depth) + +
    + Signature: (u:'TVertex * depth:int) -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-search-breadthfirstsearchalgorithm-2.html b/reference/quickgraph-algorithms-search-breadthfirstsearchalgorithm-2.html new file mode 100644 index 000000000..ce092bafe --- /dev/null +++ b/reference/quickgraph-algorithms-search-breadthfirstsearchalgorithm-2.html @@ -0,0 +1,344 @@ + + + + + BreadthFirstSearchAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    BreadthFirstSearchAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.Search
    +

    +
    +

    A breath first search algorithm for directed graphs

    + +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(g) + +
    + Signature: g:IVertexListGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    + + + new(...) + +
    + Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * vertexQueue:IQueue<'TVertex> * vertexColors:IDictionary<'TVertex,GraphColor>) -> unit
    +
    +     		+ +
    + + + new(...) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IVertexListGraph<'TVertex,'TEdge> * vertexQueue:IQueue<'TVertex> * vertexColors:IDictionary<'TVertex,GraphColor>) -> unit
    +
    +     		+ +
    + + + new(...) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IVertexListGraph<'TVertex,'TEdge> * vertexQueue:IQueue<'TVertex> * vertexColors:IDictionary<'TVertex,GraphColor> * outEdgeEnumerator:Func<IEnumerable<'TEdge>,IEnumerable<'TEdge>>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BlackTarget + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + DiscoverVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + ExamineEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + ExamineVertex + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+ +
    + + + FinishVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + GetVertexColor(vertex) + +
    + Signature: vertex:'TVertex -> GraphColor
    + Modifiers: abstract
    +
    +     		+ +
    + + + GrayTarget + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + InitializeVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + NonTreeEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + OutEdgeEnumerator + +
    + Signature: Func<IEnumerable<'TEdge>,IEnumerable<'TEdge>>
    +
    +     		+ +
    + + + StartVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + TreeEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexColors + +
    + Signature: IDictionary<'TVertex,GraphColor>
    +
    +     		+ +
    + + + Visit(s) + +
    + Signature: s:'TVertex -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-search-depthfirstsearchalgorithm-2.html b/reference/quickgraph-algorithms-search-depthfirstsearchalgorithm-2.html new file mode 100644 index 000000000..eba8b5cd3 --- /dev/null +++ b/reference/quickgraph-algorithms-search-depthfirstsearchalgorithm-2.html @@ -0,0 +1,354 @@ + + + + + DepthFirstSearchAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DepthFirstSearchAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.Search
    +

    +
    +

    A depth first search algorithm for directed graph

    + +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:IVertexListGraph<'TVertex,'TEdge> -> unit
    +
    +     		+

    Initializes a new instance of the algorithm.

    + + +
    + + + new(visitedGraph, colors) + +
    + Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * colors:IDictionary<'TVertex,GraphColor>) -> unit
    +
    +     		+

    Initializes a new instance of the algorithm.

    + + +
    + + + new(host, visitedGraph) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IVertexListGraph<'TVertex,'TEdge>) -> unit
    +
    +     		+

    Initializes a new instance of the algorithm.

    + + +
    + + + new(host, visitedGraph, colors) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IVertexListGraph<'TVertex,'TEdge> * colors:IDictionary<'TVertex,GraphColor>) -> unit
    +
    +     		+

    Initializes a new instance of the algorithm.

    + + +
    + + + new(...) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IVertexListGraph<'TVertex,'TEdge> * colors:IDictionary<'TVertex,GraphColor> * outEdgeEnumerator:Func<IEnumerable<'TEdge>,IEnumerable<'TEdge>>) -> unit
    +
    +     		+

    Initializes a new instance of the algorithm.

    + + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BackEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + DiscoverVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + ExamineEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + FinishVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + ForwardOrCrossEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + GetVertexColor(vertex) + +
    + Signature: vertex:'TVertex -> GraphColor
    + Modifiers: abstract
    +
    +     		+ +
    + + + InitializeVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + MaxDepth() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + OutEdgeEnumerator + +
    + Signature: Func<IEnumerable<'TEdge>,IEnumerable<'TEdge>>
    +
    +     		+ +
    + + + StartVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + TreeEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexColors + +
    + Signature: IDictionary<'TVertex,GraphColor>
    +
    +     		+ +
    + + + Visit(root) + +
    + Signature: root:'TVertex -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-search-edgedepthfirstsearchalgorithm-2.html b/reference/quickgraph-algorithms-search-edgedepthfirstsearchalgorithm-2.html new file mode 100644 index 000000000..1f241b380 --- /dev/null +++ b/reference/quickgraph-algorithms-search-edgedepthfirstsearchalgorithm-2.html @@ -0,0 +1,300 @@ + + + + + EdgeDepthFirstSearchAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EdgeDepthFirstSearchAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.Search
    +

    +
    +

    A edge depth first search algorithm for directed graphs

    + +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(g) + +
    + Signature: g:IEdgeListAndIncidenceGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    + + + new(visitedGraph, colors) + +
    + Signature: (visitedGraph:IEdgeListAndIncidenceGraph<'TVertex,'TEdge> * colors:IDictionary<'TEdge,GraphColor>) -> unit
    +
    +     		+ +
    + + + new(host, visitedGraph, colors) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IEdgeListAndIncidenceGraph<'TVertex,'TEdge> * colors:IDictionary<'TEdge,GraphColor>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BackEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + DiscoverTreeEdge + +
    + Signature: EdgeEdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeColors + +
    + Signature: IDictionary<'TEdge,GraphColor>
    + Modifiers: abstract
    +
    +     		+ +
    + + + ExamineEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + FinishEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + ForwardOrCrossEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + InitializeEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + MaxDepth() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + StartEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + StartVertex + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+ +
    + + + TreeEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + Visit(se, depth) + +
    + Signature: (se:'TEdge * depth:int) -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-search-implicitdepthfirstsearchalgorithm-2.html b/reference/quickgraph-algorithms-search-implicitdepthfirstsearchalgorithm-2.html new file mode 100644 index 000000000..0333947e7 --- /dev/null +++ b/reference/quickgraph-algorithms-search-implicitdepthfirstsearchalgorithm-2.html @@ -0,0 +1,268 @@ + + + + + ImplicitDepthFirstSearchAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ImplicitDepthFirstSearchAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.Search
    +

    +
    +

    A depth first search algorithm for implicit directed graphs

    + +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:IIncidenceGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    + + + new(host, visitedGraph) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IIncidenceGraph<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BackEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+

    Invoked on the back edges in the graph.

    + + +
    + + + DiscoverVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+

    Invoked when a vertex is encountered for the first time.

    + + +
    + + + ExamineEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+

    Invoked on every out-edge of each vertex after it is discovered.

    + + +
    + + + FinishVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+

    Invoked on a vertex after all of its out edges have been added to +the search tree and all of the adjacent vertices have been +discovered (but before their out-edges have been examined).

    + + +
    + + + ForwardOrCrossEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+

    Invoked on forward or cross edges in the graph. +(In an undirected graph this method is never called.)

    + + +
    + + + MaxDepth() + +
    + Signature: unit -> unit
    +
    +     		+

    Gets or sets the maximum exploration depth, from +the start vertex.

    + + +
    + + + StartVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+

    Invoked on the source vertex once before the start of the search.

    + + +
    + + + TreeEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+

    Invoked on each edge as it becomes a member of the edges that form +the search tree. If you wish to record predecessors, do so at this +event point.

    + + +
    + + + VertexColors + +
    + Signature: IDictionary<'TVertex,GraphColor>
    +
    +     		+

    Gets the vertex color map

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-search-implicitedgedepthfirstsearchalgorithm-2.html b/reference/quickgraph-algorithms-search-implicitedgedepthfirstsearchalgorithm-2.html new file mode 100644 index 000000000..257ae6d83 --- /dev/null +++ b/reference/quickgraph-algorithms-search-implicitedgedepthfirstsearchalgorithm-2.html @@ -0,0 +1,264 @@ + + + + + ImplicitEdgeDepthFirstSearchAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ImplicitEdgeDepthFirstSearchAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.Search
    +

    +
    +

    A edge depth first search algorithm for implicit directed graphs

    + +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:IIncidenceGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    + + + new(host, visitedGraph) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IIncidenceGraph<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BackEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+

    Invoked on the back edges in the graph.

    + + +
    + + + DiscoverTreeEdge + +
    + Signature: EdgeEdgeAction<'TVertex,'TEdge>
    +
    +     		+ + +
    + + + EdgeColors + +
    + Signature: IDictionary<'TEdge,GraphColor>
    +
    +     		+

    Gets the vertex color map

    + + +
    + + + FinishEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+

    Invoked on a edge after all of its out edges have been added to +the search tree and all of the adjacent vertices have been +discovered (but before their out-edges have been examined).

    + + +
    + + + ForwardOrCrossEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+

    Invoked on forward or cross edges in the graph. +(In an undirected graph this method is never called.)

    + + +
    + + + MaxDepth() + +
    + Signature: unit -> unit
    +
    +     		+

    Gets or sets the maximum exploration depth, from +the start vertex.

    + + +
    + + + StartEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+

    Invoked on the first edge of a test case

    + + +
    + + + StartVertex + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+

    Invoked on the source vertex once before the start of the search.

    + + +
    + + + TreeEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+

    Invoked on each edge as it becomes a member of the edges that form +the search tree. If you wish to record predecessors, do so at this +event point.

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-search-undirectedbreadthfirstsearchalgorithm-2.html b/reference/quickgraph-algorithms-search-undirectedbreadthfirstsearchalgorithm-2.html new file mode 100644 index 000000000..2c9b6ecf1 --- /dev/null +++ b/reference/quickgraph-algorithms-search-undirectedbreadthfirstsearchalgorithm-2.html @@ -0,0 +1,316 @@ + + + + + UndirectedBreadthFirstSearchAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    UndirectedBreadthFirstSearchAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.Search
    +

    +
    +

    A breath first search algorithm for undirected graphs

    + +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(g) + +
    + Signature: g:IUndirectedGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    + + + new(...) + +
    + Signature: (visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * vertexQueue:IQueue<'TVertex> * vertexColors:IDictionary<'TVertex,GraphColor>) -> unit
    +
    +     		+ +
    + + + new(...) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * vertexQueue:IQueue<'TVertex> * vertexColors:IDictionary<'TVertex,GraphColor>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BlackTarget + +
    + Signature: IEvent<UndirectedEdgeAction<'TVertex,'TEdge>,UndirectedEdgeEventArgs<'TVertex,'TEdge>>
    +
    +     		+ +
    + + + DiscoverVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + ExamineEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + ExamineVertex + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+ +
    + + + FinishVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + GetVertexColor(vertex) + +
    + Signature: vertex:'TVertex -> GraphColor
    + Modifiers: abstract
    +
    +     		+ +
    + + + GrayTarget + +
    + Signature: IEvent<UndirectedEdgeAction<'TVertex,'TEdge>,UndirectedEdgeEventArgs<'TVertex,'TEdge>>
    +
    +     		+ +
    + + + InitializeVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + NonTreeEdge + +
    + Signature: IEvent<UndirectedEdgeAction<'TVertex,'TEdge>,UndirectedEdgeEventArgs<'TVertex,'TEdge>>
    +
    +     		+ +
    + + + StartVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + TreeEdge + +
    + Signature: IEvent<UndirectedEdgeAction<'TVertex,'TEdge>,UndirectedEdgeEventArgs<'TVertex,'TEdge>>
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexColors + +
    + Signature: IDictionary<'TVertex,GraphColor>
    +
    +     		+ +
    + + + Visit(s) + +
    + Signature: s:'TVertex -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-search-undirecteddepthfirstsearchalgorithm-2.html b/reference/quickgraph-algorithms-search-undirecteddepthfirstsearchalgorithm-2.html new file mode 100644 index 000000000..08c5b60c6 --- /dev/null +++ b/reference/quickgraph-algorithms-search-undirecteddepthfirstsearchalgorithm-2.html @@ -0,0 +1,352 @@ + + + + + UndirectedDepthFirstSearchAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    UndirectedDepthFirstSearchAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.Search
    +

    +
    +

    A depth first search algorithm for directed graph

    + +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:IUndirectedGraph<'TVertex,'TEdge> -> unit
    +
    +     		+

    Initializes a new instance of the algorithm.

    + + +
    + + + new(visitedGraph, colors) + +
    + Signature: (visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * colors:IDictionary<'TVertex,GraphColor>) -> unit
    +
    +     		+

    Initializes a new instance of the algorithm.

    + + +
    + + + new(host, visitedGraph, colors) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * colors:IDictionary<'TVertex,GraphColor>) -> unit
    +
    +     		+

    Initializes a new instance of the algorithm.

    + + +
    + + + new(...) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * colors:IDictionary<'TVertex,GraphColor> * adjacentEdgeEnumerator:Func<IEnumerable<'TEdge>,IEnumerable<'TEdge>>) -> unit
    +
    +     		+

    Initializes a new instance of the algorithm.

    + + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AdjacentEdgeEnumerator + +
    + Signature: Func<IEnumerable<'TEdge>,IEnumerable<'TEdge>>
    +
    +     		+ +
    + + + BackEdge + +
    + Signature: IEvent<UndirectedEdgeAction<'TVertex,'TEdge>,UndirectedEdgeEventArgs<'TVertex,'TEdge>>
    +
    +     		+ +
    + + + DiscoverVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + ExamineEdge + +
    + Signature: IEvent<UndirectedEdgeAction<'TVertex,'TEdge>,UndirectedEdgeEventArgs<'TVertex,'TEdge>>
    +
    +     		+ +
    + + + FinishVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + ForwardOrCrossEdge + +
    + Signature: IEvent<UndirectedEdgeAction<'TVertex,'TEdge>,UndirectedEdgeEventArgs<'TVertex,'TEdge>>
    +
    +     		+ +
    + + + GetVertexColor(vertex) + +
    + Signature: vertex:'TVertex -> GraphColor
    + Modifiers: abstract
    +
    +     		+ +
    + + + InitializeVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + MaxDepth() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + StartVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + TreeEdge + +
    + Signature: IEvent<UndirectedEdgeAction<'TVertex,'TEdge>,UndirectedEdgeEventArgs<'TVertex,'TEdge>>
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexColors + +
    + Signature: IDictionary<'TVertex,GraphColor>
    +
    +     		+ +
    + + + VertexMaxDepthReached + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+ +
    + + + Visit(root) + +
    + Signature: root:'TVertex -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-services-ialgorithmcomponent.html b/reference/quickgraph-algorithms-services-ialgorithmcomponent.html new file mode 100644 index 000000000..2aa78e8d9 --- /dev/null +++ b/reference/quickgraph-algorithms-services-ialgorithmcomponent.html @@ -0,0 +1,121 @@ + + + + + IAlgorithmComponent - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IAlgorithmComponent

    +

    + Namespace: QuickGraph.Algorithms.Services
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + GetService() + +
    + Signature: unit -> 'T
    + Modifiers: abstract
    + Type parameters: 'T
    +     		+ +
    + + + Services + +
    + Signature: IAlgorithmServices
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetService(service) + +
    + Signature: service:byref<'T> -> bool
    + Modifiers: abstract
    + Type parameters: 'T
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-services-ialgorithmservices.html b/reference/quickgraph-algorithms-services-ialgorithmservices.html new file mode 100644 index 000000000..cc4505ee6 --- /dev/null +++ b/reference/quickgraph-algorithms-services-ialgorithmservices.html @@ -0,0 +1,93 @@ + + + + + IAlgorithmServices - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IAlgorithmServices

    +

    + Namespace: QuickGraph.Algorithms.Services
    +

    +
    +

    Common services available to algorithm instances

    + +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + CancelManager + +
    + Signature: ICancelManager
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-services-icancelmanager.html b/reference/quickgraph-algorithms-services-icancelmanager.html new file mode 100644 index 000000000..a11ae35a3 --- /dev/null +++ b/reference/quickgraph-algorithms-services-icancelmanager.html @@ -0,0 +1,161 @@ + + + + + ICancelManager - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ICancelManager

    +

    + Namespace: QuickGraph.Algorithms.Services
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Cancel() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+

    Requests the component to cancel its computation

    + + +
    + + + CancelRequested + +
    + Signature: IEvent<EventHandler,EventArgs>
    + Modifiers: abstract
    +
    +     		+

    Raised when the cancel method is called

    + + +
    + + + CancelReseted + +
    + Signature: IEvent<EventHandler,EventArgs>
    + Modifiers: abstract
    +
    +     		+

    Raised when the cancel state has been reseted

    + + +
    + + + IsCancelling + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+

    Gets a value indicating if a cancellation request is pending.

    + + +
    + + + ResetCancel() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+

    Resets the cancel state

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-services-iservice.html b/reference/quickgraph-algorithms-services-iservice.html new file mode 100644 index 000000000..12401dcf5 --- /dev/null +++ b/reference/quickgraph-algorithms-services-iservice.html @@ -0,0 +1,70 @@ + + + + + IService - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IService

    +

    + Namespace: QuickGraph.Algorithms.Services
    +

    +
    +

    Interface implemented by graph services

    + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-shortestpath-astarshortestpathalgorithm-2.html b/reference/quickgraph-algorithms-shortestpath-astarshortestpathalgorithm-2.html new file mode 100644 index 000000000..ac5ecd4b5 --- /dev/null +++ b/reference/quickgraph-algorithms-shortestpath-astarshortestpathalgorithm-2.html @@ -0,0 +1,259 @@ + + + + + AStarShortestPathAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    AStarShortestPathAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.ShortestPath
    +

    +
    +

    A* single-source shortest path algorithm for directed graph +with positive distance.

    + +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(...) + +
    + Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * costHeuristic:Func<'TVertex,float>) -> unit
    +
    +     		+ +
    + + + new(...) + +
    + Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * costHeuristic:Func<'TVertex,float> * distanceRelaxer:IDistanceRelaxer) -> unit
    +
    +     		+ +
    + + + new(...) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IVertexListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * costHeuristic:Func<'TVertex,float> * distanceRelaxer:IDistanceRelaxer) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ComputeNoInit(s) + +
    + Signature: s:'TVertex -> unit
    +
    +     		+ +
    + + + CostHeuristic + +
    + Signature: Func<'TVertex,float>
    +
    +     		+ +
    + + + DiscoverVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeNotRelaxed + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + ExamineEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + ExamineVertex + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+ +
    + + + FinishVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + InitializeVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + StartVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-shortestpath-bellmanfordshortestpathalgorithm-2.html b/reference/quickgraph-algorithms-shortestpath-bellmanfordshortestpathalgorithm-2.html new file mode 100644 index 000000000..c8c7a8611 --- /dev/null +++ b/reference/quickgraph-algorithms-shortestpath-bellmanfordshortestpathalgorithm-2.html @@ -0,0 +1,245 @@ + + + + + BellmanFordShortestPathAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    BellmanFordShortestPathAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.ShortestPath
    +

    +
    +

    Bellman Ford shortest path algorithm.

    + +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph, weights) + +
    + Signature: (visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float>) -> unit
    +
    +     		+ +
    + + + new(...) + +
    + Signature: (visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
    +
    +     		+ +
    + + + new(...) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + EdgeMinimized + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+

    Invoked during the second stage of the algorithm, +during the test of whether each edge was minimized.

    +

    If the edge is minimized then this function is invoked.

    + + +
    + + + EdgeNotMinimized + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+

    Invoked during the second stage of the algorithm, +during the test of whether each edge was minimized.

    +

    If the edge was not minimized, this function is invoked. +This happens when there is a negative cycle in the graph.

    + + +
    + + + EdgeNotRelaxed + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+

    Invoked if the distance label for the target vertex is not +decreased.

    + + +
    + + + ExamineEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+

    Invoked on every edge in the graph |V| times.

    + + +
    + + + FoundNegativeCycle + +
    + Signature: bool
    +
    +     		+ +
    + + + InitializeVertex + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+

    Invoked on each vertex in the graph before the start of the +algorithm.

    + + +
    + + + Predecessors + +
    + Signature: IDictionary<'TVertex,'TVertex>
    +
    +     		+

    Constructed predecessor map

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-shortestpath-dagshortestpathalgorithm-2.html b/reference/quickgraph-algorithms-shortestpath-dagshortestpathalgorithm-2.html new file mode 100644 index 000000000..85c902051 --- /dev/null +++ b/reference/quickgraph-algorithms-shortestpath-dagshortestpathalgorithm-2.html @@ -0,0 +1,245 @@ + + + + + DagShortestPathAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DagShortestPathAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.ShortestPath
    +

    +
    +

    A single-source shortest path algorithm for directed acyclic +graph.

    + +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(g, weights) + +
    + Signature: (g:IVertexListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float>) -> unit
    +
    +     		+ +
    + + + new(g, weights, distanceRelaxer) + +
    + Signature: (g:IVertexListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
    +
    +     		+ +
    + + + new(host, g, weights, distanceRelaxer) + +
    + Signature: (host:IAlgorithmComponent * g:IVertexListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ComputeNoInit(s) + +
    + Signature: s:'TVertex -> unit
    +
    +     		+ +
    + + + DiscoverVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeNotRelaxed + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + ExamineEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + ExamineVertex + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+ +
    + + + FinishVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + InitializeVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + StartVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-shortestpath-dijkstrashortestpathalgorithm-2.html b/reference/quickgraph-algorithms-shortestpath-dijkstrashortestpathalgorithm-2.html new file mode 100644 index 000000000..bdcb3d01d --- /dev/null +++ b/reference/quickgraph-algorithms-shortestpath-dijkstrashortestpathalgorithm-2.html @@ -0,0 +1,245 @@ + + + + + DijkstraShortestPathAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DijkstraShortestPathAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.ShortestPath
    +

    +
    +

    Dijkstra single-source shortest path algorithm for directed graph +with positive distance.

    + +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph, weights) + +
    + Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float>) -> unit
    +
    +     		+ +
    + + + new(...) + +
    + Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
    +
    +     		+ +
    + + + new(...) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IVertexListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ComputeNoInit(s) + +
    + Signature: s:'TVertex -> unit
    +
    +     		+ +
    + + + DiscoverVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeNotRelaxed + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + ExamineEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + ExamineVertex + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+ +
    + + + FinishVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + InitializeVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + StartVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-shortestpath-floydwarshallallshortestpathalgorithm-2.html b/reference/quickgraph-algorithms-shortestpath-floydwarshallallshortestpathalgorithm-2.html new file mode 100644 index 000000000..7ccf4aee7 --- /dev/null +++ b/reference/quickgraph-algorithms-shortestpath-floydwarshallallshortestpathalgorithm-2.html @@ -0,0 +1,170 @@ + + + + + FloydWarshallAllShortestPathAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FloydWarshallAllShortestPathAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.ShortestPath
    +

    +
    +

    Floyd-Warshall all shortest path algorith,

    + +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(...) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
    +
    +     		+ +
    + + + new(...) + +
    + Signature: (visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
    +
    +     		+ +
    + + + new(visitedGraph, weights) + +
    + Signature: (visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Dump(writer) + +
    + Signature: writer:TextWriter -> unit
    +
    +     		+ +
    + + + TryGetDistance(source, target, cost) + +
    + Signature: (source:'TVertex * target:'TVertex * cost:byref<float>) -> bool
    +
    +     		+ +
    + + + TryGetPath(source, target, path) + +
    + Signature: (source:'TVertex * target:'TVertex * path:byref<IEnumerable<'TEdge>>) -> bool
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-shortestpath-shortestpathalgorithmbase-3.html b/reference/quickgraph-algorithms-shortestpath-shortestpathalgorithmbase-3.html new file mode 100644 index 000000000..9d66f5d44 --- /dev/null +++ b/reference/quickgraph-algorithms-shortestpath-shortestpathalgorithmbase-3.html @@ -0,0 +1,216 @@ + + + + + ShortestPathAlgorithmBase<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ShortestPathAlgorithmBase<'TVertex, 'TEdge, 'TGraph>

    +

    + Namespace: QuickGraph.Algorithms.ShortestPath
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(host, visitedGraph, weights) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:'TGraph * weights:Func<'TEdge,float>) -> unit
    +
    +     		+ +
    + + + new(...) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:'TGraph * weights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + DistanceRelaxer + +
    + Signature: IDistanceRelaxer
    +
    +     		+ +
    + + + Distances + +
    + Signature: Dictionary<'TVertex,float>
    +
    +     		+ +
    + + + GetVertexColor(vertex) + +
    + Signature: vertex:'TVertex -> GraphColor
    + Modifiers: abstract
    +
    +     		+ +
    + + + TreeEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+

    Invoked when the distance label for the target vertex is decreased. +The edge that participated in the last relaxation for vertex v is +an edge in the shortest paths tree.

    + + +
    + + + TryGetDistance(vertex, distance) + +
    + Signature: (vertex:'TVertex * distance:byref<float>) -> bool
    +
    +     		+ +
    + + + VertexColors + +
    + Signature: Dictionary<'TVertex,GraphColor>
    +
    +     		+ +
    + + + Weights + +
    + Signature: Func<'TEdge,float>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-shortestpath-undirecteddijkstrashortestpathalgorithm-2.html b/reference/quickgraph-algorithms-shortestpath-undirecteddijkstrashortestpathalgorithm-2.html new file mode 100644 index 000000000..74c0c75cf --- /dev/null +++ b/reference/quickgraph-algorithms-shortestpath-undirecteddijkstrashortestpathalgorithm-2.html @@ -0,0 +1,245 @@ + + + + + UndirectedDijkstraShortestPathAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    UndirectedDijkstraShortestPathAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.ShortestPath
    +

    +
    +

    A single-source shortest path algorithm for undirected graph +with positive distance.

    + +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph, weights) + +
    + Signature: (visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float>) -> unit
    +
    +     		+ +
    + + + new(...) + +
    + Signature: (visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
    +
    +     		+ +
    + + + new(...) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ComputeNoInit(s) + +
    + Signature: s:'TVertex -> unit
    +
    +     		+ +
    + + + DiscoverVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeNotRelaxed + +
    + Signature: IEvent<UndirectedEdgeAction<'TVertex,'TEdge>,UndirectedEdgeEventArgs<'TVertex,'TEdge>>
    +
    +     		+ +
    + + + ExamineEdge + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    +
    +     		+ +
    + + + ExamineVertex + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+ +
    + + + FinishVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + InitializeVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + StartVertex + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-shortestpath-undirectedshortestpathalgorithmbase-2.html b/reference/quickgraph-algorithms-shortestpath-undirectedshortestpathalgorithmbase-2.html new file mode 100644 index 000000000..a22a83bc0 --- /dev/null +++ b/reference/quickgraph-algorithms-shortestpath-undirectedshortestpathalgorithmbase-2.html @@ -0,0 +1,216 @@ + + + + + UndirectedShortestPathAlgorithmBase<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    UndirectedShortestPathAlgorithmBase<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.ShortestPath
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(host, visitedGraph, weights) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float>) -> unit
    +
    +     		+ +
    + + + new(...) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + DistanceRelaxer + +
    + Signature: IDistanceRelaxer
    +
    +     		+ +
    + + + Distances + +
    + Signature: Dictionary<'TVertex,float>
    +
    +     		+ +
    + + + GetVertexColor(vertex) + +
    + Signature: vertex:'TVertex -> GraphColor
    + Modifiers: abstract
    +
    +     		+ +
    + + + TreeEdge + +
    + Signature: IEvent<UndirectedEdgeAction<'TVertex,'TEdge>,UndirectedEdgeEventArgs<'TVertex,'TEdge>>
    + Modifiers: abstract
    +
    +     		+

    Invoked when the distance label for the target vertex is decreased. +The edge that participated in the last relaxation for vertex v is +an edge in the shortest paths tree.

    + + +
    + + + TryGetDistance(vertex, distance) + +
    + Signature: (vertex:'TVertex * distance:byref<float>) -> bool
    +
    +     		+ +
    + + + VertexColors + +
    + Signature: Dictionary<'TVertex,GraphColor>
    +
    +     		+ +
    + + + Weights + +
    + Signature: Func<'TEdge,float>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-shortestpath-yen-yenshortestpathsalgorithm-1.html b/reference/quickgraph-algorithms-shortestpath-yen-yenshortestpathsalgorithm-1.html new file mode 100644 index 000000000..bf961ee16 --- /dev/null +++ b/reference/quickgraph-algorithms-shortestpath-yen-yenshortestpathsalgorithm-1.html @@ -0,0 +1,112 @@ + + + + + YenShortestPathsAlgorithm<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    YenShortestPathsAlgorithm<'TVertex>

    +

    + Namespace: QuickGraph.Algorithms.ShortestPath.Yen
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(graph, s, t, k) + +
    + Signature: (graph:AdjacencyGraph<'TVertex,TaggedEquatableEdge<'TVertex,float>> * s:'TVertex * t:'TVertex * k:int) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Execute() + +
    + Signature: unit -> IEnumerable<IEnumerable<TaggedEquatableEdge<'TVertex,float>>>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-tarjanofflineleastcommonancestoralgorithm-2.html b/reference/quickgraph-algorithms-tarjanofflineleastcommonancestoralgorithm-2.html new file mode 100644 index 000000000..794f9f930 --- /dev/null +++ b/reference/quickgraph-algorithms-tarjanofflineleastcommonancestoralgorithm-2.html @@ -0,0 +1,170 @@ + + + + + TarjanOfflineLeastCommonAncestorAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    TarjanOfflineLeastCommonAncestorAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms
    +

    +
    +

    Offline least common ancestor in a rooted tre

    + +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:IVertexListGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    + + + new(host, visitedGraph) + +
    + Signature: (host:IAlgorithmComponent * visitedGraph:IVertexListGraph<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Ancestors + +
    + Signature: IDictionary<SEquatableEdge<'TVertex>,'TVertex>
    +
    +     		+ +
    + + + Compute(root, pairs) + +
    + Signature: (root:'TVertex * pairs:IEnumerable<SEquatableEdge<'TVertex>>) -> unit
    +
    +     		+ +
    + + + SetVertexPairs(pairs) + +
    + Signature: pairs:IEnumerable<SEquatableEdge<'TVertex>> -> unit
    +
    +     		+ +
    + + + TryGetVertexPairs(pairs) + +
    + Signature: pairs:byref<IEnumerable<SEquatableEdge<'TVertex>>> -> bool
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-topologicalsort-sourcefirstbidirectionaltopologicalsortalgorithm-2.html b/reference/quickgraph-algorithms-topologicalsort-sourcefirstbidirectionaltopologicalsortalgorithm-2.html new file mode 100644 index 000000000..4e3ac6f4d --- /dev/null +++ b/reference/quickgraph-algorithms-topologicalsort-sourcefirstbidirectionaltopologicalsortalgorithm-2.html @@ -0,0 +1,182 @@ + + + + + SourceFirstBidirectionalTopologicalSortAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    SourceFirstBidirectionalTopologicalSortAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.TopologicalSort
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    + + + new(visitedGraph, direction) + +
    + Signature: (visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> * direction:TopologicalSortDirection) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AddVertex + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+ +
    + + + Compute(vertices) + +
    + Signature: vertices:IList<'TVertex> -> unit
    +
    +     		+ +
    + + + Heap + +
    + Signature: BinaryQueue<'TVertex,int>
    +
    +     		+ +
    + + + InDegrees + +
    + Signature: IDictionary<'TVertex,int>
    +
    +     		+ +
    + + + SortedVertices + +
    + Signature: ICollection<'TVertex>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-topologicalsort-sourcefirsttopologicalsortalgorithm-2.html b/reference/quickgraph-algorithms-topologicalsort-sourcefirsttopologicalsortalgorithm-2.html new file mode 100644 index 000000000..0634f1e57 --- /dev/null +++ b/reference/quickgraph-algorithms-topologicalsort-sourcefirsttopologicalsortalgorithm-2.html @@ -0,0 +1,168 @@ + + + + + SourceFirstTopologicalSortAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    SourceFirstTopologicalSortAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.TopologicalSort
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AddVertex + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+ +
    + + + Compute(vertices) + +
    + Signature: vertices:IList<'TVertex> -> unit
    +
    +     		+ +
    + + + Heap + +
    + Signature: BinaryQueue<'TVertex,int>
    +
    +     		+ +
    + + + InDegrees + +
    + Signature: IDictionary<'TVertex,int>
    +
    +     		+ +
    + + + SortedVertices + +
    + Signature: ICollection<'TVertex>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-topologicalsort-topologicalsortalgorithm-2.html b/reference/quickgraph-algorithms-topologicalsort-topologicalsortalgorithm-2.html new file mode 100644 index 000000000..6aeaa7d38 --- /dev/null +++ b/reference/quickgraph-algorithms-topologicalsort-topologicalsortalgorithm-2.html @@ -0,0 +1,154 @@ + + + + + TopologicalSortAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    TopologicalSortAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.TopologicalSort
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(g) + +
    + Signature: g:IVertexListGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    + + + new(g, vertices) + +
    + Signature: (g:IVertexListGraph<'TVertex,'TEdge> * vertices:IList<'TVertex>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AllowCyclicGraph + +
    + Signature: bool
    +
    +     		+ +
    + + + Compute(vertices) + +
    + Signature: vertices:IList<'TVertex> -> unit
    +
    +     		+ +
    + + + SortedVertices + +
    + Signature: IList<'TVertex>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-topologicalsort-topologicalsortdirection.html b/reference/quickgraph-algorithms-topologicalsort-topologicalsortdirection.html new file mode 100644 index 000000000..2a0573f89 --- /dev/null +++ b/reference/quickgraph-algorithms-topologicalsort-topologicalsortdirection.html @@ -0,0 +1,68 @@ + + + + + TopologicalSortDirection - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    TopologicalSortDirection

    +

    + Namespace: QuickGraph.Algorithms.TopologicalSort
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-topologicalsort-undirectedfirsttopologicalsortalgorithm-2.html b/reference/quickgraph-algorithms-topologicalsort-undirectedfirsttopologicalsortalgorithm-2.html new file mode 100644 index 000000000..c7081c2a5 --- /dev/null +++ b/reference/quickgraph-algorithms-topologicalsort-undirectedfirsttopologicalsortalgorithm-2.html @@ -0,0 +1,182 @@ + + + + + UndirectedFirstTopologicalSortAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    UndirectedFirstTopologicalSortAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.TopologicalSort
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:IUndirectedGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AddVertex + +
    + Signature: VertexAction<'TVertex>
    +
    +     		+ +
    + + + AllowCyclicGraph() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Compute(vertices) + +
    + Signature: vertices:IList<'TVertex> -> unit
    +
    +     		+ +
    + + + Degrees + +
    + Signature: IDictionary<'TVertex,int>
    +
    +     		+ +
    + + + Heap + +
    + Signature: BinaryQueue<'TVertex,int>
    +
    +     		+ +
    + + + SortedVertices + +
    + Signature: ICollection<'TVertex>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-topologicalsort-undirectedtopologicalsortalgorithm-2.html b/reference/quickgraph-algorithms-topologicalsort-undirectedtopologicalsortalgorithm-2.html new file mode 100644 index 000000000..b1fa131ed --- /dev/null +++ b/reference/quickgraph-algorithms-topologicalsort-undirectedtopologicalsortalgorithm-2.html @@ -0,0 +1,154 @@ + + + + + UndirectedTopologicalSortAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    UndirectedTopologicalSortAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Algorithms.TopologicalSort
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(g) + +
    + Signature: g:IUndirectedGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    + + + new(g, vertices) + +
    + Signature: (g:IUndirectedGraph<'TVertex,'TEdge> * vertices:IList<'TVertex>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AllowCyclicGraph() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Compute(vertices) + +
    + Signature: vertices:IList<'TVertex> -> unit
    +
    +     		+ +
    + + + SortedVertices + +
    + Signature: IList<'TVertex>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-tsp-taskpriority.html b/reference/quickgraph-algorithms-tsp-taskpriority.html new file mode 100644 index 000000000..a2db9711d --- /dev/null +++ b/reference/quickgraph-algorithms-tsp-taskpriority.html @@ -0,0 +1,113 @@ + + + + + TaskPriority - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    TaskPriority

    +

    + Namespace: QuickGraph.Algorithms.TSP
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(cost, pathSize) + +
    + Signature: (cost:float * pathSize:int) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + CompareTo(other) + +
    + Signature: other:TaskPriority -> int
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-tsp-tsp-3.html b/reference/quickgraph-algorithms-tsp-tsp-3.html new file mode 100644 index 000000000..3a8599cdc --- /dev/null +++ b/reference/quickgraph-algorithms-tsp-tsp-3.html @@ -0,0 +1,90 @@ + + + + + TSP<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    TSP<'TVertex, 'TEdge, 'TGraph>

    +

    + Namespace: QuickGraph.Algorithms.TSP
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph, weights) + +
    + Signature: (visitedGraph:'TGraph * weights:Func<'TEdge,float>) -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-arrayadjacencygraph-2.html b/reference/quickgraph-arrayadjacencygraph-2.html new file mode 100644 index 000000000..1e54b079f --- /dev/null +++ b/reference/quickgraph-arrayadjacencygraph-2.html @@ -0,0 +1,387 @@ + + + + + ArrayAdjacencyGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ArrayAdjacencyGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    An immutable directed graph data structure efficient for large sparse +graph representation where out-edge need to be enumerated only.

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AllowParallelEdges + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Clone() + +
    + Signature: unit -> ArrayAdjacencyGraph<'TVertex,'TEdge>
    +
    +     		+

    Returns self since this class is immutable

    + + +
    + + + ContainsEdge(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsVertex(vertex) + +
    + Signature: vertex:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Edges + +
    + Signature: IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsDirected + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsEdgesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsOutEdgesEmpty(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsVerticesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutDegree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutEdge(v, index) + +
    + Signature: (v:'TVertex * index:int) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutEdges(v) + +
    + Signature: v:'TVertex -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetEdge(source, target, edge) + +
    + Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetEdges(source, target, edges) + +
    + Signature: (source:'TVertex * target:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetOutEdges(v, edges) + +
    + Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Vertices + +
    + Signature: IEnumerable<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-arraybidirectionalgraph-2.html b/reference/quickgraph-arraybidirectionalgraph-2.html new file mode 100644 index 000000000..e0d1fdbe9 --- /dev/null +++ b/reference/quickgraph-arraybidirectionalgraph-2.html @@ -0,0 +1,480 @@ + + + + + ArrayBidirectionalGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ArrayBidirectionalGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    An immutable directed graph data structure efficient for large sparse +graph representation where out-edge need to be enumerated only.

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> -> unit
    +
    +     		+

    Constructs a new ArrayBidirectionalGraph instance from a +IBidirectionalGraph instance

    + + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AllowParallelEdges + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Clone() + +
    + Signature: unit -> ArrayBidirectionalGraph<'TVertex,'TEdge>
    +
    +     		+

    Returns self since this class is immutable

    + + +
    + + + ContainsEdge(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsVertex(vertex) + +
    + Signature: vertex:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Degree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Edges + +
    + Signature: IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + InDegree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + InEdge(v, index) + +
    + Signature: (v:'TVertex * index:int) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + + + InEdges(v) + +
    + Signature: v:'TVertex -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsDirected + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsEdgesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsInEdgesEmpty(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsOutEdgesEmpty(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsVerticesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutDegree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutEdge(v, index) + +
    + Signature: (v:'TVertex * index:int) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutEdges(v) + +
    + Signature: v:'TVertex -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetEdge(source, target, edge) + +
    + Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetEdges(source, target, edges) + +
    + Signature: (source:'TVertex * target:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetInEdges(v, edges) + +
    + Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetOutEdges(v, edges) + +
    + Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Vertices + +
    + Signature: IEnumerable<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-arrayequalitycomparer-1.html b/reference/quickgraph-arrayequalitycomparer-1.html new file mode 100644 index 000000000..d1e989731 --- /dev/null +++ b/reference/quickgraph-arrayequalitycomparer-1.html @@ -0,0 +1,168 @@ + + + + + ArrayEqualityComparer<'T> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ArrayEqualityComparer<'T>

    +

    + Namespace: QuickGraph
    +

    +
    +

    Equality comparer for array of T using Equals1 method.

    + +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+

    Constructor using default element equality

    + + +
    + + + new(elementEqualityComparer) + +
    + Signature: elementEqualityComparer:IEqualityComparer<'T> -> unit
    +
    +     		+

    Constructor using a given element equality

    + + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ElementEqualityComparer() + +
    + Signature: unit -> unit
    +
    +     		+

    Element equality

    + + +
    + + + Equals(x, y) + +
    + Signature: (x:'T [] * y:'T []) -> bool
    + Modifiers: abstract
    +
    +     		+

    Implements IEqualityComparer.Equals

    + + +
    + + + GetHashCode(x) + +
    + Signature: (x:'T []) -> int
    + Modifiers: abstract
    +
    +     		+

    Implements IEqualityComparer.GetHashCode

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-arrayundirectedgraph-2.html b/reference/quickgraph-arrayundirectedgraph-2.html new file mode 100644 index 000000000..16454c819 --- /dev/null +++ b/reference/quickgraph-arrayundirectedgraph-2.html @@ -0,0 +1,371 @@ + + + + + ArrayUndirectedGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ArrayUndirectedGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    An immutable undirected graph data structure based on arrays.

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(graph) + +
    + Signature: graph:IUndirectedGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AdjacentDegree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + AdjacentEdge(v, index) + +
    + Signature: (v:'TVertex * index:int) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + + + AdjacentEdges(v) + +
    + Signature: v:'TVertex -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + AllowParallelEdges + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Clone() + +
    + Signature: unit -> ArrayUndirectedGraph<'TVertex,'TEdge>
    +
    +     		+

    Returns self

    + + +
    + + + ContainsEdge(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsVertex(vertex) + +
    + Signature: vertex:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeEqualityComparer + +
    + Signature: EdgeEqualityComparer<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + Edges + +
    + Signature: IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsAdjacentEdgesEmpty(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsDirected + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsEdgesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsVerticesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetEdge(source, target, edge) + +
    + Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Vertices + +
    + Signature: IEnumerable<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-bidirectionadaptergraph-2.html b/reference/quickgraph-bidirectionadaptergraph-2.html new file mode 100644 index 000000000..ec62399d5 --- /dev/null +++ b/reference/quickgraph-bidirectionadaptergraph-2.html @@ -0,0 +1,460 @@ + + + + + BidirectionAdapterGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    BidirectionAdapterGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    Wraps a vertex list graph (out-edges only) and caches the in-edge dictionary.

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(baseGraph) + +
    + Signature: baseGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AllowParallelEdges + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsEdge(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsVertex(vertex) + +
    + Signature: vertex:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Degree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Edges + +
    + Signature: IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + InDegree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + InEdge(v, index) + +
    + Signature: (v:'TVertex * index:int) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + + + InEdges(v) + +
    + Signature: v:'TVertex -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsDirected + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsEdgesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsInEdgesEmpty(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsOutEdgesEmpty(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsVerticesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutDegree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutEdge(v, index) + +
    + Signature: (v:'TVertex * index:int) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutEdges(v) + +
    + Signature: v:'TVertex -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetEdge(source, target, edge) + +
    + Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetEdges(source, target, edges) + +
    + Signature: (source:'TVertex * target:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetInEdges(v, edges) + +
    + Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetOutEdges(v, edges) + +
    + Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Vertices + +
    + Signature: IEnumerable<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-bidirectionalgraph-2.html b/reference/quickgraph-bidirectionalgraph-2.html new file mode 100644 index 000000000..c4740224c --- /dev/null +++ b/reference/quickgraph-bidirectionalgraph-2.html @@ -0,0 +1,927 @@ + + + + + BidirectionalGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    BidirectionalGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A mutable directed graph data structure efficient for sparse +graph representation where out-edge and in-edges need to be enumerated. Requires +twice as much memory as the adjacency graph.

    + +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + new(allowParallelEdges) + +
    + Signature: allowParallelEdges:bool -> unit
    +
    +     		+ +
    + + + new(allowParallelEdges, vertexCapacity) + +
    + Signature: (allowParallelEdges:bool * vertexCapacity:int) -> unit
    +
    +     		+ +
    + + + new(...) + +
    + Signature: (allowParallelEdges:bool * capacity:int * vertexEdgesDictionaryFactory:Func<int,IVertexEdgeDictionary<'TVertex,'TEdge>>) -> unit
    +
    +     		+ +
    + + + new(other) + +
    + Signature: other:BidirectionalGraph<'TVertex,'TEdge> -> unit
    +
    +     		+

    Copy constructor that creates sufficiently deep copy of the graph.

    + + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AddEdge(e) + +
    + Signature: e:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddEdgeRange(edges) + +
    + Signature: edges:IEnumerable<'TEdge> -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddVertex(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddVertexRange(vertices) + +
    + Signature: vertices:IEnumerable<'TVertex> -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddVerticesAndEdge(e) + +
    + Signature: e:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddVerticesAndEdgeRange(edges) + +
    + Signature: edges:IEnumerable<'TEdge> -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + AllowParallelEdges + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Clear() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + ClearEdges(v) + +
    + Signature: v:'TVertex -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + ClearInEdges(v) + +
    + Signature: v:'TVertex -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + ClearOutEdges(v) + +
    + Signature: v:'TVertex -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + Clone() + +
    + Signature: unit -> BidirectionalGraph<'TVertex,'TEdge>
    +
    +     		+ +
    + + + ContainsEdge(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsVertex(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Degree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeAdded + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeCapacity() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + EdgeCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeRemoved + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + Edges + +
    + Signature: IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + InDegree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + InEdge(v, index) + +
    + Signature: (v:'TVertex * index:int) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + + + InEdges(v) + +
    + Signature: v:'TVertex -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsDirected + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsEdgesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsInEdgesEmpty(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsOutEdgesEmpty(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsVerticesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + MergeVertex(v, edgeFactory) + +
    + Signature: (v:'TVertex * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    + + + MergeVertexIf(...) + +
    + Signature: (vertexPredicate:VertexPredicate<'TVertex> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    + + + OutDegree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutEdge(v, index) + +
    + Signature: (v:'TVertex * index:int) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutEdges(v) + +
    + Signature: v:'TVertex -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveEdge(e) + +
    + Signature: e:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveEdgeIf(predicate) + +
    + Signature: predicate:EdgePredicate<'TVertex,'TEdge> -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveInEdgeIf(v, predicate) + +
    + Signature: (v:'TVertex * predicate:EdgePredicate<'TVertex,'TEdge>) -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveOutEdgeIf(v, predicate) + +
    + Signature: (v:'TVertex * predicate:EdgePredicate<'TVertex,'TEdge>) -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveVertex(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveVertexIf(predicate) + +
    + Signature: predicate:VertexPredicate<'TVertex> -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + TrimEdgeExcess() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetEdge(source, target, edge) + +
    + Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetEdges(source, target, edges) + +
    + Signature: (source:'TVertex * target:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetInEdges(v, edges) + +
    + Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetOutEdges(v, edges) + +
    + Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexAdded + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexRemoved + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + Vertices + +
    + Signature: IEnumerable<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    +

    Static members

    + + + + + + + + + + + + + + +
    Static memberDescription
    + + + EdgeType + +
    + Signature: Type
    +
    +     		+ +
    + + + LoadDot(dotSource, vertexFunc, edgeFunc) + +
    + Signature: (dotSource:string * vertexFunc:Func<string,IDictionary<string,string>,'TVertex> * edgeFunc:Func<'TVertex,'TVertex,IDictionary<string,string>,'TEdge>) -> BidirectionalGraph<'TVertex,'TEdge>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-bidirectionalmatrixgraph-1.html b/reference/quickgraph-bidirectionalmatrixgraph-1.html new file mode 100644 index 000000000..d408b67b5 --- /dev/null +++ b/reference/quickgraph-bidirectionalmatrixgraph-1.html @@ -0,0 +1,647 @@ + + + + + BidirectionalMatrixGraph<'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    BidirectionalMatrixGraph<'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(vertexCount) + +
    + Signature: vertexCount:int -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AddEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddEdgeRange(edges) + +
    + Signature: edges:IEnumerable<'TEdge> -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + AllowParallelEdges + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Clear() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + ClearEdges(v) + +
    + Signature: v:int -> unit
    +
    +     		+ +
    + + + ClearInEdges(v) + +
    + Signature: v:int -> unit
    +
    +     		+ +
    + + + ClearOutEdges(v) + +
    + Signature: v:int -> unit
    +
    +     		+ +
    + + + Clone() + +
    + Signature: unit -> BidirectionalMatrixGraph<'TEdge>
    +
    +     		+ +
    + + + ContainsEdge(source, target) + +
    + Signature: (source:int * target:int) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsVertex(vertex) + +
    + Signature: vertex:int -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Degree(v) + +
    + Signature: v:int -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeAdded + +
    + Signature: EdgeAction<int,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeRemoved + +
    + Signature: EdgeAction<int,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + Edges + +
    + Signature: IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + InDegree(v) + +
    + Signature: v:int -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + InEdge(v, index) + +
    + Signature: (v:int * index:int) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + + + InEdges(v) + +
    + Signature: v:int -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsDirected + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsEdgesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsInEdgesEmpty(v) + +
    + Signature: v:int -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsOutEdgesEmpty(v) + +
    + Signature: v:int -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsVerticesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutDegree(v) + +
    + Signature: v:int -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutEdge(v, index) + +
    + Signature: (v:int * index:int) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutEdges(v) + +
    + Signature: v:int -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveEdgeIf(predicate) + +
    + Signature: predicate:EdgePredicate<int,'TEdge> -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveInEdgeIf(v, edgePredicate) + +
    + Signature: (v:int * edgePredicate:EdgePredicate<int,'TEdge>) -> int
    +
    +     		+ +
    + + + RemoveOutEdgeIf(v, predicate) + +
    + Signature: (v:int * predicate:EdgePredicate<int,'TEdge>) -> int
    +
    +     		+ +
    + + + TryGetEdge(source, target, edge) + +
    + Signature: (source:int * target:int * edge:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetEdges(source, target, edges) + +
    + Signature: (source:int * target:int * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetInEdges(v, edges) + +
    + Signature: (v:int * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetOutEdges(v, edges) + +
    + Signature: (v:int * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Vertices + +
    + Signature: IEnumerable<int>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-clusteredadjacencygraph-2.html b/reference/quickgraph-clusteredadjacencygraph-2.html new file mode 100644 index 000000000..003e4b899 --- /dev/null +++ b/reference/quickgraph-clusteredadjacencygraph-2.html @@ -0,0 +1,708 @@ + + + + + ClusteredAdjacencyGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ClusteredAdjacencyGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(wrapped) + +
    + Signature: wrapped:AdjacencyGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    + + + new(parent) + +
    + Signature: parent:ClusteredAdjacencyGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AddCluster() + +
    + Signature: unit -> ClusteredAdjacencyGraph<'TVertex,'TEdge>
    +
    +     		+ +
    + + + AddEdge(e) + +
    + Signature: e:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddEdgeRange(edges) + +
    + Signature: edges:IEnumerable<'TEdge> -> int
    +
    +     		+ +
    + + + AddVertex(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddVertexRange(vertices) + +
    + Signature: vertices:IEnumerable<'TVertex> -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddVerticesAndEdge(e) + +
    + Signature: e:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddVerticesAndEdgeRange(edges) + +
    + Signature: edges:IEnumerable<'TEdge> -> int
    +
    +     		+ +
    + + + AllowParallelEdges + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Clear() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + ClearOutEdges(v) + +
    + Signature: v:'TVertex -> unit
    +
    +     		+ +
    + + + Clusters + +
    + Signature: IEnumerable
    + Modifiers: abstract
    +
    +     		+ +
    + + + ClustersCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Colapsed() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsEdge(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsVertex(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeCapacity() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + EdgeCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Edges + +
    + Signature: IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsDirected + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsEdgesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsOutEdgesEmpty(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsVerticesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutDegree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutEdge(v, index) + +
    + Signature: (v:'TVertex * index:int) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutEdges(v) + +
    + Signature: v:'TVertex -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + Parent + +
    + Signature: ClusteredAdjacencyGraph<'TVertex,'TEdge>
    +
    +     		+ +
    + + + RemoveCluster(cluster) + +
    + Signature: cluster:IClusteredGraph -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveEdge(e) + +
    + Signature: e:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveEdgeIf(predicate) + +
    + Signature: predicate:EdgePredicate<'TVertex,'TEdge> -> int
    +
    +     		+ +
    + + + RemoveOutEdgeIf(v, predicate) + +
    + Signature: (v:'TVertex * predicate:EdgePredicate<'TVertex,'TEdge>) -> int
    +
    +     		+ +
    + + + RemoveVertex(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveVertexIf(predicate) + +
    + Signature: predicate:VertexPredicate<'TVertex> -> int
    +
    +     		+ +
    + + + TryGetEdge(source, target, edge) + +
    + Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetEdges(source, target, edges) + +
    + Signature: (source:'TVertex * target:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetOutEdges(v, edges) + +
    + Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Vertices + +
    + Signature: IEnumerable<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + Wrapped + +
    + Signature: AdjacencyGraph<'TVertex,'TEdge>
    +
    +     		+ +
    +

    Static members

    + + + + + + + + + + +
    Static memberDescription
    + + + EdgeType + +
    + Signature: Type
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-collections-binaryheap-2.html b/reference/quickgraph-collections-binaryheap-2.html new file mode 100644 index 000000000..1f22b2842 --- /dev/null +++ b/reference/quickgraph-collections-binaryheap-2.html @@ -0,0 +1,356 @@ + + + + + BinaryHeap<'TPriority, 'TValue> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    BinaryHeap<'TPriority, 'TValue>

    +

    + Namespace: QuickGraph.Collections
    +

    +
    +

    Binary heap

    + +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + new(priorityComparison) + +
    + Signature: priorityComparison:Comparison<'TPriority> -> unit
    +
    +     		+ +
    + + + new(capacity, priorityComparison) + +
    + Signature: (capacity:int * priorityComparison:Comparison<'TPriority>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Add(priority, value) + +
    + Signature: (priority:'TPriority * value:'TValue) -> unit
    +
    +     		+ +
    + + + Capacity + +
    + Signature: int
    +
    +     		+ +
    + + + Count + +
    + Signature: int
    +
    +     		+ +
    + + + GetEnumerator() + +
    + Signature: unit -> IEnumerator<KeyValuePair<'TPriority,'TValue>>
    + Modifiers: abstract
    +
    +     		+ +
    + + + IndexOf(value) + +
    + Signature: value:'TValue -> int
    +
    +     		+ +
    + + + IsConsistent() + +
    + Signature: unit -> bool
    +
    +     		+ +
    + + + Minimum() + +
    + Signature: unit -> KeyValuePair<'TPriority,'TValue>
    +
    +     		+ +
    + + + MinimumUpdate(priority, value) + +
    + Signature: (priority:'TPriority * value:'TValue) -> bool
    +
    +     		+ +
    + + + PriorityComparison + +
    + Signature: Comparison<'TPriority>
    +
    +     		+ +
    + + + RemoveAt(index) + +
    + Signature: index:int -> KeyValuePair<'TPriority,'TValue>
    +
    +     		+

    Removes element at a certain index.
    +TODO: RemoveAt is wrong.

    + + +
    + + + RemoveMinimum() + +
    + Signature: unit -> KeyValuePair<'TPriority,'TValue>
    +
    +     		+ +
    + + + ToPriorityValueArray() + +
    + Signature: unit -> KeyValuePair<'TPriority,'TValue> []
    +
    +     		+ +
    + + + ToString2() + +
    + Signature: unit -> string
    +
    +     		+ +
    + + + ToStringTree() + +
    + Signature: unit -> string
    +
    +     		+ +
    + + + ToValueArray() + +
    + Signature: unit -> 'TValue []
    +
    +     		+ +
    + + + Update(priority, value) + +
    + Signature: (priority:'TPriority * value:'TValue) -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-collections-binaryqueue-2.html b/reference/quickgraph-collections-binaryqueue-2.html new file mode 100644 index 000000000..0245c5c29 --- /dev/null +++ b/reference/quickgraph-collections-binaryqueue-2.html @@ -0,0 +1,245 @@ + + + + + BinaryQueue<'TVertex, 'TDistance> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    BinaryQueue<'TVertex, 'TDistance>

    +

    + Namespace: QuickGraph.Collections
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(distances) + +
    + Signature: distances:Func<'TVertex,'TDistance> -> unit
    +
    +     		+ +
    + + + new(distances, distanceComparison) + +
    + Signature: (distances:Func<'TVertex,'TDistance> * distanceComparison:Comparison<'TDistance>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Contains(value) + +
    + Signature: value:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Count + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Dequeue() + +
    + Signature: unit -> 'TVertex
    + Modifiers: abstract
    +
    +     		+ +
    + + + Enqueue(value) + +
    + Signature: value:'TVertex -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + Peek() + +
    + Signature: unit -> 'TVertex
    + Modifiers: abstract
    +
    +     		+ +
    + + + ToArray() + +
    + Signature: unit -> 'TVertex []
    + Modifiers: abstract
    +
    +     		+ +
    + + + ToArray2() + +
    + Signature: unit -> KeyValuePair<'TDistance,'TVertex> []
    +
    +     		+ +
    + + + ToString2() + +
    + Signature: unit -> string
    +
    +     		+ +
    + + + Update(v) + +
    + Signature: v:'TVertex -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-collections-edgeedgedictionary-2.html b/reference/quickgraph-collections-edgeedgedictionary-2.html new file mode 100644 index 000000000..3e103c07e --- /dev/null +++ b/reference/quickgraph-collections-edgeedgedictionary-2.html @@ -0,0 +1,140 @@ + + + + + EdgeEdgeDictionary<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EdgeEdgeDictionary<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Collections
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + new(capacity) + +
    + Signature: capacity:int -> unit
    +
    +     		+ +
    + + + new(info, context) + +
    + Signature: (info:SerializationInfo * context:StreamingContext) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Clone() + +
    + Signature: unit -> EdgeEdgeDictionary<'TVertex,'TEdge>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-collections-edgelist-2.html b/reference/quickgraph-collections-edgelist-2.html new file mode 100644 index 000000000..2149db4aa --- /dev/null +++ b/reference/quickgraph-collections-edgelist-2.html @@ -0,0 +1,140 @@ + + + + + EdgeList<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EdgeList<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Collections
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + new(capacity) + +
    + Signature: capacity:int -> unit
    +
    +     		+ +
    + + + new(list) + +
    + Signature: list:EdgeList<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Clone() + +
    + Signature: unit -> EdgeList<'TVertex,'TEdge>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-collections-fibonacciheap-2.html b/reference/quickgraph-collections-fibonacciheap-2.html new file mode 100644 index 000000000..99ea1e1fb --- /dev/null +++ b/reference/quickgraph-collections-fibonacciheap-2.html @@ -0,0 +1,309 @@ + + + + + FibonacciHeap<'TPriority, 'TValue> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FibonacciHeap<'TPriority, 'TValue>

    +

    + Namespace: QuickGraph.Collections
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + new(Direction) + +
    + Signature: Direction:HeapDirection -> unit
    +
    +     		+ +
    + + + new(Direction, priorityComparison) + +
    + Signature: (Direction:HeapDirection * priorityComparison:Comparison<'TPriority>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ChangeKey(node, newKey) + +
    + Signature: (node:FibonacciHeapCell<'TPriority,'TValue> * newKey:'TPriority) -> unit
    +
    +     		+ +
    + + + Count + +
    + Signature: int
    +
    +     		+ +
    + + + Delete(node) + +
    + Signature: node:FibonacciHeapCell<'TPriority,'TValue> -> unit
    +
    +     		+ +
    + + + Dequeue() + +
    + Signature: unit -> KeyValuePair<'TPriority,'TValue>
    +
    +     		+ +
    + + + Direction + +
    + Signature: HeapDirection
    +
    +     		+ +
    + + + DrawHeap() + +
    + Signature: unit -> string
    +
    +     		+ +
    + + + Enqueue(Priority, Value) + +
    + Signature: (Priority:'TPriority * Value:'TValue) -> FibonacciHeapCell<'TPriority,'TValue>
    +
    +     		+ +
    + + + GetDestructiveEnumerator() + +
    + Signature: unit -> IEnumerable<KeyValuePair<'TPriority,'TValue>>
    +
    +     		+ +
    + + + GetEnumerator() + +
    + Signature: unit -> IEnumerator<KeyValuePair<'TPriority,'TValue>>
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsEmpty + +
    + Signature: bool
    +
    +     		+ +
    + + + Merge(other) + +
    + Signature: other:FibonacciHeap<'TPriority,'TValue> -> unit
    +
    +     		+ +
    + + + PriorityComparison + +
    + Signature: Comparison<'TPriority>
    +
    +     		+ +
    + + + Top + +
    + Signature: FibonacciHeapCell<'TPriority,'TValue>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-collections-fibonacciheapcell-2.html b/reference/quickgraph-collections-fibonacciheapcell-2.html new file mode 100644 index 000000000..766b8c5d4 --- /dev/null +++ b/reference/quickgraph-collections-fibonacciheapcell-2.html @@ -0,0 +1,112 @@ + + + + + FibonacciHeapCell<'TPriority, 'TValue> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FibonacciHeapCell<'TPriority, 'TValue>

    +

    + Namespace: QuickGraph.Collections
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + ToKeyValuePair() + +
    + Signature: unit -> KeyValuePair<'TPriority,'TValue>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-collections-fibonacciheaplinkedlist-2.html b/reference/quickgraph-collections-fibonacciheaplinkedlist-2.html new file mode 100644 index 000000000..d8aefab7d --- /dev/null +++ b/reference/quickgraph-collections-fibonacciheaplinkedlist-2.html @@ -0,0 +1,105 @@ + + + + + FibonacciHeapLinkedList<'TPriority, 'TValue> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FibonacciHeapLinkedList<'TPriority, 'TValue>

    +

    + Namespace: QuickGraph.Collections
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + First + +
    + Signature: FibonacciHeapCell<'TPriority,'TValue>
    +
    +     		+ +
    + + + GetEnumerator() + +
    + Signature: unit -> IEnumerator<FibonacciHeapCell<'TPriority,'TValue>>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-collections-fibonacciqueue-2.html b/reference/quickgraph-collections-fibonacciqueue-2.html new file mode 100644 index 000000000..34c5f0b66 --- /dev/null +++ b/reference/quickgraph-collections-fibonacciqueue-2.html @@ -0,0 +1,259 @@ + + + + + FibonacciQueue<'TVertex, 'TDistance> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FibonacciQueue<'TVertex, 'TDistance>

    +

    + Namespace: QuickGraph.Collections
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(distances) + +
    + Signature: distances:Func<'TVertex,'TDistance> -> unit
    +
    +     		+ +
    + + + new(valueCount, values, distances) + +
    + Signature: (valueCount:int * values:IEnumerable<'TVertex> * distances:Func<'TVertex,'TDistance>) -> unit
    +
    +     		+ +
    + + + new(...) + +
    + Signature: (valueCount:int * values:IEnumerable<'TVertex> * distances:Func<'TVertex,'TDistance> * distanceComparison:Comparison<'TDistance>) -> unit
    +
    +     		+ +
    + + + new(values, distanceComparison) + +
    + Signature: (values:Dictionary<'TVertex,'TDistance> * distanceComparison:Comparison<'TDistance>) -> unit
    +
    +     		+ +
    + + + new(values) + +
    + Signature: values:Dictionary<'TVertex,'TDistance> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Contains(value) + +
    + Signature: value:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Count + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Dequeue() + +
    + Signature: unit -> 'TVertex
    + Modifiers: abstract
    +
    +     		+ +
    + + + Enqueue(value) + +
    + Signature: value:'TVertex -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + Peek() + +
    + Signature: unit -> 'TVertex
    + Modifiers: abstract
    +
    +     		+ +
    + + + ToArray() + +
    + Signature: unit -> 'TVertex []
    + Modifiers: abstract
    +
    +     		+ +
    + + + Update(v) + +
    + Signature: v:'TVertex -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-collections-forestdisjointset-1.html b/reference/quickgraph-collections-forestdisjointset-1.html new file mode 100644 index 000000000..29c50a74b --- /dev/null +++ b/reference/quickgraph-collections-forestdisjointset-1.html @@ -0,0 +1,222 @@ + + + + + ForestDisjointSet<'T> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ForestDisjointSet<'T>

    +

    + Namespace: QuickGraph.Collections
    +

    +
    +

    Disjoint-set implementation with path compression and union-by-rank optimizations. +optimization

    + +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(elementCapacity) + +
    + Signature: elementCapacity:int -> unit
    +
    +     		+ +
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AreInSameSet(left, right) + +
    + Signature: (left:'T * right:'T) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Contains(value) + +
    + Signature: value:'T -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ElementCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + FindSet(value) + +
    + Signature: value:'T -> 'T
    + Modifiers: abstract
    +
    +     		+ +
    + + + MakeSet(value) + +
    + Signature: value:'T -> unit
    + Modifiers: abstract
    +
    +     		+

    Adds a new set

    + + +
    + + + SetCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Union(left, right) + +
    + Signature: (left:'T * right:'T) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-collections-heapdirection.html b/reference/quickgraph-collections-heapdirection.html new file mode 100644 index 000000000..5841c8ce0 --- /dev/null +++ b/reference/quickgraph-collections-heapdirection.html @@ -0,0 +1,70 @@ + + + + + HeapDirection - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    HeapDirection

    +

    + Namespace: QuickGraph.Collections
    +

    +
    +

    Specifies the order in which a Heap will Dequeue items.

    + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-collections-idisjointset-1.html b/reference/quickgraph-collections-idisjointset-1.html new file mode 100644 index 000000000..5f1e70226 --- /dev/null +++ b/reference/quickgraph-collections-idisjointset-1.html @@ -0,0 +1,197 @@ + + + + + IDisjointSet<'T> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IDisjointSet<'T>

    +

    + Namespace: QuickGraph.Collections
    +

    +
    +

    A disjoint-set data structure

    + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AreInSameSet(left, right) + +
    + Signature: (left:'T * right:'T) -> bool
    + Modifiers: abstract
    +
    +     		+

    Gets a value indicating if left and right are contained in the same set

    + + +
    + + + Contains(value) + +
    + Signature: value:'T -> bool
    + Modifiers: abstract
    +
    +     		+

    Gets a value indicating whether the value is in the data structure

    + + +
    + + + ElementCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+

    Gets the current number of elements.

    + + +
    + + + FindSet(value) + +
    + Signature: value:'T -> 'T
    + Modifiers: abstract
    +
    +     		+

    Finds the set containing the value

    + + +
    + + + MakeSet(value) + +
    + Signature: value:'T -> unit
    + Modifiers: abstract
    +
    +     		+

    Creates a new set for the value

    + + +
    + + + SetCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+

    Gets the current number of sets

    + + +
    + + + Union(left, right) + +
    + Signature: (left:'T * right:'T) -> bool
    + Modifiers: abstract
    +
    +     		+

    Merges the sets from the two values

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-collections-iedgelist-2.html b/reference/quickgraph-collections-iedgelist-2.html new file mode 100644 index 000000000..82d18b9d4 --- /dev/null +++ b/reference/quickgraph-collections-iedgelist-2.html @@ -0,0 +1,112 @@ + + + + + IEdgeList<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IEdgeList<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Collections
    +

    +
    +

    A cloneable list of edges

    + +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Clone() + +
    + Signature: unit -> IEdgeList<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+

    Gets a clone of this list

    + + +
    + + + TrimExcess() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+

    Trims excess allocated space

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-collections-ipriorityqueue-1.html b/reference/quickgraph-collections-ipriorityqueue-1.html new file mode 100644 index 000000000..44e379d7c --- /dev/null +++ b/reference/quickgraph-collections-ipriorityqueue-1.html @@ -0,0 +1,91 @@ + + + + + IPriorityQueue<'T> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IPriorityQueue<'T>

    +

    + Namespace: QuickGraph.Collections
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Update(value) + +
    + Signature: value:'T -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-collections-iqueue-1.html b/reference/quickgraph-collections-iqueue-1.html new file mode 100644 index 000000000..bdca8ab88 --- /dev/null +++ b/reference/quickgraph-collections-iqueue-1.html @@ -0,0 +1,166 @@ + + + + + IQueue<'T> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IQueue<'T>

    +

    + Namespace: QuickGraph.Collections
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Contains(value) + +
    + Signature: value:'T -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Count + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Dequeue() + +
    + Signature: unit -> 'T
    + Modifiers: abstract
    +
    +     		+ +
    + + + Enqueue(value) + +
    + Signature: value:'T -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + Peek() + +
    + Signature: unit -> 'T
    + Modifiers: abstract
    +
    +     		+ +
    + + + ToArray() + +
    + Signature: unit -> 'T []
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-collections-ivertexedgedictionary-2.html b/reference/quickgraph-collections-ivertexedgedictionary-2.html new file mode 100644 index 000000000..88417ba19 --- /dev/null +++ b/reference/quickgraph-collections-ivertexedgedictionary-2.html @@ -0,0 +1,95 @@ + + + + + IVertexEdgeDictionary<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IVertexEdgeDictionary<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Collections
    +

    +
    +

    A dictionary of vertices to a list of edges

    + +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Clone() + +
    + Signature: unit -> IVertexEdgeDictionary<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+

    Gets a clone of the dictionary. The vertices and edges are not cloned.

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-collections-queue-1.html b/reference/quickgraph-collections-queue-1.html new file mode 100644 index 000000000..85867ab04 --- /dev/null +++ b/reference/quickgraph-collections-queue-1.html @@ -0,0 +1,90 @@ + + + + + Queue<'T> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    Queue<'T>

    +

    + Namespace: QuickGraph.Collections
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-collections-softheap-2.html b/reference/quickgraph-collections-softheap-2.html new file mode 100644 index 000000000..96b7d2577 --- /dev/null +++ b/reference/quickgraph-collections-softheap-2.html @@ -0,0 +1,225 @@ + + + + + SoftHeap<'TKey, 'TValue> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    SoftHeap<'TKey, 'TValue>

    +

    + Namespace: QuickGraph.Collections
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(maximumErrorRate, keyMaxValue) + +
    + Signature: (maximumErrorRate:float * keyMaxValue:'TKey) -> unit
    +
    +     		+ +
    + + + new(...) + +
    + Signature: (maximumErrorRate:float * keyMaxValue:'TKey * comparison:Comparison<'TKey>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Add(key, value) + +
    + Signature: (key:'TKey * value:'TValue) -> unit
    +
    +     		+ +
    + + + Comparison + +
    + Signature: Comparison<'TKey>
    +
    +     		+ +
    + + + Count + +
    + Signature: int
    +
    +     		+ +
    + + + DeleteMin() + +
    + Signature: unit -> KeyValuePair<'TKey,'TValue>
    +
    +     		+ +
    + + + ErrorRate + +
    + Signature: float
    +
    +     		+ +
    + + + GetEnumerator() + +
    + Signature: unit -> IEnumerator<KeyValuePair<'TKey,'TValue>>
    + Modifiers: abstract
    +
    +     		+ +
    + + + KeyMaxValue + +
    + Signature: 'TKey
    +
    +     		+ +
    + + + MinRank + +
    + Signature: int
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-collections-termedgelist-2.html b/reference/quickgraph-collections-termedgelist-2.html new file mode 100644 index 000000000..58c32e79f --- /dev/null +++ b/reference/quickgraph-collections-termedgelist-2.html @@ -0,0 +1,335 @@ + + + + + TermEdgeList<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    TermEdgeList<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Collections
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + new(capacity) + +
    + Signature: capacity:int -> unit
    +
    +     		+ +
    + + + new(list) + +
    + Signature: list:TermEdgeList<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Add(item) + +
    + Signature: item:'TEdge -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + Clear() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + Clone() + +
    + Signature: unit -> TermEdgeList<'TVertex,'TEdge>
    +
    +     		+ +
    + + + Contains(item) + +
    + Signature: item:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + CopyTo(array, arrayIndex) + +
    + Signature: (array:'TEdge [] * arrayIndex:int) -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + Count + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + GetEnumerator() + +
    + Signature: unit -> IEnumerator<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + IndexOf(item) + +
    + Signature: item:'TEdge -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Insert(index, item) + +
    + Signature: (index:int * item:'TEdge) -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsReadOnly + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + [()] + +
    + Signature: unit -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Remove(item) + +
    + Signature: item:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveAt(index) + +
    + Signature: index:int -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + TrimExcess() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-collections-vertexedgedictionary-2.html b/reference/quickgraph-collections-vertexedgedictionary-2.html new file mode 100644 index 000000000..df2f28175 --- /dev/null +++ b/reference/quickgraph-collections-vertexedgedictionary-2.html @@ -0,0 +1,140 @@ + + + + + VertexEdgeDictionary<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    VertexEdgeDictionary<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Collections
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + new(capacity) + +
    + Signature: capacity:int -> unit
    +
    +     		+ +
    + + + new(info, context) + +
    + Signature: (info:SerializationInfo * context:StreamingContext) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Clone() + +
    + Signature: unit -> VertexEdgeDictionary<'TVertex,'TEdge>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-collections-vertexlist-1.html b/reference/quickgraph-collections-vertexlist-1.html new file mode 100644 index 000000000..6db2bd47a --- /dev/null +++ b/reference/quickgraph-collections-vertexlist-1.html @@ -0,0 +1,140 @@ + + + + + VertexList<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    VertexList<'TVertex>

    +

    + Namespace: QuickGraph.Collections
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + new(capacity) + +
    + Signature: capacity:int -> unit
    +
    +     		+ +
    + + + new(other) + +
    + Signature: other:VertexList<'TVertex> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Clone() + +
    + Signature: unit -> VertexList<'TVertex>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-compressedsparserowgraph-1.html b/reference/quickgraph-compressedsparserowgraph-1.html new file mode 100644 index 000000000..029b0875f --- /dev/null +++ b/reference/quickgraph-compressedsparserowgraph-1.html @@ -0,0 +1,385 @@ + + + + + CompressedSparseRowGraph<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    CompressedSparseRowGraph<'TVertex>

    +

    + Namespace: QuickGraph
    +

    +
    +

    Directed graph representation using a Compressed Sparse Row representation +(http://www.cs.utk.edu/~dongarra/etemplates/node373.html)

    + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AllowParallelEdges + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Clone() + +
    + Signature: unit -> CompressedSparseRowGraph<'TVertex>
    +
    +     		+ +
    + + + ContainsEdge(edge) + +
    + Signature: edge:SEquatableEdge<'TVertex> -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsEdge(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsVertex(vertex) + +
    + Signature: vertex:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Edges + +
    + Signature: IEnumerable<SEquatableEdge<'TVertex>>
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsDirected + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsEdgesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsOutEdgesEmpty(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsVerticesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutDegree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutEdge(v, index) + +
    + Signature: (v:'TVertex * index:int) -> SEquatableEdge<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutEdges(v) + +
    + Signature: v:'TVertex -> IEnumerable<SEquatableEdge<'TVertex>>
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetEdge(source, target, edge) + +
    + Signature: (source:'TVertex * target:'TVertex * edge:byref<SEquatableEdge<'TVertex>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetEdges(source, target, edges) + +
    + Signature: (source:'TVertex * target:'TVertex * edges:byref<IEnumerable<SEquatableEdge<'TVertex>>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetOutEdges(v, edges) + +
    + Signature: (v:'TVertex * edges:byref<IEnumerable<SEquatableEdge<'TVertex>>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Vertices + +
    + Signature: IEnumerable<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    +

    Static members

    + + + + + + + + + + +
    Static memberDescription
    + + + FromGraph(visitedGraph) + +
    + Signature: visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> CompressedSparseRowGraph<'TVertex>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-contracts-graphcontract.html b/reference/quickgraph-contracts-graphcontract.html new file mode 100644 index 000000000..38510d161 --- /dev/null +++ b/reference/quickgraph-contracts-graphcontract.html @@ -0,0 +1,148 @@ + + + + + GraphContract - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphContract

    +

    + Namespace: QuickGraph.Contracts
    +

    +
    +

    Debug only assertions and assumptions

    + +
    +

    Static members

    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Static memberDescription
    + + + EdgeCountEqual(left, right) + +
    + Signature: (left:IEdgeListGraph<'TVertex,'TEdge> * right:IEdgeListGraph<'TVertex,'TEdge>) -> bool
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + InEdgeSet(g, e) + +
    + Signature: (g:IEdgeListGraph<'TVertex,'TEdge> * e:'TEdge) -> bool
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + InVertexSet(g, v) + +
    + Signature: (g:IVertexSet<'TVertex> * v:'TVertex) -> bool
    + Type parameters: 'TVertex
    +     		+ +
    + + + InVertexSet(g, e) + +
    + Signature: (g:IEdgeListGraph<'TVertex,'TEdge> * e:'TEdge) -> bool
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + VertexCountEqual(left, right) + +
    + Signature: (left:IVertexSet<'TVertex> * right:IVertexSet<'TVertex>) -> bool
    + Type parameters: 'TVertex
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-createedgedelegate-2.html b/reference/quickgraph-createedgedelegate-2.html new file mode 100644 index 000000000..bcaaaeb3f --- /dev/null +++ b/reference/quickgraph-createedgedelegate-2.html @@ -0,0 +1,145 @@ + + + + + CreateEdgeDelegate<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    CreateEdgeDelegate<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    An edge factory delegate

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(object, method) + +
    + Signature: (object:obj * method:nativeint) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BeginInvoke(...) + +
    + Signature: (g:IVertexListGraph<'TVertex,'TEdge> * source:'TVertex * target:'TVertex * callback:AsyncCallback * object:obj) -> IAsyncResult
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndInvoke(result) + +
    + Signature: result:IAsyncResult -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + + + Invoke(g, source, target) + +
    + Signature: (g:IVertexListGraph<'TVertex,'TEdge> * source:'TVertex * target:'TVertex) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-createvertexdelegate-2.html b/reference/quickgraph-createvertexdelegate-2.html new file mode 100644 index 000000000..cd4f18186 --- /dev/null +++ b/reference/quickgraph-createvertexdelegate-2.html @@ -0,0 +1,145 @@ + + + + + CreateVertexDelegate<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    CreateVertexDelegate<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A vertex factory delegate.

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(object, method) + +
    + Signature: (object:obj * method:nativeint) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BeginInvoke(g, callback, object) + +
    + Signature: (g:IVertexListGraph<'TVertex,'TEdge> * callback:AsyncCallback * object:obj) -> IAsyncResult
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndInvoke(result) + +
    + Signature: result:IAsyncResult -> 'TVertex
    + Modifiers: abstract
    +
    +     		+ +
    + + + Invoke(g) + +
    + Signature: g:IVertexListGraph<'TVertex,'TEdge> -> 'TVertex
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-data-datarelationedge.html b/reference/quickgraph-data-datarelationedge.html new file mode 100644 index 000000000..b49df93dc --- /dev/null +++ b/reference/quickgraph-data-datarelationedge.html @@ -0,0 +1,142 @@ + + + + + DataRelationEdge - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DataRelationEdge

    +

    + Namespace: QuickGraph.Data
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(relation) + +
    + Signature: relation:DataRelation -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Relation + +
    + Signature: DataRelation
    +
    +     		+ +
    + + + Source + +
    + Signature: DataTable
    + Modifiers: abstract
    +
    +     		+ +
    + + + Target + +
    + Signature: DataTable
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-data-datasetgraph.html b/reference/quickgraph-data-datasetgraph.html new file mode 100644 index 000000000..1ebc6a12a --- /dev/null +++ b/reference/quickgraph-data-datasetgraph.html @@ -0,0 +1,90 @@ + + + + + DataSetGraph - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DataSetGraph

    +

    + Namespace: QuickGraph.Data
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + DataSet + +
    + Signature: DataSet
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-data-datasetgraphextensions.html b/reference/quickgraph-data-datasetgraphextensions.html new file mode 100644 index 000000000..301daaba1 --- /dev/null +++ b/reference/quickgraph-data-datasetgraphextensions.html @@ -0,0 +1,104 @@ + + + + + DataSetGraphExtensions - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DataSetGraphExtensions

    +

    + Namespace: QuickGraph.Data
    +

    +
    +
    +

    Static members

    + + + + + + + + + + + + + + +
    Static memberDescription
    + + + ToGraph(ds) + +
    + Signature: ds:DataSet -> DataSetGraph
    +
    +     		+ +
    + + + ToGraphviz(visitedGraph) + +
    + Signature: visitedGraph:DataSetGraph -> string
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-data-datasetgraphpopulatoralgorithm.html b/reference/quickgraph-data-datasetgraphpopulatoralgorithm.html new file mode 100644 index 000000000..e3d7c404a --- /dev/null +++ b/reference/quickgraph-data-datasetgraphpopulatoralgorithm.html @@ -0,0 +1,112 @@ + + + + + DataSetGraphPopulatorAlgorithm - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DataSetGraphPopulatorAlgorithm

    +

    + Namespace: QuickGraph.Data
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph, dataSet) + +
    + Signature: (visitedGraph:IMutableVertexAndEdgeListGraph<DataTable,DataRelationEdge> * dataSet:DataSet) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + DataSet + +
    + Signature: DataSet
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-data-datasetgraphvizalgorithm.html b/reference/quickgraph-data-datasetgraphvizalgorithm.html new file mode 100644 index 000000000..9d2a7df49 --- /dev/null +++ b/reference/quickgraph-data-datasetgraphvizalgorithm.html @@ -0,0 +1,106 @@ + + + + + DataSetGraphvizAlgorithm - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DataSetGraphvizAlgorithm

    +

    + Namespace: QuickGraph.Data
    +

    +
    +

    An algorithm that renders a DataSet graph to the Graphviz DOT format.

    + +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:DataSetGraph -> unit
    +
    +     		+ +
    + + + new(visitedGraph, path, imageType) + +
    + Signature: (visitedGraph:DataSetGraph * path:string * imageType:GraphvizImageType) -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-delegatebidirectionalincidencegraph-2.html b/reference/quickgraph-delegatebidirectionalincidencegraph-2.html new file mode 100644 index 000000000..b65d5ba2c --- /dev/null +++ b/reference/quickgraph-delegatebidirectionalincidencegraph-2.html @@ -0,0 +1,204 @@ + + + + + DelegateBidirectionalIncidenceGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DelegateBidirectionalIncidenceGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A delegate based bidirectional implicit graph

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(tryGetOutEdges, tryGetInEdges) + +
    + Signature: (tryGetOutEdges:TryFunc<'TVertex,IEnumerable<'TEdge>> * tryGetInEdges:TryFunc<'TVertex,IEnumerable<'TEdge>>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Degree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + InDegree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + InEdge(v, index) + +
    + Signature: (v:'TVertex * index:int) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + + + InEdges(v) + +
    + Signature: v:'TVertex -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsInEdgesEmpty(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetInEdges(v, edges) + +
    + Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetInEdgesFunc + +
    + Signature: TryFunc<'TVertex,IEnumerable<'TEdge>>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-delegateimplicitgraph-2.html b/reference/quickgraph-delegateimplicitgraph-2.html new file mode 100644 index 000000000..433a78872 --- /dev/null +++ b/reference/quickgraph-delegateimplicitgraph-2.html @@ -0,0 +1,234 @@ + + + + + DelegateImplicitGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DelegateImplicitGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A delegate-based implicit graph

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(tryGetOutEdges) + +
    + Signature: tryGetOutEdges:TryFunc<'TVertex,IEnumerable<'TEdge>> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AllowParallelEdges + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsVertex(vertex) + +
    + Signature: vertex:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsDirected + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsOutEdgesEmpty(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutDegree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutEdge(v, index) + +
    + Signature: (v:'TVertex * index:int) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutEdges(v) + +
    + Signature: v:'TVertex -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetOutEdges(v, edges) + +
    + Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetOutEdgesFunc + +
    + Signature: TryFunc<'TVertex,IEnumerable<'TEdge>>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-delegateimplicitundirectedgraph-2.html b/reference/quickgraph-delegateimplicitundirectedgraph-2.html new file mode 100644 index 000000000..6e9460126 --- /dev/null +++ b/reference/quickgraph-delegateimplicitundirectedgraph-2.html @@ -0,0 +1,278 @@ + + + + + DelegateImplicitUndirectedGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DelegateImplicitUndirectedGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A functional implicit undirected graph

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(...) + +
    + Signature: (tryGetAdjacenyEdges:TryFunc<'TVertex,IEnumerable<'TEdge>> * allowParallelEdges:bool) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AdjacentDegree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + AdjacentEdge(v, index) + +
    + Signature: (v:'TVertex * index:int) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + + + AdjacentEdges(v) + +
    + Signature: v:'TVertex -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + AllowParallelEdges + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsEdge(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsVertex(vertex) + +
    + Signature: vertex:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeEqualityComparer + +
    + Signature: EdgeEqualityComparer<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsAdjacentEdgesEmpty(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsDirected + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetAdjacencyEdgesFunc + +
    + Signature: TryFunc<'TVertex,IEnumerable<'TEdge>>
    +
    +     		+ +
    + + + TryGetAdjacentEdges(v, edges) + +
    + Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
    +
    +     		+ +
    + + + TryGetEdge(source, target, edge) + +
    + Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-delegateincidencegraph-2.html b/reference/quickgraph-delegateincidencegraph-2.html new file mode 100644 index 000000000..627030b39 --- /dev/null +++ b/reference/quickgraph-delegateincidencegraph-2.html @@ -0,0 +1,145 @@ + + + + + DelegateIncidenceGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DelegateIncidenceGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A delegate-based incidence graph

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(tryGetOutEdges) + +
    + Signature: tryGetOutEdges:TryFunc<'TVertex,IEnumerable<'TEdge>> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ContainsEdge(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetEdge(source, target, edge) + +
    + Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetEdges(source, target, edges) + +
    + Signature: (source:'TVertex * target:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-delegateundirectedgraph-2.html b/reference/quickgraph-delegateundirectedgraph-2.html new file mode 100644 index 000000000..2ad329ee8 --- /dev/null +++ b/reference/quickgraph-delegateundirectedgraph-2.html @@ -0,0 +1,205 @@ + + + + + DelegateUndirectedGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DelegateUndirectedGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A functional implicit undirected graph

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(...) + +
    + Signature: (vertices:IEnumerable<'TVertex> * tryGetAdjacentEdges:TryFunc<'TVertex,IEnumerable<'TEdge>> * allowParallelEdges:bool) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ContainsEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Edges + +
    + Signature: IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsEdgesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsVerticesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Vertices + +
    + Signature: IEnumerable<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-delegatevertexandedgelistgraph-2.html b/reference/quickgraph-delegatevertexandedgelistgraph-2.html new file mode 100644 index 000000000..e2821bcbf --- /dev/null +++ b/reference/quickgraph-delegatevertexandedgelistgraph-2.html @@ -0,0 +1,205 @@ + + + + + DelegateVertexAndEdgeListGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DelegateVertexAndEdgeListGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A delegate-based incidence graph

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(vertices, tryGetOutEdges) + +
    + Signature: (vertices:IEnumerable<'TVertex> * tryGetOutEdges:TryFunc<'TVertex,IEnumerable<'TEdge>>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ContainsEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Edges + +
    + Signature: IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsEdgesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsVerticesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Vertices + +
    + Signature: IEnumerable<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-dotparseradapter.html b/reference/quickgraph-dotparseradapter.html new file mode 100644 index 000000000..c2de1dae5 --- /dev/null +++ b/reference/quickgraph-dotparseradapter.html @@ -0,0 +1,90 @@ + + + + + DotParserAdapter - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DotParserAdapter

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-doubleequalitycomparer.html b/reference/quickgraph-doubleequalitycomparer.html new file mode 100644 index 000000000..a48c54b06 --- /dev/null +++ b/reference/quickgraph-doubleequalitycomparer.html @@ -0,0 +1,192 @@ + + + + + DoubleEqualityComparer - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DoubleEqualityComparer

    +

    + Namespace: QuickGraph
    +

    +
    +

    IEqualityComparer for floats with user-specified tolerance.

    + +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+

    Constructs DoubleEqualityComparer with default tolerance.

    + + +
    + + + new(tolerance) + +
    + Signature: tolerance:float -> unit
    +
    +     		+

    Constructs DoubleEqualityComparer with user-given tolerance.

    + + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Equals(x, y) + +
    + Signature: (x:float * y:float) -> bool
    + Modifiers: abstract
    +
    +     		+

    Implements IEqualityComparer.Equals

    + + +
    + + + GetHashCode(x) + +
    + Signature: x:float -> int
    + Modifiers: abstract
    +
    +     		+

    Implements IEqualityComparer.GetHashCode

    + + +
    + + + Tolerance() + +
    + Signature: unit -> unit
    +
    +     		+

    Tolerance used during equality comparison

    + + +
    +

    Static members

    + + + + + + + + + + +
    Static memberDescription
    + + + DefaultTolerance + +
    + Signature: float
    +
    +     		+

    Default tolerance

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-edge-1.html b/reference/quickgraph-edge-1.html new file mode 100644 index 000000000..ff7687fcb --- /dev/null +++ b/reference/quickgraph-edge-1.html @@ -0,0 +1,153 @@ + + + + + Edge<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    Edge<'TVertex>

    +

    + Namespace: QuickGraph
    +

    +
    +

    The default implementation.

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> unit
    +
    +     		+

    Initializes a new instance of the class.

    + + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Source + +
    + Signature: 'TVertex
    + Modifiers: abstract
    +
    +     		+

    Gets the source vertex

    + + +
    + + + Target + +
    + Signature: 'TVertex
    + Modifiers: abstract
    +
    +     		+

    Gets the target vertex

    + + +
    + + + ToString() + +
    + Signature: unit -> string
    + Modifiers: abstract
    +
    +     		+

    Returns a that represents the current .

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-edgeaction-2.html b/reference/quickgraph-edgeaction-2.html new file mode 100644 index 000000000..a96030cba --- /dev/null +++ b/reference/quickgraph-edgeaction-2.html @@ -0,0 +1,145 @@ + + + + + EdgeAction<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EdgeAction<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    The handler for events involving edges

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(object, method) + +
    + Signature: (object:obj * method:nativeint) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BeginInvoke(e, callback, object) + +
    + Signature: (e:'TEdge * callback:AsyncCallback * object:obj) -> IAsyncResult
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndInvoke(result) + +
    + Signature: result:IAsyncResult -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + Invoke(e) + +
    + Signature: e:'TEdge -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-edgeedgeaction-2.html b/reference/quickgraph-edgeedgeaction-2.html new file mode 100644 index 000000000..65831e439 --- /dev/null +++ b/reference/quickgraph-edgeedgeaction-2.html @@ -0,0 +1,145 @@ + + + + + EdgeEdgeAction<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EdgeEdgeAction<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    The handler for events involving two edges

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(object, method) + +
    + Signature: (object:obj * method:nativeint) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BeginInvoke(...) + +
    + Signature: (edge:'TEdge * targetEdge:'TEdge * callback:AsyncCallback * object:obj) -> IAsyncResult
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndInvoke(result) + +
    + Signature: result:IAsyncResult -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + Invoke(edge, targetEdge) + +
    + Signature: (edge:'TEdge * targetEdge:'TEdge) -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-edgeequalitycomparer-2.html b/reference/quickgraph-edgeequalitycomparer-2.html new file mode 100644 index 000000000..f3ebecebb --- /dev/null +++ b/reference/quickgraph-edgeequalitycomparer-2.html @@ -0,0 +1,143 @@ + + + + + EdgeEqualityComparer<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EdgeEqualityComparer<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(object, method) + +
    + Signature: (object:obj * method:nativeint) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BeginInvoke(...) + +
    + Signature: (edge:'TEdge * source:'TVertex * target:'TVertex * callback:AsyncCallback * object:obj) -> IAsyncResult
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndInvoke(result) + +
    + Signature: result:IAsyncResult -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Invoke(edge, source, target) + +
    + Signature: (edge:'TEdge * source:'TVertex * target:'TVertex) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-edgeeventargs-2.html b/reference/quickgraph-edgeeventargs-2.html new file mode 100644 index 000000000..8a0db3426 --- /dev/null +++ b/reference/quickgraph-edgeeventargs-2.html @@ -0,0 +1,118 @@ + + + + + EdgeEventArgs<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EdgeEventArgs<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    An event involving an edge.

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(edge) + +
    + Signature: edge:'TEdge -> unit
    +
    +     		+

    Initializes a new instance of the class.

    + + +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Edge + +
    + Signature: 'TEdge
    +
    +     		+

    Gets the edge.

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-edgeextensions.html b/reference/quickgraph-edgeextensions.html new file mode 100644 index 000000000..d9c7312ee --- /dev/null +++ b/reference/quickgraph-edgeextensions.html @@ -0,0 +1,282 @@ + + + + + EdgeExtensions - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EdgeExtensions

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Static members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Static memberDescription
    + + + GetOtherVertex(edge, vertex) + +
    + Signature: (edge:'TEdge * vertex:'TVertex) -> 'TVertex
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Given a source vertex, returns the other vertex in the edge

    + + +
    + + + GetUndirectedVertexEquality() + +
    + Signature: unit -> EdgeEqualityComparer<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Returns the most efficient comporer for the particular type of TEdge. +If TEdge implements IUndirectedEdge, then only the (source,target) pair +has to be compared; if not, (source, target) and (target, source) have to be compared.

    + + +
    + + + HasCycles(path) + +
    + Signature: path:IEnumerable<'TEdge> -> bool
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + IsAdjacent(edge, vertex) + +
    + Signature: (edge:'TEdge * vertex:'TVertex) -> bool
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Gets a value indicating if is adjacent to +(is the source or target).

    + + +
    + + + IsPath(path) + +
    + Signature: path:IEnumerable<'TEdge> -> bool
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + IsPathWithoutCycles(path) + +
    + Signature: path:IEnumerable<'TEdge> -> bool
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + IsPredecessor(...) + +
    + Signature: (predecessors:IDictionary<'TVertex,'TEdge> * root:'TVertex * vertex:'TVertex) -> bool
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Checks that is a predecessor of

    + + +
    + + + IsSelfEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Gets a value indicating if the edge is a self edge.

    + + +
    + + + ReverseEdges(edges) + +
    + Signature: edges:IEnumerable<'TEdge> -> IEnumerable<SReversedEdge<'TVertex,'TEdge>>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Returns a reversed edge enumeration

    + + +
    + + + SortedVertexEquality(...) + +
    + Signature: (edge:'TEdge * source:'TVertex * target:'TVertex) -> bool
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Gets a value indicating if the vertices of edge match (source, target)

    + + +
    + + + ToVertexPair(edge) + +
    + Signature: edge:'TEdge -> SEquatableEdge<'TVertex>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Creates a vertex pair (source, target) from the edge

    + + +
    + + + TryGetPath(predecessors, v, result) + +
    + Signature: (predecessors:IDictionary<'TVertex,'TEdge> * v:'TVertex * result:byref<IEnumerable<'TEdge>>) -> bool
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Tries to get the predecessor path, if reachable.

    + + +
    + + + UndirectedVertexEquality(...) + +
    + Signature: (edge:'TEdge * source:'TVertex * target:'TVertex) -> bool
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Gets a value indicating if the vertices of edge match (source, target) or +(target, source)

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-edgefactory-2.html b/reference/quickgraph-edgefactory-2.html new file mode 100644 index 000000000..192e536d9 --- /dev/null +++ b/reference/quickgraph-edgefactory-2.html @@ -0,0 +1,145 @@ + + + + + EdgeFactory<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EdgeFactory<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    An edge factory

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(object, method) + +
    + Signature: (object:obj * method:nativeint) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BeginInvoke(...) + +
    + Signature: (source:'TVertex * target:'TVertex * callback:AsyncCallback * object:obj) -> IAsyncResult
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndInvoke(result) + +
    + Signature: result:IAsyncResult -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + + + Invoke(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-edgeidentity-2.html b/reference/quickgraph-edgeidentity-2.html new file mode 100644 index 000000000..aaa3da754 --- /dev/null +++ b/reference/quickgraph-edgeidentity-2.html @@ -0,0 +1,143 @@ + + + + + EdgeIdentity<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EdgeIdentity<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(object, method) + +
    + Signature: (object:obj * method:nativeint) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BeginInvoke(edge, callback, object) + +
    + Signature: (edge:'TEdge * callback:AsyncCallback * object:obj) -> IAsyncResult
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndInvoke(result) + +
    + Signature: result:IAsyncResult -> string
    + Modifiers: abstract
    +
    +     		+ +
    + + + Invoke(edge) + +
    + Signature: edge:'TEdge -> string
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-edgelistgraph-2.html b/reference/quickgraph-edgelistgraph-2.html new file mode 100644 index 000000000..042153673 --- /dev/null +++ b/reference/quickgraph-edgelistgraph-2.html @@ -0,0 +1,409 @@ + + + + + EdgeListGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EdgeListGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + new(isDirected, allowParralelEdges) + +
    + Signature: (isDirected:bool * allowParralelEdges:bool) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AddEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddEdgeRange(edges) + +
    + Signature: edges:IEnumerable<'TEdge> -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddVerticesAndEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    +
    +     		+ +
    + + + AddVerticesAndEdgeRange(edges) + +
    + Signature: edges:IEnumerable<'TEdge> -> int
    +
    +     		+ +
    + + + AllowParallelEdges + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Clear() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + Clone() + +
    + Signature: unit -> EdgeListGraph<'TVertex,'TEdge>
    +
    +     		+ +
    + + + ContainsEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsVertex(vertex) + +
    + Signature: vertex:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeAdded + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeRemoved + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + Edges + +
    + Signature: IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsDirected + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsEdgesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsVerticesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveEdgeIf(predicate) + +
    + Signature: predicate:EdgePredicate<'TVertex,'TEdge> -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Vertices + +
    + Signature: IEnumerable<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-edgepredicate-2.html b/reference/quickgraph-edgepredicate-2.html new file mode 100644 index 000000000..576ccdf9d --- /dev/null +++ b/reference/quickgraph-edgepredicate-2.html @@ -0,0 +1,143 @@ + + + + + EdgePredicate<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EdgePredicate<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(object, method) + +
    + Signature: (object:obj * method:nativeint) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BeginInvoke(e, callback, object) + +
    + Signature: (e:'TEdge * callback:AsyncCallback * object:obj) -> IAsyncResult
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndInvoke(result) + +
    + Signature: result:IAsyncResult -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Invoke(e) + +
    + Signature: e:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-enumerablecontract.html b/reference/quickgraph-enumerablecontract.html new file mode 100644 index 000000000..fb6574bc9 --- /dev/null +++ b/reference/quickgraph-enumerablecontract.html @@ -0,0 +1,104 @@ + + + + + EnumerableContract - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EnumerableContract

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Static members

    + + + + + + + + + + + + + + +
    Static memberDescription
    + + + All(...) + +
    + Signature: (lowerBound:int * exclusiveUpperBound:int * predicate:Func<int,bool>) -> bool
    +
    +     		+ +
    + + + ElementsNotNull(elements) + +
    + Signature: elements:IEnumerable<'T> -> bool
    + Type parameters: 'T
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-equalityextensions.html b/reference/quickgraph-equalityextensions.html new file mode 100644 index 000000000..36ca73bbf --- /dev/null +++ b/reference/quickgraph-equalityextensions.html @@ -0,0 +1,328 @@ + + + + + EqualityExtensions - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EqualityExtensions

    +

    + Namespace: QuickGraph
    +

    +
    +

    Deep equality methods for collections (arrays, dictionaries) implemented as extension methods.

    + +
    +

    Static members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Static memberDescription
    + + + Equals1(lhs, rhs, elementEquality) + +
    + Signature: (lhs:IList<'T> * rhs:IList<'T> * elementEquality:IEqualityComparer<'T>) -> bool
    + Type parameters: 'T
    +     		+

    Element-by-element array equality using a given equality comparer for elements. +Two arrays are equal iff they are both null, +or are actually the same reference, +or they have equal length and elements are equal for each index.

    + + +
    + + + Equals1(lhs, rhs) + +
    + Signature: (lhs:IList<'T> * rhs:IList<'T>) -> bool
    + Type parameters: 'T
    +     		+

    Element-by-element array equality using EqualityComparer(T).Default to equate elements. +Two arrays are equal iff they are both null, +or are actually the same reference, +or they have equal length and elements are equal for each index.

    + + +
    + + + Equals1(lhs, rhs, tolerance) + +
    + Signature: (lhs:IList<float32> * rhs:IList<float32> * tolerance:float32) -> bool
    +
    +     		+

    Specialization of ArrayEquals(T) augmented with tolerance value +to be used when equating two float values.

    + + +
    + + + Equals1(lhs, rhs, tolerance) + +
    + Signature: (lhs:IList<float> * rhs:IList<float> * tolerance:float) -> bool
    +
    +     		+

    Specialization of ArrayEquals{T} augmented with tolerance value +to be used when equating two double values.

    + + +
    + + + Equals1(lhs, rhs, elementEquality) + +
    + Signature: (lhs:'T [] * rhs:'T [] * elementEquality:IEqualityComparer<'T>) -> bool
    + Type parameters: 'T
    +     		+

    Element-by-element array equality using a given equality comparer for elements. +Two arrays are equal iff they are both null, +or are actually the same reference, +or they have equal length and elements are equal for each index.

    + + +
    + + + Equals1(lhs, rhs) + +
    + Signature: (lhs:'T [] * rhs:'T []) -> bool
    + Type parameters: 'T
    +     		+

    Element-by-element array equality using EqualityComparer(T).Default to equate elements. +Two arrays are equal iff they are both null, +or are actually the same reference, +or they have equal length and elements are equal for each index.

    + + +
    + + + Equals1(lhs, rhs, tolerance) + +
    + Signature: (lhs:float32 [] * rhs:float32 [] * tolerance:float32) -> bool
    +
    +     		+

    Specialization of ArrayEquals(T) augmented with tolerance value +to be used when equating two float values.

    + + +
    + + + Equals1(lhs, rhs, tolerance) + +
    + Signature: (lhs:float [] * rhs:float [] * tolerance:float) -> bool
    +
    +     		+

    Specialization of ArrayEquals{T} augmented with tolerance value +to be used when equating two double values.

    + + +
    + + + Equals1(lhs, rhs) + +
    + Signature: (lhs:IDictionary<'TKey,'TValue> * rhs:IDictionary<'TKey,'TValue>) -> bool
    + Type parameters: 'TKey, 'TValue
    +     		+

    Element-by-element dictionary equality using the default equality comparer for values. +Two dictionaries are equal iff they are both null, +or are actually the same reference, +or they have identical sets of keys and elements are equal for each key.

    + + +
    + + + Equals1(lhs, rhs, valueEquality) + +
    + Signature: (lhs:IDictionary<'TKey,'TValue> * rhs:IDictionary<'TKey,'TValue> * valueEquality:IEqualityComparer<'TValue>) -> bool
    + Type parameters: 'TKey, 'TValue
    +     		+

    Element-by-element dictionary equality using a given equality comparer for values. +Two dictionaries are equal iff they are both null, +or are actually the same reference, +or they have identical sets of keys and elements are equal for each key.

    + + +
    + + + Equals2(lhs, rhs) + +
    + Signature: (lhs:'T [] [] * rhs:'T [] []) -> bool
    + Type parameters: 'T
    +     		+

    2-level deep equality for array of arrays of T using EqualityComparer(T).Default as element equality. +This has '2' in its name, because one may want to do partially deep equality on multi-dimensional array type.

    + + +
    + + + Equals2(lhs, rhs, elementEquality) + +
    + Signature: (lhs:'T [] [] * rhs:'T [] [] * elementEquality:IEqualityComparer<'T>) -> bool
    + Type parameters: 'T
    +     		+

    2-level deep equality for array of arrays of T using a given element equality comparer. +This has '2' in its name, because one may want to do partially deep equality on multi-dimensional array type.

    + + +
    + + + Equals3(lhs, rhs) + +
    + Signature: (lhs:'T [] [] [] * rhs:'T [] [] []) -> bool
    + Type parameters: 'T
    +     		+

    3-level deep equality for array of arrays of arrays of T using EqualityComparer(T).Default as element equality. +This has '3' in its name, because one may want to do partially deep equality on multi-dimensional array type.

    + + +
    + + + Equals3(lhs, rhs, elementEquality) + +
    + Signature: (lhs:'T [] [] [] * rhs:'T [] [] [] * elementEquality:IEqualityComparer<'T>) -> bool
    + Type parameters: 'T
    +     		+

    3-level deep equality for array of arrays of arrays of T using a given element equality comparer. +This has '3' in its name, because one may want to do partially deep equality on multi-dimensional array type.

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-equatableedge-1.html b/reference/quickgraph-equatableedge-1.html new file mode 100644 index 000000000..e74804c02 --- /dev/null +++ b/reference/quickgraph-equatableedge-1.html @@ -0,0 +1,145 @@ + + + + + EquatableEdge<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EquatableEdge<'TVertex>

    +

    + Namespace: QuickGraph
    +

    +
    +

    An equatable edge implementation

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Equals(other) + +
    + Signature: other:EquatableEdge<'TVertex> -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Equals(obj) + +
    + Signature: obj:obj -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + GetHashCode() + +
    + Signature: unit -> int
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-equatabletermedge-1.html b/reference/quickgraph-equatabletermedge-1.html new file mode 100644 index 000000000..a5d7e9d1f --- /dev/null +++ b/reference/quickgraph-equatabletermedge-1.html @@ -0,0 +1,159 @@ + + + + + EquatableTermEdge<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EquatableTermEdge<'TVertex>

    +

    + Namespace: QuickGraph
    +

    +
    +

    An equatable term edge implementation

    + +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(...) + +
    + Signature: (source:'TVertex * target:'TVertex * sourceTerminal:int * targetTerminal:int) -> unit
    +
    +     		+ +
    + + + new(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Equals(other) + +
    + Signature: other:EquatableTermEdge<'TVertex> -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Equals(obj) + +
    + Signature: obj:obj -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + GetHashCode() + +
    + Signature: unit -> int
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-equategraphs.html b/reference/quickgraph-equategraphs.html new file mode 100644 index 000000000..a07ebd1b2 --- /dev/null +++ b/reference/quickgraph-equategraphs.html @@ -0,0 +1,126 @@ + + + + + EquateGraphs - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EquateGraphs

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Static members

    + + + + + + + + + + + + + + +
    Static memberDescription
    + + + Equate(...) + +
    + Signature: (g:IVertexAndEdgeListGraph<'V,'E> * h:IVertexAndEdgeListGraph<'V,'E> * vertexEquality:IEqualityComparer<'V> * edgeEquality:IEqualityComparer<'E>) -> bool
    + Type parameters: 'V, 'E
    +     		+ +
    + + + Equate(g, h) + +
    + Signature: (g:IVertexAndEdgeListGraph<'V,'E> * h:IVertexAndEdgeListGraph<'V,'E>) -> bool
    + Type parameters: 'V, 'E
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-floatequalitycomparer.html b/reference/quickgraph-floatequalitycomparer.html new file mode 100644 index 000000000..c98861193 --- /dev/null +++ b/reference/quickgraph-floatequalitycomparer.html @@ -0,0 +1,192 @@ + + + + + FloatEqualityComparer - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FloatEqualityComparer

    +

    + Namespace: QuickGraph
    +

    +
    +

    IEqualityComparer for floats with user-specified tolerance.

    + +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+

    Constructs FloatEqualityComparer with default tolerance.

    + + +
    + + + new(tolerance) + +
    + Signature: tolerance:float32 -> unit
    +
    +     		+

    Constructs FloatEqualityComparer with user-given tolerance.

    + + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Equals(x, y) + +
    + Signature: (x:float32 * y:float32) -> bool
    + Modifiers: abstract
    +
    +     		+

    Implements IEqualityComparer.Equals

    + + +
    + + + GetHashCode(x) + +
    + Signature: x:float32 -> int
    + Modifiers: abstract
    +
    +     		+

    Implements IEqualityComparer.GetHashCode

    + + +
    + + + Tolerance() + +
    + Signature: unit -> unit
    +
    +     		+

    Tolerance used during equality comparison

    + + +
    +

    Static members

    + + + + + + + + + + +
    Static memberDescription
    + + + DefaultTolerance + +
    + Signature: float32
    +
    +     		+

    Default tolerance

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-fsa-graphbasedfsa-dfanode-1.html b/reference/quickgraph-fsa-graphbasedfsa-dfanode-1.html new file mode 100644 index 000000000..361a5e85b --- /dev/null +++ b/reference/quickgraph-fsa-graphbasedfsa-dfanode-1.html @@ -0,0 +1,168 @@ + + + + + DfaNode<'a> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DfaNode<'a>

    +

    + Namespace: QuickGraph.FSA
    + Parent Module: GraphBasedFsa +

    +
    +
    +

    Record Fields

    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Record FieldDescription
    + + + Id + +
    + Signature: int
    +
    +     		+ + + + + +
    + + + IsFinal + +
    + Signature: bool
    +
    +     		+ + + + + +
    + + + IsStart + +
    + Signature: bool
    +
    +     		+ + + + + +
    + + + Name + +
    + Signature: string
    +
    +     		+ + + + + +
    + + + Transitions + +
    + Signature: ('a * DfaNode<'a>) list
    + Modifiers: mutable
    +
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-fsa-graphbasedfsa-edgefsa-1.html b/reference/quickgraph-fsa-graphbasedfsa-edgefsa-1.html new file mode 100644 index 000000000..03121b812 --- /dev/null +++ b/reference/quickgraph-fsa-graphbasedfsa-edgefsa-1.html @@ -0,0 +1,96 @@ + + + + + EdgeFSA<'a> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EdgeFSA<'a>

    +

    + Namespace: QuickGraph.FSA
    + Parent Module: GraphBasedFsa +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(s, e, t) + +
    + Signature: (s:int * e:int * t:Symb<'a>) -> EdgeFSA<'a>
    +
    +     		+ + + + + +

    CompiledName: .ctor

    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-fsa-graphbasedfsa-fsa-1.html b/reference/quickgraph-fsa-graphbasedfsa-fsa-1.html new file mode 100644 index 000000000..56fe50e64 --- /dev/null +++ b/reference/quickgraph-fsa-graphbasedfsa-fsa-1.html @@ -0,0 +1,524 @@ + + + + + FSA<'a> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FSA<'a>

    +

    + Namespace: QuickGraph.FSA
    + Parent Module: GraphBasedFsa +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> FSA<'a>
    +
    +     		+ + + + + +

    CompiledName: .ctor

    +
    + + + new(initial, final, transitions) + +
    + Signature: (initial:ResizeArray<int> * final:ResizeArray<int> * transitions:ResizeArray<int * Symb<'a> * int>) -> FSA<'a>
    +
    +     		+ + + + + +

    CompiledName: .ctor

    +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Complementation(...) + +
    + Signature: (alphabet:seq<'?7299> * newSmb:('?7299 -> Symb<'a>) * getChar:(Symb<'a> -> '?7299)) -> FSA<'a>
    +
    +     		+ + + + + +
    + + + Concat(fsa2) + +
    + Signature: fsa2:FSA<'a> -> FSA<'a>
    +
    +     		+ + + + + +
    + + + FinalState() + +
    + Signature: unit -> ResizeArray<int>
    +
    +     		+ + + + + +

    CompiledName: set_FinalState

    +
    + + + FinalState() + +
    + Signature: unit -> unit
    +
    +     		+ + + + + +

    CompiledName: get_FinalState

    +
    + + + InitState() + +
    + Signature: unit -> ResizeArray<int>
    +
    +     		+ + + + + +

    CompiledName: set_InitState

    +
    + + + InitState() + +
    + Signature: unit -> unit
    +
    +     		+ + + + + +

    CompiledName: get_InitState

    +
    + + + IsEmpty + +
    + Signature: bool
    +
    +     		+ + + + + +

    CompiledName: get_IsEmpty

    +
    + + + NfaToDfa() + +
    + Signature: unit -> FSA<'a>
    +
    +     		+ + + + + +
    + + + PrintToDOT(filePath, printSmb) + +
    + Signature: (filePath:string * printSmb:('a -> string) option) -> unit
    +
    +     		+ + + + + +
    + + + RemoveExtraPaths() + +
    + Signature: unit -> FSA<'a>
    +
    +     		+ + + + + +
    + + + Union(fsa2) + +
    + Signature: fsa2:FSA<'a> -> FSA<'a>
    +
    +     		+ + + + + +
    +

    Static members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Static memberDescription
    + + + Concat(fsa1, fsa2) + +
    + Signature: (fsa1:FSA<'a> * fsa2:FSA<'a>) -> FSA<'a>
    +
    +     		+ + + + + +
    + + + CreateAnyWordsFsa(fsaParams) + +
    + Signature: fsaParams:FsaParams<'?7309,'a> -> FSA<'a>
    +
    +     		+ + + + +

    Creates FSA accepting any word over the alphabet, passed as a parameter through FsaParams

    + + +
    + + + CustomizableReplace(...) + +
    + Signature: (fsa1:FSA<'a> * fsa2:FSA<'a> * fsa3:FSA<'a> * smb1:'?7296 * smb2:'?7296 * getChar:(Symb<'a> -> '?7296) * newSmb:('?7296 -> Symb<'a>) * equalSmbl:('a -> 'a -> bool)) -> ReplaceAppetite * ReplaceOrder * ReplaceAmount -> FSA<'a>
    +
    +     		+ + + + + +
    + + + GreedyReplace(...) + +
    + Signature: (fsa1:FSA<'a> * fsa2:FSA<'a> * fsa3:FSA<'a> * smb1:'?7290 * smb2:'?7290 * getChar:(Symb<'a> -> '?7290) * newSmb:('?7290 -> Symb<'a>) * equalSmbl:('a -> 'a -> bool)) -> FSA<'a>
    +
    +     		+ + + + + +
    + + + Intersection(fsa1, fsa2, equalSmbl) + +
    + Signature: (fsa1:FSA<'a> * fsa2:FSA<'a> * equalSmbl:('a -> 'a -> bool)) -> FSA<'a>
    +
    +     		+ + + + + +
    + + + IsSubFsa(a1, a2, fsaParams) + +
    + Signature: (a1:FSA<'a> * a2:FSA<'a> * fsaParams:FsaParams<'?7306,'a>) -> bool
    +
    +     		+ + + + +

    Checks if the language accepted by FSA a1 is a sublanguage +of the language accepted by FSA a2. +Expects any fsa

    + + +
    + + + ReluctantReplace(...) + +
    + Signature: (fsa1:FSA<'a> * fsa2:FSA<'a> * fsa3:FSA<'a> * smb1:'?7293 * smb2:'?7293 * getChar:(Symb<'a> -> '?7293) * newSmb:('?7293 -> Symb<'a>) * equalSmbl:('a -> 'a -> bool)) -> FSA<'a>
    +
    +     		+ + + + + +
    + + + Replace(...) + +
    + Signature: (fsa1:FSA<'a> * fsa2:FSA<'a> * fsa3:FSA<'a> * smb1:'?7287 * smb2:'?7287 * getChar:(Symb<'a> -> '?7287) * newSmb:('?7287 -> Symb<'a>) * equalSmbl:('a -> 'a -> bool)) -> FSA<'a>
    +
    +     		+ + + + +

    fsa1 -- original strings; fsa2 -- match strings; fsa3 -- replacement strings, FSAs are not empty

    + + +
    + + + Union(fsa1, fsa2) + +
    + Signature: (fsa1:FSA<'a> * fsa2:FSA<'a>) -> FSA<'a>
    +
    +     		+ + + + + +
    + + + Widen(fsa1, fsa2, fsaParams) + +
    + Signature: (fsa1:FSA<'a> * fsa2:FSA<'a> * fsaParams:FsaParams<'?7312,'a>) -> FSA<'a>
    +
    +     		+ + + + +

    Widening operator for FSA

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-fsa-graphbasedfsa-fsaparams-2.html b/reference/quickgraph-fsa-graphbasedfsa-fsaparams-2.html new file mode 100644 index 000000000..2ddc6c09a --- /dev/null +++ b/reference/quickgraph-fsa-graphbasedfsa-fsaparams-2.html @@ -0,0 +1,185 @@ + + + + + FsaParams<'a, 'b> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FsaParams<'a, 'b>

    +

    + Namespace: QuickGraph.FSA
    + Parent Module: GraphBasedFsa +

    +
    +
    +

    Record Fields

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Record FieldDescription
    + + + Alphabet + +
    + Signature: HashSet<'a>
    +
    +     		+ + + + + +
    + + + GetChar + +
    + Signature: Symb<'b> -> 'a
    +
    +     		+ + + + + +
    + + + NewSymbol + +
    + Signature: 'a -> Symb<'b>
    +
    +     		+ + + + + +
    + + + SeparatorSmbl1 + +
    + Signature: 'a
    +
    +     		+ + + + + +
    + + + SeparatorSmbl2 + +
    + Signature: 'a
    +
    +     		+ + + + + +
    + + + SymbolsAreEqual + +
    + Signature: 'b -> 'b -> bool
    +
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-fsa-graphbasedfsa-multimap-2.html b/reference/quickgraph-fsa-graphbasedfsa-multimap-2.html new file mode 100644 index 000000000..87e1f9d4e --- /dev/null +++ b/reference/quickgraph-fsa-graphbasedfsa-multimap-2.html @@ -0,0 +1,149 @@ + + + + + MultiMap<'a, 'b> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    MultiMap<'a, 'b>

    +

    + Namespace: QuickGraph.FSA
    + Parent Module: GraphBasedFsa +

    +
    +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Comparer + +
    + Signature: IEqualityComparer<'a>
    +
    +     		+ +
    + + + Count + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + [()] + +
    + Signature: unit -> 'a
    + Modifiers: abstract
    +
    +     		+ +
    + + + Keys + +
    + Signature: KeyCollection<'a,ResizeArray<'b>>
    +
    +     		+ +
    + + + Values + +
    + Signature: ValueCollection<'a,ResizeArray<'b>>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-fsa-graphbasedfsa-nodesetset.html b/reference/quickgraph-fsa-graphbasedfsa-nodesetset.html new file mode 100644 index 000000000..7f9bdcd17 --- /dev/null +++ b/reference/quickgraph-fsa-graphbasedfsa-nodesetset.html @@ -0,0 +1,137 @@ + + + + + NodeSetSet - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    NodeSetSet

    +

    + Namespace: QuickGraph.FSA
    + Parent Module: GraphBasedFsa +

    +
    +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Count + +
    + Signature: int
    +
    +     		+ +

    CompiledName: get_Count

    +
    + + + IsEmpty + +
    + Signature: bool
    +
    +     		+ +

    CompiledName: get_IsEmpty

    +
    + + + MaximumElement + +
    + Signature: NfaNodeIdSet
    +
    +     		+ +

    CompiledName: get_MaximumElement

    +
    + + + MinimumElement + +
    + Signature: NfaNodeIdSet
    +
    +     		+ +

    CompiledName: get_MinimumElement

    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-fsa-graphbasedfsa-replaceamount.html b/reference/quickgraph-fsa-graphbasedfsa-replaceamount.html new file mode 100644 index 000000000..97b348800 --- /dev/null +++ b/reference/quickgraph-fsa-graphbasedfsa-replaceamount.html @@ -0,0 +1,113 @@ + + + + + ReplaceAmount - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ReplaceAmount

    +

    + Namespace: QuickGraph.FSA
    + Parent Module: GraphBasedFsa +

    +
    +
    +

    Union Cases

    + + + + + + + + + + + + + + +
    Union CaseDescription
    + + + All + +
    + Signature:
    +
    +     		+ + + + + +
    + + + OnlyFirst + +
    + Signature:
    +
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-fsa-graphbasedfsa-replaceappetite.html b/reference/quickgraph-fsa-graphbasedfsa-replaceappetite.html new file mode 100644 index 000000000..e4e42f4c0 --- /dev/null +++ b/reference/quickgraph-fsa-graphbasedfsa-replaceappetite.html @@ -0,0 +1,131 @@ + + + + + ReplaceAppetite - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ReplaceAppetite

    +

    + Namespace: QuickGraph.FSA
    + Parent Module: GraphBasedFsa +

    +
    +
    +

    Union Cases

    + + + + + + + + + + + + + + + + + + +
    Union CaseDescription
    + + + Declarative + +
    + Signature:
    +
    +     		+ + + + + +
    + + + Greedy + +
    + Signature:
    +
    +     		+ + + + + +
    + + + Reluctant + +
    + Signature:
    +
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-fsa-graphbasedfsa-replaceorder.html b/reference/quickgraph-fsa-graphbasedfsa-replaceorder.html new file mode 100644 index 000000000..1c7d40457 --- /dev/null +++ b/reference/quickgraph-fsa-graphbasedfsa-replaceorder.html @@ -0,0 +1,113 @@ + + + + + ReplaceOrder - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ReplaceOrder

    +

    + Namespace: QuickGraph.FSA
    + Parent Module: GraphBasedFsa +

    +
    +
    +

    Union Cases

    + + + + + + + + + + + + + + +
    Union CaseDescription
    + + + Anymost + +
    + Signature:
    +
    +     		+ + + + + +
    + + + Leftmost + +
    + Signature:
    +
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-fsa-graphbasedfsa-replacesemantics.html b/reference/quickgraph-fsa-graphbasedfsa-replacesemantics.html new file mode 100644 index 000000000..0c0df49c4 --- /dev/null +++ b/reference/quickgraph-fsa-graphbasedfsa-replacesemantics.html @@ -0,0 +1,69 @@ + + + + + ReplaceSemantics - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ReplaceSemantics

    +

    + Namespace: QuickGraph.FSA
    + Parent Module: GraphBasedFsa +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-fsa-graphbasedfsa-symb-1.html b/reference/quickgraph-fsa-graphbasedfsa-symb-1.html new file mode 100644 index 000000000..e42588651 --- /dev/null +++ b/reference/quickgraph-fsa-graphbasedfsa-symb-1.html @@ -0,0 +1,113 @@ + + + + + Symb<'a> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    Symb<'a>

    +

    + Namespace: QuickGraph.FSA
    + Parent Module: GraphBasedFsa +

    +
    +
    +

    Union Cases

    + + + + + + + + + + + + + + +
    Union CaseDescription
    + + + Eps + +
    + Signature:
    +
    +     		+ + + + + +
    + + + Smbl('a) + +
    + Signature: 'a
    +
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-fsa-graphbasedfsa.html b/reference/quickgraph-fsa-graphbasedfsa.html new file mode 100644 index 000000000..1f010fadf --- /dev/null +++ b/reference/quickgraph-fsa-graphbasedfsa.html @@ -0,0 +1,246 @@ + + + + + GraphBasedFsa - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphBasedFsa

    +

    + Namespace: QuickGraph.FSA
    +

    +
    +
    + + +

    Nested types and modules

    +
    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    TypeDescription
    + DfaNode<'a> +
    + EdgeFSA<'a> +
    + FSA<'a> +
    + FsaParams<'a, 'b> +
    + MultiMap<'a, 'b> +
    + NodeSetSet +
    + ReplaceAmount +
    + ReplaceAppetite +
    + ReplaceOrder +
    + ReplaceSemantics +
    + Symb<'a> +
    + +
    + +

    Functions and values

    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Function or valueDescription
    + + + AddToMultiMap trDict a b + +
    + Signature: trDict:MultiMap<'?7190,'?7191> -> a:'?7190 -> b:'?7191 -> unit
    + Type parameters: '?7190, '?7191
    +     		+ + + + + +
    + + + fsaToDot (...) + +
    + Signature: strs:seq<string> -> initState:ResizeArray<int> -> finalState:ResizeArray<int> -> filePrintPath:string -> unit
    +
    +     		+ + + + + +
    + + + newDfaNodeId + +
    + Signature: unit -> int
    +
    +     		+ + + + + +
    + + + reset + +
    + Signature: unit -> unit
    +
    +     		+ + + + + +
    + + + setVertexRemoved fsa startV + +
    + Signature: fsa:'?7193 -> startV:'?7194 -> seq<'?7194>
    + Type parameters: '?7193, '?7194, '?7195
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-fst-fsttable-edge-2.html b/reference/quickgraph-fst-fsttable-edge-2.html new file mode 100644 index 000000000..14616e262 --- /dev/null +++ b/reference/quickgraph-fst-fsttable-edge-2.html @@ -0,0 +1,176 @@ + + + + + Edge<'iType, 'oType> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    Edge<'iType, 'oType>

    +

    + Namespace: QuickGraph.FST
    + Parent Module: FstTable +

    +
    +
    +

    Record Fields

    + + + + + + + + + + + + + + + + + + + + + + +
    Record FieldDescription
    + + + EndV + +
    + Signature: int
    +
    +     		+ + + + + +
    + + + InSymb + +
    + Signature: 'iType
    +
    +     		+ + + + + +
    + + + OutSymb + +
    + Signature: 'oType
    +
    +     		+ + + + + +
    + + + StartV + +
    + Signature: int
    +
    +     		+ + + + + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(startV, inSymb, outSymb, endV) + +
    + Signature: (startV:int * inSymb:'iType * outSymb:'oType * endV:int) -> Edge<'iType,'oType>
    +
    +     		+ + + + + +

    CompiledName: .ctor

    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-fst-fsttable-fst-2.html b/reference/quickgraph-fst-fsttable-fst-2.html new file mode 100644 index 000000000..a08b96617 --- /dev/null +++ b/reference/quickgraph-fst-fsttable-fst-2.html @@ -0,0 +1,234 @@ + + + + + FST<'iType, 'oType> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FST<'iType, 'oType>

    +

    + Namespace: QuickGraph.FST
    + Parent Module: FstTable +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> FST<'iType,'oType>
    +
    +     		+ + + + + +

    CompiledName: .ctor

    +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + FinalState() + +
    + Signature: unit -> ResizeArray<int>
    +
    +     		+ + + + + +

    CompiledName: set_FinalState

    +
    + + + FinalState() + +
    + Signature: unit -> unit
    +
    +     		+ + + + + +

    CompiledName: get_FinalState

    +
    + + + Init(...) + +
    + Signature: (initState:ResizeArray<int> * tableOfTransitions:ResizeArray<ResizeArray<int * int>> * arrayOfFunction:ResizeArray<('iType -> 'oType)> * finalState:ResizeArray<int>) -> unit
    +
    +     		+ + + + + +
    + + + InitState() + +
    + Signature: unit -> ResizeArray<int>
    +
    +     		+ + + + + +

    CompiledName: set_InitState

    +
    + + + InitState() + +
    + Signature: unit -> unit
    +
    +     		+ + + + + +

    CompiledName: get_InitState

    +
    + + + LoadFromSimpleFST(fst) + +
    + Signature: fst:SimpleFST<'iType,'oType> -> unit
    +
    +     		+ + + + + +
    + + + printFST(filePath) + +
    + Signature: filePath:string -> unit
    +
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-fst-fsttable-simplefst-2.html b/reference/quickgraph-fst-fsttable-simplefst-2.html new file mode 100644 index 000000000..6c17b5073 --- /dev/null +++ b/reference/quickgraph-fst-fsttable-simplefst-2.html @@ -0,0 +1,158 @@ + + + + + SimpleFST<'iType, 'oType> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    SimpleFST<'iType, 'oType>

    +

    + Namespace: QuickGraph.FST
    + Parent Module: FstTable +

    +
    +
    +

    Record Fields

    + + + + + + + + + + + + + + + + + + +
    Record FieldDescription
    + + + Edges + +
    + Signature: ResizeArray<Edge<'iType,'oType>>
    +
    +     		+ + + + + +
    + + + FinalState + +
    + Signature: ResizeArray<int>
    +
    +     		+ + + + + +
    + + + InitState + +
    + Signature: ResizeArray<int>
    +
    +     		+ + + + + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(initState, edges, finalState) + +
    + Signature: (initState:ResizeArray<int> * edges:ResizeArray<Edge<'iType,'oType>> * finalState:ResizeArray<int>) -> SimpleFST<'iType,'oType>
    +
    +     		+ + + + + +

    CompiledName: .ctor

    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-fst-fsttable.html b/reference/quickgraph-fst-fsttable.html new file mode 100644 index 000000000..975ca36e4 --- /dev/null +++ b/reference/quickgraph-fst-fsttable.html @@ -0,0 +1,144 @@ + + + + + FstTable - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FstTable

    +

    + Namespace: QuickGraph.FST
    +

    +
    +
    + + +

    Nested types and modules

    +
    + + + + + + + + + + + + + + + + + + +
    TypeDescription
    + Edge<'iType, 'oType> +
    + FST<'iType, 'oType> +
    + SimpleFST<'iType, 'oType> +
    + +
    + +

    Functions and values

    + + + + + + + + + + + + + + +
    Function or valueDescription
    + + + fstToDot (...) + +
    + Signature: strs:seq<string> -> initState:ResizeArray<int> -> finalState:ResizeArray<int> -> filePrintPath:string -> unit
    +
    +     		+ + + + + +
    + + + maxVal + +
    + Signature: uint64
    +
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-fst-graphbasedfst-edgefst-2.html b/reference/quickgraph-fst-graphbasedfst-edgefst-2.html new file mode 100644 index 000000000..34c81b0e4 --- /dev/null +++ b/reference/quickgraph-fst-graphbasedfst-edgefst-2.html @@ -0,0 +1,96 @@ + + + + + EdgeFST<'a, 'b> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EdgeFST<'a, 'b>

    +

    + Namespace: QuickGraph.FST
    + Parent Module: GraphBasedFst +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(s, e, t) + +
    + Signature: (s:int * e:int * t:(Symb<'a> * Symb<'b>)) -> EdgeFST<'a,'b>
    +
    +     		+ + + + + +

    CompiledName: .ctor

    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-fst-graphbasedfst-fst-2.html b/reference/quickgraph-fst-graphbasedfst-fst-2.html new file mode 100644 index 000000000..6f80a3bf1 --- /dev/null +++ b/reference/quickgraph-fst-graphbasedfst-fst-2.html @@ -0,0 +1,430 @@ + + + + + FST<'iType, 'oType> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FST<'iType, 'oType>

    +

    + Namespace: QuickGraph.FST
    + Parent Module: GraphBasedFst +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> FST<'iType,'oType>
    +
    +     		+ + + + + +

    CompiledName: .ctor

    +
    + + + new(initial, final, transitions) + +
    + Signature: (initial:ResizeArray<int> * final:ResizeArray<int> * transitions:ResizeArray<int * (Symb<'iType> * Symb<'oType>) * int>) -> FST<'iType,'oType>
    +
    +     		+ + + + + +

    CompiledName: .ctor

    +
    + + + new(initial, final, transitions) + +
    + Signature: (initial:ResizeArray<int> * final:ResizeArray<int> * transitions:ResizeArray<EdgeFST<'iType,'oType>>) -> FST<'iType,'oType>
    +
    +     		+ + + + + +

    CompiledName: .ctor

    +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + CachedEdges + +
    + Signature: ResizeArray<EdgeFST<'iType,'oType>>
    +
    +     		+ + + + + +

    CompiledName: get_CachedEdges

    +
    + + + Concat(fst2) + +
    + Signature: fst2:FST<'iType,'oType> -> FST<'iType,'oType>
    +
    +     		+ + + + + +
    + + + FinalState() + +
    + Signature: unit -> ResizeArray<int>
    +
    +     		+ + + + + +

    CompiledName: set_FinalState

    +
    + + + FinalState() + +
    + Signature: unit -> unit
    +
    +     		+ + + + + +

    CompiledName: get_FinalState

    +
    + + + InitState() + +
    + Signature: unit -> ResizeArray<int>
    +
    +     		+ + + + + +

    CompiledName: set_InitState

    +
    + + + InitState() + +
    + Signature: unit -> unit
    +
    +     		+ + + + + +

    CompiledName: get_InitState

    +
    + + + IsEmpty + +
    + Signature: bool
    +
    +     		+ + + + + +

    CompiledName: get_IsEmpty

    +
    + + + PrintToDOT(filePath, printSmb) + +
    + Signature: (filePath:string * printSmb:('iType -> string) option) -> unit
    +
    +     		+ + + + + +
    + + + RecachEdges() + +
    + Signature: unit -> unit
    +
    +     		+ + + + + +
    + + + Union(fst2) + +
    + Signature: fst2:FST<'iType,'oType> -> FST<'iType,'oType>
    +
    +     		+ + + + + +
    +

    Static members

    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Static memberDescription
    + + + Compose(fst1, fst2, alphabet) + +
    + Signature: (fst1:FST<'?7661,'?7662> * fst2:FST<'?7663,'?7664> * alphabet:HashSet<Symb<'?7662>>) -> Test<FST<'?7661,'?7664>,Symb<'?7661> []>
    + Type parameters: '?7663, '?7664
    +     		+ + + + + +
    + + + Concat(fst1, fst2) + +
    + Signature: (fst1:FST<'iType,'oType> * fst2:FST<'iType,'oType>) -> FST<'iType,'oType>
    +
    +     		+ + + + + +
    + + + FSAtoFST(fsa, transform, smblEOF) + +
    + Signature: (fsa:FSA<'?7650> * transform:(Symb<'?7650> -> Symb<'iType> * Symb<'oType>) * smblEOF:Symb<'?7650>) -> FST<'iType,'oType>
    +
    +     		+ + + + +

    for FSA, which are not empty

    + + +
    + + + oldCompose(fst1, fst2, alphabet) + +
    + Signature: (fst1:FST<'?7654,'?7655> * fst2:FST<'?7656,'?7657> * alphabet:HashSet<Symb<'?7655>>) -> Test<FST<'?7654,'?7657>,Symb<'?7654> []>
    + Type parameters: '?7656, '?7657
    +     		+ + + + +

    for FSTs, which are not empty

    + + +
    + + + Union(fst1, fst2) + +
    + Signature: (fst1:FST<'iType,'oType> * fst2:FST<'iType,'oType>) -> FST<'iType,'oType>
    +
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-fst-graphbasedfst-test-2.html b/reference/quickgraph-fst-graphbasedfst-test-2.html new file mode 100644 index 000000000..c9290187e --- /dev/null +++ b/reference/quickgraph-fst-graphbasedfst-test-2.html @@ -0,0 +1,113 @@ + + + + + Test<'success, 'error> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    Test<'success, 'error>

    +

    + Namespace: QuickGraph.FST
    + Parent Module: GraphBasedFst +

    +
    +
    +

    Union Cases

    + + + + + + + + + + + + + + +
    Union CaseDescription
    + + + Error('error) + +
    + Signature: 'error
    +
    +     		+ + + + + +
    + + + Success('success) + +
    + Signature: 'success
    +
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-fst-graphbasedfst.html b/reference/quickgraph-fst-graphbasedfst.html new file mode 100644 index 000000000..943957c08 --- /dev/null +++ b/reference/quickgraph-fst-graphbasedfst.html @@ -0,0 +1,144 @@ + + + + + GraphBasedFst - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphBasedFst

    +

    + Namespace: QuickGraph.FST
    +

    +
    +
    + + +

    Nested types and modules

    +
    + + + + + + + + + + + + + + + + + + +
    TypeDescription
    + EdgeFST<'a, 'b> +
    + FST<'iType, 'oType> +
    + Test<'success, 'error> +
    + +
    + +

    Functions and values

    + + + + + + + + + + + + + + +
    Function or valueDescription
    + + + getReachableV fst startV + +
    + Signature: fst:'?7577 -> startV:'?7578 -> ResizeArray<'?7578>
    + Type parameters: '?7577, '?7578, '?7579
    +     		+ + + + + +
    + + + setVertexRemoved fst startV + +
    + Signature: fst:'?7573 -> startV:'?7574 -> ResizeArray<'?7574>
    + Type parameters: '?7573, '?7574, '?7575
    +     		+ + + + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-glee-gleedefaultgraphpopulator-2.html b/reference/quickgraph-glee-gleedefaultgraphpopulator-2.html new file mode 100644 index 000000000..dfbdfb644 --- /dev/null +++ b/reference/quickgraph-glee-gleedefaultgraphpopulator-2.html @@ -0,0 +1,90 @@ + + + + + GleeDefaultGraphPopulator<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GleeDefaultGraphPopulator<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Glee
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:IEdgeListGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-glee-gleeedgeeventargs-2.html b/reference/quickgraph-glee-gleeedgeeventargs-2.html new file mode 100644 index 000000000..9c8fbffa6 --- /dev/null +++ b/reference/quickgraph-glee-gleeedgeeventargs-2.html @@ -0,0 +1,112 @@ + + + + + GleeEdgeEventArgs<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GleeEdgeEventArgs<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Glee
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(edge, gedge) + +
    + Signature: (edge:'TEdge * gedge:Edge) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + GEdge + +
    + Signature: Edge
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-glee-gleeedgeeventhandler-2.html b/reference/quickgraph-glee-gleeedgeeventhandler-2.html new file mode 100644 index 000000000..6b822639c --- /dev/null +++ b/reference/quickgraph-glee-gleeedgeeventhandler-2.html @@ -0,0 +1,143 @@ + + + + + GleeEdgeEventHandler<'Vertex, 'Edge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GleeEdgeEventHandler<'Vertex, 'Edge>

    +

    + Namespace: QuickGraph.Glee
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(object, method) + +
    + Signature: (object:obj * method:nativeint) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BeginInvoke(sender, e, callback, object) + +
    + Signature: (sender:obj * e:GleeEdgeEventArgs<'Vertex,'Edge> * callback:AsyncCallback * object:obj) -> IAsyncResult
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndInvoke(result) + +
    + Signature: result:IAsyncResult -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + Invoke(sender, e) + +
    + Signature: (sender:obj * e:GleeEdgeEventArgs<'Vertex,'Edge>) -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-glee-gleegraphextensions.html b/reference/quickgraph-glee-gleegraphextensions.html new file mode 100644 index 000000000..ceae2b3bc --- /dev/null +++ b/reference/quickgraph-glee-gleegraphextensions.html @@ -0,0 +1,160 @@ + + + + + GleeGraphExtensions - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GleeGraphExtensions

    +

    + Namespace: QuickGraph.Glee
    +

    +
    +
    +

    Static members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Static memberDescription
    + + + CreateGleePopulator(...) + +
    + Signature: (visitedGraph:IEdgeListGraph<'TVertex,'TEdge> * formatProvider:IFormatProvider * format:string) -> GleeGraphPopulator<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + CreateGleePopulator(visitedGraph) + +
    + Signature: visitedGraph:IEdgeListGraph<'TVertex,'TEdge> -> GleeGraphPopulator<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + CreateIdentifiableGleePopulator(...) + +
    + Signature: (visitedGraph:IEdgeListGraph<'TVertex,'TEdge> * vertexIdentities:VertexIdentity<'TVertex>) -> GleeGraphPopulator<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + ShowDialog(graph) + +
    + Signature: graph:Graph -> unit
    +
    +     		+ +
    + + + ToGleeGraph(...) + +
    + Signature: (visitedGraph:IEdgeListGraph<'TVertex,'TEdge> * nodeAdded:GleeVertexNodeEventHandler<'TVertex> * edgeAdded:GleeEdgeEventHandler<'TVertex,'TEdge>) -> Graph
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + ToIdentifiableGleeGraph(...) + +
    + Signature: (visitedGraph:IEdgeListGraph<'TVertex,'TEdge> * vertexIdentities:VertexIdentity<'TVertex> * nodeAdded:GleeVertexNodeEventHandler<'TVertex> * edgeAdded:GleeEdgeEventHandler<'TVertex,'TEdge>) -> Graph
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-glee-gleegraphpopulator-2.html b/reference/quickgraph-glee-gleegraphpopulator-2.html new file mode 100644 index 000000000..4002be421 --- /dev/null +++ b/reference/quickgraph-glee-gleegraphpopulator-2.html @@ -0,0 +1,140 @@ + + + + + GleeGraphPopulator<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GleeGraphPopulator<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Glee
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:IEdgeListGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + EdgeAdded + +
    + Signature: IEvent<GleeEdgeEventHandler<'TVertex,'TEdge>,GleeEdgeEventArgs<'TVertex,'TEdge>>
    +
    +     		+ +
    + + + GleeGraph + +
    + Signature: Graph
    +
    +     		+ +
    + + + NodeAdded + +
    + Signature: IEvent<GleeVertexNodeEventHandler<'TVertex>,GleeVertexEventArgs<'TVertex>>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-glee-gleeindentifiablegraphpopulator-2.html b/reference/quickgraph-glee-gleeindentifiablegraphpopulator-2.html new file mode 100644 index 000000000..c64ad612d --- /dev/null +++ b/reference/quickgraph-glee-gleeindentifiablegraphpopulator-2.html @@ -0,0 +1,90 @@ + + + + + GleeIndentifiableGraphPopulator<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GleeIndentifiableGraphPopulator<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Glee
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph, vertexIdentities) + +
    + Signature: (visitedGraph:IEdgeListGraph<'TVertex,'TEdge> * vertexIdentities:VertexIdentity<'TVertex>) -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-glee-gleetostringgraphpopulator-2.html b/reference/quickgraph-glee-gleetostringgraphpopulator-2.html new file mode 100644 index 000000000..9d7f95ff0 --- /dev/null +++ b/reference/quickgraph-glee-gleetostringgraphpopulator-2.html @@ -0,0 +1,126 @@ + + + + + GleeToStringGraphPopulator<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GleeToStringGraphPopulator<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Glee
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(...) + +
    + Signature: (visitedGraph:IEdgeListGraph<'TVertex,'TEdge> * formatProvider:IFormatProvider * format:string) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Format + +
    + Signature: string
    +
    +     		+ +
    + + + FormatProvider + +
    + Signature: IFormatProvider
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-glee-gleevertexeventargs-1.html b/reference/quickgraph-glee-gleevertexeventargs-1.html new file mode 100644 index 000000000..b36f2fb8f --- /dev/null +++ b/reference/quickgraph-glee-gleevertexeventargs-1.html @@ -0,0 +1,112 @@ + + + + + GleeVertexEventArgs<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GleeVertexEventArgs<'TVertex>

    +

    + Namespace: QuickGraph.Glee
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(vertex, node) + +
    + Signature: (vertex:'TVertex * node:Node) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Node + +
    + Signature: Node
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-glee-gleevertexnodeeventhandler-1.html b/reference/quickgraph-glee-gleevertexnodeeventhandler-1.html new file mode 100644 index 000000000..ad3dc8a30 --- /dev/null +++ b/reference/quickgraph-glee-gleevertexnodeeventhandler-1.html @@ -0,0 +1,143 @@ + + + + + GleeVertexNodeEventHandler<'Vertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GleeVertexNodeEventHandler<'Vertex>

    +

    + Namespace: QuickGraph.Glee
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(object, method) + +
    + Signature: (object:obj * method:nativeint) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BeginInvoke(...) + +
    + Signature: (sender:obj * args:GleeVertexEventArgs<'Vertex> * callback:AsyncCallback * object:obj) -> IAsyncResult
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndInvoke(result) + +
    + Signature: result:IAsyncResult -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + Invoke(sender, args) + +
    + Signature: (sender:obj * args:GleeVertexEventArgs<'Vertex>) -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphcolor.html b/reference/quickgraph-graphcolor.html new file mode 100644 index 000000000..ed05cd115 --- /dev/null +++ b/reference/quickgraph-graphcolor.html @@ -0,0 +1,70 @@ + + + + + GraphColor - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphColor

    +

    + Namespace: QuickGraph
    +

    +
    +

    Colors used in vertex coloring algorithms

    + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphextensions.html b/reference/quickgraph-graphextensions.html new file mode 100644 index 000000000..6b3b96e70 --- /dev/null +++ b/reference/quickgraph-graphextensions.html @@ -0,0 +1,578 @@ + + + + + GraphExtensions - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphExtensions

    +

    + Namespace: QuickGraph
    +

    +
    +

    Extension methods for populating graph datastructures

    + +
    +

    Static members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Static memberDescription
    + + + ToAdjacencyGraph(edges) + +
    + Signature: (edges:'TVertex [] []) -> AdjacencyGraph<'TVertex,SEquatableEdge<'TVertex>>
    + Type parameters: 'TVertex
    +     		+

    Converts a jagged array of sources and targets into a graph

    + + +
    + + + ToAdjacencyGraph(...) + +
    + Signature: (edges:IEnumerable<'TEdge> * allowParallelEdges:bool) -> AdjacencyGraph<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Converts a set of edges into an adjacency graph.

    + + +
    + + + ToAdjacencyGraph(edges) + +
    + Signature: edges:IEnumerable<'TEdge> -> AdjacencyGraph<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Converts a set of edges into an adjacency graph.

    + + +
    + + + ToAdjacencyGraph(...) + +
    + Signature: (vertices:IEnumerable<'TVertex> * outEdgesFactory:Func<'TVertex,IEnumerable<'TEdge>> * allowParallelEdges:bool) -> AdjacencyGraph<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Converts a set of vertices into an adjacency graph, +using an edge factory.

    + + +
    + + + ToAdjacencyGraph(...) + +
    + Signature: (vertices:IEnumerable<'TVertex> * outEdgesFactory:Func<'TVertex,IEnumerable<'TEdge>>) -> AdjacencyGraph<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Converts a set of vertices into an adjacency graph, +using an edge factory.

    + + +
    + + + ToAdjacencyGraph(vertexPairs) + +
    + Signature: vertexPairs:IEnumerable<SEquatableEdge<'TVertex>> -> AdjacencyGraph<'TVertex,SEquatableEdge<'TVertex>>
    + Type parameters: 'TVertex
    +     		+

    Converts a sequence of vertex pairs into an adjancency graph

    + + +
    + + + ToArrayAdjacencyGraph(graph) + +
    + Signature: graph:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> ArrayAdjacencyGraph<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Creates an immutable array adjacency graph from the input graph

    + + +
    + + + ToArrayBidirectionalGraph(graph) + +
    + Signature: graph:IBidirectionalGraph<'TVertex,'TEdge> -> ArrayBidirectionalGraph<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Creates an immutable array bidirectional graph from the input graph

    + + +
    + + + ToArrayUndirectedGraph(graph) + +
    + Signature: graph:IUndirectedGraph<'TVertex,'TEdge> -> ArrayUndirectedGraph<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Creates an immutable array undirected graph from the input graph

    + + +
    + + + ToBidirectionalGraph(graph) + +
    + Signature: graph:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> IBidirectionalGraph<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Wraps a adjacency graph (out-edge only) into a bidirectional graph.

    + + +
    + + + ToBidirectionalGraph(...) + +
    + Signature: (edges:IEnumerable<'TEdge> * allowParallelEdges:bool) -> BidirectionalGraph<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Converts a set of edges into a bidirectional graph.

    + + +
    + + + ToBidirectionalGraph(edges) + +
    + Signature: edges:IEnumerable<'TEdge> -> BidirectionalGraph<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Converts a set of edges into a bidirectional graph.

    + + +
    + + + ToBidirectionalGraph(...) + +
    + Signature: (vertices:IEnumerable<'TVertex> * outEdgesFactory:Func<'TVertex,IEnumerable<'TEdge>> * allowParallelEdges:bool) -> BidirectionalGraph<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Converts a set of vertices into a bidirectional graph, +using an edge factory.

    + + +
    + + + ToBidirectionalGraph(...) + +
    + Signature: (vertices:IEnumerable<'TVertex> * outEdgesFactory:Func<'TVertex,IEnumerable<'TEdge>>) -> BidirectionalGraph<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Converts a set of vertices into a bidirectional graph, +using an edge factory

    + + +
    + + + ToBidirectionalGraph(vertexPairs) + +
    + Signature: vertexPairs:IEnumerable<SEquatableEdge<'TVertex>> -> BidirectionalGraph<'TVertex,SEquatableEdge<'TVertex>>
    + Type parameters: 'TVertex
    +     		+

    Converts a sequence of vertex pairs into an bidirectional graph

    + + +
    + + + ToCompressedRowGraph(visitedGraph) + +
    + Signature: visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> CompressedSparseRowGraph<'TVertex>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Creates an immutable compressed row graph representation of the visited graph

    + + +
    + + + ToDelegateBidirectionalIncidenceGraph(...) + +
    + Signature: (tryGetOutEdges:TryFunc<'TVertex,IEnumerable<'TEdge>> * tryGetInEdges:TryFunc<'TVertex,IEnumerable<'TEdge>>) -> DelegateBidirectionalIncidenceGraph<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Creates an instance of DelegateIncidenceGraph.

    + + +
    + + + ToDelegateIncidenceGraph(tryGetOutEdges) + +
    + Signature: tryGetOutEdges:TryFunc<'TVertex,IEnumerable<'TEdge>> -> DelegateIncidenceGraph<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Creates an instance of DelegateIncidenceGraph.

    + + +
    + + + ToDelegateIncidenceGraph(getOutEdges) + +
    + Signature: getOutEdges:Func<'TVertex,IEnumerable<'TEdge>> -> DelegateIncidenceGraph<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Creates an instance of DelegateIncidenceGraph.

    + + +
    + + + ToDelegateUndirectedGraph(dictionary) + +
    + Signature: dictionary:IDictionary<'TVertex,'TValue> -> DelegateVertexAndEdgeListGraph<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge, 'TValue
    +     		+

    Wraps a dictionary into an undirected list graph

    + + +
    + + + ToDelegateUndirectedGraph(...) + +
    + Signature: (dictionary:IDictionary<'TVertex,'TValue> * keyValueToOutEdges:Converter<KeyValuePair<'TVertex,'TValue>,IEnumerable<'TEdge>>) -> DelegateVertexAndEdgeListGraph<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge, 'TValue
    +     		+

    Wraps a dictionary into an undirected graph

    + + +
    + + + ToDelegateUndirectedGraph(...) + +
    + Signature: (vertices:IEnumerable<'TVertex> * tryGetAdjacentEdges:TryFunc<'TVertex,IEnumerable<'TEdge>>) -> DelegateUndirectedGraph<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Creates an instance of DelegateIncidenceGraph.

    + + +
    + + + ToDelegateUndirectedGraph(...) + +
    + Signature: (vertices:IEnumerable<'TVertex> * getAdjacentEdges:Func<'TVertex,IEnumerable<'TEdge>>) -> DelegateUndirectedGraph<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Creates an instance of DelegateIncidenceGraph.

    + + +
    + + + ToDelegateVertexAndEdgeListGraph(...) + +
    + Signature: (vertices:IEnumerable<'TVertex> * tryGetOutEdges:TryFunc<'TVertex,IEnumerable<'TEdge>>) -> DelegateVertexAndEdgeListGraph<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Creates an instance of DelegateIncidenceGraph.

    + + +
    + + + ToDelegateVertexAndEdgeListGraph(...) + +
    + Signature: (vertices:IEnumerable<'TVertex> * getOutEdges:Func<'TVertex,IEnumerable<'TEdge>>) -> DelegateVertexAndEdgeListGraph<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Creates an instance of DelegateIncidenceGraph.

    + + +
    + + + ToTryFunc(func) + +
    + Signature: func:Func<'T,'TResult> -> TryFunc<'T,'TResult>
    + Type parameters: 'T, 'TResult
    +     		+

    Converts a Func that returns a reference type into a tryfunc

    + + +
    + + + ToUndirectedGraph(edges) + +
    + Signature: edges:IEnumerable<'TEdge> -> UndirectedGraph<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Converts a sequence of edges into an undirected graph

    + + +
    + + + ToUndirectedGraph(...) + +
    + Signature: (edges:IEnumerable<'TEdge> * allowParralelEdges:bool) -> UndirectedGraph<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Converts a sequence of edges into an undirected graph

    + + +
    + + + ToUndirectedGraph(vertexPairs) + +
    + Signature: vertexPairs:IEnumerable<SEquatableEdge<'TVertex>> -> UndirectedGraph<'TVertex,SEquatableEdge<'TVertex>>
    + Type parameters: 'TVertex
    +     		+

    Converts a sequence of vertex pairs into an bidirectional graph

    + + +
    + + + ToVertexAndEdgeListGraph(dictionary) + +
    + Signature: dictionary:IDictionary<'TVertex,'TValue> -> DelegateVertexAndEdgeListGraph<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge, 'TValue
    +     		+

    Wraps a dictionary into a vertex and edge list graph

    + + +
    + + + ToVertexAndEdgeListGraph(...) + +
    + Signature: (dictionary:IDictionary<'TVertex,'TValue> * keyValueToOutEdges:Converter<KeyValuePair<'TVertex,'TValue>,IEnumerable<'TEdge>>) -> DelegateVertexAndEdgeListGraph<'TVertex,'TEdge>
    + Type parameters: 'TVertex, 'TEdge, 'TValue
    +     		+

    Wraps a dictionary into a vertex and edge list graph

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-condensatedgraphrenderer-3.html b/reference/quickgraph-graphviz-condensatedgraphrenderer-3.html new file mode 100644 index 000000000..e98c408fd --- /dev/null +++ b/reference/quickgraph-graphviz-condensatedgraphrenderer-3.html @@ -0,0 +1,90 @@ + + + + + CondensatedGraphRenderer<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    CondensatedGraphRenderer<'TVertex, 'TEdge, 'TGraph>

    +

    + Namespace: QuickGraph.Graphviz
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:IVertexAndEdgeListGraph<'TGraph,CondensedEdge<'TVertex,'TEdge,'TGraph>> -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-dot-graphvizarrow.html b/reference/quickgraph-graphviz-dot-graphvizarrow.html new file mode 100644 index 000000000..4406841a3 --- /dev/null +++ b/reference/quickgraph-graphviz-dot-graphvizarrow.html @@ -0,0 +1,183 @@ + + + + + GraphvizArrow - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizArrow

    +

    + Namespace: QuickGraph.Graphviz.Dot
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(shape) + +
    + Signature: shape:GraphvizArrowShape -> unit
    +
    +     		+ +
    + + + new(shape, clip, fill) + +
    + Signature: (shape:GraphvizArrowShape * clip:GraphvizArrowClipping * fill:GraphvizArrowFilling) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Clipping() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Filling() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Shape() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + ToDot() + +
    + Signature: unit -> string
    +
    +     		+ +
    + + + ToString() + +
    + Signature: unit -> string
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-dot-graphvizarrowclipping.html b/reference/quickgraph-graphviz-dot-graphvizarrowclipping.html new file mode 100644 index 000000000..b974f5b14 --- /dev/null +++ b/reference/quickgraph-graphviz-dot-graphvizarrowclipping.html @@ -0,0 +1,68 @@ + + + + + GraphvizArrowClipping - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizArrowClipping

    +

    + Namespace: QuickGraph.Graphviz.Dot
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-dot-graphvizarrowfilling.html b/reference/quickgraph-graphviz-dot-graphvizarrowfilling.html new file mode 100644 index 000000000..800be1a61 --- /dev/null +++ b/reference/quickgraph-graphviz-dot-graphvizarrowfilling.html @@ -0,0 +1,68 @@ + + + + + GraphvizArrowFilling - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizArrowFilling

    +

    + Namespace: QuickGraph.Graphviz.Dot
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-dot-graphvizarrowshape.html b/reference/quickgraph-graphviz-dot-graphvizarrowshape.html new file mode 100644 index 000000000..f41e0d760 --- /dev/null +++ b/reference/quickgraph-graphviz-dot-graphvizarrowshape.html @@ -0,0 +1,68 @@ + + + + + GraphvizArrowShape - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizArrowShape

    +

    + Namespace: QuickGraph.Graphviz.Dot
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-dot-graphvizclustermode.html b/reference/quickgraph-graphviz-dot-graphvizclustermode.html new file mode 100644 index 000000000..9ba0bbdf6 --- /dev/null +++ b/reference/quickgraph-graphviz-dot-graphvizclustermode.html @@ -0,0 +1,68 @@ + + + + + GraphvizClusterMode - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizClusterMode

    +

    + Namespace: QuickGraph.Graphviz.Dot
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-dot-graphvizedge.html b/reference/quickgraph-graphviz-dot-graphvizedge.html new file mode 100644 index 000000000..f397a9035 --- /dev/null +++ b/reference/quickgraph-graphviz-dot-graphvizedge.html @@ -0,0 +1,421 @@ + + + + + GraphvizEdge - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizEdge

    +

    + Namespace: QuickGraph.Graphviz.Dot
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Comment() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Dir() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Font() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FontColor() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Head() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + HeadArrow() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + HeadPort() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsConstrained() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsDecorated() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Label() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Layer() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Length() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + MinLength() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + StrokeColor() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Style() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Tail() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + TailArrow() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + TailPort() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + ToDot() + +
    + Signature: unit -> string
    +
    +     		+ +
    + + + ToolTip() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + ToString() + +
    + Signature: unit -> string
    + Modifiers: abstract
    +
    +     		+ +
    + + + Url() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Weight() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-dot-graphvizedgedirection.html b/reference/quickgraph-graphviz-dot-graphvizedgedirection.html new file mode 100644 index 000000000..afdbd072c --- /dev/null +++ b/reference/quickgraph-graphviz-dot-graphvizedgedirection.html @@ -0,0 +1,68 @@ + + + + + GraphvizEdgeDirection - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizEdgeDirection

    +

    + Namespace: QuickGraph.Graphviz.Dot
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-dot-graphvizedgeextremity.html b/reference/quickgraph-graphviz-dot-graphvizedgeextremity.html new file mode 100644 index 000000000..594f06bc5 --- /dev/null +++ b/reference/quickgraph-graphviz-dot-graphvizedgeextremity.html @@ -0,0 +1,210 @@ + + + + + GraphvizEdgeExtremity - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizEdgeExtremity

    +

    + Namespace: QuickGraph.Graphviz.Dot
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(isHead) + +
    + Signature: isHead:bool -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AddParameters(dic) + +
    + Signature: dic:IDictionary -> unit
    +
    +     		+ +
    + + + IsClipped() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsHead + +
    + Signature: bool
    +
    +     		+ +
    + + + Label() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Logical() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Same() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + ToolTip() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Url() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-dot-graphvizedgelabel.html b/reference/quickgraph-graphviz-dot-graphvizedgelabel.html new file mode 100644 index 000000000..51e99d9cc --- /dev/null +++ b/reference/quickgraph-graphviz-dot-graphvizedgelabel.html @@ -0,0 +1,196 @@ + + + + + GraphvizEdgeLabel - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizEdgeLabel

    +

    + Namespace: QuickGraph.Graphviz.Dot
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AddParameters(dic) + +
    + Signature: dic:IDictionary -> unit
    +
    +     		+ +
    + + + Angle() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Distance() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Float() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Font() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FontColor() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Value() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-dot-graphvizedgestyle.html b/reference/quickgraph-graphviz-dot-graphvizedgestyle.html new file mode 100644 index 000000000..3b71e3dba --- /dev/null +++ b/reference/quickgraph-graphviz-dot-graphvizedgestyle.html @@ -0,0 +1,68 @@ + + + + + GraphvizEdgeStyle - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizEdgeStyle

    +

    + Namespace: QuickGraph.Graphviz.Dot
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-dot-graphvizgraph.html b/reference/quickgraph-graphviz-dot-graphvizgraph.html new file mode 100644 index 000000000..2fbe3d7b4 --- /dev/null +++ b/reference/quickgraph-graphviz-dot-graphvizgraph.html @@ -0,0 +1,603 @@ + + + + + GraphvizGraph - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizGraph

    +

    + Namespace: QuickGraph.Graphviz.Dot
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BackgroundColor() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + ClusterRank() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Comment() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Font() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FontColor() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsCentered() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsCompounded() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsConcentrated() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsLandscape() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsNormalized() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsReMinCross() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Label() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + LabelJustification() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + LabelLocation() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Layers + +
    + Signature: GraphvizLayerCollection
    +
    +     		+ +
    + + + McLimit() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Name() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + NodeSeparation() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + NsLimit() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + NsLimit1() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + OutputOrder() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + PageDirection() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + PageSize() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Quantum() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + RankDirection() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + RankSeparation() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Ratio() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Resolution() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Rotate() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + SamplePoints() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + SearchSize() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Size() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + StyleSheet() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + ToDot() + +
    + Signature: unit -> string
    +
    +     		+ +
    + + + ToString() + +
    + Signature: unit -> string
    + Modifiers: abstract
    +
    +     		+ +
    + + + Url() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-dot-graphvizimagetype.html b/reference/quickgraph-graphviz-dot-graphvizimagetype.html new file mode 100644 index 000000000..04d8fd3de --- /dev/null +++ b/reference/quickgraph-graphviz-dot-graphvizimagetype.html @@ -0,0 +1,68 @@ + + + + + GraphvizImageType - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizImageType

    +

    + Namespace: QuickGraph.Graphviz.Dot
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-dot-graphvizlabeljustification.html b/reference/quickgraph-graphviz-dot-graphvizlabeljustification.html new file mode 100644 index 000000000..0cc9aa705 --- /dev/null +++ b/reference/quickgraph-graphviz-dot-graphvizlabeljustification.html @@ -0,0 +1,68 @@ + + + + + GraphvizLabelJustification - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizLabelJustification

    +

    + Namespace: QuickGraph.Graphviz.Dot
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-dot-graphvizlabellocation.html b/reference/quickgraph-graphviz-dot-graphvizlabellocation.html new file mode 100644 index 000000000..ae4b80656 --- /dev/null +++ b/reference/quickgraph-graphviz-dot-graphvizlabellocation.html @@ -0,0 +1,68 @@ + + + + + GraphvizLabelLocation - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizLabelLocation

    +

    + Namespace: QuickGraph.Graphviz.Dot
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-dot-graphvizlayer.html b/reference/quickgraph-graphviz-dot-graphvizlayer.html new file mode 100644 index 000000000..c6da8e066 --- /dev/null +++ b/reference/quickgraph-graphviz-dot-graphvizlayer.html @@ -0,0 +1,112 @@ + + + + + GraphvizLayer - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizLayer

    +

    + Namespace: QuickGraph.Graphviz.Dot
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(name) + +
    + Signature: name:string -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Name() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-dot-graphvizlayercollection.html b/reference/quickgraph-graphviz-dot-graphvizlayercollection.html new file mode 100644 index 000000000..875965c99 --- /dev/null +++ b/reference/quickgraph-graphviz-dot-graphvizlayercollection.html @@ -0,0 +1,154 @@ + + + + + GraphvizLayerCollection - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizLayerCollection

    +

    + Namespace: QuickGraph.Graphviz.Dot
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + new(items) + +
    + Signature: (items:GraphvizLayer []) -> unit
    +
    +     		+ +
    + + + new(items) + +
    + Signature: items:GraphvizLayerCollection -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Separators() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + ToDot() + +
    + Signature: unit -> string
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-dot-graphvizoutputmode.html b/reference/quickgraph-graphviz-dot-graphvizoutputmode.html new file mode 100644 index 000000000..b49557660 --- /dev/null +++ b/reference/quickgraph-graphviz-dot-graphvizoutputmode.html @@ -0,0 +1,68 @@ + + + + + GraphvizOutputMode - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizOutputMode

    +

    + Namespace: QuickGraph.Graphviz.Dot
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-dot-graphvizpagedirection.html b/reference/quickgraph-graphviz-dot-graphvizpagedirection.html new file mode 100644 index 000000000..ebc10ce0d --- /dev/null +++ b/reference/quickgraph-graphviz-dot-graphvizpagedirection.html @@ -0,0 +1,68 @@ + + + + + GraphvizPageDirection - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizPageDirection

    +

    + Namespace: QuickGraph.Graphviz.Dot
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-dot-graphvizrankdirection.html b/reference/quickgraph-graphviz-dot-graphvizrankdirection.html new file mode 100644 index 000000000..72bb78d40 --- /dev/null +++ b/reference/quickgraph-graphviz-dot-graphvizrankdirection.html @@ -0,0 +1,68 @@ + + + + + GraphvizRankDirection - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizRankDirection

    +

    + Namespace: QuickGraph.Graphviz.Dot
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-dot-graphvizratiomode.html b/reference/quickgraph-graphviz-dot-graphvizratiomode.html new file mode 100644 index 000000000..6a7d21277 --- /dev/null +++ b/reference/quickgraph-graphviz-dot-graphvizratiomode.html @@ -0,0 +1,68 @@ + + + + + GraphvizRatioMode - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizRatioMode

    +

    + Namespace: QuickGraph.Graphviz.Dot
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-dot-graphvizrecord.html b/reference/quickgraph-graphviz-dot-graphvizrecord.html new file mode 100644 index 000000000..929a1b461 --- /dev/null +++ b/reference/quickgraph-graphviz-dot-graphvizrecord.html @@ -0,0 +1,141 @@ + + + + + GraphvizRecord - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizRecord

    +

    + Namespace: QuickGraph.Graphviz.Dot
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Cells + +
    + Signature: GraphvizRecordCellCollection
    +
    +     		+ +
    + + + ToDot() + +
    + Signature: unit -> string
    +
    +     		+ +
    + + + ToString() + +
    + Signature: unit -> string
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-dot-graphvizrecordcell.html b/reference/quickgraph-graphviz-dot-graphvizrecordcell.html new file mode 100644 index 000000000..83dc478b9 --- /dev/null +++ b/reference/quickgraph-graphviz-dot-graphvizrecordcell.html @@ -0,0 +1,211 @@ + + + + + GraphvizRecordCell - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizRecordCell

    +

    + Namespace: QuickGraph.Graphviz.Dot
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Cells + +
    + Signature: GraphvizRecordCellCollection
    +
    +     		+ +
    + + + Escaper + +
    + Signature: GraphvizRecordEscaper
    +
    +     		+ +
    + + + HasPort + +
    + Signature: bool
    +
    +     		+ +
    + + + HasText + +
    + Signature: bool
    +
    +     		+ +
    + + + Port() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Text() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + ToDot() + +
    + Signature: unit -> string
    +
    +     		+ +
    + + + ToString() + +
    + Signature: unit -> string
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-dot-graphvizrecordcellcollection.html b/reference/quickgraph-graphviz-dot-graphvizrecordcellcollection.html new file mode 100644 index 000000000..0f0e4fb42 --- /dev/null +++ b/reference/quickgraph-graphviz-dot-graphvizrecordcellcollection.html @@ -0,0 +1,118 @@ + + + + + GraphvizRecordCellCollection - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizRecordCellCollection

    +

    + Namespace: QuickGraph.Graphviz.Dot
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + new(items) + +
    + Signature: (items:GraphvizRecordCell []) -> unit
    +
    +     		+ +
    + + + new(items) + +
    + Signature: items:GraphvizRecordCellCollection -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-dot-graphvizrecordescaper.html b/reference/quickgraph-graphviz-dot-graphvizrecordescaper.html new file mode 100644 index 000000000..7220f19e1 --- /dev/null +++ b/reference/quickgraph-graphviz-dot-graphvizrecordescaper.html @@ -0,0 +1,126 @@ + + + + + GraphvizRecordEscaper - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizRecordEscaper

    +

    + Namespace: QuickGraph.Graphviz.Dot
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Escape(text) + +
    + Signature: text:string -> string
    +
    +     		+ +
    + + + MatchEvaluator(m) + +
    + Signature: m:Match -> string
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-dot-graphvizvertex.html b/reference/quickgraph-graphviz-dot-graphvizvertex.html new file mode 100644 index 000000000..b673067cb --- /dev/null +++ b/reference/quickgraph-graphviz-dot-graphvizvertex.html @@ -0,0 +1,477 @@ + + + + + GraphvizVertex - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizVertex

    +

    + Namespace: QuickGraph.Graphviz.Dot
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BottomLabel() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Comment() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Distorsion() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FillColor() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FixedSize() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Font() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FontColor() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Group() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Label() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Layer() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Orientation() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Peripheries() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Position() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Record() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Regular() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Shape() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Sides() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Size() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Skew() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + StrokeColor() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Style() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + ToDot() + +
    + Signature: unit -> string
    +
    +     		+ +
    + + + ToolTip() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + TopLabel() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + ToString() + +
    + Signature: unit -> string
    + Modifiers: abstract
    +
    +     		+ +
    + + + Url() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Z() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-dot-graphvizvertexshape.html b/reference/quickgraph-graphviz-dot-graphvizvertexshape.html new file mode 100644 index 000000000..107ff7954 --- /dev/null +++ b/reference/quickgraph-graphviz-dot-graphvizvertexshape.html @@ -0,0 +1,68 @@ + + + + + GraphvizVertexShape - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizVertexShape

    +

    + Namespace: QuickGraph.Graphviz.Dot
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-dot-graphvizvertexstyle.html b/reference/quickgraph-graphviz-dot-graphvizvertexstyle.html new file mode 100644 index 000000000..824a89aca --- /dev/null +++ b/reference/quickgraph-graphviz-dot-graphvizvertexstyle.html @@ -0,0 +1,68 @@ + + + + + GraphvizVertexStyle - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizVertexStyle

    +

    + Namespace: QuickGraph.Graphviz.Dot
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-edgemergecondensatedgraphrenderer-2.html b/reference/quickgraph-graphviz-edgemergecondensatedgraphrenderer-2.html new file mode 100644 index 000000000..2d42b28ee --- /dev/null +++ b/reference/quickgraph-graphviz-edgemergecondensatedgraphrenderer-2.html @@ -0,0 +1,90 @@ + + + + + EdgeMergeCondensatedGraphRenderer<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    EdgeMergeCondensatedGraphRenderer<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Graphviz
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:IVertexAndEdgeListGraph<'TVertex,MergedEdge<'TVertex,'TEdge>> -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-filedotengine.html b/reference/quickgraph-graphviz-filedotengine.html new file mode 100644 index 000000000..1496b60d9 --- /dev/null +++ b/reference/quickgraph-graphviz-filedotengine.html @@ -0,0 +1,115 @@ + + + + + FileDotEngine - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FileDotEngine

    +

    + Namespace: QuickGraph.Graphviz
    +

    +
    +

    Default dot engine implementation, writes dot code to disk

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Run(imageType, dot, outputFileName) + +
    + Signature: (imageType:GraphvizImageType * dot:string * outputFileName:string) -> string
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-formatclustereventargs-2.html b/reference/quickgraph-graphviz-formatclustereventargs-2.html new file mode 100644 index 000000000..ef42100a1 --- /dev/null +++ b/reference/quickgraph-graphviz-formatclustereventargs-2.html @@ -0,0 +1,128 @@ + + + + + FormatClusterEventArgs<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FormatClusterEventArgs<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Graphviz
    +

    +
    +

    A clustered graph event argument.

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(cluster, graphFormat) + +
    + Signature: (cluster:IVertexAndEdgeListGraph<'TVertex,'TEdge> * graphFormat:GraphvizGraph) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Cluster + +
    + Signature: IVertexAndEdgeListGraph<'TVertex,'TEdge>
    +
    +     		+ +
    + + + GraphFormat + +
    + Signature: GraphvizGraph
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-formatclustereventhandler-2.html b/reference/quickgraph-graphviz-formatclustereventhandler-2.html new file mode 100644 index 000000000..1c822a147 --- /dev/null +++ b/reference/quickgraph-graphviz-formatclustereventhandler-2.html @@ -0,0 +1,143 @@ + + + + + FormatClusterEventHandler<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FormatClusterEventHandler<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Graphviz
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(object, method) + +
    + Signature: (object:obj * method:nativeint) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BeginInvoke(sender, e, callback, object) + +
    + Signature: (sender:obj * e:FormatClusterEventArgs<'TVertex,'TEdge> * callback:AsyncCallback * object:obj) -> IAsyncResult
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndInvoke(result) + +
    + Signature: result:IAsyncResult -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + Invoke(sender, e) + +
    + Signature: (sender:obj * e:FormatClusterEventArgs<'TVertex,'TEdge>) -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-formatedgeaction-2.html b/reference/quickgraph-graphviz-formatedgeaction-2.html new file mode 100644 index 000000000..972324357 --- /dev/null +++ b/reference/quickgraph-graphviz-formatedgeaction-2.html @@ -0,0 +1,143 @@ + + + + + FormatEdgeAction<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FormatEdgeAction<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Graphviz
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(object, method) + +
    + Signature: (object:obj * method:nativeint) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BeginInvoke(sender, e, callback, object) + +
    + Signature: (sender:obj * e:FormatEdgeEventArgs<'TVertex,'TEdge> * callback:AsyncCallback * object:obj) -> IAsyncResult
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndInvoke(result) + +
    + Signature: result:IAsyncResult -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + Invoke(sender, e) + +
    + Signature: (sender:obj * e:FormatEdgeEventArgs<'TVertex,'TEdge>) -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-formatedgeeventargs-2.html b/reference/quickgraph-graphviz-formatedgeeventargs-2.html new file mode 100644 index 000000000..3c2237eb8 --- /dev/null +++ b/reference/quickgraph-graphviz-formatedgeeventargs-2.html @@ -0,0 +1,92 @@ + + + + + FormatEdgeEventArgs<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FormatEdgeEventArgs<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Graphviz
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + EdgeFormatter + +
    + Signature: GraphvizEdge
    +
    +     		+

    Edge formatter

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-formatvertexeventargs-1.html b/reference/quickgraph-graphviz-formatvertexeventargs-1.html new file mode 100644 index 000000000..98391aad1 --- /dev/null +++ b/reference/quickgraph-graphviz-formatvertexeventargs-1.html @@ -0,0 +1,90 @@ + + + + + FormatVertexEventArgs<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FormatVertexEventArgs<'TVertex>

    +

    + Namespace: QuickGraph.Graphviz
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + VertexFormatter + +
    + Signature: GraphvizVertex
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-formatvertexeventhandler-1.html b/reference/quickgraph-graphviz-formatvertexeventhandler-1.html new file mode 100644 index 000000000..f363b8339 --- /dev/null +++ b/reference/quickgraph-graphviz-formatvertexeventhandler-1.html @@ -0,0 +1,143 @@ + + + + + FormatVertexEventHandler<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FormatVertexEventHandler<'TVertex>

    +

    + Namespace: QuickGraph.Graphviz
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(object, method) + +
    + Signature: (object:obj * method:nativeint) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BeginInvoke(sender, e, callback, object) + +
    + Signature: (sender:obj * e:FormatVertexEventArgs<'TVertex> * callback:AsyncCallback * object:obj) -> IAsyncResult
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndInvoke(result) + +
    + Signature: result:IAsyncResult -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + Invoke(sender, e) + +
    + Signature: (sender:obj * e:FormatVertexEventArgs<'TVertex>) -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-graphrendererbase-2.html b/reference/quickgraph-graphviz-graphrendererbase-2.html new file mode 100644 index 000000000..e5a058706 --- /dev/null +++ b/reference/quickgraph-graphviz-graphrendererbase-2.html @@ -0,0 +1,140 @@ + + + + + GraphRendererBase<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphRendererBase<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Graphviz
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:IEdgeListGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Generate(dot, fileName) + +
    + Signature: (dot:IDotEngine * fileName:string) -> string
    +
    +     		+ +
    + + + Graphviz + +
    + Signature: GraphvizAlgorithm<'TVertex,'TEdge>
    +
    +     		+ +
    + + + VisitedGraph + +
    + Signature: IEdgeListGraph<'TVertex,'TEdge>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-graphvizalgorithm-2.html b/reference/quickgraph-graphviz-graphvizalgorithm-2.html new file mode 100644 index 000000000..248b233a5 --- /dev/null +++ b/reference/quickgraph-graphviz-graphvizalgorithm-2.html @@ -0,0 +1,286 @@ + + + + + GraphvizAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Graphviz
    +

    +
    +

    An algorithm that renders a graph to the Graphviz DOT format.

    + +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(g) + +
    + Signature: g:IEdgeListGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    + + + new(g, path, imageType) + +
    + Signature: (g:IEdgeListGraph<'TVertex,'TEdge> * path:string * imageType:GraphvizImageType) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + CommonEdgeFormat + +
    + Signature: GraphvizEdge
    +
    +     		+ +
    + + + CommonVertexFormat + +
    + Signature: GraphvizVertex
    +
    +     		+ +
    + + + Escape(value) + +
    + Signature: value:string -> string
    +
    +     		+ +
    + + + FormatCluster + +
    + Signature: IEvent<FormatClusterEventHandler<'TVertex,'TEdge>,FormatClusterEventArgs<'TVertex,'TEdge>>
    +
    +     		+ +
    + + + FormatEdge + +
    + Signature: IEvent<FormatEdgeAction<'TVertex,'TEdge>,FormatEdgeEventArgs<'TVertex,'TEdge>>
    +
    +     		+ +
    + + + FormatVertex + +
    + Signature: IEvent<FormatVertexEventHandler<'TVertex>,FormatVertexEventArgs<'TVertex>>
    +
    +     		+ +
    + + + Generate() + +
    + Signature: unit -> string
    +
    +     		+ +
    + + + Generate(dot, outputFileName) + +
    + Signature: (dot:IDotEngine * outputFileName:string) -> string
    +
    +     		+ +
    + + + GraphFormat + +
    + Signature: GraphvizGraph
    +
    +     		+ +
    + + + ImageType() + +
    + Signature: unit -> unit
    +
    +     		+

    Current image output type

    + + +
    + + + Output + +
    + Signature: StringWriter
    +
    +     		+

    Dot output stream.

    + + +
    + + + VisitedGraph() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-graphvizextensions.html b/reference/quickgraph-graphviz-graphvizextensions.html new file mode 100644 index 000000000..623323740 --- /dev/null +++ b/reference/quickgraph-graphviz-graphvizextensions.html @@ -0,0 +1,161 @@ + + + + + GraphvizExtensions - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizExtensions

    +

    + Namespace: QuickGraph.Graphviz
    +

    +
    +

    Helper extensions to render graphs to graphviz

    + +
    +

    Static members

    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Static memberDescription
    + + + ToGraphviz(graph) + +
    + Signature: graph:IEdgeListGraph<'TVertex,'TEdge> -> string
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Renders a graph to the Graphviz DOT format.

    + + +
    + + + ToGraphviz(graph, initialization) + +
    + Signature: (graph:IEdgeListGraph<'TVertex,'TEdge> * initialization:Action<GraphvizAlgorithm<'TVertex,'TEdge>>) -> string
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Renders a graph to the Graphviz DOT format.

    + + +
    + + + ToSvg(graph) + +
    + Signature: graph:IEdgeListGraph<'TVertex,'TEdge> -> string
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Performs a layout .dot in an SVG (Scalable Vector Graphics) file +by calling Agl through the http://rise4fun.com/ REST services.

    + + +
    + + + ToSvg(graph, initialization) + +
    + Signature: (graph:IEdgeListGraph<'TVertex,'TEdge> * initialization:Action<GraphvizAlgorithm<'TVertex,'TEdge>>) -> string
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Performs a layout .dot in an SVG (Scalable Vector Graphics) file +by calling Agl through the http://rise4fun.com/ REST services.

    + + +
    + + + ToSvg(dot) + +
    + Signature: dot:string -> string
    +
    +     		+

    Performs a layout .dot in an SVG (Scalable Vector Graphics) file +by calling Agl through the http://rise4fun.com/ REST services.

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-idotengine.html b/reference/quickgraph-graphviz-idotengine.html new file mode 100644 index 000000000..06f7e0bc6 --- /dev/null +++ b/reference/quickgraph-graphviz-idotengine.html @@ -0,0 +1,91 @@ + + + + + IDotEngine - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IDotEngine

    +

    + Namespace: QuickGraph.Graphviz
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Run(imageType, dot, outputFileName) + +
    + Signature: (imageType:GraphvizImageType * dot:string * outputFileName:string) -> string
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-graphviz-svghtmlwrapper.html b/reference/quickgraph-graphviz-svghtmlwrapper.html new file mode 100644 index 000000000..04b4a8174 --- /dev/null +++ b/reference/quickgraph-graphviz-svghtmlwrapper.html @@ -0,0 +1,120 @@ + + + + + SvgHtmlWrapper - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    SvgHtmlWrapper

    +

    + Namespace: QuickGraph.Graphviz
    +

    +
    +
    +

    Static members

    + + + + + + + + + + + + + + + + + + +
    Static memberDescription
    + + + DumpHtml(size, svgFileName) + +
    + Signature: (size:Size * svgFileName:string) -> string
    +
    +     		+ +
    + + + ParseSize(svg) + +
    + Signature: svg:string -> Size
    +
    +     		+ +
    + + + WrapSvg(svgFileName) + +
    + Signature: svgFileName:string -> string
    +
    +     		+

    Creates a HTML file that wraps the SVG and returns the file name

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-ibidirectionalgraph-2.html b/reference/quickgraph-ibidirectionalgraph-2.html new file mode 100644 index 000000000..ad1bd0542 --- /dev/null +++ b/reference/quickgraph-ibidirectionalgraph-2.html @@ -0,0 +1,71 @@ + + + + + IBidirectionalGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IBidirectionalGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A directed graph datastructure that is efficient +to traverse both in and out edges.

    + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-ibidirectionalincidencegraph-2.html b/reference/quickgraph-ibidirectionalincidencegraph-2.html new file mode 100644 index 000000000..224514603 --- /dev/null +++ b/reference/quickgraph-ibidirectionalincidencegraph-2.html @@ -0,0 +1,182 @@ + + + + + IBidirectionalIncidenceGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IBidirectionalIncidenceGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A directed graph datastructure that is efficient +to traverse both in and out edges.

    + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Degree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+

    Gets the degree of , i.e. +the sum of the out-degree and in-degree of .

    + + +
    + + + InDegree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+

    Gets the number of in-edges of

    + + +
    + + + InEdge(v, index) + +
    + Signature: (v:'TVertex * index:int) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+

    Gets the in-edge at location .

    + + +
    + + + InEdges(v) + +
    + Signature: v:'TVertex -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+

    Gets the collection of in-edges of .

    + + +
    + + + IsInEdgesEmpty(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+

    Determines whether has no in-edges.

    + + +
    + + + TryGetInEdges(v, edges) + +
    + Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+

    Tries to get the in-edges of

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-icloneableedge-2.html b/reference/quickgraph-icloneableedge-2.html new file mode 100644 index 000000000..c8d738971 --- /dev/null +++ b/reference/quickgraph-icloneableedge-2.html @@ -0,0 +1,96 @@ + + + + + ICloneableEdge<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ICloneableEdge<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A cloneable edge

    + +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Clone(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+

    Clones the edge content to a different pair of +and vertices

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-iclusteredgraph.html b/reference/quickgraph-iclusteredgraph.html new file mode 100644 index 000000000..1c4cd9c90 --- /dev/null +++ b/reference/quickgraph-iclusteredgraph.html @@ -0,0 +1,151 @@ + + + + + IClusteredGraph - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IClusteredGraph

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AddCluster() + +
    + Signature: unit -> IClusteredGraph
    + Modifiers: abstract
    +
    +     		+ +
    + + + Clusters + +
    + Signature: IEnumerable
    + Modifiers: abstract
    +
    +     		+ +
    + + + ClustersCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Colapsed() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveCluster(g) + +
    + Signature: g:IClusteredGraph -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-identifiableedgefactory-2.html b/reference/quickgraph-identifiableedgefactory-2.html new file mode 100644 index 000000000..680e492de --- /dev/null +++ b/reference/quickgraph-identifiableedgefactory-2.html @@ -0,0 +1,145 @@ + + + + + IdentifiableEdgeFactory<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IdentifiableEdgeFactory<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A factory of identifiable edges.

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(object, method) + +
    + Signature: (object:obj * method:nativeint) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BeginInvoke(...) + +
    + Signature: (source:'TVertex * target:'TVertex * id:string * callback:AsyncCallback * object:obj) -> IAsyncResult
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndInvoke(result) + +
    + Signature: result:IAsyncResult -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + + + Invoke(source, target, id) + +
    + Signature: (source:'TVertex * target:'TVertex * id:string) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-identifiablevertexfactory-1.html b/reference/quickgraph-identifiablevertexfactory-1.html new file mode 100644 index 000000000..3b2ec6943 --- /dev/null +++ b/reference/quickgraph-identifiablevertexfactory-1.html @@ -0,0 +1,145 @@ + + + + + IdentifiableVertexFactory<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IdentifiableVertexFactory<'TVertex>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A factory of identifiable vertices.

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(object, method) + +
    + Signature: (object:obj * method:nativeint) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BeginInvoke(id, callback, object) + +
    + Signature: (id:string * callback:AsyncCallback * object:obj) -> IAsyncResult
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndInvoke(result) + +
    + Signature: result:IAsyncResult -> 'TVertex
    + Modifiers: abstract
    +
    +     		+ +
    + + + Invoke(id) + +
    + Signature: id:string -> 'TVertex
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-iedge-1.html b/reference/quickgraph-iedge-1.html new file mode 100644 index 000000000..db8fc8c03 --- /dev/null +++ b/reference/quickgraph-iedge-1.html @@ -0,0 +1,112 @@ + + + + + IEdge<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IEdge<'TVertex>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A directed edge

    + +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Source + +
    + Signature: 'TVertex
    + Modifiers: abstract
    +
    +     		+

    Gets the source vertex

    + + +
    + + + Target + +
    + Signature: 'TVertex
    + Modifiers: abstract
    +
    +     		+

    Gets the target vertex

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-iedgelistandincidencegraph-2.html b/reference/quickgraph-iedgelistandincidencegraph-2.html new file mode 100644 index 000000000..0980e6344 --- /dev/null +++ b/reference/quickgraph-iedgelistandincidencegraph-2.html @@ -0,0 +1,70 @@ + + + + + IEdgeListAndIncidenceGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IEdgeListAndIncidenceGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    An incidence graph whose edges can be enumerated

    + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-iedgelistgraph-2.html b/reference/quickgraph-iedgelistgraph-2.html new file mode 100644 index 000000000..1a5bb7b69 --- /dev/null +++ b/reference/quickgraph-iedgelistgraph-2.html @@ -0,0 +1,70 @@ + + + + + IEdgeListGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IEdgeListGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A graph whose edges can be enumerated

    + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-iedgeset-2.html b/reference/quickgraph-iedgeset-2.html new file mode 100644 index 000000000..8e0e44521 --- /dev/null +++ b/reference/quickgraph-iedgeset-2.html @@ -0,0 +1,146 @@ + + + + + IEdgeSet<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IEdgeSet<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A set of edges

    + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ContainsEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+

    Determines whether the specified edge contains edge.

    + + +
    + + + EdgeCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+

    Gets the edge count.

    + + +
    + + + Edges + +
    + Signature: IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+

    Gets the edges.

    + + +
    + + + IsEdgesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+

    Gets a value indicating whether there are no edges in this set.

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-igraph-2.html b/reference/quickgraph-igraph-2.html new file mode 100644 index 000000000..cfdf9a200 --- /dev/null +++ b/reference/quickgraph-igraph-2.html @@ -0,0 +1,113 @@ + + + + + IGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A graph with vertices of type +and edges of type

    + +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AllowParallelEdges + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+

    Gets a value indicating if the graph allows parallel edges

    + + +
    + + + IsDirected + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+

    Gets a value indicating if the graph is directed

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-ihierarchy-2.html b/reference/quickgraph-ihierarchy-2.html new file mode 100644 index 000000000..0c886759b --- /dev/null +++ b/reference/quickgraph-ihierarchy-2.html @@ -0,0 +1,253 @@ + + + + + IHierarchy<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IHierarchy<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ChildrenEdges(vertex) + +
    + Signature: vertex:'TVertex -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+

    Gets the collection of children +from

    + + +
    + + + ChildrenVertices(vertex) + +
    + Signature: vertex:'TVertex -> IEnumerable<'TVertex>
    + Modifiers: abstract
    +
    +     		+

    Gets the collection of children +from

    + + +
    + + + GetParent(vertex) + +
    + Signature: vertex:'TVertex -> 'TVertex
    + Modifiers: abstract
    +
    +     		+

    Gets the parent of

    + + +
    + + + GetParentEdge(vertex) + +
    + Signature: vertex:'TVertex -> 'TEdge
    + Modifiers: abstract
    +
    +     		+

    Gets the parent of

    + + +
    + + + InducedEdgeCount(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> int
    + Modifiers: abstract
    +
    +     		+

    Gets the number of edges between +and .

    + + +
    + + + IsCrossEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+

    Gets a value indicating if is +a cross edge.

    + + +
    + + + IsInnerNode(vertex) + +
    + Signature: vertex:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+

    Gets a value indicating if is +inner node or a leaf.

    + + +
    + + + IsPredecessorOf(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> bool
    + Modifiers: abstract
    +
    +     		+

    Gets a value indicating if +is a predecessor of

    + + +
    + + + IsRealEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+

    Gets a value indicating whether
    +exists really or is just an induced edge.

    + + +
    + + + Root + +
    + Signature: 'TVertex
    + Modifiers: abstract
    +
    +     		+

    Gets the roots of the hierarchy

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-ihyperedge-1.html b/reference/quickgraph-ihyperedge-1.html new file mode 100644 index 000000000..790d6d1e7 --- /dev/null +++ b/reference/quickgraph-ihyperedge-1.html @@ -0,0 +1,106 @@ + + + + + IHyperEdge<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IHyperEdge<'TVertex>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + EndPointCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndPoints + +
    + Signature: IEnumerable<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-iimplicitgraph-2.html b/reference/quickgraph-iimplicitgraph-2.html new file mode 100644 index 000000000..bfbb6e4f6 --- /dev/null +++ b/reference/quickgraph-iimplicitgraph-2.html @@ -0,0 +1,163 @@ + + + + + IImplicitGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IImplicitGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A implicit directed graph datastructure

    + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + IsOutEdgesEmpty(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+

    Determines whether there are out-edges associated to .

    + + +
    + + + OutDegree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+

    Gets the count of out-edges of

    + + +
    + + + OutEdge(v, index) + +
    + Signature: (v:'TVertex * index:int) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+

    Gets the out-edge of at position .

    + + +
    + + + OutEdges(v) + +
    + Signature: v:'TVertex -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+

    Gets the out-edges of .

    + + +
    + + + TryGetOutEdges(v, edges) + +
    + Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+

    Tries to get the out-edges of

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-iimplicitundirectedgraph-2.html b/reference/quickgraph-iimplicitundirectedgraph-2.html new file mode 100644 index 000000000..f6a2db5ea --- /dev/null +++ b/reference/quickgraph-iimplicitundirectedgraph-2.html @@ -0,0 +1,181 @@ + + + + + IImplicitUndirectedGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IImplicitUndirectedGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AdjacentDegree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + AdjacentEdge(v, index) + +
    + Signature: (v:'TVertex * index:int) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + + + AdjacentEdges(v) + +
    + Signature: v:'TVertex -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsEdge(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeEqualityComparer + +
    + Signature: EdgeEqualityComparer<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsAdjacentEdgesEmpty(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetEdge(source, target, edge) + +
    + Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-iimplicitvertexset-1.html b/reference/quickgraph-iimplicitvertexset-1.html new file mode 100644 index 000000000..805ae15d7 --- /dev/null +++ b/reference/quickgraph-iimplicitvertexset-1.html @@ -0,0 +1,95 @@ + + + + + IImplicitVertexSet<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IImplicitVertexSet<'TVertex>

    +

    + Namespace: QuickGraph
    +

    +
    +

    An implicit set of vertices

    + +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + ContainsVertex(vertex) + +
    + Signature: vertex:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+

    Determines whether the specified vertex contains vertex.

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-iincidencegraph-2.html b/reference/quickgraph-iincidencegraph-2.html new file mode 100644 index 000000000..105512d98 --- /dev/null +++ b/reference/quickgraph-iincidencegraph-2.html @@ -0,0 +1,121 @@ + + + + + IIncidenceGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IIncidenceGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ContainsEdge(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetEdge(source, target, edge) + +
    + Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetEdges(source, target, edges) + +
    + Signature: (source:'TVertex * target:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-imutablebidirectionalgraph-2.html b/reference/quickgraph-imutablebidirectionalgraph-2.html new file mode 100644 index 000000000..940f2f767 --- /dev/null +++ b/reference/quickgraph-imutablebidirectionalgraph-2.html @@ -0,0 +1,130 @@ + + + + + IMutableBidirectionalGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IMutableBidirectionalGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A mutable bidirectional directed graph

    + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ClearEdges(v) + +
    + Signature: v:'TVertex -> unit
    + Modifiers: abstract
    +
    +     		+

    Clears in-edges and out-edges of

    + + +
    + + + ClearInEdges(v) + +
    + Signature: v:'TVertex -> unit
    + Modifiers: abstract
    +
    +     		+

    Clears in-edges of

    + + +
    + + + RemoveInEdgeIf(v, edgePredicate) + +
    + Signature: (v:'TVertex * edgePredicate:EdgePredicate<'TVertex,'TEdge>) -> int
    + Modifiers: abstract
    +
    +     		+

    Removes in-edges of that match +predicate .

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-imutableedgelistgraph-2.html b/reference/quickgraph-imutableedgelistgraph-2.html new file mode 100644 index 000000000..e5440f39a --- /dev/null +++ b/reference/quickgraph-imutableedgelistgraph-2.html @@ -0,0 +1,180 @@ + + + + + IMutableEdgeListGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IMutableEdgeListGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A mutable edge list graph.

    + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AddEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+

    Adds the edge to the graph

    + + +
    + + + AddEdgeRange(edges) + +
    + Signature: edges:IEnumerable<'TEdge> -> int
    + Modifiers: abstract
    +
    +     		+

    Adds a set of edges to the graph.

    + + +
    + + + EdgeAdded + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+

    Raised when an edge is added to the graph.

    + + +
    + + + EdgeRemoved + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+

    Raised when an edge has been removed from the graph.

    + + +
    + + + RemoveEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+

    Removes from the graph

    + + +
    + + + RemoveEdgeIf(predicate) + +
    + Signature: predicate:EdgePredicate<'TVertex,'TEdge> -> int
    + Modifiers: abstract
    +
    +     		+

    Removes all edges that match .

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-imutablegraph-2.html b/reference/quickgraph-imutablegraph-2.html new file mode 100644 index 000000000..d6fa7e832 --- /dev/null +++ b/reference/quickgraph-imutablegraph-2.html @@ -0,0 +1,95 @@ + + + + + IMutableGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IMutableGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A mutable graph instance

    + +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Clear() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+

    Clears the vertex and edges

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-imutableincidencegraph-2.html b/reference/quickgraph-imutableincidencegraph-2.html new file mode 100644 index 000000000..252c573aa --- /dev/null +++ b/reference/quickgraph-imutableincidencegraph-2.html @@ -0,0 +1,130 @@ + + + + + IMutableIncidenceGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IMutableIncidenceGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A mutable incidence graph

    + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ClearOutEdges(v) + +
    + Signature: v:'TVertex -> unit
    + Modifiers: abstract
    +
    +     		+

    Trims the out edges of vertex

    + + +
    + + + RemoveOutEdgeIf(v, predicate) + +
    + Signature: (v:'TVertex * predicate:EdgePredicate<'TVertex,'TEdge>) -> int
    + Modifiers: abstract
    +
    +     		+

    Removes all out edges of +where evalutes to true.

    + + +
    + + + TrimEdgeExcess() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+

    Trims excess storage allocated for edges

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-imutabletermbidirectionalgraph-2.html b/reference/quickgraph-imutabletermbidirectionalgraph-2.html new file mode 100644 index 000000000..62a491805 --- /dev/null +++ b/reference/quickgraph-imutabletermbidirectionalgraph-2.html @@ -0,0 +1,68 @@ + + + + + IMutableTermBidirectionalGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IMutableTermBidirectionalGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-imutableundirectedgraph-2.html b/reference/quickgraph-imutableundirectedgraph-2.html new file mode 100644 index 000000000..3fb2d3e5a --- /dev/null +++ b/reference/quickgraph-imutableundirectedgraph-2.html @@ -0,0 +1,108 @@ + + + + + IMutableUndirectedGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IMutableUndirectedGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A mutable indirect graph

    + +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ClearAdjacentEdges(vertex) + +
    + Signature: vertex:'TVertex -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveAdjacentEdgeIf(vertex, predicate) + +
    + Signature: (vertex:'TVertex * predicate:EdgePredicate<'TVertex,'TEdge>) -> int
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-imutablevertexandedgelistgraph-2.html b/reference/quickgraph-imutablevertexandedgelistgraph-2.html new file mode 100644 index 000000000..b0f670107 --- /dev/null +++ b/reference/quickgraph-imutablevertexandedgelistgraph-2.html @@ -0,0 +1,70 @@ + + + + + IMutableVertexAndEdgeListGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IMutableVertexAndEdgeListGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A mutable vertex and edge list graph

    + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-imutablevertexandedgeset-2.html b/reference/quickgraph-imutablevertexandedgeset-2.html new file mode 100644 index 000000000..52797f66e --- /dev/null +++ b/reference/quickgraph-imutablevertexandedgeset-2.html @@ -0,0 +1,112 @@ + + + + + IMutableVertexAndEdgeSet<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IMutableVertexAndEdgeSet<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A mutable vertex and edge set

    + +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AddVerticesAndEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+

    Adds the vertices and edge to the graph.

    + + +
    + + + AddVerticesAndEdgeRange(edges) + +
    + Signature: edges:IEnumerable<'TEdge> -> int
    + Modifiers: abstract
    +
    +     		+

    Adds a set of edges (and it's vertices if necessary)

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-imutablevertexlistgraph-2.html b/reference/quickgraph-imutablevertexlistgraph-2.html new file mode 100644 index 000000000..ef4142fec --- /dev/null +++ b/reference/quickgraph-imutablevertexlistgraph-2.html @@ -0,0 +1,70 @@ + + + + + IMutableVertexListGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IMutableVertexListGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A mutable vertex list graph

    + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-imutablevertexset-1.html b/reference/quickgraph-imutablevertexset-1.html new file mode 100644 index 000000000..5ccd744fa --- /dev/null +++ b/reference/quickgraph-imutablevertexset-1.html @@ -0,0 +1,168 @@ + + + + + IMutableVertexSet<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IMutableVertexSet<'TVertex>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A mutable vertex set

    + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AddVertex(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddVertexRange(vertices) + +
    + Signature: vertices:IEnumerable<'TVertex> -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveVertex(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveVertexIf(pred) + +
    + Signature: pred:VertexPredicate<'TVertex> -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexAdded + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexRemoved + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-itagged-1.html b/reference/quickgraph-itagged-1.html new file mode 100644 index 000000000..4414a5058 --- /dev/null +++ b/reference/quickgraph-itagged-1.html @@ -0,0 +1,112 @@ + + + + + ITagged<'TTag> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ITagged<'TTag>

    +

    + Namespace: QuickGraph
    +

    +
    +

    An instance holding a tag

    + +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Tag() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+

    Gets or sets the tag

    + + +
    + + + TagChanged + +
    + Signature: IEvent<EventHandler,EventArgs>
    + Modifiers: abstract
    +
    +     		+

    Raised when the tag is changed

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-itermbidirectionalgraph-2.html b/reference/quickgraph-itermbidirectionalgraph-2.html new file mode 100644 index 000000000..a3c7dc4e9 --- /dev/null +++ b/reference/quickgraph-itermbidirectionalgraph-2.html @@ -0,0 +1,226 @@ + + + + + ITermBidirectionalGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ITermBidirectionalGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + InDegreeAt(v, terminal) + +
    + Signature: (v:'TVertex * terminal:int) -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + InEdgesAt(v, terminal) + +
    + Signature: (v:'TVertex * terminal:int) -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + InTerminalCount(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsInEdgesEmptyAt(v, terminal) + +
    + Signature: (v:'TVertex * terminal:int) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsOutEdgesEmptyAt(v, terminal) + +
    + Signature: (v:'TVertex * terminal:int) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutDegreeAt(v, terminal) + +
    + Signature: (v:'TVertex * terminal:int) -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutEdgesAt(v, terminal) + +
    + Signature: (v:'TVertex * terminal:int) -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutTerminalCount(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetInEdgesAt(v, terminal, edges) + +
    + Signature: (v:'TVertex * terminal:int * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetOutEdgesAt(v, terminal, edges) + +
    + Signature: (v:'TVertex * terminal:int * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-itermedge-1.html b/reference/quickgraph-itermedge-1.html new file mode 100644 index 000000000..f2858a8c8 --- /dev/null +++ b/reference/quickgraph-itermedge-1.html @@ -0,0 +1,112 @@ + + + + + ITermEdge<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ITermEdge<'TVertex>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A directed edge with terminal indices

    + +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + SourceTerminal + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+

    Index of terminal on source vertex to which this edge is attached.

    + + +
    + + + TargetTerminal + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+

    Index of terminal on target vertex to which this edge is attached.

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-iundirectededge-1.html b/reference/quickgraph-iundirectededge-1.html new file mode 100644 index 000000000..b55a0c56c --- /dev/null +++ b/reference/quickgraph-iundirectededge-1.html @@ -0,0 +1,70 @@ + + + + + IUndirectedEdge<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IUndirectedEdge<'TVertex>

    +

    + Namespace: QuickGraph
    +

    +
    +

    An undirected edge.

    + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-iundirectedgraph-2.html b/reference/quickgraph-iundirectedgraph-2.html new file mode 100644 index 000000000..1db14d78e --- /dev/null +++ b/reference/quickgraph-iundirectedgraph-2.html @@ -0,0 +1,70 @@ + + + + + IUndirectedGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IUndirectedGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    An undirected graph

    + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-ivertexandedgelistgraph-2.html b/reference/quickgraph-ivertexandedgelistgraph-2.html new file mode 100644 index 000000000..7ec51e933 --- /dev/null +++ b/reference/quickgraph-ivertexandedgelistgraph-2.html @@ -0,0 +1,70 @@ + + + + + IVertexAndEdgeListGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IVertexAndEdgeListGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A directed graph where vertices and edges can be enumerated efficiently.

    + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-ivertexlistgraph-2.html b/reference/quickgraph-ivertexlistgraph-2.html new file mode 100644 index 000000000..17672565b --- /dev/null +++ b/reference/quickgraph-ivertexlistgraph-2.html @@ -0,0 +1,71 @@ + + + + + IVertexListGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IVertexListGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A directed graph datastructure where out-edges can be traversed, +i.e. a vertex set + implicit graph.

    + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-ivertexset-1.html b/reference/quickgraph-ivertexset-1.html new file mode 100644 index 000000000..275cc2081 --- /dev/null +++ b/reference/quickgraph-ivertexset-1.html @@ -0,0 +1,129 @@ + + + + + IVertexSet<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IVertexSet<'TVertex>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A set of vertices

    + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + IsVerticesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+

    Gets a value indicating whether there are no vertices in this set.

    + + +
    + + + VertexCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+

    Gets the vertex count.

    + + +
    + + + Vertices + +
    + Signature: IEnumerable<'TVertex>
    + Modifiers: abstract
    +
    +     		+

    Gets the vertices.

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-negativecyclegraphexception.html b/reference/quickgraph-negativecyclegraphexception.html new file mode 100644 index 000000000..c89786687 --- /dev/null +++ b/reference/quickgraph-negativecyclegraphexception.html @@ -0,0 +1,132 @@ + + + + + NegativeCycleGraphException - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    NegativeCycleGraphException

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + new(message) + +
    + Signature: message:string -> unit
    +
    +     		+ +
    + + + new(message, inner) + +
    + Signature: (message:string * inner:exn) -> unit
    +
    +     		+ +
    + + + new(info, context) + +
    + Signature: (info:SerializationInfo * context:StreamingContext) -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-negativeweightexception.html b/reference/quickgraph-negativeweightexception.html new file mode 100644 index 000000000..4efea9bad --- /dev/null +++ b/reference/quickgraph-negativeweightexception.html @@ -0,0 +1,132 @@ + + + + + NegativeWeightException - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    NegativeWeightException

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + new(message) + +
    + Signature: message:string -> unit
    +
    +     		+ +
    + + + new(message, inner) + +
    + Signature: (message:string * inner:exn) -> unit
    +
    +     		+ +
    + + + new(info, context) + +
    + Signature: (info:SerializationInfo * context:StreamingContext) -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-nonacyclicgraphexception.html b/reference/quickgraph-nonacyclicgraphexception.html new file mode 100644 index 000000000..57d2eed24 --- /dev/null +++ b/reference/quickgraph-nonacyclicgraphexception.html @@ -0,0 +1,132 @@ + + + + + NonAcyclicGraphException - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    NonAcyclicGraphException

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + new(message) + +
    + Signature: message:string -> unit
    +
    +     		+ +
    + + + new(message, inner) + +
    + Signature: (message:string * inner:exn) -> unit
    +
    +     		+ +
    + + + new(info, context) + +
    + Signature: (info:SerializationInfo * context:StreamingContext) -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-nonstronglyconnectedgraphexception.html b/reference/quickgraph-nonstronglyconnectedgraphexception.html new file mode 100644 index 000000000..6a9037977 --- /dev/null +++ b/reference/quickgraph-nonstronglyconnectedgraphexception.html @@ -0,0 +1,134 @@ + + + + + NonStronglyConnectedGraphException - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    NonStronglyConnectedGraphException

    +

    + Namespace: QuickGraph
    +

    +
    +

    Exception raised when an algorithm detects a non-strongly connected graph.

    + +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + new(message) + +
    + Signature: message:string -> unit
    +
    +     		+ +
    + + + new(message, inner) + +
    + Signature: (message:string * inner:exn) -> unit
    +
    +     		+ +
    + + + new(info, context) + +
    + Signature: (info:SerializationInfo * context:StreamingContext) -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-nopathfoundexception.html b/reference/quickgraph-nopathfoundexception.html new file mode 100644 index 000000000..b83eb1abf --- /dev/null +++ b/reference/quickgraph-nopathfoundexception.html @@ -0,0 +1,90 @@ + + + + + NoPathFoundException - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    NoPathFoundException

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-paralleledgenotallowedexception.html b/reference/quickgraph-paralleledgenotallowedexception.html new file mode 100644 index 000000000..6a2ec6c03 --- /dev/null +++ b/reference/quickgraph-paralleledgenotallowedexception.html @@ -0,0 +1,132 @@ + + + + + ParallelEdgeNotAllowedException - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ParallelEdgeNotAllowedException

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + new(message) + +
    + Signature: message:string -> unit
    +
    +     		+ +
    + + + new(message, inner) + +
    + Signature: (message:string * inner:exn) -> unit
    +
    +     		+ +
    + + + new(info, context) + +
    + Signature: (info:SerializationInfo * context:StreamingContext) -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-petri-allwaystrueconditionexpression-1.html b/reference/quickgraph-petri-allwaystrueconditionexpression-1.html new file mode 100644 index 000000000..b6c3f0256 --- /dev/null +++ b/reference/quickgraph-petri-allwaystrueconditionexpression-1.html @@ -0,0 +1,113 @@ + + + + + AllwaysTrueConditionExpression<'Token> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    AllwaysTrueConditionExpression<'Token>

    +

    + Namespace: QuickGraph.Petri
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + IsEnabled(tokens) + +
    + Signature: tokens:IList<'Token> -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-petri-iarc-1.html b/reference/quickgraph-petri-iarc-1.html new file mode 100644 index 000000000..f21d5e871 --- /dev/null +++ b/reference/quickgraph-petri-iarc-1.html @@ -0,0 +1,151 @@ + + + + + IArc<'Token> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IArc<'Token>

    +

    + Namespace: QuickGraph.Petri
    +

    +
    +

    A directed edge of a net which may connect a +to a or a to +a .

    + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Annotation() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+

    Gets or sets the arc annotation.

    + + +
    + + + IsInputArc + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+

    Gets a value indicating if the +instance is a input arc.

    + + +
    + + + Place + +
    + Signature: IPlace<'Token>
    + Modifiers: abstract
    +
    +     		+

    Gets the instance attached to the +.

    + + +
    + + + Transition + +
    + Signature: ITransition<'Token>
    + Modifiers: abstract
    +
    +     		+

    Gets or sets the instance attached to the +.

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-petri-iconditionexpression-1.html b/reference/quickgraph-petri-iconditionexpression-1.html new file mode 100644 index 000000000..e61f3e603 --- /dev/null +++ b/reference/quickgraph-petri-iconditionexpression-1.html @@ -0,0 +1,91 @@ + + + + + IConditionExpression<'Token> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IConditionExpression<'Token>

    +

    + Namespace: QuickGraph.Petri
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + IsEnabled(tokens) + +
    + Signature: tokens:IList<'Token> -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-petri-identityexpression-1.html b/reference/quickgraph-petri-identityexpression-1.html new file mode 100644 index 000000000..831c5a280 --- /dev/null +++ b/reference/quickgraph-petri-identityexpression-1.html @@ -0,0 +1,113 @@ + + + + + IdentityExpression<'Token> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IdentityExpression<'Token>

    +

    + Namespace: QuickGraph.Petri
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Eval(marking) + +
    + Signature: marking:IList<'Token> -> IList<'Token>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-petri-iexpression-1.html b/reference/quickgraph-petri-iexpression-1.html new file mode 100644 index 000000000..3a86a5e24 --- /dev/null +++ b/reference/quickgraph-petri-iexpression-1.html @@ -0,0 +1,91 @@ + + + + + IExpression<'Token> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IExpression<'Token>

    +

    + Namespace: QuickGraph.Petri
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Eval(marking) + +
    + Signature: marking:IList<'Token> -> IList<'Token>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-petri-imutablepetrinet-1.html b/reference/quickgraph-petri-imutablepetrinet-1.html new file mode 100644 index 000000000..fac934e1f --- /dev/null +++ b/reference/quickgraph-petri-imutablepetrinet-1.html @@ -0,0 +1,136 @@ + + + + + IMutablePetriNet<'Token> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IMutablePetriNet<'Token>

    +

    + Namespace: QuickGraph.Petri
    +

    +
    +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AddArc(place, transition) + +
    + Signature: (place:IPlace<'Token> * transition:ITransition<'Token>) -> IArc<'Token>
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddArc(transition, place) + +
    + Signature: (transition:ITransition<'Token> * place:IPlace<'Token>) -> IArc<'Token>
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddPlace(name) + +
    + Signature: name:string -> IPlace<'Token>
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddTransition(name) + +
    + Signature: name:string -> ITransition<'Token>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-petri-ipetrigraph-1.html b/reference/quickgraph-petri-ipetrigraph-1.html new file mode 100644 index 000000000..195f27bbd --- /dev/null +++ b/reference/quickgraph-petri-ipetrigraph-1.html @@ -0,0 +1,68 @@ + + + + + IPetriGraph<'Token> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IPetriGraph<'Token>

    +

    + Namespace: QuickGraph.Petri
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-petri-ipetrinet-1.html b/reference/quickgraph-petri-ipetrinet-1.html new file mode 100644 index 000000000..ea4001733 --- /dev/null +++ b/reference/quickgraph-petri-ipetrinet-1.html @@ -0,0 +1,144 @@ + + + + + IPetriNet<'Token> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IPetriNet<'Token>

    +

    + Namespace: QuickGraph.Petri
    +

    +
    +

    A High Level Petri Graph.

    + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Arcs + +
    + Signature: IList<IArc<'Token>>
    + Modifiers: abstract
    +
    +     		+

    Gets a collection of instances.

    + + +
    + + + Graph + +
    + Signature: IPetriGraph<'Token>
    + Modifiers: abstract
    +
    +     		+ +
    + + + Places + +
    + Signature: IList<IPlace<'Token>>
    + Modifiers: abstract
    +
    +     		+

    Gets a collection of instances.

    + + +
    + + + Transitions + +
    + Signature: IList<ITransition<'Token>>
    + Modifiers: abstract
    +
    +     		+

    Gets a collection of instances.

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-petri-ipetrivertex.html b/reference/quickgraph-petri-ipetrivertex.html new file mode 100644 index 000000000..59a61d0da --- /dev/null +++ b/reference/quickgraph-petri-ipetrivertex.html @@ -0,0 +1,95 @@ + + + + + IPetriVertex - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IPetriVertex

    +

    + Namespace: QuickGraph.Petri
    +

    +
    +

    A vertex (node) of a Petri Graph.

    + +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Name + +
    + Signature: string
    + Modifiers: abstract
    +
    +     		+

    Gets or sets the name of the node

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-petri-iplace-1.html b/reference/quickgraph-petri-iplace-1.html new file mode 100644 index 000000000..db9b96e7f --- /dev/null +++ b/reference/quickgraph-petri-iplace-1.html @@ -0,0 +1,108 @@ + + + + + IPlace<'Token> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IPlace<'Token>

    +

    + Namespace: QuickGraph.Petri
    +

    +
    +

    A Place in the HLPN framework

    + +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Marking + +
    + Signature: IList<'Token>
    + Modifiers: abstract
    +
    +     		+ +
    + + + ToStringWithMarking() + +
    + Signature: unit -> string
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-petri-itransition-1.html b/reference/quickgraph-petri-itransition-1.html new file mode 100644 index 000000000..2bb158a14 --- /dev/null +++ b/reference/quickgraph-petri-itransition-1.html @@ -0,0 +1,95 @@ + + + + + ITransition<'Token> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ITransition<'Token>

    +

    + Namespace: QuickGraph.Petri
    +

    +
    +

    A node of a net, taken from the transition kind.

    + +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Condition() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+

    A boolean expression associated with the transition

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-petri-petrinet-1.html b/reference/quickgraph-petri-petrinet-1.html new file mode 100644 index 000000000..a2ffa84b6 --- /dev/null +++ b/reference/quickgraph-petri-petrinet-1.html @@ -0,0 +1,247 @@ + + + + + PetriNet<'Token> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    PetriNet<'Token>

    +

    + Namespace: QuickGraph.Petri
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AddArc(place, transition) + +
    + Signature: (place:IPlace<'Token> * transition:ITransition<'Token>) -> IArc<'Token>
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddArc(transition, place) + +
    + Signature: (transition:ITransition<'Token> * place:IPlace<'Token>) -> IArc<'Token>
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddPlace(name) + +
    + Signature: name:string -> IPlace<'Token>
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddTransition(name) + +
    + Signature: name:string -> ITransition<'Token>
    + Modifiers: abstract
    +
    +     		+ +
    + + + Arcs + +
    + Signature: IList<IArc<'Token>>
    + Modifiers: abstract
    +
    +     		+ +
    + + + Clone() + +
    + Signature: unit -> PetriNet<'Token>
    +
    +     		+ +
    + + + Graph + +
    + Signature: IPetriGraph<'Token>
    + Modifiers: abstract
    +
    +     		+ +
    + + + Places + +
    + Signature: IList<IPlace<'Token>>
    + Modifiers: abstract
    +
    +     		+ +
    + + + ToString() + +
    + Signature: unit -> string
    + Modifiers: abstract
    +
    +     		+ +
    + + + Transitions + +
    + Signature: IList<ITransition<'Token>>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-petri-petrinetsimulator-1.html b/reference/quickgraph-petri-petrinetsimulator-1.html new file mode 100644 index 000000000..16c66ac29 --- /dev/null +++ b/reference/quickgraph-petri-petrinetsimulator-1.html @@ -0,0 +1,140 @@ + + + + + PetriNetSimulator<'Token> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    PetriNetSimulator<'Token>

    +

    + Namespace: QuickGraph.Petri
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(net) + +
    + Signature: net:IPetriNet<'Token> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Initialize() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Net + +
    + Signature: IPetriNet<'Token>
    +
    +     		+ +
    + + + SimulateStep() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-predicates-filteredbidirectionalgraph-3.html b/reference/quickgraph-predicates-filteredbidirectionalgraph-3.html new file mode 100644 index 000000000..4293d9c11 --- /dev/null +++ b/reference/quickgraph-predicates-filteredbidirectionalgraph-3.html @@ -0,0 +1,248 @@ + + + + + FilteredBidirectionalGraph<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FilteredBidirectionalGraph<'TVertex, 'TEdge, 'TGraph>

    +

    + Namespace: QuickGraph.Predicates
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(...) + +
    + Signature: (baseGraph:'TGraph * vertexPredicate:VertexPredicate<'TVertex> * edgePredicate:EdgePredicate<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ContainsEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Degree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Edges + +
    + Signature: IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + InDegree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + InEdge(v, index) + +
    + Signature: (v:'TVertex * index:int) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + + + InEdges(v) + +
    + Signature: v:'TVertex -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsEdgesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsInEdgesEmpty(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetInEdges(v, edges) + +
    + Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-predicates-filterededgelistgraph-3.html b/reference/quickgraph-predicates-filterededgelistgraph-3.html new file mode 100644 index 000000000..d98c6dfce --- /dev/null +++ b/reference/quickgraph-predicates-filterededgelistgraph-3.html @@ -0,0 +1,203 @@ + + + + + FilteredEdgeListGraph<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FilteredEdgeListGraph<'TVertex, 'TEdge, 'TGraph>

    +

    + Namespace: QuickGraph.Predicates
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(...) + +
    + Signature: (baseGraph:'TGraph * vertexPredicate:VertexPredicate<'TVertex> * edgePredicate:EdgePredicate<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ContainsEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Edges + +
    + Signature: IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsEdgesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsVerticesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Vertices + +
    + Signature: IEnumerable<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-predicates-filteredgraph-3.html b/reference/quickgraph-predicates-filteredgraph-3.html new file mode 100644 index 000000000..321a5a611 --- /dev/null +++ b/reference/quickgraph-predicates-filteredgraph-3.html @@ -0,0 +1,174 @@ + + + + + FilteredGraph<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FilteredGraph<'TVertex, 'TEdge, 'TGraph>

    +

    + Namespace: QuickGraph.Predicates
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(...) + +
    + Signature: (baseGraph:'TGraph * vertexPredicate:VertexPredicate<'TVertex> * edgePredicate:EdgePredicate<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AllowParallelEdges + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + BaseGraph + +
    + Signature: 'TGraph
    +
    +     		+

    Underlying filtered graph

    + + +
    + + + EdgePredicate + +
    + Signature: EdgePredicate<'TVertex,'TEdge>
    +
    +     		+

    Edge predicate used to filter the edges

    + + +
    + + + IsDirected + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexPredicate + +
    + Signature: VertexPredicate<'TVertex>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-predicates-filteredimplicitgraph-3.html b/reference/quickgraph-predicates-filteredimplicitgraph-3.html new file mode 100644 index 000000000..a8b572c9a --- /dev/null +++ b/reference/quickgraph-predicates-filteredimplicitgraph-3.html @@ -0,0 +1,173 @@ + + + + + FilteredImplicitGraph<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FilteredImplicitGraph<'TVertex, 'TEdge, 'TGraph>

    +

    + Namespace: QuickGraph.Predicates
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(...) + +
    + Signature: (baseGraph:'TGraph * vertexPredicate:VertexPredicate<'TVertex> * edgePredicate:EdgePredicate<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + IsOutEdgesEmpty(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutDegree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutEdge(v, index) + +
    + Signature: (v:'TVertex * index:int) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutEdges(v) + +
    + Signature: v:'TVertex -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetOutEdges(v, edges) + +
    + Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-predicates-filteredimplicitvertexset-3.html b/reference/quickgraph-predicates-filteredimplicitvertexset-3.html new file mode 100644 index 000000000..7a6a190eb --- /dev/null +++ b/reference/quickgraph-predicates-filteredimplicitvertexset-3.html @@ -0,0 +1,113 @@ + + + + + FilteredImplicitVertexSet<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FilteredImplicitVertexSet<'TVertex, 'TEdge, 'TGraph>

    +

    + Namespace: QuickGraph.Predicates
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(...) + +
    + Signature: (baseGraph:'TGraph * vertexPredicate:VertexPredicate<'TVertex> * edgePredicate:EdgePredicate<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + ContainsVertex(vertex) + +
    + Signature: vertex:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-predicates-filteredincidencegraph-3.html b/reference/quickgraph-predicates-filteredincidencegraph-3.html new file mode 100644 index 000000000..fd5bed169 --- /dev/null +++ b/reference/quickgraph-predicates-filteredincidencegraph-3.html @@ -0,0 +1,143 @@ + + + + + FilteredIncidenceGraph<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FilteredIncidenceGraph<'TVertex, 'TEdge, 'TGraph>

    +

    + Namespace: QuickGraph.Predicates
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(...) + +
    + Signature: (baseGraph:'TGraph * vertexPredicate:VertexPredicate<'TVertex> * edgePredicate:EdgePredicate<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ContainsEdge(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetEdge(source, target, edge) + +
    + Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetEdges(source, target, edges) + +
    + Signature: (source:'TVertex * target:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-predicates-filteredundirectedgraph-3.html b/reference/quickgraph-predicates-filteredundirectedgraph-3.html new file mode 100644 index 000000000..94c030e06 --- /dev/null +++ b/reference/quickgraph-predicates-filteredundirectedgraph-3.html @@ -0,0 +1,323 @@ + + + + + FilteredUndirectedGraph<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FilteredUndirectedGraph<'TVertex, 'TEdge, 'TGraph>

    +

    + Namespace: QuickGraph.Predicates
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(...) + +
    + Signature: (baseGraph:'TGraph * vertexPredicate:VertexPredicate<'TVertex> * edgePredicate:EdgePredicate<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AdjacentDegree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + AdjacentEdge(v, index) + +
    + Signature: (v:'TVertex * index:int) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + + + AdjacentEdges(v) + +
    + Signature: v:'TVertex -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsEdge(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsVertex(vertex) + +
    + Signature: vertex:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeEqualityComparer + +
    + Signature: EdgeEqualityComparer<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + Edges + +
    + Signature: IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsAdjacentEdgesEmpty(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsEdgesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsVerticesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetEdge(source, target, edge) + +
    + Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Vertices + +
    + Signature: IEnumerable<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-predicates-filteredvertexandedgelistgraph-3.html b/reference/quickgraph-predicates-filteredvertexandedgelistgraph-3.html new file mode 100644 index 000000000..9d8d34d9e --- /dev/null +++ b/reference/quickgraph-predicates-filteredvertexandedgelistgraph-3.html @@ -0,0 +1,158 @@ + + + + + FilteredVertexAndEdgeListGraph<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FilteredVertexAndEdgeListGraph<'TVertex, 'TEdge, 'TGraph>

    +

    + Namespace: QuickGraph.Predicates
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(...) + +
    + Signature: (baseGraph:'TGraph * vertexPredicate:VertexPredicate<'TVertex> * edgePredicate:EdgePredicate<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ContainsEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Edges + +
    + Signature: IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsEdgesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-predicates-filteredvertexlistgraph-3.html b/reference/quickgraph-predicates-filteredvertexlistgraph-3.html new file mode 100644 index 000000000..3130c7672 --- /dev/null +++ b/reference/quickgraph-predicates-filteredvertexlistgraph-3.html @@ -0,0 +1,143 @@ + + + + + FilteredVertexListGraph<'TVertex, 'TEdge, 'Graph> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FilteredVertexListGraph<'TVertex, 'TEdge, 'Graph>

    +

    + Namespace: QuickGraph.Predicates
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(...) + +
    + Signature: (baseGraph:'Graph * vertexPredicate:VertexPredicate<'TVertex> * edgePredicate:EdgePredicate<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + IsVerticesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Vertices + +
    + Signature: IEnumerable<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-predicates-indictionaryvertexpredicate-2.html b/reference/quickgraph-predicates-indictionaryvertexpredicate-2.html new file mode 100644 index 000000000..b951d9555 --- /dev/null +++ b/reference/quickgraph-predicates-indictionaryvertexpredicate-2.html @@ -0,0 +1,112 @@ + + + + + InDictionaryVertexPredicate<'TVertex, 'TValue> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    InDictionaryVertexPredicate<'TVertex, 'TValue>

    +

    + Namespace: QuickGraph.Predicates
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(dictionary) + +
    + Signature: dictionary:IDictionary<'TVertex,'TValue> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Test(v) + +
    + Signature: v:'TVertex -> bool
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-predicates-isolatedvertexpredicate-2.html b/reference/quickgraph-predicates-isolatedvertexpredicate-2.html new file mode 100644 index 000000000..26eb18cda --- /dev/null +++ b/reference/quickgraph-predicates-isolatedvertexpredicate-2.html @@ -0,0 +1,114 @@ + + + + + IsolatedVertexPredicate<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    IsolatedVertexPredicate<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Predicates
    +

    +
    +

    A vertex predicate that detects vertex with no in or out edges.

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Test(v) + +
    + Signature: v:'TVertex -> bool
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-predicates-residualedgepredicate-2.html b/reference/quickgraph-predicates-residualedgepredicate-2.html new file mode 100644 index 000000000..7b918a605 --- /dev/null +++ b/reference/quickgraph-predicates-residualedgepredicate-2.html @@ -0,0 +1,126 @@ + + + + + ResidualEdgePredicate<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ResidualEdgePredicate<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Predicates
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(residualCapacities) + +
    + Signature: residualCapacities:IDictionary<'TEdge,float> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ResidualCapacities + +
    + Signature: IDictionary<'TEdge,float>
    +
    +     		+ +
    + + + Test(e) + +
    + Signature: e:'TEdge -> bool
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-predicates-reversedresidualedgepredicate-2.html b/reference/quickgraph-predicates-reversedresidualedgepredicate-2.html new file mode 100644 index 000000000..c364e4c3e --- /dev/null +++ b/reference/quickgraph-predicates-reversedresidualedgepredicate-2.html @@ -0,0 +1,144 @@ + + + + + ReversedResidualEdgePredicate<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ReversedResidualEdgePredicate<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Predicates
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(residualCapacities, reversedEdges) + +
    + Signature: (residualCapacities:IDictionary<'TEdge,float> * reversedEdges:IDictionary<'TEdge,'TEdge>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + ResidualCapacities + +
    + Signature: IDictionary<'TEdge,float>
    +
    +     		+

    Residual capacities map

    + + +
    + + + ReversedEdges + +
    + Signature: IDictionary<'TEdge,'TEdge>
    +
    +     		+

    Reversed edges map

    + + +
    + + + Test(e) + +
    + Signature: e:'TEdge -> bool
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-predicates-sinkvertexpredicate-2.html b/reference/quickgraph-predicates-sinkvertexpredicate-2.html new file mode 100644 index 000000000..4d2a8befa --- /dev/null +++ b/reference/quickgraph-predicates-sinkvertexpredicate-2.html @@ -0,0 +1,112 @@ + + + + + SinkVertexPredicate<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    SinkVertexPredicate<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Predicates
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:IIncidenceGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Test(v) + +
    + Signature: v:'TVertex -> bool
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-quickgraphexception.html b/reference/quickgraph-quickgraphexception.html new file mode 100644 index 000000000..b8c9ea74e --- /dev/null +++ b/reference/quickgraph-quickgraphexception.html @@ -0,0 +1,132 @@ + + + + + QuickGraphException - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    QuickGraphException

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + new(message) + +
    + Signature: message:string -> unit
    +
    +     		+ +
    + + + new(message, inner) + +
    + Signature: (message:string * inner:exn) -> unit
    +
    +     		+ +
    + + + new(info, context) + +
    + Signature: (info:SerializationInfo * context:StreamingContext) -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-quickgraphresourcemanager.html b/reference/quickgraph-quickgraphresourcemanager.html new file mode 100644 index 000000000..72268adb7 --- /dev/null +++ b/reference/quickgraph-quickgraphresourcemanager.html @@ -0,0 +1,118 @@ + + + + + QuickGraphResourceManager - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    QuickGraphResourceManager

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Static members

    + + + + + + + + + + + + + + + + + + +
    Static memberDescription
    + + + DumpResources(path) + +
    + Signature: path:string -> unit
    +
    +     		+ +
    + + + GetBanner() + +
    + Signature: unit -> Image
    +
    +     		+ +
    + + + GetLogo() + +
    + Signature: unit -> Image
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-referenceequalitycomparer-1.html b/reference/quickgraph-referenceequalitycomparer-1.html new file mode 100644 index 000000000..87ad51222 --- /dev/null +++ b/reference/quickgraph-referenceequalitycomparer-1.html @@ -0,0 +1,136 @@ + + + + + ReferenceEqualityComparer<'T> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ReferenceEqualityComparer<'T>

    +

    + Namespace: QuickGraph
    +

    +
    +

    EqualityComparer that uses Object.ReferenceEquals to compare items.

    + +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Equals(x, y) + +
    + Signature: (x:'T * y:'T) -> bool
    + Modifiers: abstract
    +
    +     		+

    Equates two objects of type T using ReferenceEquals.

    + + +
    + + + GetHashCode(x) + +
    + Signature: x:'T -> int
    + Modifiers: abstract
    +
    +     		+

    Hash code using the usual Object.GetHashCode when applied to type T.

    + + +
    +

    Static members

    + + + + + + + + + + +
    Static memberDescription
    + + + Instance + +
    + Signature: ReferenceEqualityComparer<'T>
    +
    +     		+

    Default singleton instance of this class.

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-reversedbidirectionalgraph-2.html b/reference/quickgraph-reversedbidirectionalgraph-2.html new file mode 100644 index 000000000..e7be47efc --- /dev/null +++ b/reference/quickgraph-reversedbidirectionalgraph-2.html @@ -0,0 +1,472 @@ + + + + + ReversedBidirectionalGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ReversedBidirectionalGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(originalGraph) + +
    + Signature: originalGraph:IBidirectionalGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AllowParallelEdges + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsEdge(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsEdge(edge) + +
    + Signature: edge:SReversedEdge<'TVertex,'TEdge> -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsVertex(vertex) + +
    + Signature: vertex:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Degree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Edges + +
    + Signature: IEnumerable<SReversedEdge<'TVertex,'TEdge>>
    + Modifiers: abstract
    +
    +     		+ +
    + + + InDegree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + InEdge(v, index) + +
    + Signature: (v:'TVertex * index:int) -> SReversedEdge<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + InEdges(v) + +
    + Signature: v:'TVertex -> IEnumerable<SReversedEdge<'TVertex,'TEdge>>
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsDirected + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsEdgesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsInEdgesEmpty(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsOutEdgesEmpty(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsVerticesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + OriginalGraph + +
    + Signature: IBidirectionalGraph<'TVertex,'TEdge>
    +
    +     		+ +
    + + + OutDegree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutEdge(v, index) + +
    + Signature: (v:'TVertex * index:int) -> SReversedEdge<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutEdges(v) + +
    + Signature: v:'TVertex -> IEnumerable<SReversedEdge<'TVertex,'TEdge>>
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetEdge(source, target, edge) + +
    + Signature: (source:'TVertex * target:'TVertex * edge:byref<SReversedEdge<'TVertex,'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetEdges(source, target, edges) + +
    + Signature: (source:'TVertex * target:'TVertex * edges:byref<IEnumerable<SReversedEdge<'TVertex,'TEdge>>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetInEdges(v, edges) + +
    + Signature: (v:'TVertex * edges:byref<IEnumerable<SReversedEdge<'TVertex,'TEdge>>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetOutEdges(v, edges) + +
    + Signature: (v:'TVertex * edges:byref<IEnumerable<SReversedEdge<'TVertex,'TEdge>>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Vertices + +
    + Signature: IEnumerable<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-samples-graphcreation.html b/reference/quickgraph-samples-graphcreation.html new file mode 100644 index 000000000..e682e55e8 --- /dev/null +++ b/reference/quickgraph-samples-graphcreation.html @@ -0,0 +1,126 @@ + + + + + GraphCreation - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphCreation

    +

    + Namespace: QuickGraph.Samples
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + DelegateGraph() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + EdgeArrayToAdjacencyGraph() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-samples-graphvizsamples.html b/reference/quickgraph-samples-graphvizsamples.html new file mode 100644 index 000000000..54db6be2b --- /dev/null +++ b/reference/quickgraph-samples-graphvizsamples.html @@ -0,0 +1,112 @@ + + + + + GraphvizSamples - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphvizSamples

    +

    + Namespace: QuickGraph.Samples
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + RenderGraphWithGraphviz() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-samples-wikisamples.html b/reference/quickgraph-samples-wikisamples.html new file mode 100644 index 000000000..8018337b2 --- /dev/null +++ b/reference/quickgraph-samples-wikisamples.html @@ -0,0 +1,112 @@ + + + + + WikiSamples - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    WikiSamples

    +

    + Namespace: QuickGraph.Samples
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + ShortestPath() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-sedge-1.html b/reference/quickgraph-sedge-1.html new file mode 100644 index 000000000..4da310d72 --- /dev/null +++ b/reference/quickgraph-sedge-1.html @@ -0,0 +1,153 @@ + + + + + SEdge<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    SEdge<'TVertex>

    +

    + Namespace: QuickGraph
    +

    +
    +

    An struct based implementation.

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> unit
    +
    +     		+

    Initializes a new instance of the class.

    + + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Source + +
    + Signature: 'TVertex
    + Modifiers: abstract
    +
    +     		+

    Gets the source vertex

    + + +
    + + + Target + +
    + Signature: 'TVertex
    + Modifiers: abstract
    +
    +     		+

    Gets the target vertex

    + + +
    + + + ToString() + +
    + Signature: unit -> string
    + Modifiers: abstract
    +
    +     		+

    Returns a that represents the current .

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-sequatableedge-1.html b/reference/quickgraph-sequatableedge-1.html new file mode 100644 index 000000000..8045d7758 --- /dev/null +++ b/reference/quickgraph-sequatableedge-1.html @@ -0,0 +1,204 @@ + + + + + SEquatableEdge<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    SEquatableEdge<'TVertex>

    +

    + Namespace: QuickGraph
    +

    +
    +

    An struct based implementation.

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> unit
    +
    +     		+

    Initializes a new instance of the class.

    + + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Equals(other) + +
    + Signature: other:SEquatableEdge<'TVertex> -> bool
    + Modifiers: abstract
    +
    +     		+

    Indicates whether the current object is equal to another object of the same type.

    + + +
    + + + Equals(obj) + +
    + Signature: obj:obj -> bool
    + Modifiers: abstract
    +
    +     		+

    Indicates whether this instance and a specified object are equal.

    + + +
    + + + GetHashCode() + +
    + Signature: unit -> int
    + Modifiers: abstract
    +
    +     		+

    Returns the hash code for this instance.

    + + +
    + + + Source + +
    + Signature: 'TVertex
    + Modifiers: abstract
    +
    +     		+

    Gets the source vertex

    + + +
    + + + Target + +
    + Signature: 'TVertex
    + Modifiers: abstract
    +
    +     		+

    Gets the target vertex

    + + +
    + + + ToString() + +
    + Signature: unit -> string
    + Modifiers: abstract
    +
    +     		+

    Returns a that represents the current .

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-sequatableundirectededge-1.html b/reference/quickgraph-sequatableundirectededge-1.html new file mode 100644 index 000000000..40501fe9c --- /dev/null +++ b/reference/quickgraph-sequatableundirectededge-1.html @@ -0,0 +1,204 @@ + + + + + SEquatableUndirectedEdge<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    SEquatableUndirectedEdge<'TVertex>

    +

    + Namespace: QuickGraph
    +

    +
    +

    An struct based implementation.

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> unit
    +
    +     		+

    Initializes a new instance of the class.

    + + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Equals(other) + +
    + Signature: other:SEquatableUndirectedEdge<'TVertex> -> bool
    + Modifiers: abstract
    +
    +     		+

    Indicates whether the current object is equal to another object of the same type.

    + + +
    + + + Equals(obj) + +
    + Signature: obj:obj -> bool
    + Modifiers: abstract
    +
    +     		+

    Indicates whether this instance and a specified object are equal.

    + + +
    + + + GetHashCode() + +
    + Signature: unit -> int
    + Modifiers: abstract
    +
    +     		+

    Returns the hash code for this instance.

    + + +
    + + + Source + +
    + Signature: 'TVertex
    + Modifiers: abstract
    +
    +     		+

    Gets the source vertex

    + + +
    + + + Target + +
    + Signature: 'TVertex
    + Modifiers: abstract
    +
    +     		+

    Gets the target vertex

    + + +
    + + + ToString() + +
    + Signature: unit -> string
    + Modifiers: abstract
    +
    +     		+

    Returns a that represents the current .

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-directedgraphml-clrboolean.html b/reference/quickgraph-serialization-directedgraphml-clrboolean.html new file mode 100644 index 000000000..1eece078d --- /dev/null +++ b/reference/quickgraph-serialization-directedgraphml-clrboolean.html @@ -0,0 +1,68 @@ + + + + + ClrBoolean - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    ClrBoolean

    +

    + Namespace: QuickGraph.Serialization.DirectedGraphML
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-directedgraphml-directedgraph.html b/reference/quickgraph-serialization-directedgraphml-directedgraph.html new file mode 100644 index 000000000..933064e06 --- /dev/null +++ b/reference/quickgraph-serialization-directedgraphml-directedgraph.html @@ -0,0 +1,364 @@ + + + + + DirectedGraph - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DirectedGraph

    +

    + Namespace: QuickGraph.Serialization.DirectedGraphML
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Background() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + BackgroundImage() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + ButterflyMode() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + ButterflyModeSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Categories() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + GraphDirection() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + GraphDirectionSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IdentifierAliases() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Layout() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + LayoutSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Links() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + NeighborhoodDistance() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Nodes() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Paths() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Properties() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + QualifiedNames() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Styles() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Title() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + ZoomLevel() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-directedgraphml-directedgraphalias.html b/reference/quickgraph-serialization-directedgraphml-directedgraphalias.html new file mode 100644 index 000000000..02d09418e --- /dev/null +++ b/reference/quickgraph-serialization-directedgraphml-directedgraphalias.html @@ -0,0 +1,140 @@ + + + + + DirectedGraphAlias - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DirectedGraphAlias

    +

    + Namespace: QuickGraph.Serialization.DirectedGraphML
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Id() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + n() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Uri() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-directedgraphml-directedgraphcategory.html b/reference/quickgraph-serialization-directedgraphml-directedgraphcategory.html new file mode 100644 index 000000000..d2ba74e64 --- /dev/null +++ b/reference/quickgraph-serialization-directedgraphml-directedgraphcategory.html @@ -0,0 +1,644 @@ + + + + + DirectedGraphCategory - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DirectedGraphCategory

    +

    + Namespace: QuickGraph.Serialization.DirectedGraphML
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Background() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + BasedOn() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CanBeDataDriven() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CanLinkedNodesBeDataDriven() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + DefaultAction() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Details() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FontFamily() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FontSize() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FontSizeSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FontStyle() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FontStyleSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FontWeight() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FontWeightSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + HorizontalAlignment() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + HorizontalAlignmentSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Icon() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Id() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + InboundName() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IncomingActionLabel() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsContainment() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsContainmentSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsProviderRoot() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsProviderRootSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsTag() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsTagSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Label() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + NavigationActionLabel() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + OutboundName() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + OutgoingActionLabel() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Shape() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + SourceCategory() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Stroke() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + StrokeDashArray() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Style() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + TargetCategory() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + VerticalAlignment() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + VerticalAlignmentSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Visibility() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + VisibilitySpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-directedgraphml-directedgraphlink.html b/reference/quickgraph-serialization-directedgraphml-directedgraphlink.html new file mode 100644 index 000000000..b4f0a5bfb --- /dev/null +++ b/reference/quickgraph-serialization-directedgraphml-directedgraphlink.html @@ -0,0 +1,392 @@ + + + + + DirectedGraphLink - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DirectedGraphLink

    +

    + Namespace: QuickGraph.Serialization.DirectedGraphML
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AttractConsumers() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + AttractConsumersSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Background() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Category() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Category1() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FontFamily() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FontSize() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FontSizeSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FontStyle() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FontStyleSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FontWeight() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FontWeightSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Label() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Seeder() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + SeederSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Source() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Stroke() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + StrokeDashArray() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Target() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Visibility() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + VisibilitySpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-directedgraphml-directedgraphlinkcategory.html b/reference/quickgraph-serialization-directedgraphml-directedgraphlinkcategory.html new file mode 100644 index 000000000..f873cc181 --- /dev/null +++ b/reference/quickgraph-serialization-directedgraphml-directedgraphlinkcategory.html @@ -0,0 +1,112 @@ + + + + + DirectedGraphLinkCategory - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DirectedGraphLinkCategory

    +

    + Namespace: QuickGraph.Serialization.DirectedGraphML
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Ref() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-directedgraphml-directedgraphname.html b/reference/quickgraph-serialization-directedgraphml-directedgraphname.html new file mode 100644 index 000000000..b469bd699 --- /dev/null +++ b/reference/quickgraph-serialization-directedgraphml-directedgraphname.html @@ -0,0 +1,154 @@ + + + + + DirectedGraphName - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DirectedGraphName

    +

    + Namespace: QuickGraph.Serialization.DirectedGraphML
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Formatter() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Id() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Label() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + ValueType() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-directedgraphml-directedgraphnode.html b/reference/quickgraph-serialization-directedgraphml-directedgraphnode.html new file mode 100644 index 000000000..c19f4bc9c --- /dev/null +++ b/reference/quickgraph-serialization-directedgraphml-directedgraphnode.html @@ -0,0 +1,2100 @@ + + + + + DirectedGraphNode - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DirectedGraphNode

    +

    + Namespace: QuickGraph.Serialization.DirectedGraphML
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Access() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Assembly() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Background() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Category() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Category1() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeGenIncoming() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeGenIncomingSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeGenSourceName() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeGenTargetName() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_CallSequenceNumber() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_CallSequenceNumberSpecified(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_DisableEnabledErrorHandler(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_DisableEnabledErrorHandlerSpecified(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_DisableEnabledException(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_DisableEnabledExceptionSpecified(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_EndColumn() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_EndColumnSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_EndLine() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_EndLineSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_FrameDepth() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_FrameDepthSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_FrameKind() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_FrameKindSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_Icon() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_InstanceTrackingInformation(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsAbstract() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsAbstractSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsAnonymous() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsAnonymousSpecified(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsArray() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsArraySpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsByReference() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsByReferenceSpecified(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsCallToThis() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsCallToThisSpecified(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsConstructor() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsConstructorSpecified(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsDo() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsDoSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsFinal() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsFinalSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsFor() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsForEach() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsForEachSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsForSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsGeneric() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsGenericInstance() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsGenericInstanceSpecified(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsGenericSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsHideBySignature() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsHideBySignatureSpecified(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsInternal() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsInternalSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsOperator() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsOperatorSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsOut() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsOutSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsParameterArray() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsParameterArraySpecified(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsPrivate() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsPrivateSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsPropertyGet() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsPropertyGetSpecified(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsPropertySet() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsPropertySetSpecified(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsProtected() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsProtectedOrInternal(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsProtectedOrInternalSpecified(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsProtectedSpecified(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsPrototype() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsPrototypeSpecified(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsPublic() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsPublicSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsSpecialName() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsSpecialNameSpecified(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsStatic() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsStaticSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsUntilLoop() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsUntilLoopSpecified(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsVirtual() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsVirtualSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsWhile() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_IsWhileSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_PreserveData() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_PreserveDataSpecified(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_SingleInstanceSourceLink(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_SingleInstanceSourceLinkSpecified(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_SingleInstanceTargetLink(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_SingleInstanceTargetLinkSpecified(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_SourceText() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_StartColumn() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_StartColumnSpecified(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_StartLine() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_StartLineSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_StatementKind() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_StatementNumber() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_StatementNumberSpecified(...) + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + CodeSchemaProperty_StatementType() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Description() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FilePath() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FontFamily() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FontSize() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FontSizeSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FontStyle() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FontStyleSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FontWeight() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FontWeightSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + FunctionTypeFlags() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Group() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + GroupSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + HorizontalAlignment() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + HorizontalAlignmentSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Icon() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Id() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsAbstract() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsAbstractSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsCodeType() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsCodeTypeSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsDocumentation() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsDocumentationSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsHub() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsHubSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsOverloaded() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsOverloadedSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsOverridable() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsOverridableSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsVertical() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsVerticalSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Label() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Language() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + LinesOfCode() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + LinesOfCodeSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Location() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + MustImplement() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Namespace() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Reference() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Shape() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Style() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + TypeName() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + VerticalAlignment() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + VerticalAlignmentSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Visibility() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + VisibilitySpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-directedgraphml-directedgraphnodecategory.html b/reference/quickgraph-serialization-directedgraphml-directedgraphnodecategory.html new file mode 100644 index 000000000..9ad7652b8 --- /dev/null +++ b/reference/quickgraph-serialization-directedgraphml-directedgraphnodecategory.html @@ -0,0 +1,112 @@ + + + + + DirectedGraphNodeCategory - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DirectedGraphNodeCategory

    +

    + Namespace: QuickGraph.Serialization.DirectedGraphML
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Ref() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-directedgraphml-directedgraphpath.html b/reference/quickgraph-serialization-directedgraphml-directedgraphpath.html new file mode 100644 index 000000000..710aad2da --- /dev/null +++ b/reference/quickgraph-serialization-directedgraphml-directedgraphpath.html @@ -0,0 +1,126 @@ + + + + + DirectedGraphPath - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DirectedGraphPath

    +

    + Namespace: QuickGraph.Serialization.DirectedGraphML
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Id() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Value() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-directedgraphml-directedgraphproperty.html b/reference/quickgraph-serialization-directedgraphml-directedgraphproperty.html new file mode 100644 index 000000000..10c908a3f --- /dev/null +++ b/reference/quickgraph-serialization-directedgraphml-directedgraphproperty.html @@ -0,0 +1,210 @@ + + + + + DirectedGraphProperty - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DirectedGraphProperty

    +

    + Namespace: QuickGraph.Serialization.DirectedGraphML
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + DataType() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Description() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Group() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Id() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsReference() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsReferenceSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Label() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + ReferenceTemplate() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-directedgraphml-directedgraphstyle.html b/reference/quickgraph-serialization-directedgraphml-directedgraphstyle.html new file mode 100644 index 000000000..0dbbb362b --- /dev/null +++ b/reference/quickgraph-serialization-directedgraphml-directedgraphstyle.html @@ -0,0 +1,210 @@ + + + + + DirectedGraphStyle - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DirectedGraphStyle

    +

    + Namespace: QuickGraph.Serialization.DirectedGraphML
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Condition() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + GroupLabel() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsEnabled() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + IsEnabledSpecified() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Setter() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + TargetType() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + ToolTip() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + ValueLabel() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-directedgraphml-directedgraphstylecondition.html b/reference/quickgraph-serialization-directedgraphml-directedgraphstylecondition.html new file mode 100644 index 000000000..8a1f47347 --- /dev/null +++ b/reference/quickgraph-serialization-directedgraphml-directedgraphstylecondition.html @@ -0,0 +1,112 @@ + + + + + DirectedGraphStyleCondition - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DirectedGraphStyleCondition

    +

    + Namespace: QuickGraph.Serialization.DirectedGraphML
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Expression() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-directedgraphml-directedgraphstylesetter.html b/reference/quickgraph-serialization-directedgraphml-directedgraphstylesetter.html new file mode 100644 index 000000000..0c34265aa --- /dev/null +++ b/reference/quickgraph-serialization-directedgraphml-directedgraphstylesetter.html @@ -0,0 +1,140 @@ + + + + + DirectedGraphStyleSetter - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DirectedGraphStyleSetter

    +

    + Namespace: QuickGraph.Serialization.DirectedGraphML
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Expression() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Property() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + Value() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-directedgraphml-fontstyleenum.html b/reference/quickgraph-serialization-directedgraphml-fontstyleenum.html new file mode 100644 index 000000000..d6a4fd844 --- /dev/null +++ b/reference/quickgraph-serialization-directedgraphml-fontstyleenum.html @@ -0,0 +1,68 @@ + + + + + FontStyleEnum - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FontStyleEnum

    +

    + Namespace: QuickGraph.Serialization.DirectedGraphML
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-directedgraphml-fontweightenum.html b/reference/quickgraph-serialization-directedgraphml-fontweightenum.html new file mode 100644 index 000000000..a226b8b19 --- /dev/null +++ b/reference/quickgraph-serialization-directedgraphml-fontweightenum.html @@ -0,0 +1,68 @@ + + + + + FontWeightEnum - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FontWeightEnum

    +

    + Namespace: QuickGraph.Serialization.DirectedGraphML
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-directedgraphml-framekindenum.html b/reference/quickgraph-serialization-directedgraphml-framekindenum.html new file mode 100644 index 000000000..6936918d6 --- /dev/null +++ b/reference/quickgraph-serialization-directedgraphml-framekindenum.html @@ -0,0 +1,68 @@ + + + + + FrameKindEnum - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    FrameKindEnum

    +

    + Namespace: QuickGraph.Serialization.DirectedGraphML
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-directedgraphml-graphdirectionenum.html b/reference/quickgraph-serialization-directedgraphml-graphdirectionenum.html new file mode 100644 index 000000000..3acf42205 --- /dev/null +++ b/reference/quickgraph-serialization-directedgraphml-graphdirectionenum.html @@ -0,0 +1,68 @@ + + + + + GraphDirectionEnum - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphDirectionEnum

    +

    + Namespace: QuickGraph.Serialization.DirectedGraphML
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-directedgraphml-groupenum.html b/reference/quickgraph-serialization-directedgraphml-groupenum.html new file mode 100644 index 000000000..4953cbfdb --- /dev/null +++ b/reference/quickgraph-serialization-directedgraphml-groupenum.html @@ -0,0 +1,68 @@ + + + + + GroupEnum - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GroupEnum

    +

    + Namespace: QuickGraph.Serialization.DirectedGraphML
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-directedgraphml-horizontalalignmentenum.html b/reference/quickgraph-serialization-directedgraphml-horizontalalignmentenum.html new file mode 100644 index 000000000..b0e2c1b4d --- /dev/null +++ b/reference/quickgraph-serialization-directedgraphml-horizontalalignmentenum.html @@ -0,0 +1,68 @@ + + + + + HorizontalAlignmentEnum - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    HorizontalAlignmentEnum

    +

    + Namespace: QuickGraph.Serialization.DirectedGraphML
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-directedgraphml-layoutenum.html b/reference/quickgraph-serialization-directedgraphml-layoutenum.html new file mode 100644 index 000000000..d55282a96 --- /dev/null +++ b/reference/quickgraph-serialization-directedgraphml-layoutenum.html @@ -0,0 +1,68 @@ + + + + + LayoutEnum - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    LayoutEnum

    +

    + Namespace: QuickGraph.Serialization.DirectedGraphML
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-directedgraphml-propertytype.html b/reference/quickgraph-serialization-directedgraphml-propertytype.html new file mode 100644 index 000000000..eb02ece14 --- /dev/null +++ b/reference/quickgraph-serialization-directedgraphml-propertytype.html @@ -0,0 +1,68 @@ + + + + + PropertyType - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    PropertyType

    +

    + Namespace: QuickGraph.Serialization.DirectedGraphML
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-directedgraphml-targettypeenum.html b/reference/quickgraph-serialization-directedgraphml-targettypeenum.html new file mode 100644 index 000000000..6d327bc4c --- /dev/null +++ b/reference/quickgraph-serialization-directedgraphml-targettypeenum.html @@ -0,0 +1,68 @@ + + + + + TargetTypeEnum - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    TargetTypeEnum

    +

    + Namespace: QuickGraph.Serialization.DirectedGraphML
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-directedgraphml-verticalalignmentenum.html b/reference/quickgraph-serialization-directedgraphml-verticalalignmentenum.html new file mode 100644 index 000000000..8b99d0e79 --- /dev/null +++ b/reference/quickgraph-serialization-directedgraphml-verticalalignmentenum.html @@ -0,0 +1,68 @@ + + + + + VerticalAlignmentEnum - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    VerticalAlignmentEnum

    +

    + Namespace: QuickGraph.Serialization.DirectedGraphML
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-directedgraphml-visibilityenum.html b/reference/quickgraph-serialization-directedgraphml-visibilityenum.html new file mode 100644 index 000000000..090e7fc4e --- /dev/null +++ b/reference/quickgraph-serialization-directedgraphml-visibilityenum.html @@ -0,0 +1,68 @@ + + + + + VisibilityEnum - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    VisibilityEnum

    +

    + Namespace: QuickGraph.Serialization.DirectedGraphML
    +

    +
    +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-directedgraphmlalgorithm-2.html b/reference/quickgraph-serialization-directedgraphmlalgorithm-2.html new file mode 100644 index 000000000..7c894e654 --- /dev/null +++ b/reference/quickgraph-serialization-directedgraphmlalgorithm-2.html @@ -0,0 +1,160 @@ + + + + + DirectedGraphMLAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DirectedGraphMLAlgorithm<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Serialization
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(...) + +
    + Signature: (visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * vertexIdentities:VertexIdentity<'TVertex> * edgeIdentities:EdgeIdentity<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + DirectedGraph + +
    + Signature: DirectedGraph
    +
    +     		+ +
    + + + FormatEdge + +
    + Signature: Action<'TEdge,DirectedGraphLink>
    +
    +     		+

    Raised when a new link is added to the graph

    + + +
    + + + FormatGraph + +
    + Signature: Action<IVertexAndEdgeListGraph<'TVertex,'TEdge>,DirectedGraph>
    +
    +     		+

    Raised when the graph is about to be returned

    + + +
    + + + FormatNode + +
    + Signature: Action<'TVertex,DirectedGraphNode>
    +
    +     		+

    Raised when a new node is added to the graph

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-directedgraphmlextensions.html b/reference/quickgraph-serialization-directedgraphmlextensions.html new file mode 100644 index 000000000..164d1f3cf --- /dev/null +++ b/reference/quickgraph-serialization-directedgraphmlextensions.html @@ -0,0 +1,236 @@ + + + + + DirectedGraphMLExtensions - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    DirectedGraphMLExtensions

    +

    + Namespace: QuickGraph.Serialization
    +

    +
    +

    Directed Graph Markup Language extensions

    + +
    +

    Static members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Static memberDescription
    + + + DirectedGraphSerializer + +
    + Signature: XmlSerializer
    +
    +     		+

    Gets the DirectedGraph xml serializer

    + + +
    + + + OpenAsDGML(graph, filename) + +
    + Signature: (graph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * filename:string) -> unit
    + Type parameters: 'TVertex, 'TEdge
    +     		+ +
    + + + ToDirectedGraphML(visitedGraph) + +
    + Signature: visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> DirectedGraph
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Populates a DGML graph from a graph

    + + +
    + + + ToDirectedGraphML(...) + +
    + Signature: (visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * vertexColors:Func<'TVertex,GraphColor>) -> DirectedGraph
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Populates a DGML graph from a graph

    + + +
    + + + ToDirectedGraphML(...) + +
    + Signature: (visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * vertexIdentities:VertexIdentity<'TVertex> * edgeIdentities:EdgeIdentity<'TVertex,'TEdge>) -> DirectedGraph
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Populates a DGML graph from a graph

    + + +
    + + + ToDirectedGraphML(...) + +
    + Signature: (visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * vertexIdentities:VertexIdentity<'TVertex> * edgeIdentities:EdgeIdentity<'TVertex,'TEdge> * _formatNode:Action<'TVertex,DirectedGraphNode> * _formatEdge:Action<'TEdge,DirectedGraphLink>) -> DirectedGraph
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Populates a DGML graph from a graph

    + + +
    + + + WriteXml(graph, fileName) + +
    + Signature: (graph:DirectedGraph * fileName:string) -> unit
    +
    +     		+

    Writes the dgml data structure to the xml writer

    + + +
    + + + WriteXml(graph, writer) + +
    + Signature: (graph:DirectedGraph * writer:XmlWriter) -> unit
    +
    +     		+

    Writes the dgml data structure to the xml writer

    + + +
    + + + WriteXml(graph, stream) + +
    + Signature: (graph:DirectedGraph * stream:Stream) -> unit
    +
    +     		+

    Writes the dgml data structure to the xml writer

    + + +
    + + + WriteXml(graph, writer) + +
    + Signature: (graph:DirectedGraph * writer:TextWriter) -> unit
    +
    +     		+

    Writes the dgml data structure to the xml writer

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-graphmldeserializer-3.html b/reference/quickgraph-serialization-graphmldeserializer-3.html new file mode 100644 index 000000000..bb794e1e4 --- /dev/null +++ b/reference/quickgraph-serialization-graphmldeserializer-3.html @@ -0,0 +1,114 @@ + + + + + GraphMLDeserializer<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphMLDeserializer<'TVertex, 'TEdge, 'TGraph>

    +

    + Namespace: QuickGraph.Serialization
    +

    +
    +

    A GraphML ( http://graphml.graphdrawing.org/ ) format deserializer.

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Deserialize(...) + +
    + Signature: (reader:XmlReader * visitedGraph:'TGraph * vertexFactory:IdentifiableVertexFactory<'TVertex> * edgeFactory:IdentifiableEdgeFactory<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-graphmlextensions.html b/reference/quickgraph-serialization-graphmlextensions.html new file mode 100644 index 000000000..da723c6c7 --- /dev/null +++ b/reference/quickgraph-serialization-graphmlextensions.html @@ -0,0 +1,188 @@ + + + + + GraphMLExtensions - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphMLExtensions

    +

    + Namespace: QuickGraph.Serialization
    +

    +
    +
    +

    Static members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Static memberDescription
    + + + DeserializeAndValidateFromGraphML(...) + +
    + Signature: (graph:'TGraph * reader:TextReader * vertexFactory:IdentifiableVertexFactory<'TVertex> * edgeFactory:IdentifiableEdgeFactory<'TVertex,'TEdge>) -> unit
    + Type parameters: 'TVertex, 'TEdge, 'TGraph
    +     		+ +
    + + + DeserializeFromGraphML(...) + +
    + Signature: (graph:'TGraph * fileName:string * vertexFactory:IdentifiableVertexFactory<'TVertex> * edgeFactory:IdentifiableEdgeFactory<'TVertex,'TEdge>) -> unit
    + Type parameters: 'TVertex, 'TEdge, 'TGraph
    +     		+ +
    + + + DeserializeFromGraphML(...) + +
    + Signature: (graph:'TGraph * reader:TextReader * vertexFactory:IdentifiableVertexFactory<'TVertex> * edgeFactory:IdentifiableEdgeFactory<'TVertex,'TEdge>) -> unit
    + Type parameters: 'TVertex, 'TEdge, 'TGraph
    +     		+ +
    + + + DeserializeFromGraphML(...) + +
    + Signature: (graph:'TGraph * reader:XmlReader * vertexFactory:IdentifiableVertexFactory<'TVertex> * edgeFactory:IdentifiableEdgeFactory<'TVertex,'TEdge>) -> unit
    + Type parameters: 'TVertex, 'TEdge, 'TGraph
    +     		+ +
    + + + SerializeToGraphML(...) + +
    + Signature: (graph:'TGraph * fileName:string * vertexIdentities:VertexIdentity<'TVertex> * edgeIdentities:EdgeIdentity<'TVertex,'TEdge>) -> unit
    + Type parameters: 'TVertex, 'TEdge, 'TGraph
    +     		+ +
    + + + SerializeToGraphML(graph, fileName) + +
    + Signature: (graph:'TGraph * fileName:string) -> unit
    + Type parameters: 'TVertex, 'TEdge, 'TGraph
    +     		+ +
    + + + SerializeToGraphML(...) + +
    + Signature: (graph:'TGraph * writer:XmlWriter * vertexIdentities:VertexIdentity<'TVertex> * edgeIdentities:EdgeIdentity<'TVertex,'TEdge>) -> unit
    + Type parameters: 'TVertex, 'TEdge, 'TGraph
    +     		+ +
    + + + SerializeToGraphML(graph, writer) + +
    + Signature: (graph:'TGraph * writer:XmlWriter) -> unit
    + Type parameters: 'TVertex, 'TEdge, 'TGraph
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-graphmlserializer-3.html b/reference/quickgraph-serialization-graphmlserializer-3.html new file mode 100644 index 000000000..4ac44ca28 --- /dev/null +++ b/reference/quickgraph-serialization-graphmlserializer-3.html @@ -0,0 +1,136 @@ + + + + + GraphMLSerializer<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphMLSerializer<'TVertex, 'TEdge, 'TGraph>

    +

    + Namespace: QuickGraph.Serialization
    +

    +
    +

    A GraphML ( http://graphml.graphdrawing.org/ ) format serializer.

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Serialize(...) + +
    + Signature: (writer:XmlWriter * visitedGraph:'TGraph * vertexIdentities:VertexIdentity<'TVertex> * edgeIdentities:EdgeIdentity<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    +

    Static members

    + + + + + + + + + + +
    Static memberDescription
    + + + MoveNextData(reader) + +
    + Signature: reader:XmlReader -> bool
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-graphmlxmlresolver.html b/reference/quickgraph-serialization-graphmlxmlresolver.html new file mode 100644 index 000000000..bd44cd4a4 --- /dev/null +++ b/reference/quickgraph-serialization-graphmlxmlresolver.html @@ -0,0 +1,145 @@ + + + + + GraphMLXmlResolver - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    GraphMLXmlResolver

    +

    + Namespace: QuickGraph.Serialization
    +

    +
    +

    A resolver that loads graphml DTD and XSD schemas +from embedded resources.

    + +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + new(baseResolver) + +
    + Signature: baseResolver:XmlResolver -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Credentials() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + GetEntity(...) + +
    + Signature: (absoluteUri:Uri * role:string * ofObjectToReturn:Type) -> obj
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-serializationextensions.html b/reference/quickgraph-serialization-serializationextensions.html new file mode 100644 index 000000000..6741283d3 --- /dev/null +++ b/reference/quickgraph-serialization-serializationextensions.html @@ -0,0 +1,188 @@ + + + + + SerializationExtensions - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    SerializationExtensions

    +

    + Namespace: QuickGraph.Serialization
    +

    +
    +
    +

    Static members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Static memberDescription
    + + + DeserializeFromBinary(stream) + +
    + Signature: stream:Stream -> 'TGraph
    + Type parameters: 'TVertex, 'TEdge, 'TGraph
    +     		+

    Deserializes a graph instance from a stream that was serialized using the .Net serialization binary format.

    + + +
    + + + DeserializeFromXml(...) + +
    + Signature: (doc:IXPathNavigable * graphXPath:string * verticesXPath:string * edgesXPath:string * graphFactory:Func<XPathNavigator,'TGraph> * vertexFactory:Func<XPathNavigator,'TVertex> * edgeFactory:Func<XPathNavigator,'TEdge>) -> 'TGraph
    + Type parameters: 'TVertex, 'TEdge, 'TGraph
    +     		+

    Deserializes a graph from a generic xml stream, using an .

    + + +
    + + + DeserializeFromXml(...) + +
    + Signature: (reader:XmlReader * graphPredicate:Predicate<XmlReader> * vertexPredicate:Predicate<XmlReader> * edgePredicate:Predicate<XmlReader> * graphFactory:Func<XmlReader,'TGraph> * vertexFactory:Func<XmlReader,'TVertex> * edgeFactory:Func<XmlReader,'TEdge>) -> 'TGraph
    + Type parameters: 'TVertex, 'TEdge, 'TGraph
    +     		+

    Deserializes a graph from a generic xml stream, using an .

    + + +
    + + + DeserializeFromXml(...) + +
    + Signature: (reader:XmlReader * graphElementName:string * vertexElementName:string * edgeElementName:string * namespaceUri:string * graphFactory:Func<XmlReader,'TGraph> * vertexFactory:Func<XmlReader,'TVertex> * edgeFactory:Func<XmlReader,'TEdge>) -> 'TGraph
    + Type parameters: 'TVertex, 'TEdge, 'TGraph
    +     		+

    Deserializes a graph from a generic xml stream, using an .

    + + +
    + + + SerializeToBinary(graph, stream) + +
    + Signature: (graph:IGraph<'TVertex,'TEdge> * stream:Stream) -> unit
    + Type parameters: 'TVertex, 'TEdge
    +     		+

    Serializes the graph to the stream using the .Net serialization binary format.

    + + +
    + + + SerializeToXml(...) + +
    + Signature: (graph:'TGraph * writer:XmlWriter * vertexIdentity:VertexIdentity<'TVertex> * edgeIdentity:EdgeIdentity<'TVertex,'TEdge> * graphElementName:string * vertexElementName:string * edgeElementName:string * namespaceUri:string) -> unit
    + Type parameters: 'TVertex, 'TEdge, 'TGraph
    +     		+

    Serializes a graph to a generic xml stream, using an .

    + + +
    + + + SerializeToXml(...) + +
    + Signature: (graph:'TGraph * writer:XmlWriter * vertexIdentity:VertexIdentity<'TVertex> * edgeIdentity:EdgeIdentity<'TVertex,'TEdge> * graphElementName:string * vertexElementName:string * edgeElementName:string * namespaceUri:string * writeGraphAttributes:Action<XmlWriter,'TGraph> * writeVertexAttributes:Action<XmlWriter,'TVertex> * writeEdgeAttributes:Action<XmlWriter,'TEdge>) -> unit
    + Type parameters: 'TVertex, 'TEdge, 'TGraph
    +     		+

    Serializes a graph to a generic xml stream, using an .

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-serializerbase-2.html b/reference/quickgraph-serialization-serializerbase-2.html new file mode 100644 index 000000000..0e080d337 --- /dev/null +++ b/reference/quickgraph-serialization-serializerbase-2.html @@ -0,0 +1,112 @@ + + + + + SerializerBase<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    SerializerBase<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph.Serialization
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + EmitDocumentDeclaration() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-xmlreaderextensions.html b/reference/quickgraph-serialization-xmlreaderextensions.html new file mode 100644 index 000000000..819f904d0 --- /dev/null +++ b/reference/quickgraph-serialization-xmlreaderextensions.html @@ -0,0 +1,176 @@ + + + + + XmlReaderExtensions - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    XmlReaderExtensions

    +

    + Namespace: QuickGraph.Serialization
    +

    +
    +
    +

    Static members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Static memberDescription
    + + + ReadElementContentAsArray(...) + +
    + Signature: (xmlReader:XmlReader * localName:string * namespaceURI:string * stringToT:Func<string,'T>) -> 'T []
    + Type parameters: 'T
    +     		+

    Read contents of an XML element as an array of type T.

    + + +
    + + + ReadElementContentAsBooleanArray(...) + +
    + Signature: (xmlReader:XmlReader * localName:string * namespaceURI:string) -> bool []
    +
    +     		+ +
    + + + ReadElementContentAsDoubleArray(...) + +
    + Signature: (xmlReader:XmlReader * localName:string * namespaceURI:string) -> float []
    +
    +     		+ +
    + + + ReadElementContentAsInt32Array(...) + +
    + Signature: (xmlReader:XmlReader * localName:string * namespaceURI:string) -> int []
    +
    +     		+ +
    + + + ReadElementContentAsInt64Array(...) + +
    + Signature: (xmlReader:XmlReader * localName:string * namespaceURI:string) -> int64 []
    +
    +     		+ +
    + + + ReadElementContentAsSingleArray(...) + +
    + Signature: (xmlReader:XmlReader * localName:string * namespaceURI:string) -> float32 []
    +
    +     		+ +
    + + + ReadElementContentAsStringArray(...) + +
    + Signature: (xmlReader:XmlReader * localName:string * namespaceURI:string) -> string []
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-xmlserializableedge-1.html b/reference/quickgraph-serialization-xmlserializableedge-1.html new file mode 100644 index 000000000..16c07b466 --- /dev/null +++ b/reference/quickgraph-serialization-xmlserializableedge-1.html @@ -0,0 +1,128 @@ + + + + + XmlSerializableEdge<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    XmlSerializableEdge<'TVertex>

    +

    + Namespace: QuickGraph.Serialization
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Source() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + Target() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-xmlserializablegraph-3.html b/reference/quickgraph-serialization-xmlserializablegraph-3.html new file mode 100644 index 000000000..09a2c2246 --- /dev/null +++ b/reference/quickgraph-serialization-xmlserializablegraph-3.html @@ -0,0 +1,142 @@ + + + + + XmlSerializableGraph<'TVertex, 'TEdge, 'TGraph> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    XmlSerializableGraph<'TVertex, 'TEdge, 'TGraph>

    +

    + Namespace: QuickGraph.Serialization
    +

    +
    +

    A base class that creates a proxy to a graph that is xml serializable

    + +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(graph) + +
    + Signature: graph:'TGraph -> unit
    +
    +     		+ +
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Edges + +
    + Signature: IEnumerable<'TEdge>
    +
    +     		+ +
    + + + Graph + +
    + Signature: 'TGraph
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-serialization-xmlwriterextensions.html b/reference/quickgraph-serialization-xmlwriterextensions.html new file mode 100644 index 000000000..0d1c6ca48 --- /dev/null +++ b/reference/quickgraph-serialization-xmlwriterextensions.html @@ -0,0 +1,178 @@ + + + + + XmlWriterExtensions - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    XmlWriterExtensions

    +

    + Namespace: QuickGraph.Serialization
    +

    +
    +
    +

    Static members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Static memberDescription
    + + + WriteArray(xmlWriter, value) + +
    + Signature: (xmlWriter:XmlWriter * value:IList<'T>) -> unit
    + Type parameters: 'T
    +     		+

    Writes an array as space separated values. There is a space after every value, even the last one. +If array is null, it writes "null". If array is empty, it writes empty string. If array is a string array +with only one element "null", then it writes "null ".

    + + +
    + + + WriteBooleanArray(xmlWriter, value) + +
    + Signature: (xmlWriter:XmlWriter * value:IList<bool>) -> unit
    +
    +     		+ +
    + + + WriteDoubleArray(xmlWriter, value) + +
    + Signature: (xmlWriter:XmlWriter * value:IList<float>) -> unit
    +
    +     		+ +
    + + + WriteInt32Array(xmlWriter, value) + +
    + Signature: (xmlWriter:XmlWriter * value:IList<int>) -> unit
    +
    +     		+ +
    + + + WriteInt64Array(xmlWriter, value) + +
    + Signature: (xmlWriter:XmlWriter * value:IList<int64>) -> unit
    +
    +     		+ +
    + + + WriteSingleArray(xmlWriter, value) + +
    + Signature: (xmlWriter:XmlWriter * value:IList<float32>) -> unit
    +
    +     		+ +
    + + + WriteStringArray(xmlWriter, value) + +
    + Signature: (xmlWriter:XmlWriter * value:IList<string>) -> unit
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-sreversededge-2.html b/reference/quickgraph-sreversededge-2.html new file mode 100644 index 000000000..e4babceeb --- /dev/null +++ b/reference/quickgraph-sreversededge-2.html @@ -0,0 +1,204 @@ + + + + + SReversedEdge<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    SReversedEdge<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A reversed edge

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(originalEdge) + +
    + Signature: originalEdge:'TEdge -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Equals(obj) + +
    + Signature: obj:obj -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Equals(other) + +
    + Signature: other:SReversedEdge<'TVertex,'TEdge> -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + GetHashCode() + +
    + Signature: unit -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + OriginalEdge + +
    + Signature: 'TEdge
    +
    +     		+ +
    + + + Source + +
    + Signature: 'TVertex
    + Modifiers: abstract
    +
    +     		+ +
    + + + Target + +
    + Signature: 'TVertex
    + Modifiers: abstract
    +
    +     		+ +
    + + + ToString() + +
    + Signature: unit -> string
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-staggededge-2.html b/reference/quickgraph-staggededge-2.html new file mode 100644 index 000000000..2bc614c87 --- /dev/null +++ b/reference/quickgraph-staggededge-2.html @@ -0,0 +1,177 @@ + + + + + STaggedEdge<'TVertex, 'TTag> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    STaggedEdge<'TVertex, 'TTag>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A tagged edge as value type.

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(source, target, tag) + +
    + Signature: (source:'TVertex * target:'TVertex * tag:'TTag) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Source + +
    + Signature: 'TVertex
    + Modifiers: abstract
    +
    +     		+ +
    + + + Tag() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + TagChanged + +
    + Signature: IEvent<EventHandler,EventArgs>
    + Modifiers: abstract
    +
    +     		+ +
    + + + Target + +
    + Signature: 'TVertex
    + Modifiers: abstract
    +
    +     		+ +
    + + + ToString() + +
    + Signature: unit -> string
    + Modifiers: abstract
    +
    +     		+

    Returns a that represents the current .

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-staggedequatableedge-2.html b/reference/quickgraph-staggedequatableedge-2.html new file mode 100644 index 000000000..814248269 --- /dev/null +++ b/reference/quickgraph-staggedequatableedge-2.html @@ -0,0 +1,228 @@ + + + + + STaggedEquatableEdge<'TVertex, 'TTag> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    STaggedEquatableEdge<'TVertex, 'TTag>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A tagged edge as value type.

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(source, target, tag) + +
    + Signature: (source:'TVertex * target:'TVertex * tag:'TTag) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Equals(other) + +
    + Signature: other:STaggedEquatableEdge<'TVertex,'TTag> -> bool
    + Modifiers: abstract
    +
    +     		+

    Indicates whether the current object is equal to another object of the same type.

    + + +
    + + + Equals(obj) + +
    + Signature: obj:obj -> bool
    + Modifiers: abstract
    +
    +     		+

    Indicates whether this instance and a specified object are equal.

    + + +
    + + + GetHashCode() + +
    + Signature: unit -> int
    + Modifiers: abstract
    +
    +     		+

    Returns the hash code for this instance.

    + + +
    + + + Source + +
    + Signature: 'TVertex
    + Modifiers: abstract
    +
    +     		+ +
    + + + Tag() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + TagChanged + +
    + Signature: IEvent<EventHandler,EventArgs>
    + Modifiers: abstract
    +
    +     		+ +
    + + + Target + +
    + Signature: 'TVertex
    + Modifiers: abstract
    +
    +     		+ +
    + + + ToString() + +
    + Signature: unit -> string
    + Modifiers: abstract
    +
    +     		+

    Returns a that represents the current .

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-sundirectededge-1.html b/reference/quickgraph-sundirectededge-1.html new file mode 100644 index 000000000..55dc8c207 --- /dev/null +++ b/reference/quickgraph-sundirectededge-1.html @@ -0,0 +1,153 @@ + + + + + SUndirectedEdge<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    SUndirectedEdge<'TVertex>

    +

    + Namespace: QuickGraph
    +

    +
    +

    An struct based implementation.

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> unit
    +
    +     		+

    Initializes a new instance of the class.

    + + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Source + +
    + Signature: 'TVertex
    + Modifiers: abstract
    +
    +     		+

    Gets the source vertex

    + + +
    + + + Target + +
    + Signature: 'TVertex
    + Modifiers: abstract
    +
    +     		+

    Gets the target vertex

    + + +
    + + + ToString() + +
    + Signature: unit -> string
    + Modifiers: abstract
    +
    +     		+

    Returns a that represents the current .

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-sundirectedtaggededge-2.html b/reference/quickgraph-sundirectedtaggededge-2.html new file mode 100644 index 000000000..28c787533 --- /dev/null +++ b/reference/quickgraph-sundirectedtaggededge-2.html @@ -0,0 +1,183 @@ + + + + + SUndirectedTaggedEdge<'TVertex, 'TTag> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    SUndirectedTaggedEdge<'TVertex, 'TTag>

    +

    + Namespace: QuickGraph
    +

    +
    +

    An struct based implementation.

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(source, target, tag) + +
    + Signature: (source:'TVertex * target:'TVertex * tag:'TTag) -> unit
    +
    +     		+

    Initializes a new instance of the class.

    + + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Source + +
    + Signature: 'TVertex
    + Modifiers: abstract
    +
    +     		+

    Gets the source vertex

    + + +
    + + + Tag() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + TagChanged + +
    + Signature: IEvent<EventHandler,EventArgs>
    + Modifiers: abstract
    +
    +     		+ +
    + + + Target + +
    + Signature: 'TVertex
    + Modifiers: abstract
    +
    +     		+

    Gets the target vertex

    + + +
    + + + ToString() + +
    + Signature: unit -> string
    + Modifiers: abstract
    +
    +     		+

    Returns a that represents the current .

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-taggededge-2.html b/reference/quickgraph-taggededge-2.html new file mode 100644 index 000000000..03dc968ff --- /dev/null +++ b/reference/quickgraph-taggededge-2.html @@ -0,0 +1,128 @@ + + + + + TaggedEdge<'TVertex, 'TTag> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    TaggedEdge<'TVertex, 'TTag>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(source, target, tag) + +
    + Signature: (source:'TVertex * target:'TVertex * tag:'TTag) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Tag() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + TagChanged + +
    + Signature: IEvent<EventHandler,EventArgs>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-taggedequatableedge-2.html b/reference/quickgraph-taggedequatableedge-2.html new file mode 100644 index 000000000..b4dfefd59 --- /dev/null +++ b/reference/quickgraph-taggedequatableedge-2.html @@ -0,0 +1,130 @@ + + + + + TaggedEquatableEdge<'TVertex, 'TTag> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    TaggedEquatableEdge<'TVertex, 'TTag>

    +

    + Namespace: QuickGraph
    +

    +
    +

    An equatable, tagged, edge

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(source, target, tag) + +
    + Signature: (source:'TVertex * target:'TVertex * tag:'TTag) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Tag() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + TagChanged + +
    + Signature: IEvent<EventHandler,EventArgs>
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-taggedundirectededge-2.html b/reference/quickgraph-taggedundirectededge-2.html new file mode 100644 index 000000000..51c41f723 --- /dev/null +++ b/reference/quickgraph-taggedundirectededge-2.html @@ -0,0 +1,153 @@ + + + + + TaggedUndirectedEdge<'TVertex, 'TTag> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    TaggedUndirectedEdge<'TVertex, 'TTag>

    +

    + Namespace: QuickGraph
    +

    +
    +

    A tagged undirected edge.

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(source, target, tag) + +
    + Signature: (source:'TVertex * target:'TVertex * tag:'TTag) -> unit
    +
    +     		+

    Initializes a new instance of the class.

    + + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Tag() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+

    Gets or sets the tag

    + + +
    + + + TagChanged + +
    + Signature: IEvent<EventHandler,EventArgs>
    + Modifiers: abstract
    +
    +     		+

    Raised when the tag is changed

    + + +
    + + + ToString() + +
    + Signature: unit -> string
    + Modifiers: abstract
    +
    +     		+

    Returns a that represents the current .

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-termbidirectionalgraph-2.html b/reference/quickgraph-termbidirectionalgraph-2.html new file mode 100644 index 000000000..4640d1081 --- /dev/null +++ b/reference/quickgraph-termbidirectionalgraph-2.html @@ -0,0 +1,248 @@ + + + + + TermBidirectionalGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    TermBidirectionalGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + InDegreeAt(v, terminal) + +
    + Signature: (v:'TVertex * terminal:int) -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + InEdgesAt(v, terminal) + +
    + Signature: (v:'TVertex * terminal:int) -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + InTerminalCount(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsInEdgesEmptyAt(v, terminal) + +
    + Signature: (v:'TVertex * terminal:int) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsOutEdgesEmptyAt(v, terminal) + +
    + Signature: (v:'TVertex * terminal:int) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutDegreeAt(v, terminal) + +
    + Signature: (v:'TVertex * terminal:int) -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutEdgesAt(v, terminal) + +
    + Signature: (v:'TVertex * terminal:int) -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + OutTerminalCount(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetInEdgesAt(v, terminal, edges) + +
    + Signature: (v:'TVertex * terminal:int * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetOutEdgesAt(v, terminal, edges) + +
    + Signature: (v:'TVertex * terminal:int * edges:byref<IEnumerable<'TEdge>>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-termedge-1.html b/reference/quickgraph-termedge-1.html new file mode 100644 index 000000000..3becae55c --- /dev/null +++ b/reference/quickgraph-termedge-1.html @@ -0,0 +1,203 @@ + + + + + TermEdge<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    TermEdge<'TVertex>

    +

    + Namespace: QuickGraph
    +

    +
    +

    The default implementation.

    + +
    +

    Constructors

    + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(...) + +
    + Signature: (source:'TVertex * target:'TVertex * sourceTerminal:int * targetTerminal:int) -> unit
    +
    +     		+

    Constructs new using source/target vertex and source/target terminals.

    + + +
    + + + new(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> unit
    +
    +     		+

    Constructs new using source/target vertex and zero terminals.

    + + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Source + +
    + Signature: 'TVertex
    + Modifiers: abstract
    +
    +     		+

    Gets the source vertex

    + + +
    + + + SourceTerminal + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+

    Gets the source terminal

    + + +
    + + + Target + +
    + Signature: 'TVertex
    + Modifiers: abstract
    +
    +     		+

    Gets the target vertex

    + + +
    + + + TargetTerminal + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+

    Gets the target terminal

    + + +
    + + + ToString() + +
    + Signature: unit -> string
    + Modifiers: abstract
    +
    +     		+

    Returns a that represents the current .

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-tryfunc-2.html b/reference/quickgraph-tryfunc-2.html new file mode 100644 index 000000000..f924a2a23 --- /dev/null +++ b/reference/quickgraph-tryfunc-2.html @@ -0,0 +1,143 @@ + + + + + TryFunc<'T, 'TResult> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    TryFunc<'T, 'TResult>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(object, method) + +
    + Signature: (object:obj * method:nativeint) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BeginInvoke(...) + +
    + Signature: (arg:'T * result:byref<'TResult> * callback:AsyncCallback * object:obj) -> IAsyncResult
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndInvoke(result, __result) + +
    + Signature: (result:byref<'TResult> * __result:IAsyncResult) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Invoke(arg, result) + +
    + Signature: (arg:'T * result:byref<'TResult>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-tryfunc-3.html b/reference/quickgraph-tryfunc-3.html new file mode 100644 index 000000000..a7b587239 --- /dev/null +++ b/reference/quickgraph-tryfunc-3.html @@ -0,0 +1,143 @@ + + + + + TryFunc<'T1, 'T2, 'TResult> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    TryFunc<'T1, 'T2, 'TResult>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(object, method) + +
    + Signature: (object:obj * method:nativeint) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BeginInvoke(...) + +
    + Signature: (arg:'T1 * arg2:'T2 * result:byref<'TResult> * callback:AsyncCallback * object:obj) -> IAsyncResult
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndInvoke(result, __result) + +
    + Signature: (result:byref<'TResult> * __result:IAsyncResult) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Invoke(arg, arg2, result) + +
    + Signature: (arg:'T1 * arg2:'T2 * result:byref<'TResult>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-tryfunc-4.html b/reference/quickgraph-tryfunc-4.html new file mode 100644 index 000000000..eaf3f6a7b --- /dev/null +++ b/reference/quickgraph-tryfunc-4.html @@ -0,0 +1,143 @@ + + + + + TryFunc<'T1, 'T2, 'T3, 'TResult> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    TryFunc<'T1, 'T2, 'T3, 'TResult>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(object, method) + +
    + Signature: (object:obj * method:nativeint) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BeginInvoke(...) + +
    + Signature: (arg:'T1 * arg2:'T2 * arg3:'T3 * result:byref<'TResult> * callback:AsyncCallback * object:obj) -> IAsyncResult
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndInvoke(result, __result) + +
    + Signature: (result:byref<'TResult> * __result:IAsyncResult) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Invoke(arg, arg2, arg3, result) + +
    + Signature: (arg:'T1 * arg2:'T2 * arg3:'T3 * result:byref<'TResult>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-tryfunc-5.html b/reference/quickgraph-tryfunc-5.html new file mode 100644 index 000000000..4c747f4d6 --- /dev/null +++ b/reference/quickgraph-tryfunc-5.html @@ -0,0 +1,143 @@ + + + + + TryFunc<'T1, 'T2, 'T3, 'T4, 'TResult> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    TryFunc<'T1, 'T2, 'T3, 'T4, 'TResult>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(object, method) + +
    + Signature: (object:obj * method:nativeint) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BeginInvoke(...) + +
    + Signature: (arg:'T1 * arg2:'T2 * arg3:'T3 * arg4:'T4 * result:byref<'TResult> * callback:AsyncCallback * object:obj) -> IAsyncResult
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndInvoke(result, __result) + +
    + Signature: (result:byref<'TResult> * __result:IAsyncResult) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Invoke(arg, arg2, arg3, arg4, result) + +
    + Signature: (arg:'T1 * arg2:'T2 * arg3:'T3 * arg4:'T4 * result:byref<'TResult>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-undirectedbidirectionalgraph-2.html b/reference/quickgraph-undirectedbidirectionalgraph-2.html new file mode 100644 index 000000000..a58842d5b --- /dev/null +++ b/reference/quickgraph-undirectedbidirectionalgraph-2.html @@ -0,0 +1,367 @@ + + + + + UndirectedBidirectionalGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    UndirectedBidirectionalGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(visitedGraph) + +
    + Signature: visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AdjacentDegree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + AdjacentEdge(v, index) + +
    + Signature: (v:'TVertex * index:int) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + + + AdjacentEdges(v) + +
    + Signature: v:'TVertex -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + AllowParallelEdges + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsEdge(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsVertex(vertex) + +
    + Signature: vertex:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeEqualityComparer + +
    + Signature: EdgeEqualityComparer<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + Edges + +
    + Signature: IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsAdjacentEdgesEmpty(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsDirected + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsEdgesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsVerticesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + TryGetEdge(source, target, edge) + +
    + Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Vertices + +
    + Signature: IEnumerable<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + VisitedGraph + +
    + Signature: IBidirectionalGraph<'TVertex,'TEdge>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-undirectededge-1.html b/reference/quickgraph-undirectededge-1.html new file mode 100644 index 000000000..89b2e0c99 --- /dev/null +++ b/reference/quickgraph-undirectededge-1.html @@ -0,0 +1,153 @@ + + + + + UndirectedEdge<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    UndirectedEdge<'TVertex>

    +

    + Namespace: QuickGraph
    +

    +
    +

    The default implementation.

    + +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> unit
    +
    +     		+

    Initializes a new instance of the class.

    + + +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Source + +
    + Signature: 'TVertex
    + Modifiers: abstract
    +
    +     		+

    Gets the source vertex

    + + +
    + + + Target + +
    + Signature: 'TVertex
    + Modifiers: abstract
    +
    +     		+

    Gets the target vertex

    + + +
    + + + ToString() + +
    + Signature: unit -> string
    + Modifiers: abstract
    +
    +     		+

    Returns a that represents the current .

    + + +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-undirectededgeaction-2.html b/reference/quickgraph-undirectededgeaction-2.html new file mode 100644 index 000000000..f6713d137 --- /dev/null +++ b/reference/quickgraph-undirectededgeaction-2.html @@ -0,0 +1,143 @@ + + + + + UndirectedEdgeAction<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    UndirectedEdgeAction<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(object, method) + +
    + Signature: (object:obj * method:nativeint) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BeginInvoke(sender, e, callback, object) + +
    + Signature: (sender:obj * e:UndirectedEdgeEventArgs<'TVertex,'TEdge> * callback:AsyncCallback * object:obj) -> IAsyncResult
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndInvoke(result) + +
    + Signature: result:IAsyncResult -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + Invoke(sender, e) + +
    + Signature: (sender:obj * e:UndirectedEdgeEventArgs<'TVertex,'TEdge>) -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-undirectededgeeventargs-2.html b/reference/quickgraph-undirectededgeeventargs-2.html new file mode 100644 index 000000000..b3d0fb4e1 --- /dev/null +++ b/reference/quickgraph-undirectededgeeventargs-2.html @@ -0,0 +1,140 @@ + + + + + UndirectedEdgeEventArgs<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    UndirectedEdgeEventArgs<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(edge, reversed) + +
    + Signature: (edge:'TEdge * reversed:bool) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + Reversed + +
    + Signature: bool
    +
    +     		+ +
    + + + Source + +
    + Signature: 'TVertex
    +
    +     		+ +
    + + + Target + +
    + Signature: 'TVertex
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-undirectedgraph-2.html b/reference/quickgraph-undirectedgraph-2.html new file mode 100644 index 000000000..a0ec28ff6 --- /dev/null +++ b/reference/quickgraph-undirectedgraph-2.html @@ -0,0 +1,728 @@ + + + + + UndirectedGraph<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    UndirectedGraph<'TVertex, 'TEdge>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + + + + + + + + + +
    ConstructorDescription
    + + + new(...) + +
    + Signature: (allowParallelEdges:bool * edgeEqualityComparer:EdgeEqualityComparer<'TVertex,'TEdge>) -> unit
    +
    +     		+ +
    + + + new(allowParallelEdges) + +
    + Signature: allowParallelEdges:bool -> unit
    +
    +     		+ +
    + + + new() + +
    + Signature: unit -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + AddEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddEdgeRange(edges) + +
    + Signature: edges:IEnumerable<'TEdge> -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddVertex(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddVertexRange(vertices) + +
    + Signature: vertices:IEnumerable<'TVertex> -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddVerticesAndEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + AddVerticesAndEdgeRange(edges) + +
    + Signature: edges:IEnumerable<'TEdge> -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + AdjacentDegree(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + AdjacentEdge(v, index) + +
    + Signature: (v:'TVertex * index:int) -> 'TEdge
    + Modifiers: abstract
    +
    +     		+ +
    + + + AdjacentEdges(v) + +
    + Signature: v:'TVertex -> IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + AdjacentVertices(v) + +
    + Signature: v:'TVertex -> IEnumerable<'TVertex>
    +
    +     		+ +
    + + + AllowParallelEdges + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Clear() + +
    + Signature: unit -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + ClearAdjacentEdges(v) + +
    + Signature: v:'TVertex -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + Clone() + +
    + Signature: unit -> UndirectedGraph<'TVertex,'TEdge>
    +
    +     		+ +
    + + + ContainsEdge(source, target) + +
    + Signature: (source:'TVertex * target:'TVertex) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + ContainsVertex(vertex) + +
    + Signature: vertex:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeAdded + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeCapacity() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + EdgeCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeEqualityComparer + +
    + Signature: EdgeEqualityComparer<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + EdgeRemoved + +
    + Signature: EdgeAction<'TVertex,'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + Edges + +
    + Signature: IEnumerable<'TEdge>
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsAdjacentEdgesEmpty(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsDirected + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsEdgesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + IsVerticesEmpty + +
    + Signature: bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveAdjacentEdgeIf(v, predicate) + +
    + Signature: (v:'TVertex * predicate:EdgePredicate<'TVertex,'TEdge>) -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveEdge(edge) + +
    + Signature: edge:'TEdge -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveEdgeIf(predicate) + +
    + Signature: predicate:EdgePredicate<'TVertex,'TEdge> -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveEdges(edges) + +
    + Signature: edges:IEnumerable<'TEdge> -> int
    +
    +     		+ +
    + + + RemoveVertex(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + RemoveVertexIf(pred) + +
    + Signature: pred:VertexPredicate<'TVertex> -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + TrimEdgeExcess() + +
    + Signature: unit -> unit
    +
    +     		+ +
    + + + TryGetEdge(source, target, edge) + +
    + Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexAdded + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexCount + +
    + Signature: int
    + Modifiers: abstract
    +
    +     		+ +
    + + + VertexRemoved + +
    + Signature: VertexAction<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    + + + Vertices + +
    + Signature: IEnumerable<'TVertex>
    + Modifiers: abstract
    +
    +     		+ +
    +

    Static members

    + + + + + + + + + + +
    Static memberDescription
    + + + LoadDot(dotSource, vertexFunc, edgeFunc) + +
    + Signature: (dotSource:string * vertexFunc:Func<string,IDictionary<string,string>,'TVertex> * edgeFunc:Func<'TVertex,'TVertex,IDictionary<string,string>,'TEdge>) -> UndirectedGraph<'TVertex,'TEdge>
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-vertexaction-1.html b/reference/quickgraph-vertexaction-1.html new file mode 100644 index 000000000..7a508df72 --- /dev/null +++ b/reference/quickgraph-vertexaction-1.html @@ -0,0 +1,143 @@ + + + + + VertexAction<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    VertexAction<'TVertex>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(object, method) + +
    + Signature: (object:obj * method:nativeint) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BeginInvoke(vertex, callback, object) + +
    + Signature: (vertex:'TVertex * callback:AsyncCallback * object:obj) -> IAsyncResult
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndInvoke(result) + +
    + Signature: result:IAsyncResult -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + Invoke(vertex) + +
    + Signature: vertex:'TVertex -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-vertexeventargs-1.html b/reference/quickgraph-vertexeventargs-1.html new file mode 100644 index 000000000..ad1df443d --- /dev/null +++ b/reference/quickgraph-vertexeventargs-1.html @@ -0,0 +1,112 @@ + + + + + VertexEventArgs<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    VertexEventArgs<'TVertex>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(vertex) + +
    + Signature: vertex:'TVertex -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + +
    Instance memberDescription
    + + + Vertex + +
    + Signature: 'TVertex
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-vertexeventhandler-1.html b/reference/quickgraph-vertexeventhandler-1.html new file mode 100644 index 000000000..d1f8322b1 --- /dev/null +++ b/reference/quickgraph-vertexeventhandler-1.html @@ -0,0 +1,143 @@ + + + + + VertexEventHandler<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    VertexEventHandler<'TVertex>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(object, method) + +
    + Signature: (object:obj * method:nativeint) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BeginInvoke(sender, e, callback, object) + +
    + Signature: (sender:obj * e:VertexEventArgs<'TVertex> * callback:AsyncCallback * object:obj) -> IAsyncResult
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndInvoke(result) + +
    + Signature: result:IAsyncResult -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + + + Invoke(sender, e) + +
    + Signature: (sender:obj * e:VertexEventArgs<'TVertex>) -> unit
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-vertexfactory-1.html b/reference/quickgraph-vertexfactory-1.html new file mode 100644 index 000000000..3c03b832c --- /dev/null +++ b/reference/quickgraph-vertexfactory-1.html @@ -0,0 +1,143 @@ + + + + + VertexFactory<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    VertexFactory<'TVertex>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(object, method) + +
    + Signature: (object:obj * method:nativeint) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BeginInvoke(callback, object) + +
    + Signature: (callback:AsyncCallback * object:obj) -> IAsyncResult
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndInvoke(result) + +
    + Signature: result:IAsyncResult -> 'TVertex
    + Modifiers: abstract
    +
    +     		+ +
    + + + Invoke() + +
    + Signature: unit -> 'TVertex
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-vertexidentity-1.html b/reference/quickgraph-vertexidentity-1.html new file mode 100644 index 000000000..e76e3a98c --- /dev/null +++ b/reference/quickgraph-vertexidentity-1.html @@ -0,0 +1,143 @@ + + + + + VertexIdentity<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    VertexIdentity<'TVertex>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(object, method) + +
    + Signature: (object:obj * method:nativeint) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BeginInvoke(v, callback, object) + +
    + Signature: (v:'TVertex * callback:AsyncCallback * object:obj) -> IAsyncResult
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndInvoke(result) + +
    + Signature: result:IAsyncResult -> string
    + Modifiers: abstract
    +
    +     		+ +
    + + + Invoke(v) + +
    + Signature: v:'TVertex -> string
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-vertexindexer-1.html b/reference/quickgraph-vertexindexer-1.html new file mode 100644 index 000000000..0f9ed54ea --- /dev/null +++ b/reference/quickgraph-vertexindexer-1.html @@ -0,0 +1,143 @@ + + + + + VertexIndexer<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    VertexIndexer<'TVertex>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(object, method) + +
    + Signature: (object:obj * method:nativeint) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BeginInvoke(v, callback, object) + +
    + Signature: (v:'TVertex * callback:AsyncCallback * object:obj) -> IAsyncResult
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndInvoke(result) + +
    + Signature: result:IAsyncResult -> int
    + Modifiers: abstract
    +
    +     		+ +
    + + + Invoke(v) + +
    + Signature: v:'TVertex -> int
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + diff --git a/reference/quickgraph-vertexpredicate-1.html b/reference/quickgraph-vertexpredicate-1.html new file mode 100644 index 000000000..2cd937d1c --- /dev/null +++ b/reference/quickgraph-vertexpredicate-1.html @@ -0,0 +1,143 @@ + + + + + VertexPredicate<'TVertex> - QuickGraph + + + + + + + + + + + + + + + +
    +
    + +

    QuickGraph

    +
    +
    +
    +
    + + + + +

    VertexPredicate<'TVertex>

    +

    + Namespace: QuickGraph
    +

    +
    +
    +

    Constructors

    + + + + + + + + + + +
    ConstructorDescription
    + + + new(object, method) + +
    + Signature: (object:obj * method:nativeint) -> unit
    +
    +     		+ +
    +

    Instance members

    + + + + + + + + + + + + + + + + + + +
    Instance memberDescription
    + + + BeginInvoke(v, callback, object) + +
    + Signature: (v:'TVertex * callback:AsyncCallback * object:obj) -> IAsyncResult
    + Modifiers: abstract
    +
    +     		+ +
    + + + EndInvoke(result) + +
    + Signature: result:IAsyncResult -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + + + Invoke(v) + +
    + Signature: v:'TVertex -> bool
    + Modifiers: abstract
    +
    +     		+ +
    + +
    +
    + F# Project + +
    +
    +
    + Fork me on GitHub + + From ee24f3f101c226bc4f287ab79a74ba268d652217 Mon Sep 17 00:00:00 2001 From: rsdpisuy Date: Thu, 18 Aug 2016 10:04:03 +0300 Subject: [PATCH 13/15] Update generated documentation for version 3.7.2 --- release-notes.html | 4 ++++ 1 file changed, 4 insertions(+) diff --git a/release-notes.html b/release-notes.html index 9f5a4de89..990c93c90 100644 --- a/release-notes.html +++ b/release-notes.html @@ -32,6 +32,10 @@

    QuickGraph

    +

    3.7.2 August 18 2016

    +
      +
    • Update DotParser to latest version (1.0.6)
      • +

    3.7.1 July 12 2016

    • Minor fixes
      • From d7105698aba09053abcbd6f728844b7e46772281 Mon Sep 17 00:00:00 2001 From: gsv Date: Tue, 23 Aug 2016 11:40:04 +0300 Subject: [PATCH 14/15] Update generated documentation for version 3.7.3 --- release-notes.html | 8 ++++++-- 1 file changed, 6 insertions(+), 2 deletions(-) diff --git a/release-notes.html b/release-notes.html index 990c93c90..0fc2d2913 100644 --- a/release-notes.html +++ b/release-notes.html @@ -32,9 +32,13 @@

      QuickGraph

      -

      3.7.2 August 18 2016

      +

      3.7.3 August 23 2016

        -
      • Update DotParser to latest version (1.0.6)
        • +
      • Minor fix in packet dependences specification
        • +
      +

      3.7.2 August 17 2016

      +
        +
      • Update DotParser to latest version

      3.7.1 July 12 2016

        From 188fd94afd3a7b70e8874e81f459536682b6b246 Mon Sep 17 00:00:00 2001 From: gsv Date: Mon, 27 Aug 2018 22:06:54 +0300 Subject: [PATCH 15/15] Update generated documentation for version 3.7.4 --- reference/helpertypes-eqclass.html | 4 +- reference/helpertypes-eqclassfuns.html | 20 +- reference/helpertypes-markedval-1.html | 8 +- reference/helpertypes-markedvalfuns.html | 8 +- reference/helpertypes-statefromfsa.html | 4 +- reference/helpertypes-statefromfsafuns.html | 16 +- reference/helpertypes-twosets-1.html | 8 +- reference/helpertypes-twosetsfuns.html | 12 +- reference/index.html | 51 +- reference/quickgraph-adjacencygraph-2.html | 180 +++--- ...quickgraph-algorithms-algorithmbase-1.html | 56 +- ...ph-algorithms-algorithmeventhandler-1.html | 16 +- ...kgraph-algorithms-algorithmextensions.html | 200 +++--- ...hms-approxcompletecoloringalgorithm-2.html | 176 ++++++ ...s-assigmentproblem-hungarianalgorithm.html | 130 ++++ ...s-assigmentproblem-hungarianiteration.html | 168 +++++ ...gershorminimumfeedbackarcsetalgorithm.html | 4 +- ...lgorithms-bipartitedimensionalgorithm.html | 12 +- ...ms-centralityapproximationalgorithm-2.html | 16 +- ...rithms-chromaticpolynomial-basenode-2.html | 219 +++++++ ...algorithms-chromaticpolynomial-leaf-2.html | 96 +++ ...algorithms-chromaticpolynomial-node-2.html | 218 +++++++ ...kgraph-algorithms-chromaticpolynomial.html | 94 ++- ...-cliques-maximumcliquealgorithmbase-2.html | 8 +- ...ckgraph-algorithms-componentwithedges.html | 68 +++ ...ensation-condensationgraphalgorithm-3.html | 12 +- ...gorithms-condensation-condensededge-3.html | 8 +- ...edgemergecondensationgraphalgorithm-2.html | 12 +- ...-algorithms-condensation-mergededge-2.html | 12 +- ...onents-connectedcomponentsalgorithm-2.html | 20 +- ...ementalconnectedcomponentsalgorithm-2.html | 16 +- ...tronglyconnectedcomponentsalgorithm-2.html | 84 ++- ...-weaklyconnectedcomponentsalgorithm-2.html | 34 +- ...ckgraph-algorithms-domaticpartition-2.html | 16 +- ...ph-algorithms-edgecoloringalgorithm-2.html | 176 ++++++ ...h-algorithms-euleriantrailalgorithm-2.html | 44 +- ...oneablevertexgraphexploreralgorithm-2.html | 52 +- ...thms-exploration-itransitionfactory-2.html | 8 +- ...tion-transitionfactoryimplicitgraph-2.html | 48 +- ...uickgraph-algorithms-geneticconstants.html | 28 +- ...hcoloring-vertexcoloring-inputmodel-2.html | 8 +- ...coloring-vertexcoloring-outputmodel-2.html | 8 +- ...texcoloring-vertexcoloringalgorithm-2.html | 22 +- .../quickgraph-algorithms-ialgorithm-1.html | 4 +- .../quickgraph-algorithms-icomputation.html | 32 +- ...rithms-iconnectedcomponentalgorithm-3.html | 8 +- ...gorithms-idistancerecorderalgorithm-2.html | 8 +- ...uickgraph-algorithms-idistancerelaxer.html | 8 +- ...-algorithms-iedgecolorizeralgorithm-2.html | 4 +- ...s-iedgepredecessorrecorderalgorithm-2.html | 8 +- ...graph-algorithms-inducedpathalgorithm.html | 8 +- ...algorithms-iseuleriangraphalgorithm-2.html | 36 +- ...orithms-ishamiltoniangraphalgorithm-2.html | 22 +- ...ph-algorithms-itreebuilderalgorithm-2.html | 4 +- ...hms-iundirectedtreebuilderalgorithm-2.html | 4 +- ...dvertexpredecessorrecorderalgorithm-2.html | 8 +- ...lgorithms-ivertexcolorizeralgorithm-2.html | 4 +- ...ivertexpredecessorrecorderalgorithm-2.html | 8 +- ...orithms-ivertextimestamperalgorithm-2.html | 8 +- ...hanlinalgoritm-kernighanlinalgoritm-2.html | 12 +- ...thms-kernighanlinalgoritm-partition-1.html | 16 +- ...uickgraph-algorithms-maxcardinality-2.html | 121 ++++ ...s-maximumbipartitematchingalgorithm-2.html | 24 +- ...-allverticesgraphaugmentoralgorithm-2.html | 8 +- ...low-edmondskarpmaximumflowalgorithm-2.html | 8 +- ...mumflow-graphaugmentoralgorithmbase-3.html | 48 +- ...-maximumflow-graphbalanceralgorithm-2.html | 100 +-- ...ms-maximumflow-maximumflowalgorithm-2.html | 48 +- ...tisourcesinkgraphaugmentoralgorithm-2.html | 8 +- ...flow-reversededgeaugmentoralgorithm-2.html | 40 +- ...rithms-maximumindependentsetalgorithm.html | 8 +- ...-minimumdominatingsetgeneticalgorithm.html | 8 +- ...kruskalminimumspanningtreealgorithm-2.html | 16 +- ...ee-primminimumspanningtreealgorithm-2.html | 16 +- ...ers-edgepredecessorrecorderobserver-2.html | 36 +- ...thms-observers-edgerecorderobserver-2.html | 16 +- ...raph-algorithms-observers-iobserver-1.html | 4 +- ...ectedvertexdistancerecorderobserver-2.html | 24 +- ...edvertexpredecessorrecorderobserver-2.html | 20 +- ...vers-vertexdistancerecorderobserver-2.html | 24 +- ...rtexpredecessorpathrecorderobserver-2.html | 24 +- ...s-vertexpredecessorrecorderobserver-2.html | 20 +- ...ms-observers-vertexrecorderobserver-2.html | 16 +- ...observers-vertextimestamperobserver-2.html | 24 +- ...ckgraph-algorithms-randomgraphfactory.html | 24 +- ...lks-cyclepoppingrandomtreealgorithm-2.html | 56 +- ...h-algorithms-randomwalks-iedgechain-2.html | 8 +- ...rithms-randomwalks-imarkovedgechain-2.html | 4 +- ...hms-randomwalks-markovedgechainbase-2.html | 16 +- ...ndomwalks-normalizedmarkovedgechain-2.html | 12 +- ...hms-randomwalks-randomwalkalgorithm-2.html | 40 +- ...hms-randomwalks-roundrobinedgechain-2.html | 12 +- ...ks-vanishingweightedmarkovedgechain-2.html | 20 +- ...randomwalks-weightedmarkovedgechain-2.html | 12 +- ...omwalks-weightedmarkovedgechainbase-2.html | 8 +- ...anpavleyrankedshortestpathalgorithm-2.html | 20 +- ...ath-rankedshortestpathalgorithmbase-3.html | 20 +- ...lgorithms-ranking-pagerankalgorithm-2.html | 32 +- ...raph-algorithms-rootedalgorithmbase-2.html | 24 +- ...lgorithms-rootedsearchalgorithmbase-2.html | 28 +- ...ch-bestfirstfrontiersearchalgorithm-2.html | 8 +- ...irectionaldepthfirstsearchalgorithm-2.html | 60 +- ...-search-breadthfirstsearchalgorithm-2.html | 72 +-- ...ms-search-depthfirstsearchalgorithm-2.html | 72 +-- ...earch-edgedepthfirstsearchalgorithm-2.html | 60 +- ...h-implicitdepthfirstsearchalgorithm-2.html | 44 +- ...plicitedgedepthfirstsearchalgorithm-2.html | 44 +- ...directedbreadthfirstsearchalgorithm-2.html | 64 +- ...undirecteddepthfirstsearchalgorithm-2.html | 72 +-- ...gorithms-services-ialgorithmcomponent.html | 12 +- ...lgorithms-services-ialgorithmservices.html | 4 +- ...ph-algorithms-services-icancelmanager.html | 20 +- ...testpath-astarshortestpathalgorithm-2.html | 48 +- ...th-bellmanfordshortestpathalgorithm-2.html | 40 +- ...ortestpath-dagshortestpathalgorithm-2.html | 44 +- ...tpath-dijkstrashortestpathalgorithm-2.html | 44 +- ...oydwarshallallshortestpathalgorithm-2.html | 24 +- ...rtestpath-shortestpathalgorithmbase-3.html | 36 +- ...recteddijkstrashortestpathalgorithm-2.html | 44 +- ...undirectedshortestpathalgorithmbase-2.html | 36 +- ...tpath-yen-yenshortestpathsalgorithm-1.html | 26 +- ...offlineleastcommonancestoralgorithm-2.html | 24 +- ...directionaltopologicalsortalgorithm-2.html | 28 +- ...sourcefirsttopologicalsortalgorithm-2.html | 24 +- ...ogicalsort-topologicalsortalgorithm-2.html | 48 +- ...rectedfirsttopologicalsortalgorithm-2.html | 28 +- ...-undirectedtopologicalsortalgorithm-2.html | 20 +- ...gorithms-transitiveclosurealgorithm-2.html | 112 ++++ ...rithms-transitivereductionalgorithm-2.html | 112 ++++ ...uickgraph-algorithms-tsp-taskpriority.html | 8 +- .../quickgraph-algorithms-tsp-tsp-3.html | 4 +- .../quickgraph-arrayadjacencygraph-2.html | 80 +-- .../quickgraph-arraybidirectionalgraph-2.html | 104 ++-- .../quickgraph-arrayequalitycomparer-1.html | 20 +- .../quickgraph-arrayundirectedgraph-2.html | 76 +-- .../quickgraph-bidirectionadaptergraph-2.html | 100 +-- .../quickgraph-bidirectionalgraph-2.html | 224 +++---- ...quickgraph-bidirectionalmatrixgraph-1.html | 152 ++--- .../quickgraph-clusteredadjacencygraph-2.html | 168 ++--- .../quickgraph-collections-binaryheap-2.html | 76 +-- .../quickgraph-collections-binaryqueue-2.html | 44 +- ...raph-collections-edgeedgedictionary-2.html | 16 +- .../quickgraph-collections-edgelist-2.html | 16 +- ...uickgraph-collections-fibonacciheap-2.html | 64 +- ...graph-collections-fibonacciheapcell-2.html | 8 +- ...collections-fibonacciheaplinkedlist-2.html | 8 +- ...ickgraph-collections-fibonacciqueue-2.html | 48 +- ...graph-collections-forestdisjointset-1.html | 36 +- ...quickgraph-collections-idisjointset-1.html | 28 +- .../quickgraph-collections-iedgelist-2.html | 8 +- ...ickgraph-collections-ipriorityqueue-1.html | 4 +- .../quickgraph-collections-iqueue-1.html | 24 +- ...h-collections-ivertexedgedictionary-2.html | 4 +- reference/quickgraph-collections-queue-1.html | 4 +- .../quickgraph-collections-softheap-2.html | 40 +- ...quickgraph-collections-termedgelist-2.html | 68 +-- ...ph-collections-vertexedgedictionary-2.html | 16 +- .../quickgraph-collections-vertexlist-1.html | 16 +- ...quickgraph-compressedsparserowgraph-1.html | 80 +-- .../quickgraph-contracts-graphcontract.html | 20 +- .../quickgraph-createedgedelegate-2.html | 16 +- .../quickgraph-createvertexdelegate-2.html | 16 +- .../quickgraph-data-datarelationedge.html | 16 +- reference/quickgraph-data-datasetgraph.html | 4 +- ...uickgraph-data-datasetgraphextensions.html | 8 +- ...h-data-datasetgraphpopulatoralgorithm.html | 8 +- ...ckgraph-data-datasetgraphvizalgorithm.html | 8 +- ...delegatebidirectionalincidencegraph-2.html | 32 +- .../quickgraph-delegateimplicitgraph-2.html | 40 +- ...aph-delegateimplicitundirectedgraph-2.html | 52 +- .../quickgraph-delegateincidencegraph-2.html | 16 +- .../quickgraph-delegateundirectedgraph-2.html | 32 +- ...raph-delegatevertexandedgelistgraph-2.html | 32 +- reference/quickgraph-dotparseradapter.html | 4 +- .../quickgraph-doubleequalitycomparer.html | 24 +- reference/quickgraph-edge-1.html | 16 +- reference/quickgraph-edgeaction-2.html | 16 +- reference/quickgraph-edgeedgeaction-2.html | 16 +- .../quickgraph-edgeequalitycomparer-2.html | 16 +- reference/quickgraph-edgeeventargs-2.html | 8 +- reference/quickgraph-edgeextensions.html | 52 +- reference/quickgraph-edgefactory-2.html | 16 +- reference/quickgraph-edgeidentity-2.html | 16 +- reference/quickgraph-edgelistgraph-2.html | 88 +-- reference/quickgraph-edgepredicate-2.html | 16 +- reference/quickgraph-enumerablecontract.html | 8 +- reference/quickgraph-equalityextensions.html | 56 +- reference/quickgraph-equatableedge-1.html | 16 +- reference/quickgraph-equatabletermedge-1.html | 20 +- reference/quickgraph-equategraphs.html | 12 +- .../quickgraph-floatequalitycomparer.html | 24 +- ...uickgraph-fsa-graphbasedfsa-dfanode-1.html | 20 +- ...uickgraph-fsa-graphbasedfsa-edgefsa-1.html | 4 +- .../quickgraph-fsa-graphbasedfsa-fsa-1.html | 92 +-- ...ckgraph-fsa-graphbasedfsa-fsaparams-2.html | 24 +- ...ickgraph-fsa-graphbasedfsa-multimap-2.html | 20 +- ...ickgraph-fsa-graphbasedfsa-nodesetset.html | 16 +- ...graph-fsa-graphbasedfsa-replaceamount.html | 8 +- ...aph-fsa-graphbasedfsa-replaceappetite.html | 12 +- ...kgraph-fsa-graphbasedfsa-replaceorder.html | 8 +- .../quickgraph-fsa-graphbasedfsa-symb-1.html | 8 +- reference/quickgraph-fsa-graphbasedfsa.html | 20 +- reference/quickgraph-fst-fsttable-edge-2.html | 20 +- reference/quickgraph-fst-fsttable-fst-2.html | 32 +- .../quickgraph-fst-fsttable-simplefst-2.html | 16 +- reference/quickgraph-fst-fsttable.html | 8 +- ...uickgraph-fst-graphbasedfst-edgefst-2.html | 4 +- .../quickgraph-fst-graphbasedfst-fst-2.html | 72 +-- .../quickgraph-fst-graphbasedfst-test-2.html | 8 +- reference/quickgraph-fst-graphbasedfst.html | 8 +- ...raph-glee-gleedefaultgraphpopulator-2.html | 4 +- .../quickgraph-glee-gleeedgeeventargs-2.html | 8 +- ...uickgraph-glee-gleeedgeeventhandler-2.html | 16 +- .../quickgraph-glee-gleegraphextensions.html | 24 +- .../quickgraph-glee-gleegraphpopulator-2.html | 16 +- ...lee-gleeindentifiablegraphpopulator-2.html | 4 +- ...aph-glee-gleetostringgraphpopulator-2.html | 12 +- ...quickgraph-glee-gleevertexeventargs-1.html | 8 +- ...aph-glee-gleevertexnodeeventhandler-1.html | 16 +- reference/quickgraph-graphextensions.html | 124 ++-- ...h-graphviz-condensatedgraphrenderer-3.html | 4 +- ...quickgraph-graphviz-dot-graphvizarrow.html | 28 +- .../quickgraph-graphviz-dot-graphvizedge.html | 96 +-- ...ph-graphviz-dot-graphvizedgeextremity.html | 36 +- ...kgraph-graphviz-dot-graphvizedgelabel.html | 32 +- ...quickgraph-graphviz-dot-graphvizgraph.html | 148 ++--- ...quickgraph-graphviz-dot-graphvizlayer.html | 8 +- ...-graphviz-dot-graphvizlayercollection.html | 20 +- ...uickgraph-graphviz-dot-graphvizrecord.html | 16 +- ...graph-graphviz-dot-graphvizrecordcell.html | 36 +- ...hviz-dot-graphvizrecordcellcollection.html | 12 +- ...ph-graphviz-dot-graphvizrecordescaper.html | 12 +- ...uickgraph-graphviz-dot-graphvizvertex.html | 112 ++-- ...z-edgemergecondensatedgraphrenderer-2.html | 4 +- .../quickgraph-graphviz-filedotengine.html | 8 +- ...aph-graphviz-formatclustereventargs-2.html | 12 +- ...-graphviz-formatclustereventhandler-2.html | 16 +- ...uickgraph-graphviz-formatedgeaction-2.html | 16 +- ...kgraph-graphviz-formatedgeeventargs-2.html | 4 +- ...raph-graphviz-formatvertexeventargs-1.html | 4 +- ...h-graphviz-formatvertexeventhandler-1.html | 16 +- ...ickgraph-graphviz-graphrendererbase-2.html | 16 +- ...ickgraph-graphviz-graphvizalgorithm-2.html | 56 +- ...uickgraph-graphviz-graphvizextensions.html | 20 +- reference/quickgraph-graphviz-idotengine.html | 4 +- .../quickgraph-graphviz-svghtmlwrapper.html | 12 +- ...kgraph-ibidirectionalincidencegraph-2.html | 24 +- reference/quickgraph-icloneableedge-2.html | 4 +- reference/quickgraph-iclusteredgraph.html | 20 +- .../quickgraph-identifiableedgefactory-2.html | 16 +- ...uickgraph-identifiablevertexfactory-1.html | 16 +- reference/quickgraph-iedge-1.html | 8 +- reference/quickgraph-iedgeset-2.html | 16 +- reference/quickgraph-igraph-2.html | 8 +- reference/quickgraph-ihierarchy-2.html | 40 +- reference/quickgraph-ihyperedge-1.html | 8 +- reference/quickgraph-iimplicitgraph-2.html | 20 +- ...quickgraph-iimplicitundirectedgraph-2.html | 28 +- .../quickgraph-iimplicitvertexset-1.html | 4 +- reference/quickgraph-iincidencegraph-2.html | 12 +- ...ickgraph-imutablebidirectionalgraph-2.html | 12 +- .../quickgraph-imutableedgelistgraph-2.html | 24 +- reference/quickgraph-imutablegraph-2.html | 4 +- .../quickgraph-imutableincidencegraph-2.html | 12 +- .../quickgraph-imutableundirectedgraph-2.html | 8 +- ...quickgraph-imutablevertexandedgeset-2.html | 8 +- reference/quickgraph-imutablevertexset-1.html | 24 +- reference/quickgraph-itagged-1.html | 8 +- .../quickgraph-itermbidirectionalgraph-2.html | 40 +- reference/quickgraph-itermedge-1.html | 8 +- reference/quickgraph-ivertexset-1.html | 12 +- ...uickgraph-negativecyclegraphexception.html | 16 +- .../quickgraph-negativeweightexception.html | 16 +- .../quickgraph-nonacyclicgraphexception.html | 16 +- ...ph-nonstronglyconnectedgraphexception.html | 16 +- .../quickgraph-nopathfoundexception.html | 4 +- ...graph-paralleledgenotallowedexception.html | 16 +- ...etri-allwaystrueconditionexpression-1.html | 8 +- reference/quickgraph-petri-iarc-1.html | 16 +- ...ickgraph-petri-iconditionexpression-1.html | 4 +- ...quickgraph-petri-identityexpression-1.html | 8 +- reference/quickgraph-petri-iexpression-1.html | 4 +- .../quickgraph-petri-imutablepetrinet-1.html | 16 +- reference/quickgraph-petri-ipetrinet-1.html | 16 +- reference/quickgraph-petri-ipetrivertex.html | 4 +- reference/quickgraph-petri-iplace-1.html | 8 +- reference/quickgraph-petri-itransition-1.html | 4 +- reference/quickgraph-petri-petrinet-1.html | 44 +- .../quickgraph-petri-petrinetsimulator-1.html | 16 +- ...edicates-filteredbidirectionalgraph-3.html | 44 +- ...ph-predicates-filterededgelistgraph-3.html | 32 +- ...quickgraph-predicates-filteredgraph-3.html | 24 +- ...ph-predicates-filteredimplicitgraph-3.html | 24 +- ...redicates-filteredimplicitvertexset-3.html | 8 +- ...h-predicates-filteredincidencegraph-3.html | 16 +- ...-predicates-filteredundirectedgraph-3.html | 64 +- ...ates-filteredvertexandedgelistgraph-3.html | 20 +- ...-predicates-filteredvertexlistgraph-3.html | 16 +- ...dicates-indictionaryvertexpredicate-2.html | 8 +- ...-predicates-isolatedvertexpredicate-2.html | 8 +- ...ph-predicates-residualedgepredicate-2.html | 12 +- ...cates-reversedresidualedgepredicate-2.html | 16 +- ...raph-predicates-sinkvertexpredicate-2.html | 8 +- reference/quickgraph-quickgraphexception.html | 16 +- .../quickgraph-quickgraphresourcemanager.html | 12 +- ...uickgraph-referenceequalitycomparer-1.html | 12 +- ...ickgraph-reversedbidirectionalgraph-2.html | 104 ++-- .../quickgraph-samples-graphcreation.html | 12 +- .../quickgraph-samples-graphvizsamples.html | 8 +- reference/quickgraph-samples-wikisamples.html | 8 +- reference/quickgraph-sedge-1.html | 16 +- reference/quickgraph-sequatableedge-1.html | 28 +- ...quickgraph-sequatableundirectededge-1.html | 28 +- ...ization-directedgraphml-directedgraph.html | 80 +-- ...on-directedgraphml-directedgraphalias.html | 16 +- ...directedgraphml-directedgraphcategory.html | 160 ++--- ...ion-directedgraphml-directedgraphlink.html | 88 +-- ...ctedgraphml-directedgraphlinkcategory.html | 8 +- ...ion-directedgraphml-directedgraphname.html | 20 +- ...ion-directedgraphml-directedgraphnode.html | 576 +++++++++--------- ...ctedgraphml-directedgraphnodecategory.html | 8 +- ...ion-directedgraphml-directedgraphpath.html | 12 +- ...directedgraphml-directedgraphproperty.html | 36 +- ...on-directedgraphml-directedgraphstyle.html | 36 +- ...edgraphml-directedgraphstylecondition.html | 8 +- ...ectedgraphml-directedgraphstylesetter.html | 16 +- ...ialization-directedgraphmlalgorithm-2.html | 20 +- ...rialization-directedgraphmlextensions.html | 40 +- ...h-serialization-graphmldeserializer-3.html | 8 +- ...graph-serialization-graphmlextensions.html | 32 +- ...aph-serialization-graphmlserializer-3.html | 12 +- ...raph-serialization-graphmlxmlresolver.html | 16 +- ...serialization-serializationextensions.html | 28 +- ...kgraph-serialization-serializerbase-2.html | 8 +- ...aph-serialization-xmlreaderextensions.html | 28 +- ...h-serialization-xmlserializableedge-1.html | 12 +- ...-serialization-xmlserializablegraph-3.html | 16 +- ...aph-serialization-xmlwriterextensions.html | 28 +- reference/quickgraph-sreversededge-2.html | 32 +- reference/quickgraph-staggededge-2.html | 24 +- .../quickgraph-staggedequatableedge-2.html | 36 +- reference/quickgraph-sundirectededge-1.html | 16 +- .../quickgraph-sundirectedtaggededge-2.html | 24 +- reference/quickgraph-taggededge-2.html | 12 +- .../quickgraph-taggedequatableedge-2.html | 12 +- .../quickgraph-taggedundirectededge-2.html | 16 +- .../quickgraph-termbidirectionalgraph-2.html | 44 +- reference/quickgraph-termedge-1.html | 28 +- reference/quickgraph-tryfunc-2.html | 16 +- reference/quickgraph-tryfunc-3.html | 16 +- reference/quickgraph-tryfunc-4.html | 16 +- reference/quickgraph-tryfunc-5.html | 16 +- ...kgraph-undirectedbidirectionalgraph-2.html | 76 +-- reference/quickgraph-undirectededge-1.html | 16 +- .../quickgraph-undirectededgeaction-2.html | 16 +- .../quickgraph-undirectededgeeventargs-2.html | 16 +- reference/quickgraph-undirectedgraph-2.html | 186 +++--- reference/quickgraph-vertexaction-1.html | 16 +- reference/quickgraph-vertexeventargs-1.html | 8 +- .../quickgraph-vertexeventhandler-1.html | 16 +- reference/quickgraph-vertexfactory-1.html | 16 +- reference/quickgraph-vertexidentity-1.html | 16 +- reference/quickgraph-vertexindexer-1.html | 16 +- reference/quickgraph-vertexpredicate-1.html | 16 +- release-notes.html | 10 +- 365 files changed, 6826 insertions(+), 4895 deletions(-) create mode 100644 reference/quickgraph-algorithms-approxcompletecoloringalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-assigmentproblem-hungarianalgorithm.html create mode 100644 reference/quickgraph-algorithms-assigmentproblem-hungarianiteration.html create mode 100644 reference/quickgraph-algorithms-chromaticpolynomial-basenode-2.html create mode 100644 reference/quickgraph-algorithms-chromaticpolynomial-leaf-2.html create mode 100644 reference/quickgraph-algorithms-chromaticpolynomial-node-2.html create mode 100644 reference/quickgraph-algorithms-componentwithedges.html create mode 100644 reference/quickgraph-algorithms-edgecoloringalgorithm-2.html create mode 100644 reference/quickgraph-algorithms-maxcardinality-2.html create mode 100644 reference/quickgraph-algorithms-transitiveclosurealgorithm-2.html create mode 100644 reference/quickgraph-algorithms-transitivereductionalgorithm-2.html diff --git a/reference/helpertypes-eqclass.html b/reference/helpertypes-eqclass.html index 8d133c574..63afe8cef 100644 --- a/reference/helpertypes-eqclass.html +++ b/reference/helpertypes-eqclass.html @@ -51,10 +51,10 @@

        Union Cases

        - + EqClass(TwoSets<int>) -
        +
        Signature: TwoSets<int>
        diff --git a/reference/helpertypes-eqclassfuns.html b/reference/helpertypes-eqclassfuns.html index 915657f13..a887e22c4 100644 --- a/reference/helpertypes-eqclassfuns.html +++ b/reference/helpertypes-eqclassfuns.html @@ -54,10 +54,10 @@

        Functions and values

        - + add arg1 arg2 -
        +
        Signature: StateFromFsa -> EqClass -> EqClass
        @@ -72,10 +72,10 @@

        Functions and values

        - + contains v arg2 -
        +
        Signature: v:int -> EqClass -> bool
        @@ -90,10 +90,10 @@

        Functions and values

        - + empty -
        +
        Signature: EqClass
        @@ -108,10 +108,10 @@

        Functions and values

        - + fsa1States arg1 -
        +
        Signature: EqClass -> Set<int>
        @@ -126,10 +126,10 @@

        Functions and values

        - + fsa2States arg1 -
        +
        Signature: EqClass -> Set<int>
        diff --git a/reference/helpertypes-markedval-1.html b/reference/helpertypes-markedval-1.html index 2050294e2..9cf1bc6fb 100644 --- a/reference/helpertypes-markedval-1.html +++ b/reference/helpertypes-markedval-1.html @@ -51,10 +51,10 @@

        Record Fields

        - + Marked -
        +
        Signature: bool
        @@ -69,10 +69,10 @@

        Record Fields

        - + Value -
        +
        Signature: 'a
        diff --git a/reference/helpertypes-markedvalfuns.html b/reference/helpertypes-markedvalfuns.html index 8dfc151eb..4791d1b1b 100644 --- a/reference/helpertypes-markedvalfuns.html +++ b/reference/helpertypes-markedvalfuns.html @@ -54,10 +54,10 @@

        Functions and values

        - + marked v -
        +
        Signature: v:'?7535 -> MarkedVal<'?7535>
        Type parameters: '?7535
        @@ -72,10 +72,10 @@

        Functions and values

        - + notMarked v -
        +
        Signature: v:'?7537 -> MarkedVal<'?7537>
        Type parameters: '?7537
        diff --git a/reference/helpertypes-statefromfsa.html b/reference/helpertypes-statefromfsa.html index f7f8db7f2..1551c9fff 100644 --- a/reference/helpertypes-statefromfsa.html +++ b/reference/helpertypes-statefromfsa.html @@ -51,10 +51,10 @@

        Union Cases

        - + StateFromFsa(MarkedVal<int>) -
        +
        Signature: MarkedVal<int>
        diff --git a/reference/helpertypes-statefromfsafuns.html b/reference/helpertypes-statefromfsafuns.html index 08261d812..673e1daae 100644 --- a/reference/helpertypes-statefromfsafuns.html +++ b/reference/helpertypes-statefromfsafuns.html @@ -54,10 +54,10 @@

        Functions and values

        - + fromFsa1 id -
        +
        Signature: id:int -> StateFromFsa
        @@ -72,10 +72,10 @@

        Functions and values

        - + fromFsa2 id -
        +
        Signature: id:int -> StateFromFsa
        @@ -90,10 +90,10 @@

        Functions and values

        - + isFromFsa1 arg1 -
        +
        Signature: StateFromFsa -> bool
        @@ -108,10 +108,10 @@

        Functions and values

        - + isFromFsa2 arg1 -
        +
        Signature: StateFromFsa -> bool
        diff --git a/reference/helpertypes-twosets-1.html b/reference/helpertypes-twosets-1.html index 83380b3b8..b6afb9207 100644 --- a/reference/helpertypes-twosets-1.html +++ b/reference/helpertypes-twosets-1.html @@ -51,10 +51,10 @@

        Record Fields

        - + Marked -
        +
        Signature: Set<'a>
        @@ -69,10 +69,10 @@

        Record Fields

        - + NotMarked -
        +
        Signature: Set<'a>
        diff --git a/reference/helpertypes-twosetsfuns.html b/reference/helpertypes-twosetsfuns.html index 2152c039e..e23349109 100644 --- a/reference/helpertypes-twosetsfuns.html +++ b/reference/helpertypes-twosetsfuns.html @@ -54,10 +54,10 @@

        Functions and values

        - + add mv ts -
        +
        Signature: mv:MarkedVal<'?7552> -> ts:TwoSets<'?7552> -> TwoSets<'?7552>
        Type parameters: '?7552
        @@ -72,10 +72,10 @@

        Functions and values

        - + contains v ts -
        +
        Signature: v:'?7554 -> ts:TwoSets<'?7554> -> bool
        Type parameters: '?7554
        @@ -90,10 +90,10 @@

        Functions and values

        - + empty -
        +
        Signature: TwoSets<'?7550>
        Type parameters: '?7550
        diff --git a/reference/index.html b/reference/index.html index 7d31e2ec4..85f6adbbf 100644 --- a/reference/index.html +++ b/reference/index.html @@ -902,6 +902,12 @@

        QuickGraph.Algorithms Namespace

        + + + ComponentWithEdges + + + ComputationState @@ -1054,7 +1060,19 @@

        QuickGraph.Algorithms Namespace

        - ApproxCompleteColoringAlgorithm + TransitiveClosureAlgorithm<'TVertex, 'TEdge> + + + + + + TransitiveReductionAlgorithm<'TVertex, 'TEdge> + + + + + + ApproxCompleteColoringAlgorithm<'Vertex, 'Edge> @@ -1084,7 +1102,7 @@

        QuickGraph.Algorithms Namespace

        - EdgeColoringAlgorithm + EdgeColoringAlgorithm<'Vertex, 'Edge> @@ -1100,6 +1118,12 @@

        QuickGraph.Algorithms Namespace

        + + + MaxCardinality<'Vertex, 'Edge> + + + MaximumIndependentSetAlgorithm @@ -1146,6 +1170,29 @@

        QuickGraph.Algorithms Namespace

        +
        +

        QuickGraph.Algorithms.AssigmentProblem Namespace

        +
        + + + + + + + + + + + + + + +
        TypeDescription
        + HungarianAlgorithm +
        + HungarianIteration +
        +

        QuickGraph.Algorithms.Cliques Namespace

        diff --git a/reference/quickgraph-adjacencygraph-2.html b/reference/quickgraph-adjacencygraph-2.html index f4737964c..94502b02e 100644 --- a/reference/quickgraph-adjacencygraph-2.html +++ b/reference/quickgraph-adjacencygraph-2.html @@ -53,10 +53,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -67,10 +67,10 @@

        Constructors

        - + new(allowParallelEdges) -
        +
        Signature: allowParallelEdges:bool -> unit
        @@ -81,10 +81,10 @@

        Constructors

        - + new(allowParallelEdges, capacity) -
        +
        Signature: (allowParallelEdges:bool * capacity:int) -> unit
        @@ -95,10 +95,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (allowParallelEdges:bool * capacity:int * edgeCapacity:int) -> unit
        @@ -109,10 +109,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (allowParallelEdges:bool * capacity:int * edgeCapacity:int * vertexEdgesDictionaryFactory:Func<int,IVertexEdgeDictionary<'TVertex,'TEdge>>) -> unit
        @@ -131,10 +131,10 @@

        Instance members

        - + AddEdge(e) -
        +
        Signature: e:'TEdge -> bool
        Modifiers: abstract
        @@ -148,10 +148,10 @@

        Instance members

        - + AddEdgeRange(edges) -
        +
        Signature: edges:IEnumerable<'TEdge> -> int
        Modifiers: abstract
        @@ -163,10 +163,10 @@

        Instance members

        - + AddVertex(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -178,10 +178,10 @@

        Instance members

        - + AddVertexRange(vertices) -
        +
        Signature: vertices:IEnumerable<'TVertex> -> int
        Modifiers: abstract
        @@ -193,10 +193,10 @@

        Instance members

        - + AddVerticesAndEdge(e) -
        +
        Signature: e:'TEdge -> bool
        Modifiers: abstract
        @@ -208,10 +208,10 @@

        Instance members

        - + AddVerticesAndEdgeRange(edges) -
        +
        Signature: edges:IEnumerable<'TEdge> -> int
        Modifiers: abstract
        @@ -225,10 +225,10 @@

        Instance members

        - + AllowParallelEdges -
        +
        Signature: bool
        Modifiers: abstract
        @@ -240,10 +240,10 @@

        Instance members

        - + Clear() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -255,10 +255,10 @@

        Instance members

        - + ClearOutEdges(v) -
        +
        Signature: v:'TVertex -> unit
        Modifiers: abstract
        @@ -270,10 +270,10 @@

        Instance members

        - + Clone() -
        +
        Signature: unit -> AdjacencyGraph<'TVertex,'TEdge>
        @@ -284,10 +284,10 @@

        Instance members

        - + ContainsEdge(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> bool
        Modifiers: abstract
        @@ -299,10 +299,10 @@

        Instance members

        - + ContainsEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -314,10 +314,10 @@

        Instance members

        - + ContainsVertex(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -329,10 +329,10 @@

        Instance members

        - + EdgeAdded -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -344,10 +344,10 @@

        Instance members

        - + EdgeCapacity() -
        +
        Signature: unit -> unit
        @@ -358,10 +358,10 @@

        Instance members

        - + EdgeCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -375,10 +375,10 @@

        Instance members

        - + EdgeRemoved -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -390,10 +390,10 @@

        Instance members

        - + Edges -
        +
        Signature: IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -407,10 +407,10 @@

        Instance members

        - + IsDirected -
        +
        Signature: bool
        Modifiers: abstract
        @@ -422,10 +422,10 @@

        Instance members

        - + IsEdgesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -439,10 +439,10 @@

        Instance members

        - + IsOutEdgesEmpty(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -454,10 +454,10 @@

        Instance members

        - + IsVerticesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -469,10 +469,10 @@

        Instance members

        - + OutDegree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -484,10 +484,10 @@

        Instance members

        - + OutEdge(v, index) -
        +
        Signature: (v:'TVertex * index:int) -> 'TEdge
        Modifiers: abstract
        @@ -499,10 +499,10 @@

        Instance members

        - + OutEdges(v) -
        +
        Signature: v:'TVertex -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -514,10 +514,10 @@

        Instance members

        - + RemoveEdge(e) -
        +
        Signature: e:'TEdge -> bool
        Modifiers: abstract
        @@ -529,10 +529,10 @@

        Instance members

        - + RemoveEdgeIf(predicate) -
        +
        Signature: predicate:EdgePredicate<'TVertex,'TEdge> -> int
        Modifiers: abstract
        @@ -544,10 +544,10 @@

        Instance members

        - + RemoveOutEdgeIf(v, predicate) -
        +
        Signature: (v:'TVertex * predicate:EdgePredicate<'TVertex,'TEdge>) -> int
        Modifiers: abstract
        @@ -559,10 +559,10 @@

        Instance members

        - + RemoveVertex(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -574,10 +574,10 @@

        Instance members

        - + RemoveVertexIf(predicate) -
        +
        Signature: predicate:VertexPredicate<'TVertex> -> int
        Modifiers: abstract
        @@ -589,10 +589,10 @@

        Instance members

        - + TrimEdgeExcess() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -604,10 +604,10 @@

        Instance members

        - + TryGetEdge(source, target, edge) -
        +
        Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
        Modifiers: abstract
        @@ -619,10 +619,10 @@

        Instance members

        - + TryGetEdges(source, target, edges) -
        +
        Signature: (source:'TVertex * target:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        @@ -634,10 +634,10 @@

        Instance members

        - + TryGetOutEdges(v, edges) -
        +
        Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        @@ -649,10 +649,10 @@

        Instance members

        - + VertexAdded -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -664,10 +664,10 @@

        Instance members

        - + VertexCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -679,10 +679,10 @@

        Instance members

        - + VertexRemoved -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -694,10 +694,10 @@

        Instance members

        - + Vertices -
        +
        Signature: IEnumerable<'TVertex>
        Modifiers: abstract
        @@ -717,10 +717,10 @@

        Static members

        - + EdgeType -
        +
        Signature: Type
        @@ -731,10 +731,10 @@

        Static members

        - + LoadDot(dotSource, vertexFunc, edgeFunc) -
        +
        Signature: (dotSource:string * vertexFunc:Func<string,IDictionary<string,string>,'TVertex> * edgeFunc:Func<'TVertex,'TVertex,IDictionary<string,string>,'TEdge>) -> AdjacencyGraph<'TVertex,'TEdge>
        diff --git a/reference/quickgraph-algorithms-algorithmbase-1.html b/reference/quickgraph-algorithms-algorithmbase-1.html index 9b5f6aae8..62c9bc978 100644 --- a/reference/quickgraph-algorithms-algorithmbase-1.html +++ b/reference/quickgraph-algorithms-algorithmbase-1.html @@ -50,10 +50,10 @@

        Constructors

        - + new(host, visitedGraph) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:'TGraph) -> unit
        @@ -66,10 +66,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:'TGraph -> unit
        @@ -88,10 +88,10 @@

        Instance members

        - + Abort() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -103,10 +103,10 @@

        Instance members

        - + Aborted -
        +
        Signature: IEvent<EventHandler,EventArgs>
        Modifiers: abstract
        @@ -118,10 +118,10 @@

        Instance members

        - + Compute() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -133,10 +133,10 @@

        Instance members

        - + Finished -
        +
        Signature: IEvent<EventHandler,EventArgs>
        Modifiers: abstract
        @@ -148,10 +148,10 @@

        Instance members

        - + GetService() -
        +
        Signature: unit -> 'T
        Modifiers: abstract
        @@ -163,10 +163,10 @@

        Instance members

        - + Services -
        +
        Signature: IAlgorithmServices
        Modifiers: abstract
        @@ -178,10 +178,10 @@

        Instance members

        - + Started -
        +
        Signature: IEvent<EventHandler,EventArgs>
        Modifiers: abstract
        @@ -193,10 +193,10 @@

        Instance members

        - + State -
        +
        Signature: ComputationState
        Modifiers: abstract
        @@ -208,10 +208,10 @@

        Instance members

        - + StateChanged -
        +
        Signature: IEvent<EventHandler,EventArgs>
        Modifiers: abstract
        @@ -223,10 +223,10 @@

        Instance members

        - + SyncRoot -
        +
        Signature: obj
        Modifiers: abstract
        @@ -238,10 +238,10 @@

        Instance members

        - + TryGetService(service) -
        +
        Signature: service:byref<'T> -> bool
        Modifiers: abstract
        @@ -253,10 +253,10 @@

        Instance members

        - + VisitedGraph -
        +
        Signature: 'TGraph
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-algorithmeventhandler-1.html b/reference/quickgraph-algorithms-algorithmeventhandler-1.html index 84c137321..90db6bfdd 100644 --- a/reference/quickgraph-algorithms-algorithmeventhandler-1.html +++ b/reference/quickgraph-algorithms-algorithmeventhandler-1.html @@ -50,10 +50,10 @@

        Constructors

        - + new(object, method) -
        +
        Signature: (object:obj * method:nativeint) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + BeginInvoke(sender, e, callback, object) -
        +
        Signature: (sender:IAlgorithm<'TGraph> * e:EventArgs * callback:AsyncCallback * object:obj) -> IAsyncResult
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + EndInvoke(result) -
        +
        Signature: result:IAsyncResult -> unit
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + Invoke(sender, e) -
        +
        Signature: (sender:IAlgorithm<'TGraph> * e:EventArgs) -> unit
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-algorithmextensions.html b/reference/quickgraph-algorithms-algorithmextensions.html index 776e17e23..2a5fb3cf2 100644 --- a/reference/quickgraph-algorithms-algorithmextensions.html +++ b/reference/quickgraph-algorithms-algorithmextensions.html @@ -52,10 +52,10 @@

        Static members

        - + Clone(...) -
        +
        Signature: (g:IVertexAndEdgeListGraph<'TVertex,'TEdge> * vertexCloner:Func<'TVertex,'TVertex> * edgeCloner:Func<'TEdge,'TVertex,'TVertex,'TEdge> * clone:IMutableVertexAndEdgeSet<'TVertex,'TEdge>) -> unit
        Type parameters: 'TVertex, 'TEdge
        @@ -68,10 +68,10 @@

        Static members

        - + ComputeDisjointSet(visitedGraph) -
        +
        Signature: visitedGraph:IUndirectedGraph<'TVertex,'TEdge> -> IDisjointSet<'TVertex>
        Type parameters: 'TVertex, 'TEdge
        @@ -82,10 +82,10 @@

        Static members

        - + ComputePredecessorCost(...) -
        +
        Signature: (predecessors:IDictionary<'TVertex,'TEdge> * edgeCosts:IDictionary<'TEdge,float> * target:'TVertex) -> float
        Type parameters: 'TVertex, 'TEdge
        @@ -99,10 +99,38 @@

        Static members

        - + + ComputeTransitiveClosure(...) + +
        + Signature: (visitedGraph:BidirectionalGraph<'TVertex,'TEdge> * createEdge:Func<'TVertex,'TVertex,'TEdge>) -> BidirectionalGraph<'TVertex,'TEdge>
        + Type parameters: 'TVertex, 'TEdge
        + + + + + + + + + + ComputeTransitiveReduction(visitedGraph) + +
        + Signature: visitedGraph:BidirectionalGraph<'TVertex,'TEdge> -> BidirectionalGraph<'TVertex,'TEdge>
        + Type parameters: 'TVertex, 'TEdge
        + + + + + + + + + CondensateEdges(...) -
        +
        Signature: (visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> * vertexPredicate:VertexPredicate<'TVertex>) -> IMutableBidirectionalGraph<'TVertex,MergedEdge<'TVertex,'TEdge>>
        Type parameters: 'TVertex, 'TEdge
        @@ -113,10 +141,10 @@

        Static members

        - + CondensateStronglyConnected(g) -
        +
        Signature: g:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> IMutableBidirectionalGraph<'TGraph,CondensedEdge<'TVertex,'TEdge,'TGraph>>
        Type parameters: 'TVertex, 'TEdge, 'TGraph
        @@ -129,10 +157,10 @@

        Static members

        - + CondensateWeaklyConnected(g) -
        +
        Signature: g:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> IMutableBidirectionalGraph<'TGraph,CondensedEdge<'TVertex,'TEdge,'TGraph>>
        Type parameters: 'TVertex, 'TEdge, 'TGraph
        @@ -145,10 +173,10 @@

        Static members

        - + ConnectedComponents(g, components) -
        +
        Signature: (g:IUndirectedGraph<'TVertex,'TEdge> * components:IDictionary<'TVertex,int>) -> int
        Type parameters: 'TVertex, 'TEdge
        @@ -161,10 +189,10 @@

        Static members

        - + GetEdgeIdentity(graph) -
        +
        Signature: graph:IEdgeSet<'TVertex,'TEdge> -> EdgeIdentity<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -177,10 +205,10 @@

        Static members

        - + GetIndexer(dictionary) -
        +
        Signature: dictionary:Dictionary<'TKey,'TValue> -> Func<'TKey,'TValue>
        Type parameters: 'TKey, 'TValue
        @@ -193,10 +221,10 @@

        Static members

        - + GetVertexIdentity(graph) -
        +
        Signature: graph:IVertexSet<'TVertex> -> VertexIdentity<'TVertex>
        Type parameters: 'TVertex
        @@ -209,10 +237,10 @@

        Static members

        - + IncrementalConnectedComponents(g) -
        +
        Signature: g:IMutableVertexAndEdgeSet<'TVertex,'TEdge> -> Func<KeyValuePair<int,IDictionary<'TVertex,int>>>
        Type parameters: 'TVertex, 'TEdge
        @@ -227,10 +255,10 @@

        Static members

        - + IsDirectedAcyclicGraph(g) -
        +
        Signature: g:IVertexListGraph<'TVertex,'TEdge> -> bool
        Type parameters: 'TVertex, 'TEdge
        @@ -243,10 +271,10 @@

        Static members

        - + IsolatedVertices(visitedGraph) -
        +
        Signature: visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> -> IEnumerable<'TVertex>
        Type parameters: 'TVertex, 'TEdge
        @@ -259,10 +287,10 @@

        Static members

        - + MaximumFlowEdmondsKarp(...) -
        +
        Signature: (visitedGraph:IMutableVertexAndEdgeListGraph<'TVertex,'TEdge> * edgeCapacities:Func<'TEdge,float> * source:'TVertex * sink:'TVertex * flowPredecessors:byref<TryFunc<'TVertex,'TEdge>> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> float
        Type parameters: 'TVertex, 'TEdge
        @@ -277,10 +305,10 @@

        Static members

        - + MinimumSpanningTreeKruskal(...) -
        +
        Signature: (visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float>) -> IEnumerable<'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -293,10 +321,10 @@

        Static members

        - + MinimumSpanningTreePrim(...) -
        +
        Signature: (visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float>) -> IEnumerable<'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -310,10 +338,10 @@

        Static members

        - + OddVertices(g) -
        +
        Signature: g:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> List<'TVertex>
        Type parameters: 'TVertex, 'TEdge
        @@ -326,10 +354,10 @@

        Static members

        - + OfflineLeastCommonAncestorTarjan(...) -
        +
        Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * root:'TVertex * pairs:IEnumerable<SEquatableEdge<'TVertex>>) -> TryFunc<SEquatableEdge<'TVertex>,'TVertex>
        Type parameters: 'TVertex, 'TEdge
        @@ -343,10 +371,10 @@

        Static members

        - + RankedShortestPathHoffmanPavley(...) -
        +
        Signature: (visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> * edgeWeights:Func<'TEdge,float> * source:'TVertex * target:'TVertex * pathCount:int) -> IEnumerable<IEnumerable<'TEdge>>
        Type parameters: 'TVertex, 'TEdge
        @@ -359,10 +387,10 @@

        Static members

        - + Roots(visitedGraph) -
        +
        Signature: visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> -> IEnumerable<'TVertex>
        Type parameters: 'TVertex, 'TEdge
        @@ -375,10 +403,10 @@

        Static members

        - + Roots(visitedGraph) -
        +
        Signature: visitedGraph:IVertexListGraph<'TVertex,'TEdge> -> IEnumerable<'TVertex>
        Type parameters: 'TVertex, 'TEdge
        @@ -391,10 +419,10 @@

        Static members

        - + ShortestPathsAStar(...) -
        +
        Signature: (visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * edgeWeights:Func<'TEdge,float> * costHeuristic:Func<'TVertex,float> * source:'TVertex) -> TryFunc<'TVertex,IEnumerable<'TEdge>>
        Type parameters: 'TVertex, 'TEdge
        @@ -405,10 +433,10 @@

        Static members

        - + ShortestPathsBellmanFord(...) -
        +
        Signature: (visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * edgeWeights:Func<'TEdge,float> * source:'TVertex) -> TryFunc<'TVertex,IEnumerable<'TEdge>>
        Type parameters: 'TVertex, 'TEdge
        @@ -419,10 +447,10 @@

        Static members

        - + ShortestPathsDag(...) -
        +
        Signature: (visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * edgeWeights:Func<'TEdge,float> * source:'TVertex) -> TryFunc<'TVertex,IEnumerable<'TEdge>>
        Type parameters: 'TVertex, 'TEdge
        @@ -433,10 +461,10 @@

        Static members

        - + ShortestPathsDijkstra(...) -
        +
        Signature: (visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * edgeWeights:Func<'TEdge,float> * source:'TVertex) -> TryFunc<'TVertex,IEnumerable<'TEdge>>
        Type parameters: 'TVertex, 'TEdge
        @@ -447,10 +475,10 @@

        Static members

        - + ShortestPathsDijkstra(...) -
        +
        Signature: (visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * edgeWeights:Func<'TEdge,float> * source:'TVertex) -> TryFunc<'TVertex,IEnumerable<'TEdge>>
        Type parameters: 'TVertex, 'TEdge
        @@ -461,10 +489,10 @@

        Static members

        - + Sinks(visitedGraph) -
        +
        Signature: visitedGraph:IVertexListGraph<'TVertex,'TEdge> -> IEnumerable<'TVertex>
        Type parameters: 'TVertex, 'TEdge
        @@ -477,10 +505,10 @@

        Static members

        - + SourceFirstBidirectionalTopologicalSort(...) -
        +
        Signature: (visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> * direction:TopologicalSortDirection) -> IEnumerable<'TVertex>
        Type parameters: 'TVertex, 'TEdge
        @@ -491,10 +519,10 @@

        Static members

        - + SourceFirstBidirectionalTopologicalSort(...) -
        +
        Signature: visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> -> IEnumerable<'TVertex>
        Type parameters: 'TVertex, 'TEdge
        @@ -505,10 +533,10 @@

        Static members

        - + SourceFirstBidirectionalTopologicalSort(...) -
        +
        Signature: (visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> * vertices:IList<'TVertex> * direction:TopologicalSortDirection) -> unit
        Type parameters: 'TVertex, 'TEdge
        @@ -519,10 +547,10 @@

        Static members

        - + SourceFirstBidirectionalTopologicalSort(...) -
        +
        Signature: (visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> * vertices:IList<'TVertex>) -> unit
        Type parameters: 'TVertex, 'TEdge
        @@ -533,10 +561,10 @@

        Static members

        - + SourceFirstTopologicalSort(visitedGraph) -
        +
        Signature: visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> IEnumerable<'TVertex>
        Type parameters: 'TVertex, 'TEdge
        @@ -547,10 +575,10 @@

        Static members

        - + SourceFirstTopologicalSort(...) -
        +
        Signature: (visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * vertices:IList<'TVertex>) -> unit
        Type parameters: 'TVertex, 'TEdge
        @@ -561,10 +589,10 @@

        Static members

        - + StronglyConnectedComponents(...) -
        +
        Signature: (g:IVertexListGraph<'TVertex,'TEdge> * components:byref<IDictionary<'TVertex,int>>) -> int
        Type parameters: 'TVertex, 'TEdge
        @@ -577,10 +605,10 @@

        Static members

        - + TopologicalSort(visitedGraph) -
        +
        Signature: visitedGraph:IUndirectedGraph<'TVertex,'TEdge> -> IEnumerable<'TVertex>
        Type parameters: 'TVertex, 'TEdge
        @@ -594,10 +622,10 @@

        Static members

        - + TopologicalSort(visitedGraph, vertices) -
        +
        Signature: (visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * vertices:IList<'TVertex>) -> unit
        Type parameters: 'TVertex, 'TEdge
        @@ -611,10 +639,10 @@

        Static members

        - + TopologicalSort(visitedGraph) -
        +
        Signature: visitedGraph:IVertexListGraph<'TVertex,'TEdge> -> IEnumerable<'TVertex>
        Type parameters: 'TVertex, 'TEdge
        @@ -628,10 +656,10 @@

        Static members

        - + TopologicalSort(visitedGraph, vertices) -
        +
        Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * vertices:IList<'TVertex>) -> unit
        Type parameters: 'TVertex, 'TEdge
        @@ -645,10 +673,10 @@

        Static members

        - + TreeBreadthFirstSearch(...) -
        +
        Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * root:'TVertex) -> TryFunc<'TVertex,IEnumerable<'TEdge>>
        Type parameters: 'TVertex, 'TEdge
        @@ -659,10 +687,10 @@

        Static members

        - + TreeCyclePoppingRandom(...) -
        +
        Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * root:'TVertex) -> TryFunc<'TVertex,IEnumerable<'TEdge>>
        Type parameters: 'TVertex, 'TEdge
        @@ -673,10 +701,10 @@

        Static members

        - + TreeCyclePoppingRandom(...) -
        +
        Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * root:'TVertex * edgeChain:IMarkovEdgeChain<'TVertex,'TEdge>) -> TryFunc<'TVertex,IEnumerable<'TEdge>>
        Type parameters: 'TVertex, 'TEdge
        @@ -687,10 +715,10 @@

        Static members

        - + TreeDepthFirstSearch(visitedGraph, root) -
        +
        Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * root:'TVertex) -> TryFunc<'TVertex,IEnumerable<'TEdge>>
        Type parameters: 'TVertex, 'TEdge
        @@ -703,10 +731,10 @@

        Static members

        - + WeaklyConnectedComponents(g, components) -
        +
        Signature: (g:IVertexListGraph<'TVertex,'TEdge> * components:IDictionary<'TVertex,int>) -> int
        Type parameters: 'TVertex, 'TEdge
        diff --git a/reference/quickgraph-algorithms-approxcompletecoloringalgorithm-2.html b/reference/quickgraph-algorithms-approxcompletecoloringalgorithm-2.html new file mode 100644 index 000000000..90bb4d69e --- /dev/null +++ b/reference/quickgraph-algorithms-approxcompletecoloringalgorithm-2.html @@ -0,0 +1,176 @@ + + + + + ApproxCompleteColoringAlgorithm<'Vertex, 'Edge> - QuickGraph + + + + + + + + + + + + + + + +
        +
        + +

        QuickGraph

        +
        +
        +
        +
        + + + + +

        ApproxCompleteColoringAlgorithm<'Vertex, 'Edge>

        +

        + Namespace: QuickGraph.Algorithms
        +

        +
        +
        +

        Constructors

        + + + + + + + + + + +
        ConstructorDescription
        + + + new() + +
        + Signature: unit -> ApproxCompleteColoringAlgorithm<'Vertex,'Edge>
        +
        +         		+ + + + + +

        CompiledName: .ctor

        +
        +

        Instance members

        + + + + + + + + + + + + + + + + + + + + + + +
        Instance memberDescription
        + + + add_Colored(arg1) + +
        + Signature: (Handler<'Vertex * int>) -> unit
        +
        +         		+ + + + + +
        + + + Colored + +
        + Signature: IEvent<'Vertex * int>
        +
        +         		+ + + + + +

        CompiledName: get_Colored

        +
        + + + Compute(graph) + +
        + Signature: graph:UndirectedGraph<'Vertex,'Edge> -> List<List<'Vertex>>
        +
        +         		+ + + + + +
        + + + remove_Colored(arg1) + +
        + Signature: (Handler<'Vertex * int>) -> unit
        +
        +         		+ + + + + +
        + +
        +
        + F# Project + +
        +
        +
        + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-assigmentproblem-hungarianalgorithm.html b/reference/quickgraph-algorithms-assigmentproblem-hungarianalgorithm.html new file mode 100644 index 000000000..eba22054f --- /dev/null +++ b/reference/quickgraph-algorithms-assigmentproblem-hungarianalgorithm.html @@ -0,0 +1,130 @@ + + + + + HungarianAlgorithm - QuickGraph + + + + + + + + + + + + + + + +
        +
        + +

        QuickGraph

        +
        +
        +
        +
        + + + + +

        HungarianAlgorithm

        +

        + Namespace: QuickGraph.Algorithms.AssigmentProblem
        +

        +
        +
        +

        Constructors

        + + + + + + + + + + +
        ConstructorDescription
        + + + new(costs) + +
        + Signature: (costs:int [,]) -> unit
        +
        +         		+ +
        +

        Instance members

        + + + + + + + + + + + + + + +
        Instance memberDescription
        + + + GetIterations() + +
        + Signature: unit -> List<HungarianIteration>
        +
        +         		+

        Returns iterations that can be used to visualise the algorithm

        + + +
        + + + Run() + +
        + Signature: unit -> int []
        +
        +         		+

        Returns assigments without visualisation

        + + +
        + +
        +
        + F# Project + +
        +
        +
        + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-assigmentproblem-hungarianiteration.html b/reference/quickgraph-algorithms-assigmentproblem-hungarianiteration.html new file mode 100644 index 000000000..6d8e67587 --- /dev/null +++ b/reference/quickgraph-algorithms-assigmentproblem-hungarianiteration.html @@ -0,0 +1,168 @@ + + + + + HungarianIteration - QuickGraph + + + + + + + + + + + + + + + +
        +
        + +

        QuickGraph

        +
        +
        +
        +
        + + + + +

        HungarianIteration

        +

        + Namespace: QuickGraph.Algorithms.AssigmentProblem
        +

        +
        +
        +

        Constructors

        + + + + + + + + + + +
        ConstructorDescription
        + + + new() + +
        + Signature: unit -> unit
        +
        +         		+ +
        +

        Instance members

        + + + + + + + + + + + + + + + + + + + + + + + + + + +
        Instance memberDescription
        + + + ColsCovered() + +
        + Signature: unit -> unit
        +
        +         		+ +
        + + + Mask() + +
        + Signature: unit -> unit
        +
        +         		+ +
        + + + Matrix() + +
        + Signature: unit -> unit
        +
        +         		+ +
        + + + RowsCovered() + +
        + Signature: unit -> unit
        +
        +         		+ +
        + + + Step() + +
        + Signature: unit -> unit
        +
        +         		+ +
        + +
        +
        + F# Project + +
        +
        +
        + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-bergershorminimumfeedbackarcsetalgorithm.html b/reference/quickgraph-algorithms-bergershorminimumfeedbackarcsetalgorithm.html index 4412d88c9..f7b9347cc 100644 --- a/reference/quickgraph-algorithms-bergershorminimumfeedbackarcsetalgorithm.html +++ b/reference/quickgraph-algorithms-bergershorminimumfeedbackarcsetalgorithm.html @@ -50,10 +50,10 @@

        Static members

        - + Compute(graph) -
        +
        Signature: graph:AdjacencyGraph<string,Edge<string>> -> AdjacencyGraph<string,Edge<string>>
        diff --git a/reference/quickgraph-algorithms-bipartitedimensionalgorithm.html b/reference/quickgraph-algorithms-bipartitedimensionalgorithm.html index edc5cf935..e1b61fb61 100644 --- a/reference/quickgraph-algorithms-bipartitedimensionalgorithm.html +++ b/reference/quickgraph-algorithms-bipartitedimensionalgorithm.html @@ -50,10 +50,10 @@

        Constructors

        - + new(graph) -
        +
        Signature: graph:UndirectedGraph<int,IEdge<int>> -> BipartiteDimensionAlgorithm
        @@ -77,10 +77,10 @@

        Instance members

        - + BipartiteDimensionValue -
        +
        Signature: int
        @@ -96,10 +96,10 @@

        Instance members

        - + GetNthBiclique(i) -
        +
        Signature: i:int -> int list
        diff --git a/reference/quickgraph-algorithms-centralityapproximationalgorithm-2.html b/reference/quickgraph-algorithms-centralityapproximationalgorithm-2.html index be7b4a9d7..e3ed93f5e 100644 --- a/reference/quickgraph-algorithms-centralityapproximationalgorithm-2.html +++ b/reference/quickgraph-algorithms-centralityapproximationalgorithm-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(visitedGraph, distances) -
        +
        Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * distances:Func<'TEdge,float>) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Distances -
        +
        Signature: Func<'TEdge,float>
        @@ -86,10 +86,10 @@

        Instance members

        - + MaxIterationCount() -
        +
        Signature: unit -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + Rand() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-algorithms-chromaticpolynomial-basenode-2.html b/reference/quickgraph-algorithms-chromaticpolynomial-basenode-2.html new file mode 100644 index 000000000..024051d91 --- /dev/null +++ b/reference/quickgraph-algorithms-chromaticpolynomial-basenode-2.html @@ -0,0 +1,219 @@ + + + + + BaseNode<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
        +
        + +

        QuickGraph

        +
        +
        +
        +
        + + + + +

        BaseNode<'TVertex, 'TEdge>

        +

        + Namespace: QuickGraph.Algorithms
        + Parent Module: ChromaticPolynomial +

        +
        +
        +

        Constructors

        + + + + + + + + + + +
        ConstructorDescription
        + + + new(...) + +
        + Signature: (graph:UndirectedGraph<'TVertex,'TEdge> * parent:BaseNode<'TVertex,'TEdge> option * verticesToPaintIfChild:'TVertex list) -> BaseNode<'TVertex,'TEdge>
        +
        +         		+ + + + + +

        CompiledName: .ctor

        +
        +

        Instance members

        + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
        Instance memberDescription
        + + + ChromaticPolinomial + +
        + Signature: int list
        + Modifiers: abstract
        +
        +         		+ + + + + +

        CompiledName: get_ChromaticPolinomial

        +
        + + + Graph + +
        + Signature: UndirectedGraph<'TVertex,'TEdge>
        +
        +         		+ + + + + +

        CompiledName: get_Graph

        +
        + + + IsVisited() + +
        + Signature: unit -> bool
        +
        +         		+ + + + + +

        CompiledName: set_IsVisited

        +
        + + + IsVisited() + +
        + Signature: unit -> unit
        +
        +         		+ + + + + +

        CompiledName: get_IsVisited

        +
        + + + Parent + +
        + Signature: BaseNode<'TVertex,'TEdge> option
        +
        +         		+ + + + + +

        CompiledName: get_Parent

        +
        + + + VerticesToPaintIfChild + +
        + Signature: 'TVertex list
        +
        +         		+ + + + + +

        CompiledName: get_VerticesToPaintIfChild

        +
        + +
        +
        + F# Project + +
        +
        +
        + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-chromaticpolynomial-leaf-2.html b/reference/quickgraph-algorithms-chromaticpolynomial-leaf-2.html new file mode 100644 index 000000000..0fc7e57f6 --- /dev/null +++ b/reference/quickgraph-algorithms-chromaticpolynomial-leaf-2.html @@ -0,0 +1,96 @@ + + + + + Leaf<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
        +
        + +

        QuickGraph

        +
        +
        +
        +
        + + + + +

        Leaf<'TVertex, 'TEdge>

        +

        + Namespace: QuickGraph.Algorithms
        + Parent Module: ChromaticPolynomial +

        +
        +
        +

        Constructors

        + + + + + + + + + + +
        ConstructorDescription
        + + + new(...) + +
        + Signature: (graph:UndirectedGraph<'TVertex,'TEdge> * parent:BaseNode<'TVertex,'TEdge> option * verticesToPaintIfChild:'TVertex list) -> Leaf<'TVertex,'TEdge>
        +
        +         		+ + + + + +

        CompiledName: .ctor

        +
        + +
        +
        + F# Project + +
        +
        +
        + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-chromaticpolynomial-node-2.html b/reference/quickgraph-algorithms-chromaticpolynomial-node-2.html new file mode 100644 index 000000000..20d1bfefa --- /dev/null +++ b/reference/quickgraph-algorithms-chromaticpolynomial-node-2.html @@ -0,0 +1,218 @@ + + + + + Node<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
        +
        + +

        QuickGraph

        +
        +
        +
        +
        + + + + +

        Node<'TVertex, 'TEdge>

        +

        + Namespace: QuickGraph.Algorithms
        + Parent Module: ChromaticPolynomial +

        +
        +
        +

        Constructors

        + + + + + + + + + + +
        ConstructorDescription
        + + + new(...) + +
        + Signature: (graph:UndirectedGraph<'TVertex,'TEdge> * parent:BaseNode<'TVertex,'TEdge> option * verticesToPaintIfChild:'TVertex list) -> Node<'TVertex,'TEdge>
        +
        +         		+ + + + + +

        CompiledName: .ctor

        +
        +

        Instance members

        + + + + + + + + + + + + + + + + + + + + + + + + + + + + + + +
        Instance memberDescription
        + + + LeftChild() + +
        + Signature: unit -> BaseNode<'TVertex,'TEdge>
        +
        +         		+ + + + + +

        CompiledName: set_LeftChild

        +
        + + + LeftChild() + +
        + Signature: unit -> unit
        +
        +         		+ + + + + +

        CompiledName: get_LeftChild

        +
        + + + RightChild() + +
        + Signature: unit -> BaseNode<'TVertex,'TEdge>
        +
        +         		+ + + + + +

        CompiledName: set_RightChild

        +
        + + + RightChild() + +
        + Signature: unit -> unit
        +
        +         		+ + + + + +

        CompiledName: get_RightChild

        +
        + + + VerticesToPaintIfParent() + +
        + Signature: unit -> 'TVertex list
        +
        +         		+ + + + + +

        CompiledName: set_VerticesToPaintIfParent

        +
        + + + VerticesToPaintIfParent() + +
        + Signature: unit -> unit
        +
        +         		+ + + + + +

        CompiledName: get_VerticesToPaintIfParent

        +
        + +
        +
        + F# Project + +
        +
        +
        + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-chromaticpolynomial.html b/reference/quickgraph-algorithms-chromaticpolynomial.html index 4d842effa..21f491b41 100644 --- a/reference/quickgraph-algorithms-chromaticpolynomial.html +++ b/reference/quickgraph-algorithms-chromaticpolynomial.html @@ -52,19 +52,19 @@

        Nested types and modules

        - BaseNode + BaseNode<'TVertex, 'TEdge> - Leaf + Leaf<'TVertex, 'TEdge> - Node + Node<'TVertex, 'TEdge> @@ -83,14 +83,14 @@

        Functions and values

        - buildTree graph + buildTree graph createEdge
        - Signature: graph:UndirectedGraph<obj,UndirectedEdge<obj>> -> BaseNode
        -
        + Signature: graph:UndirectedGraph<'Tvertex,'?8220> -> createEdge:Func<'Tvertex,'Tvertex,'?8220> -> BaseNode<'Tvertex,'?8220>
        + Type parameters: 'Tvertex, '?8220
        - + @@ -101,14 +101,86 @@

        Functions and values

        - findChromaticPolynomial graph + findChromaticPolynomial graph createEdge
        - Signature: graph:UndirectedGraph<obj,UndirectedEdge<obj>> -> int []
        -
        + Signature: graph:UndirectedGraph<'?8236,UndirectedEdge<'?8236>> -> createEdge:Func<'?8236,'?8236,UndirectedEdge<'?8236>> -> int []
        + Type parameters: '?8236
        - + + + + + + + + + + + + isFirstNode node + +
        + Signature: node:BaseNode<'?8228,'?8229> -> bool
        + Type parameters: '?8228, '?8229
        + + + + + + + + + + + + + + isLastNode node + +
        + Signature: node:BaseNode<'?8231,'?8232> -> bool
        + Type parameters: '?8231, '?8232
        + + + + + + + + + + + + + + next node + +
        + Signature: node:Node<'?8222,'?8223> -> BaseNode<'?8222,'?8223>
        + Type parameters: '?8222, '?8223
        + + + + + + + + + + + + + + prev node + +
        + Signature: node:Node<'?8225,'?8226> -> BaseNode<'?8225,'?8226>
        + Type parameters: '?8225, '?8226
        + + + diff --git a/reference/quickgraph-algorithms-cliques-maximumcliquealgorithmbase-2.html b/reference/quickgraph-algorithms-cliques-maximumcliquealgorithmbase-2.html index 420fb6a6f..f4408a412 100644 --- a/reference/quickgraph-algorithms-cliques-maximumcliquealgorithmbase-2.html +++ b/reference/quickgraph-algorithms-cliques-maximumcliquealgorithmbase-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(host, visitedGraph) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IUndirectedGraph<'TVertex,'TEdge>) -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:IUndirectedGraph<'TVertex,'TEdge> -> unit
        diff --git a/reference/quickgraph-algorithms-componentwithedges.html b/reference/quickgraph-algorithms-componentwithedges.html new file mode 100644 index 000000000..d0a1132e4 --- /dev/null +++ b/reference/quickgraph-algorithms-componentwithedges.html @@ -0,0 +1,68 @@ + + + + + ComponentWithEdges - QuickGraph + + + + + + + + + + + + + + + +
        +
        + +

        QuickGraph

        +
        +
        +
        +
        + + + + +

        ComponentWithEdges

        +

        + Namespace: QuickGraph.Algorithms
        +

        +
        +
        + +
        +
        + F# Project + +
        +
        +
        + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-condensation-condensationgraphalgorithm-3.html b/reference/quickgraph-algorithms-condensation-condensationgraphalgorithm-3.html index 6fb65d416..9d71c09b7 100644 --- a/reference/quickgraph-algorithms-condensation-condensationgraphalgorithm-3.html +++ b/reference/quickgraph-algorithms-condensation-condensationgraphalgorithm-3.html @@ -50,10 +50,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + CondensedGraph -
        +
        Signature: IMutableBidirectionalGraph<'TGraph,CondensedEdge<'TVertex,'TEdge,'TGraph>>
        @@ -86,10 +86,10 @@

        Instance members

        - + StronglyConnected() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-algorithms-condensation-condensededge-3.html b/reference/quickgraph-algorithms-condensation-condensededge-3.html index fee4b9491..9a31dfb0a 100644 --- a/reference/quickgraph-algorithms-condensation-condensededge-3.html +++ b/reference/quickgraph-algorithms-condensation-condensededge-3.html @@ -50,10 +50,10 @@

        Constructors

        - + new(source, target) -
        +
        Signature: (source:'TGraph * target:'TGraph) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Edges -
        +
        Signature: IList<'TEdge>
        diff --git a/reference/quickgraph-algorithms-condensation-edgemergecondensationgraphalgorithm-2.html b/reference/quickgraph-algorithms-condensation-edgemergecondensationgraphalgorithm-2.html index 5e056627c..eb82de087 100644 --- a/reference/quickgraph-algorithms-condensation-edgemergecondensationgraphalgorithm-2.html +++ b/reference/quickgraph-algorithms-condensation-edgemergecondensationgraphalgorithm-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> * condensatedGraph:IMutableBidirectionalGraph<'TVertex,MergedEdge<'TVertex,'TEdge>> * vertexPredicate:VertexPredicate<'TVertex>) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + CondensatedGraph -
        +
        Signature: IMutableBidirectionalGraph<'TVertex,MergedEdge<'TVertex,'TEdge>>
        @@ -86,10 +86,10 @@

        Instance members

        - + VertexPredicate -
        +
        Signature: VertexPredicate<'TVertex>
        diff --git a/reference/quickgraph-algorithms-condensation-mergededge-2.html b/reference/quickgraph-algorithms-condensation-mergededge-2.html index 9a2d4e175..0b0cae023 100644 --- a/reference/quickgraph-algorithms-condensation-mergededge-2.html +++ b/reference/quickgraph-algorithms-condensation-mergededge-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Edges -
        +
        Signature: IList<'TEdge>
        @@ -94,10 +94,10 @@

        Static members

        - + Merge(inEdge, outEdge) -
        +
        Signature: (inEdge:MergedEdge<'TVertex,'TEdge> * outEdge:MergedEdge<'TVertex,'TEdge>) -> MergedEdge<'TVertex,'TEdge>
        diff --git a/reference/quickgraph-algorithms-connectedcomponents-connectedcomponentsalgorithm-2.html b/reference/quickgraph-algorithms-connectedcomponents-connectedcomponentsalgorithm-2.html index ebfc162cc..02d358dfa 100644 --- a/reference/quickgraph-algorithms-connectedcomponents-connectedcomponentsalgorithm-2.html +++ b/reference/quickgraph-algorithms-connectedcomponents-connectedcomponentsalgorithm-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(g) -
        +
        Signature: g:IUndirectedGraph<'TVertex,'TEdge> -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(visitedGraph, components) -
        +
        Signature: (visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * components:IDictionary<'TVertex,int>) -> unit
        @@ -78,10 +78,10 @@

        Constructors

        - + new(host, visitedGraph, components) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * components:IDictionary<'TVertex,int>) -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + ComponentCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -115,10 +115,10 @@

        Instance members

        - + Components -
        +
        Signature: IDictionary<'TVertex,int>
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-connectedcomponents-incrementalconnectedcomponentsalgorithm-2.html b/reference/quickgraph-algorithms-connectedcomponents-incrementalconnectedcomponentsalgorithm-2.html index af7b40c72..5e9fb2a36 100644 --- a/reference/quickgraph-algorithms-connectedcomponents-incrementalconnectedcomponentsalgorithm-2.html +++ b/reference/quickgraph-algorithms-connectedcomponents-incrementalconnectedcomponentsalgorithm-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:IMutableVertexAndEdgeSet<'TVertex,'TEdge> -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(host, visitedGraph) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IMutableVertexAndEdgeSet<'TVertex,'TEdge>) -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + ComponentCount -
        +
        Signature: int
        @@ -100,10 +100,10 @@

        Instance members

        - + GetComponents() -
        +
        Signature: unit -> KeyValuePair<int,IDictionary<'TVertex,int>>
        diff --git a/reference/quickgraph-algorithms-connectedcomponents-stronglyconnectedcomponentsalgorithm-2.html b/reference/quickgraph-algorithms-connectedcomponents-stronglyconnectedcomponentsalgorithm-2.html index 3070c8f22..7b5e4e562 100644 --- a/reference/quickgraph-algorithms-connectedcomponents-stronglyconnectedcomponentsalgorithm-2.html +++ b/reference/quickgraph-algorithms-connectedcomponents-stronglyconnectedcomponentsalgorithm-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(g) -
        +
        Signature: g:IVertexListGraph<'TVertex,'TEdge> -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(g, components) -
        +
        Signature: (g:IVertexListGraph<'TVertex,'TEdge> * components:IDictionary<'TVertex,int>) -> unit
        @@ -78,10 +78,10 @@

        Constructors

        - + new(host, g, components) -
        +
        Signature: (host:IAlgorithmComponent * g:IVertexListGraph<'TVertex,'TEdge> * components:IDictionary<'TVertex,int>) -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + ComponentCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -115,10 +115,10 @@

        Instance members

        - + Components -
        +
        Signature: IDictionary<'TVertex,int>
        Modifiers: abstract
        @@ -130,10 +130,24 @@

        Instance members

        - + + DiffBySteps + +
        + Signature: List<int>
        +
        + + + + + + + + + DiscoverTimes -
        +
        Signature: IDictionary<'TVertex,int>
        @@ -144,15 +158,57 @@

        Instance members

        - + + Graphs + +
        + Signature: List<BidirectionalGraph<'TVertex,'TEdge>>
        +
        + + + + + + + + + Roots -
        +
        Signature: IDictionary<'TVertex,'TVertex>
        + + + + + + + Steps + +
        + Signature: int
        +
        + + + + + + + + + + Vertices + +
        + Signature: List<'TVertex>
        +
        + + + diff --git a/reference/quickgraph-algorithms-connectedcomponents-weaklyconnectedcomponentsalgorithm-2.html b/reference/quickgraph-algorithms-connectedcomponents-weaklyconnectedcomponentsalgorithm-2.html index 9b48c4624..245030375 100644 --- a/reference/quickgraph-algorithms-connectedcomponents-weaklyconnectedcomponentsalgorithm-2.html +++ b/reference/quickgraph-algorithms-connectedcomponents-weaklyconnectedcomponentsalgorithm-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:IVertexListGraph<'TVertex,'TEdge> -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(visitedGraph, components) -
        +
        Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * components:IDictionary<'TVertex,int>) -> unit
        @@ -78,10 +78,10 @@

        Constructors

        - + new(host, visitedGraph, components) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IVertexListGraph<'TVertex,'TEdge> * components:IDictionary<'TVertex,int>) -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + ComponentCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -115,16 +115,30 @@

        Instance members

        - + Components -
        +
        Signature: IDictionary<'TVertex,int>
        Modifiers: abstract
        + + + + + + + Graphs + +
        + Signature: List<BidirectionalGraph<'TVertex,'TEdge>>
        +
        + + + diff --git a/reference/quickgraph-algorithms-domaticpartition-2.html b/reference/quickgraph-algorithms-domaticpartition-2.html index 8444fac5d..959d34022 100644 --- a/reference/quickgraph-algorithms-domaticpartition-2.html +++ b/reference/quickgraph-algorithms-domaticpartition-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(graph) -
        +
        Signature: graph:UndirectedGraph<'Vertex,'Edge> -> DomaticPartition<'Vertex,'Edge>
        @@ -77,10 +77,10 @@

        Instance members

        - + GetMaxSizePartition() -
        +
        Signature: unit -> seq<seq<'Vertex>>
        @@ -95,10 +95,10 @@

        Instance members

        - + MinimalDominatingSets() -
        +
        Signature: unit -> Set<Set<'Vertex>>
        @@ -113,10 +113,10 @@

        Instance members

        - + MSCs(u sSrc) -
        +
        Signature: u:Set<'Vertex> -> sSrc:Set<Set<'Vertex>> -> Set<Set<Set<'Vertex>>>
        diff --git a/reference/quickgraph-algorithms-edgecoloringalgorithm-2.html b/reference/quickgraph-algorithms-edgecoloringalgorithm-2.html new file mode 100644 index 000000000..9c9d1c06e --- /dev/null +++ b/reference/quickgraph-algorithms-edgecoloringalgorithm-2.html @@ -0,0 +1,176 @@ + + + + + EdgeColoringAlgorithm<'Vertex, 'Edge> - QuickGraph + + + + + + + + + + + + + + + +
        +
        + +

        QuickGraph

        +
        +
        +
        +
        + + + + +

        EdgeColoringAlgorithm<'Vertex, 'Edge>

        +

        + Namespace: QuickGraph.Algorithms
        +

        +
        +
        +

        Constructors

        + + + + + + + + + + +
        ConstructorDescription
        + + + new() + +
        + Signature: unit -> EdgeColoringAlgorithm<'Vertex,'Edge>
        +
        +         		+ + + + + +

        CompiledName: .ctor

        +
        +

        Instance members

        + + + + + + + + + + + + + + + + + + + + + + +
        Instance memberDescription
        + + + add_Colored(arg1) + +
        + Signature: Handler<'Edge> -> unit
        +
        +         		+ + + + + +
        + + + Colored + +
        + Signature: IEvent<'Edge>
        +
        +         		+ + + + + +

        CompiledName: get_Colored

        +
        + + + Compute(graph) + +
        + Signature: graph:UndirectedGraph<'Vertex,'Edge> -> UndirectedGraph<'Vertex,'Edge>
        +
        +         		+ + + + + +
        + + + remove_Colored(arg1) + +
        + Signature: Handler<'Edge> -> unit
        +
        +         		+ + + + + +
        + +
        +
        + F# Project + +
        +
        +
        + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-euleriantrailalgorithm-2.html b/reference/quickgraph-algorithms-euleriantrailalgorithm-2.html index ef8a1c698..d05fc2ffd 100644 --- a/reference/quickgraph-algorithms-euleriantrailalgorithm-2.html +++ b/reference/quickgraph-algorithms-euleriantrailalgorithm-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:IMutableVertexAndEdgeListGraph<'TVertex,'TEdge> -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(host, visitedGraph) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IMutableVertexAndEdgeListGraph<'TVertex,'TEdge>) -> unit
        @@ -88,10 +88,10 @@

        Instance members

        - + AddTemporaryEdges(edgeFactory) -
        +
        Signature: edgeFactory:EdgeFactory<'TVertex,'TEdge> -> List<'TEdge>
        @@ -104,10 +104,10 @@

        Instance members

        - + Circuit -
        +
        Signature: List<'TEdge>
        @@ -118,10 +118,10 @@

        Instance members

        - + CircuitEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -132,10 +132,10 @@

        Instance members

        - + RemoveTemporaryEdges() -
        +
        Signature: unit -> unit
        @@ -148,10 +148,10 @@

        Instance members

        - + Trails() -
        +
        Signature: unit -> ICollection<ICollection<'TEdge>>
        @@ -164,10 +164,10 @@

        Instance members

        - + Trails(s) -
        +
        Signature: s:'TVertex -> ICollection<ICollection<'TEdge>>
        @@ -181,10 +181,10 @@

        Instance members

        - + TreeEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -196,10 +196,10 @@

        Instance members

        - + VisitEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -218,10 +218,10 @@

        Static members

        - + ComputeEulerianPathCount(g) -
        +
        Signature: g:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> int
        diff --git a/reference/quickgraph-algorithms-exploration-cloneablevertexgraphexploreralgorithm-2.html b/reference/quickgraph-algorithms-exploration-cloneablevertexgraphexploreralgorithm-2.html index a35bdd2e9..f054809a8 100644 --- a/reference/quickgraph-algorithms-exploration-cloneablevertexgraphexploreralgorithm-2.html +++ b/reference/quickgraph-algorithms-exploration-cloneablevertexgraphexploreralgorithm-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:IMutableVertexAndEdgeListGraph<'TVertex,'TEdge> -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(host, visitedGraph) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IMutableVertexAndEdgeSet<'TVertex,'TEdge>) -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + AddEdgePredicate() -
        +
        Signature: unit -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + AddVertexPredicate() -
        +
        Signature: unit -> unit
        @@ -114,10 +114,10 @@

        Instance members

        - + BackEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -128,10 +128,10 @@

        Instance members

        - + DiscoverVertex -
        +
        Signature: VertexAction<'TVertex>
        @@ -142,10 +142,10 @@

        Instance members

        - + EdgeSkipped -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -156,10 +156,10 @@

        Instance members

        - + ExploreVertexPredicate() -
        +
        Signature: unit -> unit
        @@ -170,10 +170,10 @@

        Instance members

        - + FinishedPredicate() -
        +
        Signature: unit -> unit
        @@ -184,10 +184,10 @@

        Instance members

        - + FinishedSuccessfully -
        +
        Signature: bool
        @@ -198,10 +198,10 @@

        Instance members

        - + TransitionFactories -
        +
        Signature: IList<ITransitionFactory<'TVertex,'TEdge>>
        @@ -212,10 +212,10 @@

        Instance members

        - + TreeEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -227,10 +227,10 @@

        Instance members

        - + UnexploredVertices -
        +
        Signature: IEnumerable<'TVertex>
        diff --git a/reference/quickgraph-algorithms-exploration-itransitionfactory-2.html b/reference/quickgraph-algorithms-exploration-itransitionfactory-2.html index 932b3a9e0..63bf081a6 100644 --- a/reference/quickgraph-algorithms-exploration-itransitionfactory-2.html +++ b/reference/quickgraph-algorithms-exploration-itransitionfactory-2.html @@ -50,10 +50,10 @@

        Instance members

        - + Apply(source) -
        +
        Signature: source:'TVertex -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -65,10 +65,10 @@

        Instance members

        - + IsValid(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-exploration-transitionfactoryimplicitgraph-2.html b/reference/quickgraph-algorithms-exploration-transitionfactoryimplicitgraph-2.html index 74ee49264..7bc81a282 100644 --- a/reference/quickgraph-algorithms-exploration-transitionfactoryimplicitgraph-2.html +++ b/reference/quickgraph-algorithms-exploration-transitionfactoryimplicitgraph-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + AllowParallelEdges -
        +
        Signature: bool
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + ContainsVertex(vertex) -
        +
        Signature: vertex:'TVertex -> bool
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + IsDirected -
        +
        Signature: bool
        Modifiers: abstract
        @@ -117,10 +117,10 @@

        Instance members

        - + IsOutEdgesEmpty(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -132,10 +132,10 @@

        Instance members

        - + OutDegree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -147,10 +147,10 @@

        Instance members

        - + OutEdge(v, index) -
        +
        Signature: (v:'TVertex * index:int) -> 'TEdge
        Modifiers: abstract
        @@ -162,10 +162,10 @@

        Instance members

        - + OutEdges(v) -
        +
        Signature: v:'TVertex -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -177,10 +177,10 @@

        Instance members

        - + SuccessorEdgePredicate() -
        +
        Signature: unit -> unit
        @@ -191,10 +191,10 @@

        Instance members

        - + SuccessorVertexPredicate() -
        +
        Signature: unit -> unit
        @@ -205,10 +205,10 @@

        Instance members

        - + TransitionFactories -
        +
        Signature: IList<ITransitionFactory<'TVertex,'TEdge>>
        @@ -219,10 +219,10 @@

        Instance members

        - + TryGetOutEdges(v, edges) -
        +
        Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-geneticconstants.html b/reference/quickgraph-algorithms-geneticconstants.html index bccd0a06c..907ed48cb 100644 --- a/reference/quickgraph-algorithms-geneticconstants.html +++ b/reference/quickgraph-algorithms-geneticconstants.html @@ -53,10 +53,10 @@

        Functions and values

        - + gMax -
        +
        Signature: int
        @@ -71,10 +71,10 @@

        Functions and values

        - + M -
        +
        Signature: int
        @@ -89,10 +89,10 @@

        Functions and values

        - + nCore -
        +
        Signature: int
        @@ -107,10 +107,10 @@

        Functions and values

        - + nDS -
        +
        Signature: int
        @@ -125,10 +125,10 @@

        Functions and values

        - + nl -
        +
        Signature: int
        @@ -143,10 +143,10 @@

        Functions and values

        - + pc -
        +
        Signature: float<MeasureOne>
        @@ -161,10 +161,10 @@

        Functions and values

        - + pm -
        +
        Signature: float<MeasureOne>
        diff --git a/reference/quickgraph-algorithms-graphcoloring-vertexcoloring-inputmodel-2.html b/reference/quickgraph-algorithms-graphcoloring-vertexcoloring-inputmodel-2.html index 6e346225b..760d8f024 100644 --- a/reference/quickgraph-algorithms-graphcoloring-vertexcoloring-inputmodel-2.html +++ b/reference/quickgraph-algorithms-graphcoloring-vertexcoloring-inputmodel-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Graph() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-algorithms-graphcoloring-vertexcoloring-outputmodel-2.html b/reference/quickgraph-algorithms-graphcoloring-vertexcoloring-outputmodel-2.html index 2295624a8..741fd9754 100644 --- a/reference/quickgraph-algorithms-graphcoloring-vertexcoloring-outputmodel-2.html +++ b/reference/quickgraph-algorithms-graphcoloring-vertexcoloring-outputmodel-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Colors() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-algorithms-graphcoloring-vertexcoloring-vertexcoloringalgorithm-2.html b/reference/quickgraph-algorithms-graphcoloring-vertexcoloring-vertexcoloringalgorithm-2.html index 3acfb4e13..c87332f45 100644 --- a/reference/quickgraph-algorithms-graphcoloring-vertexcoloring-vertexcoloringalgorithm-2.html +++ b/reference/quickgraph-algorithms-graphcoloring-vertexcoloring-vertexcoloringalgorithm-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(input) -
        +
        Signature: input:InputModel<'TVertex,'TEdge> -> unit
        @@ -72,10 +72,24 @@

        Instance members

        - + + ColourVertex + +
        + Signature: VertexAction<'TVertex>
        +
        + + + + + + + + + Compute() -
        +
        Signature: unit -> OutputModel<'TVertex,'TEdge>
        diff --git a/reference/quickgraph-algorithms-ialgorithm-1.html b/reference/quickgraph-algorithms-ialgorithm-1.html index 360d378c1..3f622eca6 100644 --- a/reference/quickgraph-algorithms-ialgorithm-1.html +++ b/reference/quickgraph-algorithms-ialgorithm-1.html @@ -50,10 +50,10 @@

        Instance members

        - + VisitedGraph -
        +
        Signature: 'TGraph
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-icomputation.html b/reference/quickgraph-algorithms-icomputation.html index 0dd0fff3c..830a0ee3c 100644 --- a/reference/quickgraph-algorithms-icomputation.html +++ b/reference/quickgraph-algorithms-icomputation.html @@ -50,10 +50,10 @@

        Instance members

        - + Abort() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -65,10 +65,10 @@

        Instance members

        - + Aborted -
        +
        Signature: IEvent<EventHandler,EventArgs>
        Modifiers: abstract
        @@ -80,10 +80,10 @@

        Instance members

        - + Compute() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -95,10 +95,10 @@

        Instance members

        - + Finished -
        +
        Signature: IEvent<EventHandler,EventArgs>
        Modifiers: abstract
        @@ -110,10 +110,10 @@

        Instance members

        - + Started -
        +
        Signature: IEvent<EventHandler,EventArgs>
        Modifiers: abstract
        @@ -125,10 +125,10 @@

        Instance members

        - + State -
        +
        Signature: ComputationState
        Modifiers: abstract
        @@ -140,10 +140,10 @@

        Instance members

        - + StateChanged -
        +
        Signature: IEvent<EventHandler,EventArgs>
        Modifiers: abstract
        @@ -155,10 +155,10 @@

        Instance members

        - + SyncRoot -
        +
        Signature: obj
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-iconnectedcomponentalgorithm-3.html b/reference/quickgraph-algorithms-iconnectedcomponentalgorithm-3.html index 9cd3c74c3..8e72cb133 100644 --- a/reference/quickgraph-algorithms-iconnectedcomponentalgorithm-3.html +++ b/reference/quickgraph-algorithms-iconnectedcomponentalgorithm-3.html @@ -50,10 +50,10 @@

        Instance members

        - + ComponentCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -65,10 +65,10 @@

        Instance members

        - + Components -
        +
        Signature: IDictionary<'TVertex,int>
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-idistancerecorderalgorithm-2.html b/reference/quickgraph-algorithms-idistancerecorderalgorithm-2.html index f1ba4e0af..dab55106b 100644 --- a/reference/quickgraph-algorithms-idistancerecorderalgorithm-2.html +++ b/reference/quickgraph-algorithms-idistancerecorderalgorithm-2.html @@ -52,10 +52,10 @@

        Instance members

        - + DiscoverVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -67,10 +67,10 @@

        Instance members

        - + InitializeVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-idistancerelaxer.html b/reference/quickgraph-algorithms-idistancerelaxer.html index 01e2d5c1d..04101ad01 100644 --- a/reference/quickgraph-algorithms-idistancerelaxer.html +++ b/reference/quickgraph-algorithms-idistancerelaxer.html @@ -50,10 +50,10 @@

        Instance members

        - + Combine(distance, weight) -
        +
        Signature: (distance:float * weight:float) -> float
        Modifiers: abstract
        @@ -65,10 +65,10 @@

        Instance members

        - + InitialDistance -
        +
        Signature: float
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-iedgecolorizeralgorithm-2.html b/reference/quickgraph-algorithms-iedgecolorizeralgorithm-2.html index 55518b9ca..c562e830b 100644 --- a/reference/quickgraph-algorithms-iedgecolorizeralgorithm-2.html +++ b/reference/quickgraph-algorithms-iedgecolorizeralgorithm-2.html @@ -50,10 +50,10 @@

        Instance members

        - + EdgeColors -
        +
        Signature: IDictionary<'TEdge,GraphColor>
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-iedgepredecessorrecorderalgorithm-2.html b/reference/quickgraph-algorithms-iedgepredecessorrecorderalgorithm-2.html index 32e5fcf32..d4bf78e69 100644 --- a/reference/quickgraph-algorithms-iedgepredecessorrecorderalgorithm-2.html +++ b/reference/quickgraph-algorithms-iedgepredecessorrecorderalgorithm-2.html @@ -50,10 +50,10 @@

        Instance members

        - + DiscoverTreeEdge -
        +
        Signature: EdgeEdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -65,10 +65,10 @@

        Instance members

        - + FinishEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-inducedpathalgorithm.html b/reference/quickgraph-algorithms-inducedpathalgorithm.html index f1df021cf..dea62e77b 100644 --- a/reference/quickgraph-algorithms-inducedpathalgorithm.html +++ b/reference/quickgraph-algorithms-inducedpathalgorithm.html @@ -53,12 +53,12 @@

        Functions and values

        - + findInducedPaths graph -
        - Signature: graph:UndirectedGraph<'?8044,IEdge<'?8044>> -> List<List<'?8044>>
        - Type parameters: '?8044
        +
        + Signature: graph:UndirectedGraph<'?8104,IEdge<'?8104>> -> List<List<'?8104>>
        + Type parameters: '?8104
        diff --git a/reference/quickgraph-algorithms-iseuleriangraphalgorithm-2.html b/reference/quickgraph-algorithms-iseuleriangraphalgorithm-2.html index 02c8fa936..111e28548 100644 --- a/reference/quickgraph-algorithms-iseuleriangraphalgorithm-2.html +++ b/reference/quickgraph-algorithms-iseuleriangraphalgorithm-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(graph) -
        +
        Signature: graph:UndirectedGraph<'TVertex,UndirectedEdge<'TVertex>> -> unit
        @@ -72,15 +72,43 @@

        Instance members

        - + + checkComponentsWithEdges() + +
        + Signature: unit -> ComponentWithEdges
        +
        + + + + + + + + + isEulerian() -
        +
        Signature: unit -> bool
        + + + + + + + satisfiesEulerianCondition(vertex) + +
        + Signature: vertex:'TVertex -> bool
        +
        + + + diff --git a/reference/quickgraph-algorithms-ishamiltoniangraphalgorithm-2.html b/reference/quickgraph-algorithms-ishamiltoniangraphalgorithm-2.html index 01657dbd9..8f81b399d 100644 --- a/reference/quickgraph-algorithms-ishamiltoniangraphalgorithm-2.html +++ b/reference/quickgraph-algorithms-ishamiltoniangraphalgorithm-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(graph) -
        +
        Signature: graph:UndirectedGraph<'TVertex,UndirectedEdge<'TVertex>> -> unit
        @@ -72,10 +72,24 @@

        Instance members

        - + + GetPermutations() + +
        + Signature: unit -> List<List<'TVertex>>
        +
        + + + + + + + + + IsHamiltonian() -
        +
        Signature: unit -> bool
        diff --git a/reference/quickgraph-algorithms-itreebuilderalgorithm-2.html b/reference/quickgraph-algorithms-itreebuilderalgorithm-2.html index 76d5d0aef..1301742dc 100644 --- a/reference/quickgraph-algorithms-itreebuilderalgorithm-2.html +++ b/reference/quickgraph-algorithms-itreebuilderalgorithm-2.html @@ -50,10 +50,10 @@

        Instance members

        - + TreeEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-iundirectedtreebuilderalgorithm-2.html b/reference/quickgraph-algorithms-iundirectedtreebuilderalgorithm-2.html index e92cbc00a..4e087f835 100644 --- a/reference/quickgraph-algorithms-iundirectedtreebuilderalgorithm-2.html +++ b/reference/quickgraph-algorithms-iundirectedtreebuilderalgorithm-2.html @@ -50,10 +50,10 @@

        Instance members

        - + TreeEdge -
        +
        Signature: IEvent<UndirectedEdgeAction<'TVertex,'TEdge>,UndirectedEdgeEventArgs<'TVertex,'TEdge>>
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-iundirectedvertexpredecessorrecorderalgorithm-2.html b/reference/quickgraph-algorithms-iundirectedvertexpredecessorrecorderalgorithm-2.html index 62e5d8902..f413310a9 100644 --- a/reference/quickgraph-algorithms-iundirectedvertexpredecessorrecorderalgorithm-2.html +++ b/reference/quickgraph-algorithms-iundirectedvertexpredecessorrecorderalgorithm-2.html @@ -50,10 +50,10 @@

        Instance members

        - + FinishVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -65,10 +65,10 @@

        Instance members

        - + StartVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-ivertexcolorizeralgorithm-2.html b/reference/quickgraph-algorithms-ivertexcolorizeralgorithm-2.html index 29a26f29a..60cb46c4c 100644 --- a/reference/quickgraph-algorithms-ivertexcolorizeralgorithm-2.html +++ b/reference/quickgraph-algorithms-ivertexcolorizeralgorithm-2.html @@ -50,10 +50,10 @@

        Instance members

        - + GetVertexColor(v) -
        +
        Signature: v:'TVertex -> GraphColor
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-ivertexpredecessorrecorderalgorithm-2.html b/reference/quickgraph-algorithms-ivertexpredecessorrecorderalgorithm-2.html index 73d79a9cf..f60f3dba7 100644 --- a/reference/quickgraph-algorithms-ivertexpredecessorrecorderalgorithm-2.html +++ b/reference/quickgraph-algorithms-ivertexpredecessorrecorderalgorithm-2.html @@ -50,10 +50,10 @@

        Instance members

        - + FinishVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -65,10 +65,10 @@

        Instance members

        - + StartVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-ivertextimestamperalgorithm-2.html b/reference/quickgraph-algorithms-ivertextimestamperalgorithm-2.html index 050f218b1..8e20fdcc5 100644 --- a/reference/quickgraph-algorithms-ivertextimestamperalgorithm-2.html +++ b/reference/quickgraph-algorithms-ivertextimestamperalgorithm-2.html @@ -50,10 +50,10 @@

        Instance members

        - + DiscoverVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -65,10 +65,10 @@

        Instance members

        - + FinishVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-kernighanlinalgoritm-kernighanlinalgoritm-2.html b/reference/quickgraph-algorithms-kernighanlinalgoritm-kernighanlinalgoritm-2.html index eb5d401f5..4d8eee9dc 100644 --- a/reference/quickgraph-algorithms-kernighanlinalgoritm-kernighanlinalgoritm-2.html +++ b/reference/quickgraph-algorithms-kernighanlinalgoritm-kernighanlinalgoritm-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(g, itersNum) -
        +
        Signature: (g:UndirectedGraph<'TVertex,'TEdge> * itersNum:int) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Execute() -
        +
        Signature: unit -> Partition<'TVertex>
        @@ -86,10 +86,10 @@

        Instance members

        - + getStartPartition() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-algorithms-kernighanlinalgoritm-partition-1.html b/reference/quickgraph-algorithms-kernighanlinalgoritm-partition-1.html index 1ce215951..741537a25 100644 --- a/reference/quickgraph-algorithms-kernighanlinalgoritm-partition-1.html +++ b/reference/quickgraph-algorithms-kernighanlinalgoritm-partition-1.html @@ -50,10 +50,10 @@

        Constructors

        - + new(A, B, cutCost) -
        +
        Signature: (A:SortedSet<'TVertex> * B:SortedSet<'TVertex> * cutCost:float) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + A() -
        +
        Signature: unit -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + B() -
        +
        Signature: unit -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + cutCost() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-algorithms-maxcardinality-2.html b/reference/quickgraph-algorithms-maxcardinality-2.html new file mode 100644 index 000000000..54b9d2234 --- /dev/null +++ b/reference/quickgraph-algorithms-maxcardinality-2.html @@ -0,0 +1,121 @@ + + + + + MaxCardinality<'Vertex, 'Edge> - QuickGraph + + + + + + + + + + + + + + + +
        +
        + +

        QuickGraph

        +
        +
        +
        +
        + + + + +

        MaxCardinality<'Vertex, 'Edge>

        +

        + Namespace: QuickGraph.Algorithms
        +

        +
        +
        +

        Constructors

        + + + + + + + + + + +
        ConstructorDescription
        + + + new(...) + +
        + Signature: (firstGraph:BidirectionalGraph<'Vertex,'Edge> * secondGraph:BidirectionalGraph<'Vertex,'Edge> * similarityMat:Dictionary<('Vertex * 'Vertex),double> * threshold:double * createEdge:Func<'Vertex,'Vertex,'Edge>) -> MaxCardinality<'Vertex,'Edge>
        +
        +         		+ + + + + +

        CompiledName: .ctor

        +
        +

        Instance members

        + + + + + + + + + + +
        Instance memberDescription
        + + + compMaxCardinality() + +
        + Signature: unit -> Set<'Vertex * 'Vertex>
        +
        +         		+ + + + + +
        + +
        +
        + F# Project + +
        +
        +
        + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-maximumbipartitematchingalgorithm-2.html b/reference/quickgraph-algorithms-maximumbipartitematchingalgorithm-2.html index d3c63d119..93b9ad00b 100644 --- a/reference/quickgraph-algorithms-maximumbipartitematchingalgorithm-2.html +++ b/reference/quickgraph-algorithms-maximumbipartitematchingalgorithm-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (visitedGraph:IMutableVertexAndEdgeListGraph<'TVertex,'TEdge> * vertexSetA:IEnumerable<'TVertex> * vertexSetB:IEnumerable<'TVertex> * vertexFactory:VertexFactory<'TVertex> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + EdgeFactory() -
        +
        Signature: unit -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + MatchedEdges() -
        +
        Signature: unit -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + VertexFactory() -
        +
        Signature: unit -> unit
        @@ -114,10 +114,10 @@

        Instance members

        - + VertexSetA() -
        +
        Signature: unit -> unit
        @@ -128,10 +128,10 @@

        Instance members

        - + VertexSetB() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-algorithms-maximumflow-allverticesgraphaugmentoralgorithm-2.html b/reference/quickgraph-algorithms-maximumflow-allverticesgraphaugmentoralgorithm-2.html index 622ab2ec0..ef49f4af7 100644 --- a/reference/quickgraph-algorithms-maximumflow-allverticesgraphaugmentoralgorithm-2.html +++ b/reference/quickgraph-algorithms-maximumflow-allverticesgraphaugmentoralgorithm-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (visitedGraph:IMutableVertexAndEdgeSet<'TVertex,'TEdge> * vertexFactory:VertexFactory<'TVertex> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IMutableVertexAndEdgeSet<'TVertex,'TEdge> * vertexFactory:VertexFactory<'TVertex> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
        diff --git a/reference/quickgraph-algorithms-maximumflow-edmondskarpmaximumflowalgorithm-2.html b/reference/quickgraph-algorithms-maximumflow-edmondskarpmaximumflowalgorithm-2.html index 668812e08..0d594ce6c 100644 --- a/reference/quickgraph-algorithms-maximumflow-edmondskarpmaximumflowalgorithm-2.html +++ b/reference/quickgraph-algorithms-maximumflow-edmondskarpmaximumflowalgorithm-2.html @@ -54,10 +54,10 @@

        Constructors

        - + new(g, capacities, edgeFactory) -
        +
        Signature: (g:IMutableVertexAndEdgeListGraph<'TVertex,'TEdge> * capacities:Func<'TEdge,float> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
        @@ -68,10 +68,10 @@

        Constructors

        - + new(host, g, capacities, edgeFactory) -
        +
        Signature: (host:IAlgorithmComponent * g:IMutableVertexAndEdgeListGraph<'TVertex,'TEdge> * capacities:Func<'TEdge,float> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
        diff --git a/reference/quickgraph-algorithms-maximumflow-graphaugmentoralgorithmbase-3.html b/reference/quickgraph-algorithms-maximumflow-graphaugmentoralgorithmbase-3.html index e8ca158e0..667bba50a 100644 --- a/reference/quickgraph-algorithms-maximumflow-graphaugmentoralgorithmbase-3.html +++ b/reference/quickgraph-algorithms-maximumflow-graphaugmentoralgorithmbase-3.html @@ -50,10 +50,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:'TGraph * vertexFactory:VertexFactory<'TVertex> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Augmented -
        +
        Signature: bool
        @@ -86,10 +86,10 @@

        Instance members

        - + AugmentedEdges -
        +
        Signature: ICollection<'TEdge>
        @@ -100,10 +100,10 @@

        Instance members

        - + Dispose() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -115,10 +115,10 @@

        Instance members

        - + EdgeAdded -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -129,10 +129,10 @@

        Instance members

        - + EdgeFactory -
        +
        Signature: EdgeFactory<'TVertex,'TEdge>
        @@ -143,10 +143,10 @@

        Instance members

        - + Rollback() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -158,10 +158,10 @@

        Instance members

        - + SuperSink -
        +
        Signature: 'TVertex
        @@ -172,10 +172,10 @@

        Instance members

        - + SuperSinkAdded -
        +
        Signature: VertexAction<'TVertex>
        @@ -186,10 +186,10 @@

        Instance members

        - + SuperSource -
        +
        Signature: 'TVertex
        @@ -200,10 +200,10 @@

        Instance members

        - + SuperSourceAdded -
        +
        Signature: VertexAction<'TVertex>
        @@ -214,10 +214,10 @@

        Instance members

        - + VertexFactory -
        +
        Signature: VertexFactory<'TVertex>
        diff --git a/reference/quickgraph-algorithms-maximumflow-graphbalanceralgorithm-2.html b/reference/quickgraph-algorithms-maximumflow-graphbalanceralgorithm-2.html index ae73c2bcb..923499c90 100644 --- a/reference/quickgraph-algorithms-maximumflow-graphbalanceralgorithm-2.html +++ b/reference/quickgraph-algorithms-maximumflow-graphbalanceralgorithm-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (visitedGraph:IMutableBidirectionalGraph<'TVertex,'TEdge> * source:'TVertex * sink:'TVertex * vertexFactory:VertexFactory<'TVertex> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (visitedGraph:IMutableBidirectionalGraph<'TVertex,'TEdge> * vertexFactory:VertexFactory<'TVertex> * edgeFactory:EdgeFactory<'TVertex,'TEdge> * source:'TVertex * sink:'TVertex * capacities:IDictionary<'TEdge,float>) -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + Balance() -
        +
        Signature: unit -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + Balanced -
        +
        Signature: bool
        @@ -114,10 +114,10 @@

        Instance members

        - + BalancingSink -
        +
        Signature: 'TVertex
        @@ -128,10 +128,10 @@

        Instance members

        - + BalancingSinkAdded -
        +
        Signature: VertexAction<'TVertex>
        @@ -142,10 +142,10 @@

        Instance members

        - + BalancingSinkEdge -
        +
        Signature: 'TEdge
        @@ -156,10 +156,10 @@

        Instance members

        - + BalancingSource -
        +
        Signature: 'TVertex
        @@ -170,10 +170,10 @@

        Instance members

        - + BalancingSourceAdded -
        +
        Signature: VertexAction<'TVertex>
        @@ -184,10 +184,10 @@

        Instance members

        - + BalancingSourceEdge -
        +
        Signature: 'TEdge
        @@ -198,10 +198,10 @@

        Instance members

        - + Capacities -
        +
        Signature: IDictionary<'TEdge,float>
        @@ -212,10 +212,10 @@

        Instance members

        - + DeficientEdges -
        +
        Signature: ICollection<'TEdge>
        @@ -226,10 +226,10 @@

        Instance members

        - + DeficientVertexAdded -
        +
        Signature: VertexAction<'TVertex>
        @@ -240,10 +240,10 @@

        Instance members

        - + DeficientVertices -
        +
        Signature: ICollection<'TVertex>
        @@ -254,10 +254,10 @@

        Instance members

        - + EdgeAdded -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -268,10 +268,10 @@

        Instance members

        - + EdgeFactory -
        +
        Signature: EdgeFactory<'TVertex,'TEdge>
        @@ -282,10 +282,10 @@

        Instance members

        - + GetBalancingIndex(v) -
        +
        Signature: v:'TVertex -> int
        @@ -296,10 +296,10 @@

        Instance members

        - + Sink -
        +
        Signature: 'TVertex
        @@ -310,10 +310,10 @@

        Instance members

        - + Source -
        +
        Signature: 'TVertex
        @@ -324,10 +324,10 @@

        Instance members

        - + SurplusEdges -
        +
        Signature: ICollection<'TEdge>
        @@ -338,10 +338,10 @@

        Instance members

        - + SurplusVertexAdded -
        +
        Signature: VertexAction<'TVertex>
        @@ -352,10 +352,10 @@

        Instance members

        - + SurplusVertices -
        +
        Signature: ICollection<'TVertex>
        @@ -366,10 +366,10 @@

        Instance members

        - + UnBalance() -
        +
        Signature: unit -> unit
        @@ -380,10 +380,10 @@

        Instance members

        - + VertexFactory -
        +
        Signature: VertexFactory<'TVertex>
        @@ -394,10 +394,10 @@

        Instance members

        - + VisitedGraph -
        +
        Signature: IMutableBidirectionalGraph<'TVertex,'TEdge>
        diff --git a/reference/quickgraph-algorithms-maximumflow-maximumflowalgorithm-2.html b/reference/quickgraph-algorithms-maximumflow-maximumflowalgorithm-2.html index 6cab24535..02e960aa6 100644 --- a/reference/quickgraph-algorithms-maximumflow-maximumflowalgorithm-2.html +++ b/reference/quickgraph-algorithms-maximumflow-maximumflowalgorithm-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IMutableVertexAndEdgeListGraph<'TVertex,'TEdge> * capacities:Func<'TEdge,float> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
        @@ -74,10 +74,10 @@

        Instance members

        - + Capacities() -
        +
        Signature: unit -> unit
        @@ -88,10 +88,10 @@

        Instance members

        - + Compute(source, sink) -
        +
        Signature: (source:'TVertex * sink:'TVertex) -> float
        @@ -102,10 +102,10 @@

        Instance members

        - + EdgeFactory() -
        +
        Signature: unit -> unit
        @@ -116,10 +116,10 @@

        Instance members

        - + GetVertexColor(vertex) -
        +
        Signature: vertex:'TVertex -> GraphColor
        Modifiers: abstract
        @@ -131,10 +131,10 @@

        Instance members

        - + MaxFlow() -
        +
        Signature: unit -> unit
        @@ -145,10 +145,10 @@

        Instance members

        - + Predecessors() -
        +
        Signature: unit -> unit
        @@ -159,10 +159,10 @@

        Instance members

        - + ResidualCapacities() -
        +
        Signature: unit -> unit
        @@ -173,10 +173,10 @@

        Instance members

        - + ReversedEdges() -
        +
        Signature: unit -> unit
        @@ -187,10 +187,10 @@

        Instance members

        - + Sink() -
        +
        Signature: unit -> unit
        @@ -201,10 +201,10 @@

        Instance members

        - + Source() -
        +
        Signature: unit -> unit
        @@ -215,10 +215,10 @@

        Instance members

        - + VertexColors() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-algorithms-maximumflow-multisourcesinkgraphaugmentoralgorithm-2.html b/reference/quickgraph-algorithms-maximumflow-multisourcesinkgraphaugmentoralgorithm-2.html index cbed2326f..17c5a410c 100644 --- a/reference/quickgraph-algorithms-maximumflow-multisourcesinkgraphaugmentoralgorithm-2.html +++ b/reference/quickgraph-algorithms-maximumflow-multisourcesinkgraphaugmentoralgorithm-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (visitedGraph:IMutableBidirectionalGraph<'TVertex,'TEdge> * vertexFactory:VertexFactory<'TVertex> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IMutableBidirectionalGraph<'TVertex,'TEdge> * vertexFactory:VertexFactory<'TVertex> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
        diff --git a/reference/quickgraph-algorithms-maximumflow-reversededgeaugmentoralgorithm-2.html b/reference/quickgraph-algorithms-maximumflow-reversededgeaugmentoralgorithm-2.html index 4408ee05a..224921f18 100644 --- a/reference/quickgraph-algorithms-maximumflow-reversededgeaugmentoralgorithm-2.html +++ b/reference/quickgraph-algorithms-maximumflow-reversededgeaugmentoralgorithm-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(visitedGraph, edgeFactory) -
        +
        Signature: (visitedGraph:IMutableVertexAndEdgeListGraph<'TVertex,'TEdge> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(host, visitedGraph, edgeFactory) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IMutableVertexAndEdgeListGraph<'TVertex,'TEdge> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + AddReversedEdges() -
        +
        Signature: unit -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + Augmented -
        +
        Signature: bool
        @@ -114,10 +114,10 @@

        Instance members

        - + AugmentedEdges -
        +
        Signature: ICollection<'TEdge>
        @@ -128,10 +128,10 @@

        Instance members

        - + EdgeFactory -
        +
        Signature: EdgeFactory<'TVertex,'TEdge>
        @@ -142,10 +142,10 @@

        Instance members

        - + RemoveReversedEdges() -
        +
        Signature: unit -> unit
        @@ -156,10 +156,10 @@

        Instance members

        - + ReversedEdgeAdded -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -170,10 +170,10 @@

        Instance members

        - + ReversedEdges -
        +
        Signature: Dictionary<'TEdge,'TEdge>
        @@ -184,10 +184,10 @@

        Instance members

        - + VisitedGraph -
        +
        Signature: IMutableVertexAndEdgeListGraph<'TVertex,'TEdge>
        diff --git a/reference/quickgraph-algorithms-maximumindependentsetalgorithm.html b/reference/quickgraph-algorithms-maximumindependentsetalgorithm.html index ed504eef3..39819a246 100644 --- a/reference/quickgraph-algorithms-maximumindependentsetalgorithm.html +++ b/reference/quickgraph-algorithms-maximumindependentsetalgorithm.html @@ -50,10 +50,10 @@

        Static members

        - + Compute(graph) -
        +
        Signature: graph:UndirectedGraph<int,Edge<int>> -> seq<int>
        @@ -68,10 +68,10 @@

        Static members

        - + Compute(vertices, edges) -
        +
        Signature: (vertices:int list * edges:Edge<int> list) -> seq<int>
        diff --git a/reference/quickgraph-algorithms-minimumdominatingsetgeneticalgorithm.html b/reference/quickgraph-algorithms-minimumdominatingsetgeneticalgorithm.html index f756943da..4960835d3 100644 --- a/reference/quickgraph-algorithms-minimumdominatingsetgeneticalgorithm.html +++ b/reference/quickgraph-algorithms-minimumdominatingsetgeneticalgorithm.html @@ -50,10 +50,10 @@

        Constructors

        - + new(graph) -
        +
        Signature: graph:IUndirectedGraph<int,IUndirectedEdge<int>> -> MinimumDominatingSetGeneticAlgorithm
        @@ -77,10 +77,10 @@

        Instance members

        - + Compute() -
        +
        Signature: unit -> Chromosome
        diff --git a/reference/quickgraph-algorithms-minimumspanningtree-kruskalminimumspanningtreealgorithm-2.html b/reference/quickgraph-algorithms-minimumspanningtree-kruskalminimumspanningtreealgorithm-2.html index 52207a7ed..70dfe86b0 100644 --- a/reference/quickgraph-algorithms-minimumspanningtree-kruskalminimumspanningtreealgorithm-2.html +++ b/reference/quickgraph-algorithms-minimumspanningtree-kruskalminimumspanningtreealgorithm-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(visitedGraph, edgeWeights) -
        +
        Signature: (visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * edgeWeights:Func<'TEdge,float>) -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(host, visitedGraph, edgeWeights) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * edgeWeights:Func<'TEdge,float>) -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + ExamineEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -100,10 +100,10 @@

        Instance members

        - + TreeEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-minimumspanningtree-primminimumspanningtreealgorithm-2.html b/reference/quickgraph-algorithms-minimumspanningtree-primminimumspanningtreealgorithm-2.html index dc16c703d..405a36f2f 100644 --- a/reference/quickgraph-algorithms-minimumspanningtree-primminimumspanningtreealgorithm-2.html +++ b/reference/quickgraph-algorithms-minimumspanningtree-primminimumspanningtreealgorithm-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(visitedGraph, edgeWeights) -
        +
        Signature: (visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * edgeWeights:Func<'TEdge,float>) -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(host, visitedGraph, edgeWeights) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * edgeWeights:Func<'TEdge,float>) -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + ExamineEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -100,10 +100,10 @@

        Instance members

        - + TreeEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-observers-edgepredecessorrecorderobserver-2.html b/reference/quickgraph-algorithms-observers-edgepredecessorrecorderobserver-2.html index 673436e51..27e95b0e8 100644 --- a/reference/quickgraph-algorithms-observers-edgepredecessorrecorderobserver-2.html +++ b/reference/quickgraph-algorithms-observers-edgepredecessorrecorderobserver-2.html @@ -51,10 +51,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -65,10 +65,10 @@

        Constructors

        - + new(edgePredecessors, endPathEdges) -
        +
        Signature: (edgePredecessors:IDictionary<'TEdge,'TEdge> * endPathEdges:IList<'TEdge>) -> unit
        @@ -87,10 +87,10 @@

        Instance members

        - + AllMergedPaths() -
        +
        Signature: unit -> ICollection<ICollection<'TEdge>>
        @@ -101,10 +101,10 @@

        Instance members

        - + AllPaths() -
        +
        Signature: unit -> ICollection<ICollection<'TEdge>>
        @@ -115,10 +115,10 @@

        Instance members

        - + Attach(algorithm) -
        +
        Signature: algorithm:IEdgePredecessorRecorderAlgorithm<'TVertex,'TEdge> -> IDisposable
        Modifiers: abstract
        @@ -130,10 +130,10 @@

        Instance members

        - + EdgePredecessors -
        +
        Signature: IDictionary<'TEdge,'TEdge>
        @@ -144,10 +144,10 @@

        Instance members

        - + EndPathEdges -
        +
        Signature: IList<'TEdge>
        @@ -158,10 +158,10 @@

        Instance members

        - + MergedPath(se, colors) -
        +
        Signature: (se:'TEdge * colors:IDictionary<'TEdge,GraphColor>) -> ICollection<'TEdge>
        @@ -172,10 +172,10 @@

        Instance members

        - + Path(se) -
        +
        Signature: se:'TEdge -> ICollection<'TEdge>
        diff --git a/reference/quickgraph-algorithms-observers-edgerecorderobserver-2.html b/reference/quickgraph-algorithms-observers-edgerecorderobserver-2.html index 648780c73..ffd7bfb93 100644 --- a/reference/quickgraph-algorithms-observers-edgerecorderobserver-2.html +++ b/reference/quickgraph-algorithms-observers-edgerecorderobserver-2.html @@ -51,10 +51,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -65,10 +65,10 @@

        Constructors

        - + new(edges) -
        +
        Signature: edges:IList<'TEdge> -> unit
        @@ -87,10 +87,10 @@

        Instance members

        - + Attach(algorithm) -
        +
        Signature: algorithm:ITreeBuilderAlgorithm<'TVertex,'TEdge> -> IDisposable
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + Edges -
        +
        Signature: IList<'TEdge>
        diff --git a/reference/quickgraph-algorithms-observers-iobserver-1.html b/reference/quickgraph-algorithms-observers-iobserver-1.html index 7c26612ca..a655e3c7f 100644 --- a/reference/quickgraph-algorithms-observers-iobserver-1.html +++ b/reference/quickgraph-algorithms-observers-iobserver-1.html @@ -52,10 +52,10 @@

        Instance members

        - + Attach(algorithm) -
        +
        Signature: algorithm:'TAlgorithm -> IDisposable
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-observers-undirectedvertexdistancerecorderobserver-2.html b/reference/quickgraph-algorithms-observers-undirectedvertexdistancerecorderobserver-2.html index e2c9db93d..bec7c952b 100644 --- a/reference/quickgraph-algorithms-observers-undirectedvertexdistancerecorderobserver-2.html +++ b/reference/quickgraph-algorithms-observers-undirectedvertexdistancerecorderobserver-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(edgeWeights) -
        +
        Signature: edgeWeights:Func<'TEdge,float> -> unit
        @@ -66,10 +66,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (edgeWeights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer * distances:IDictionary<'TVertex,float>) -> unit
        @@ -88,10 +88,10 @@

        Instance members

        - + Attach(algorithm) -
        +
        Signature: algorithm:IUndirectedTreeBuilderAlgorithm<'TVertex,'TEdge> -> IDisposable
        Modifiers: abstract
        @@ -103,10 +103,10 @@

        Instance members

        - + DistanceRelaxer -
        +
        Signature: IDistanceRelaxer
        @@ -117,10 +117,10 @@

        Instance members

        - + Distances -
        +
        Signature: IDictionary<'TVertex,float>
        @@ -131,10 +131,10 @@

        Instance members

        - + EdgeWeights -
        +
        Signature: Func<'TEdge,float>
        diff --git a/reference/quickgraph-algorithms-observers-undirectedvertexpredecessorrecorderobserver-2.html b/reference/quickgraph-algorithms-observers-undirectedvertexpredecessorrecorderobserver-2.html index ab91da2b1..fb92586c7 100644 --- a/reference/quickgraph-algorithms-observers-undirectedvertexpredecessorrecorderobserver-2.html +++ b/reference/quickgraph-algorithms-observers-undirectedvertexpredecessorrecorderobserver-2.html @@ -51,10 +51,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -65,10 +65,10 @@

        Constructors

        - + new(vertexPredecessors) -
        +
        Signature: vertexPredecessors:IDictionary<'TVertex,'TEdge> -> unit
        @@ -87,10 +87,10 @@

        Instance members

        - + Attach(algorithm) -
        +
        Signature: algorithm:IUndirectedTreeBuilderAlgorithm<'TVertex,'TEdge> -> IDisposable
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + TryGetPath(vertex, path) -
        +
        Signature: (vertex:'TVertex * path:byref<IEnumerable<'TEdge>>) -> bool
        @@ -116,10 +116,10 @@

        Instance members

        - + VertexPredecessors -
        +
        Signature: IDictionary<'TVertex,'TEdge>
        diff --git a/reference/quickgraph-algorithms-observers-vertexdistancerecorderobserver-2.html b/reference/quickgraph-algorithms-observers-vertexdistancerecorderobserver-2.html index 7d0c8bdb8..f22c6296e 100644 --- a/reference/quickgraph-algorithms-observers-vertexdistancerecorderobserver-2.html +++ b/reference/quickgraph-algorithms-observers-vertexdistancerecorderobserver-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(edgeWeights) -
        +
        Signature: edgeWeights:Func<'TEdge,float> -> unit
        @@ -66,10 +66,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (edgeWeights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer * distances:IDictionary<'TVertex,float>) -> unit
        @@ -88,10 +88,10 @@

        Instance members

        - + Attach(algorithm) -
        +
        Signature: algorithm:ITreeBuilderAlgorithm<'TVertex,'TEdge> -> IDisposable
        Modifiers: abstract
        @@ -103,10 +103,10 @@

        Instance members

        - + DistanceRelaxer -
        +
        Signature: IDistanceRelaxer
        @@ -117,10 +117,10 @@

        Instance members

        - + Distances -
        +
        Signature: IDictionary<'TVertex,float>
        @@ -131,10 +131,10 @@

        Instance members

        - + EdgeWeights -
        +
        Signature: Func<'TEdge,float>
        diff --git a/reference/quickgraph-algorithms-observers-vertexpredecessorpathrecorderobserver-2.html b/reference/quickgraph-algorithms-observers-vertexpredecessorpathrecorderobserver-2.html index c72924ff6..1fa3c3a63 100644 --- a/reference/quickgraph-algorithms-observers-vertexpredecessorpathrecorderobserver-2.html +++ b/reference/quickgraph-algorithms-observers-vertexpredecessorpathrecorderobserver-2.html @@ -51,10 +51,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -65,10 +65,10 @@

        Constructors

        - + new(vertexPredecessors) -
        +
        Signature: vertexPredecessors:IDictionary<'TVertex,'TEdge> -> unit
        @@ -87,10 +87,10 @@

        Instance members

        - + AllPaths() -
        +
        Signature: unit -> IEnumerable<IEnumerable<'TEdge>>
        @@ -101,10 +101,10 @@

        Instance members

        - + Attach(algorithm) -
        +
        Signature: algorithm:IVertexPredecessorRecorderAlgorithm<'TVertex,'TEdge> -> IDisposable
        Modifiers: abstract
        @@ -116,10 +116,10 @@

        Instance members

        - + EndPathVertices -
        +
        Signature: ICollection<'TVertex>
        @@ -130,10 +130,10 @@

        Instance members

        - + VertexPredecessors -
        +
        Signature: IDictionary<'TVertex,'TEdge>
        diff --git a/reference/quickgraph-algorithms-observers-vertexpredecessorrecorderobserver-2.html b/reference/quickgraph-algorithms-observers-vertexpredecessorrecorderobserver-2.html index d008f0cf8..448903033 100644 --- a/reference/quickgraph-algorithms-observers-vertexpredecessorrecorderobserver-2.html +++ b/reference/quickgraph-algorithms-observers-vertexpredecessorrecorderobserver-2.html @@ -51,10 +51,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -65,10 +65,10 @@

        Constructors

        - + new(vertexPredecessors) -
        +
        Signature: vertexPredecessors:Dictionary<'TVertex,'TEdge> -> unit
        @@ -87,10 +87,10 @@

        Instance members

        - + Attach(algorithm) -
        +
        Signature: algorithm:ITreeBuilderAlgorithm<'TVertex,'TEdge> -> IDisposable
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + TryGetPath(vertex, path) -
        +
        Signature: (vertex:'TVertex * path:byref<IEnumerable<'TEdge>>) -> bool
        @@ -116,10 +116,10 @@

        Instance members

        - + VertexPredecessors -
        +
        Signature: IDictionary<'TVertex,'TEdge>
        diff --git a/reference/quickgraph-algorithms-observers-vertexrecorderobserver-2.html b/reference/quickgraph-algorithms-observers-vertexrecorderobserver-2.html index 3f43761c4..a29566d75 100644 --- a/reference/quickgraph-algorithms-observers-vertexrecorderobserver-2.html +++ b/reference/quickgraph-algorithms-observers-vertexrecorderobserver-2.html @@ -51,10 +51,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -65,10 +65,10 @@

        Constructors

        - + new(vertices) -
        +
        Signature: vertices:IList<'TVertex> -> unit
        @@ -87,10 +87,10 @@

        Instance members

        - + Attach(algorithm) -
        +
        Signature: algorithm:IVertexTimeStamperAlgorithm<'TVertex,'TEdge> -> IDisposable
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + Vertices -
        +
        Signature: IEnumerable<'TVertex>
        diff --git a/reference/quickgraph-algorithms-observers-vertextimestamperobserver-2.html b/reference/quickgraph-algorithms-observers-vertextimestamperobserver-2.html index bd8f83a03..d7c562fc7 100644 --- a/reference/quickgraph-algorithms-observers-vertextimestamperobserver-2.html +++ b/reference/quickgraph-algorithms-observers-vertextimestamperobserver-2.html @@ -51,10 +51,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -65,10 +65,10 @@

        Constructors

        - + new(discoverTimes) -
        +
        Signature: discoverTimes:Dictionary<'TVertex,int> -> unit
        @@ -79,10 +79,10 @@

        Constructors

        - + new(discoverTimes, finishTimes) -
        +
        Signature: (discoverTimes:Dictionary<'TVertex,int> * finishTimes:Dictionary<'TVertex,int>) -> unit
        @@ -101,10 +101,10 @@

        Instance members

        - + Attach(algorithm) -
        +
        Signature: algorithm:IVertexTimeStamperAlgorithm<'TVertex,'TEdge> -> IDisposable
        Modifiers: abstract
        @@ -116,10 +116,10 @@

        Instance members

        - + DiscoverTimes -
        +
        Signature: IDictionary<'TVertex,int>
        @@ -130,10 +130,10 @@

        Instance members

        - + FinishTimes -
        +
        Signature: IDictionary<'TVertex,int>
        diff --git a/reference/quickgraph-algorithms-randomgraphfactory.html b/reference/quickgraph-algorithms-randomgraphfactory.html index 444cec768..0292ef76d 100644 --- a/reference/quickgraph-algorithms-randomgraphfactory.html +++ b/reference/quickgraph-algorithms-randomgraphfactory.html @@ -50,10 +50,10 @@

        Static members

        - + Create(...) -
        +
        Signature: (g:IMutableVertexAndEdgeListGraph<'TVertex,'TEdge> * vertexFactory:VertexFactory<'TVertex> * edgeFactory:EdgeFactory<'TVertex,'TEdge> * rnd:Random * vertexCount:int * edgeCount:int * selfEdges:bool) -> unit
        Type parameters: 'TVertex, 'TEdge
        @@ -64,10 +64,10 @@

        Static members

        - + Create(...) -
        +
        Signature: (g:IMutableUndirectedGraph<'TVertex,'TEdge> * vertexFactory:VertexFactory<'TVertex> * edgeFactory:EdgeFactory<'TVertex,'TEdge> * rnd:Random * vertexCount:int * edgeCount:int * selfEdges:bool) -> unit
        Type parameters: 'TVertex, 'TEdge
        @@ -78,10 +78,10 @@

        Static members

        - + GetEdge(g, rnd) -
        +
        Signature: (g:IEdgeSet<'TVertex,'TEdge> * rnd:Random) -> 'TEdge
        Type parameters: 'TVertex, 'TEdge
        @@ -92,10 +92,10 @@

        Static members

        - + GetEdge(edges, count, rnd) -
        +
        Signature: (edges:IEnumerable<'TEdge> * count:int * rnd:Random) -> 'TEdge
        Type parameters: 'TVertex, 'TEdge
        @@ -106,10 +106,10 @@

        Static members

        - + GetVertex(g, rnd) -
        +
        Signature: (g:IVertexListGraph<'TVertex,'TEdge> * rnd:Random) -> 'TVertex
        Type parameters: 'TVertex, 'TEdge
        @@ -120,10 +120,10 @@

        Static members

        - + GetVertex(vertices, count, rnd) -
        +
        Signature: (vertices:IEnumerable<'TVertex> * count:int * rnd:Random) -> 'TVertex
        Type parameters: 'TVertex, 'TEdge
        diff --git a/reference/quickgraph-algorithms-randomwalks-cyclepoppingrandomtreealgorithm-2.html b/reference/quickgraph-algorithms-randomwalks-cyclepoppingrandomtreealgorithm-2.html index 7acbac88b..447a85d4d 100644 --- a/reference/quickgraph-algorithms-randomwalks-cyclepoppingrandomtreealgorithm-2.html +++ b/reference/quickgraph-algorithms-randomwalks-cyclepoppingrandomtreealgorithm-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:IVertexListGraph<'TVertex,'TEdge> -> unit
        @@ -66,10 +66,10 @@

        Constructors

        - + new(visitedGraph, edgeChain) -
        +
        Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * edgeChain:IMarkovEdgeChain<'TVertex,'TEdge>) -> unit
        @@ -80,10 +80,10 @@

        Constructors

        - + new(host, visitedGraph, edgeChain) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IVertexListGraph<'TVertex,'TEdge> * edgeChain:IMarkovEdgeChain<'TVertex,'TEdge>) -> unit
        @@ -102,10 +102,10 @@

        Instance members

        - + ClearTreeVertex -
        +
        Signature: VertexAction<'TVertex>
        @@ -116,10 +116,10 @@

        Instance members

        - + EdgeChain -
        +
        Signature: IMarkovEdgeChain<'TVertex,'TEdge>
        @@ -130,10 +130,10 @@

        Instance members

        - + FinishVertex -
        +
        Signature: VertexAction<'TVertex>
        @@ -144,10 +144,10 @@

        Instance members

        - + GetVertexColor(v) -
        +
        Signature: v:'TVertex -> GraphColor
        Modifiers: abstract
        @@ -159,10 +159,10 @@

        Instance members

        - + InitializeVertex -
        +
        Signature: VertexAction<'TVertex>
        @@ -173,10 +173,10 @@

        Instance members

        - + RandomTree() -
        +
        Signature: unit -> unit
        @@ -187,10 +187,10 @@

        Instance members

        - + RandomTreeWithRoot(root) -
        +
        Signature: root:'TVertex -> unit
        @@ -201,10 +201,10 @@

        Instance members

        - + Rnd() -
        +
        Signature: unit -> unit
        @@ -217,10 +217,10 @@

        Instance members

        - + Successors -
        +
        Signature: IDictionary<'TVertex,'TEdge>
        @@ -231,10 +231,10 @@

        Instance members

        - + TreeEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -246,10 +246,10 @@

        Instance members

        - + VertexColors -
        +
        Signature: IDictionary<'TVertex,GraphColor>
        diff --git a/reference/quickgraph-algorithms-randomwalks-iedgechain-2.html b/reference/quickgraph-algorithms-randomwalks-iedgechain-2.html index da873f294..b010d998a 100644 --- a/reference/quickgraph-algorithms-randomwalks-iedgechain-2.html +++ b/reference/quickgraph-algorithms-randomwalks-iedgechain-2.html @@ -50,10 +50,10 @@

        Instance members

        - + TryGetSuccessor(g, u, successor) -
        +
        Signature: (g:IImplicitGraph<'TVertex,'TEdge> * u:'TVertex * successor:byref<'TEdge>) -> bool
        Modifiers: abstract
        @@ -65,10 +65,10 @@

        Instance members

        - + TryGetSuccessor(edges, u, successor) -
        +
        Signature: (edges:IEnumerable<'TEdge> * u:'TVertex * successor:byref<'TEdge>) -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-randomwalks-imarkovedgechain-2.html b/reference/quickgraph-algorithms-randomwalks-imarkovedgechain-2.html index 71bb7c714..5950deef1 100644 --- a/reference/quickgraph-algorithms-randomwalks-imarkovedgechain-2.html +++ b/reference/quickgraph-algorithms-randomwalks-imarkovedgechain-2.html @@ -50,10 +50,10 @@

        Instance members

        - + Rand() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-randomwalks-markovedgechainbase-2.html b/reference/quickgraph-algorithms-randomwalks-markovedgechainbase-2.html index 3bf532c2b..1d552fb7a 100644 --- a/reference/quickgraph-algorithms-randomwalks-markovedgechainbase-2.html +++ b/reference/quickgraph-algorithms-randomwalks-markovedgechainbase-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Rand() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + TryGetSuccessor(g, u, successor) -
        +
        Signature: (g:IImplicitGraph<'TVertex,'TEdge> * u:'TVertex * successor:byref<'TEdge>) -> bool
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + TryGetSuccessor(edges, u, successor) -
        +
        Signature: (edges:IEnumerable<'TEdge> * u:'TVertex * successor:byref<'TEdge>) -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-randomwalks-normalizedmarkovedgechain-2.html b/reference/quickgraph-algorithms-randomwalks-normalizedmarkovedgechain-2.html index d8342f5b6..c64e58fc3 100644 --- a/reference/quickgraph-algorithms-randomwalks-normalizedmarkovedgechain-2.html +++ b/reference/quickgraph-algorithms-randomwalks-normalizedmarkovedgechain-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + TryGetSuccessor(g, u, successor) -
        +
        Signature: (g:IImplicitGraph<'TVertex,'TEdge> * u:'TVertex * successor:byref<'TEdge>) -> bool
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + TryGetSuccessor(edges, u, successor) -
        +
        Signature: (edges:IEnumerable<'TEdge> * u:'TVertex * successor:byref<'TEdge>) -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-randomwalks-randomwalkalgorithm-2.html b/reference/quickgraph-algorithms-randomwalks-randomwalkalgorithm-2.html index 86f251dfe..43141a263 100644 --- a/reference/quickgraph-algorithms-randomwalks-randomwalkalgorithm-2.html +++ b/reference/quickgraph-algorithms-randomwalks-randomwalkalgorithm-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:IImplicitGraph<'TVertex,'TEdge> -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(visitedGraph, edgeChain) -
        +
        Signature: (visitedGraph:IImplicitGraph<'TVertex,'TEdge> * edgeChain:IEdgeChain<'TVertex,'TEdge>) -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + EdgeChain() -
        +
        Signature: unit -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + EndPredicate() -
        +
        Signature: unit -> unit
        @@ -114,10 +114,10 @@

        Instance members

        - + EndVertex -
        +
        Signature: VertexAction<'TVertex>
        @@ -128,10 +128,10 @@

        Instance members

        - + Generate(root) -
        +
        Signature: root:'TVertex -> unit
        @@ -142,10 +142,10 @@

        Instance members

        - + Generate(root, walkCount) -
        +
        Signature: (root:'TVertex * walkCount:int) -> unit
        @@ -156,10 +156,10 @@

        Instance members

        - + StartVertex -
        +
        Signature: VertexAction<'TVertex>
        @@ -170,10 +170,10 @@

        Instance members

        - + TreeEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -185,10 +185,10 @@

        Instance members

        - + VisitedGraph -
        +
        Signature: IImplicitGraph<'TVertex,'TEdge>
        diff --git a/reference/quickgraph-algorithms-randomwalks-roundrobinedgechain-2.html b/reference/quickgraph-algorithms-randomwalks-roundrobinedgechain-2.html index 55d5f60ff..0c050ddd8 100644 --- a/reference/quickgraph-algorithms-randomwalks-roundrobinedgechain-2.html +++ b/reference/quickgraph-algorithms-randomwalks-roundrobinedgechain-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + TryGetSuccessor(g, u, successor) -
        +
        Signature: (g:IImplicitGraph<'TVertex,'TEdge> * u:'TVertex * successor:byref<'TEdge>) -> bool
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + TryGetSuccessor(edges, u, successor) -
        +
        Signature: (edges:IEnumerable<'TEdge> * u:'TVertex * successor:byref<'TEdge>) -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-randomwalks-vanishingweightedmarkovedgechain-2.html b/reference/quickgraph-algorithms-randomwalks-vanishingweightedmarkovedgechain-2.html index 659c2dd67..f079840c0 100644 --- a/reference/quickgraph-algorithms-randomwalks-vanishingweightedmarkovedgechain-2.html +++ b/reference/quickgraph-algorithms-randomwalks-vanishingweightedmarkovedgechain-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(weights) -
        +
        Signature: weights:IDictionary<'TEdge,float> -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(weights, factor) -
        +
        Signature: (weights:IDictionary<'TEdge,float> * factor:float) -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + Factor() -
        +
        Signature: unit -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + TryGetSuccessor(g, u, successor) -
        +
        Signature: (g:IImplicitGraph<'TVertex,'TEdge> * u:'TVertex * successor:byref<'TEdge>) -> bool
        Modifiers: abstract
        @@ -115,10 +115,10 @@

        Instance members

        - + TryGetSuccessor(edges, u, successor) -
        +
        Signature: (edges:IEnumerable<'TEdge> * u:'TVertex * successor:byref<'TEdge>) -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-randomwalks-weightedmarkovedgechain-2.html b/reference/quickgraph-algorithms-randomwalks-weightedmarkovedgechain-2.html index 0f9a204ab..884ffbc5f 100644 --- a/reference/quickgraph-algorithms-randomwalks-weightedmarkovedgechain-2.html +++ b/reference/quickgraph-algorithms-randomwalks-weightedmarkovedgechain-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(weights) -
        +
        Signature: weights:IDictionary<'TEdge,float> -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + TryGetSuccessor(g, u, successor) -
        +
        Signature: (g:IImplicitGraph<'TVertex,'TEdge> * u:'TVertex * successor:byref<'TEdge>) -> bool
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + TryGetSuccessor(edges, u, sucessor) -
        +
        Signature: (edges:IEnumerable<'TEdge> * u:'TVertex * sucessor:byref<'TEdge>) -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-randomwalks-weightedmarkovedgechainbase-2.html b/reference/quickgraph-algorithms-randomwalks-weightedmarkovedgechainbase-2.html index a317b5f1d..51c720a7f 100644 --- a/reference/quickgraph-algorithms-randomwalks-weightedmarkovedgechainbase-2.html +++ b/reference/quickgraph-algorithms-randomwalks-weightedmarkovedgechainbase-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(weights) -
        +
        Signature: weights:IDictionary<'TEdge,float> -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Weights() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-algorithms-rankedshortestpath-hoffmanpavleyrankedshortestpathalgorithm-2.html b/reference/quickgraph-algorithms-rankedshortestpath-hoffmanpavleyrankedshortestpathalgorithm-2.html index 7cb36c51e..ddeb2cf86 100644 --- a/reference/quickgraph-algorithms-rankedshortestpath-hoffmanpavleyrankedshortestpathalgorithm-2.html +++ b/reference/quickgraph-algorithms-rankedshortestpath-hoffmanpavleyrankedshortestpathalgorithm-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(visitedGraph, edgeWeights) -
        +
        Signature: (visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> * edgeWeights:Func<'TEdge,float>) -> unit
        @@ -66,10 +66,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> * edgeWeights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
        @@ -88,10 +88,10 @@

        Instance members

        - + Compute(rootVertex, goalVertex) -
        +
        Signature: (rootVertex:'TVertex * goalVertex:'TVertex) -> unit
        @@ -102,10 +102,10 @@

        Instance members

        - + SetGoalVertex(goalVertex) -
        +
        Signature: goalVertex:'TVertex -> unit
        @@ -116,10 +116,10 @@

        Instance members

        - + TryGetGoalVertex(goalVertex) -
        +
        Signature: goalVertex:byref<'TVertex> -> bool
        diff --git a/reference/quickgraph-algorithms-rankedshortestpath-rankedshortestpathalgorithmbase-3.html b/reference/quickgraph-algorithms-rankedshortestpath-rankedshortestpathalgorithmbase-3.html index dbde45235..b070bfeff 100644 --- a/reference/quickgraph-algorithms-rankedshortestpath-rankedshortestpathalgorithmbase-3.html +++ b/reference/quickgraph-algorithms-rankedshortestpath-rankedshortestpathalgorithmbase-3.html @@ -50,10 +50,10 @@

        Constructors

        - + new(host, visitedGraph, distanceRelaxer) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:'TGraph * distanceRelaxer:IDistanceRelaxer) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + ComputedShortestPathCount -
        +
        Signature: int
        @@ -86,10 +86,10 @@

        Instance members

        - + ComputedShortestPaths -
        +
        Signature: IEnumerable<IEnumerable<'TEdge>>
        @@ -100,10 +100,10 @@

        Instance members

        - + DistanceRelaxer -
        +
        Signature: IDistanceRelaxer
        @@ -114,10 +114,10 @@

        Instance members

        - + ShortestPathCount() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-algorithms-ranking-pagerankalgorithm-2.html b/reference/quickgraph-algorithms-ranking-pagerankalgorithm-2.html index f70e4ee4f..9cb0bf2ec 100644 --- a/reference/quickgraph-algorithms-ranking-pagerankalgorithm-2.html +++ b/reference/quickgraph-algorithms-ranking-pagerankalgorithm-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Damping() -
        +
        Signature: unit -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + GetRanksMean() -
        +
        Signature: unit -> float
        @@ -100,10 +100,10 @@

        Instance members

        - + GetRanksSum() -
        +
        Signature: unit -> float
        @@ -114,10 +114,10 @@

        Instance members

        - + InitializeRanks() -
        +
        Signature: unit -> unit
        @@ -128,10 +128,10 @@

        Instance members

        - + MaxIteration() -
        +
        Signature: unit -> unit
        @@ -142,10 +142,10 @@

        Instance members

        - + Ranks -
        +
        Signature: IDictionary<'TVertex,float>
        @@ -156,10 +156,10 @@

        Instance members

        - + Tolerance() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-algorithms-rootedalgorithmbase-2.html b/reference/quickgraph-algorithms-rootedalgorithmbase-2.html index 9af8763dc..d4f56c2f7 100644 --- a/reference/quickgraph-algorithms-rootedalgorithmbase-2.html +++ b/reference/quickgraph-algorithms-rootedalgorithmbase-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(host, visitedGraph) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:'TGraph) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + ClearRootVertex() -
        +
        Signature: unit -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + Compute(rootVertex) -
        +
        Signature: rootVertex:'TVertex -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + RootVertexChanged -
        +
        Signature: IEvent<EventHandler,EventArgs>
        @@ -114,10 +114,10 @@

        Instance members

        - + SetRootVertex(rootVertex) -
        +
        Signature: rootVertex:'TVertex -> unit
        @@ -128,10 +128,10 @@

        Instance members

        - + TryGetRootVertex(rootVertex) -
        +
        Signature: rootVertex:byref<'TVertex> -> bool
        diff --git a/reference/quickgraph-algorithms-rootedsearchalgorithmbase-2.html b/reference/quickgraph-algorithms-rootedsearchalgorithmbase-2.html index e07697c6e..a5735d232 100644 --- a/reference/quickgraph-algorithms-rootedsearchalgorithmbase-2.html +++ b/reference/quickgraph-algorithms-rootedsearchalgorithmbase-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(host, visitedGraph) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:'TGraph) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + ClearGoalVertex() -
        +
        Signature: unit -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + Compute(root, goal) -
        +
        Signature: (root:'TVertex * goal:'TVertex) -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + GoalReached -
        +
        Signature: IEvent<EventHandler,EventArgs>
        @@ -114,10 +114,10 @@

        Instance members

        - + GoalVertexChanged -
        +
        Signature: IEvent<EventHandler,EventArgs>
        @@ -128,10 +128,10 @@

        Instance members

        - + SetGoalVertex(goalVertex) -
        +
        Signature: goalVertex:'TVertex -> unit
        @@ -142,10 +142,10 @@

        Instance members

        - + TryGetGoalVertex(goalVertex) -
        +
        Signature: goalVertex:byref<'TVertex> -> bool
        diff --git a/reference/quickgraph-algorithms-search-bestfirstfrontiersearchalgorithm-2.html b/reference/quickgraph-algorithms-search-bestfirstfrontiersearchalgorithm-2.html index 845f80e92..4c1af6cae 100644 --- a/reference/quickgraph-algorithms-search-bestfirstfrontiersearchalgorithm-2.html +++ b/reference/quickgraph-algorithms-search-bestfirstfrontiersearchalgorithm-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IBidirectionalIncidenceGraph<'TVertex,'TEdge> * edgeWeights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
        @@ -74,10 +74,10 @@

        Instance members

        - + TreeEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-search-bidirectionaldepthfirstsearchalgorithm-2.html b/reference/quickgraph-algorithms-search-bidirectionaldepthfirstsearchalgorithm-2.html index ede595a48..eec9fb2b0 100644 --- a/reference/quickgraph-algorithms-search-bidirectionaldepthfirstsearchalgorithm-2.html +++ b/reference/quickgraph-algorithms-search-bidirectionaldepthfirstsearchalgorithm-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(g) -
        +
        Signature: g:IBidirectionalGraph<'TVertex,'TEdge> -> unit
        @@ -66,10 +66,10 @@

        Constructors

        - + new(visitedGraph, colors) -
        +
        Signature: (visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> * colors:IDictionary<'TVertex,GraphColor>) -> unit
        @@ -80,10 +80,10 @@

        Constructors

        - + new(host, visitedGraph, colors) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> * colors:IDictionary<'TVertex,GraphColor>) -> unit
        @@ -102,10 +102,10 @@

        Instance members

        - + BackEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -116,10 +116,10 @@

        Instance members

        - + DiscoverVertex -
        +
        Signature: VertexAction<'TVertex>
        @@ -130,10 +130,10 @@

        Instance members

        - + ExamineEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -144,10 +144,10 @@

        Instance members

        - + FinishVertex -
        +
        Signature: VertexAction<'TVertex>
        @@ -158,10 +158,10 @@

        Instance members

        - + ForwardOrCrossEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -172,10 +172,10 @@

        Instance members

        - + GetVertexColor(vertex) -
        +
        Signature: vertex:'TVertex -> GraphColor
        Modifiers: abstract
        @@ -187,10 +187,10 @@

        Instance members

        - + InitializeVertex -
        +
        Signature: VertexAction<'TVertex>
        @@ -201,10 +201,10 @@

        Instance members

        - + MaxDepth() -
        +
        Signature: unit -> unit
        @@ -215,10 +215,10 @@

        Instance members

        - + StartVertex -
        +
        Signature: VertexAction<'TVertex>
        @@ -229,10 +229,10 @@

        Instance members

        - + TreeEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -244,10 +244,10 @@

        Instance members

        - + VertexColors -
        +
        Signature: IDictionary<'TVertex,GraphColor>
        @@ -258,10 +258,10 @@

        Instance members

        - + Visit(u, depth) -
        +
        Signature: (u:'TVertex * depth:int) -> unit
        diff --git a/reference/quickgraph-algorithms-search-breadthfirstsearchalgorithm-2.html b/reference/quickgraph-algorithms-search-breadthfirstsearchalgorithm-2.html index ce092bafe..2334c26bf 100644 --- a/reference/quickgraph-algorithms-search-breadthfirstsearchalgorithm-2.html +++ b/reference/quickgraph-algorithms-search-breadthfirstsearchalgorithm-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(g) -
        +
        Signature: g:IVertexListGraph<'TVertex,'TEdge> -> unit
        @@ -66,10 +66,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * vertexQueue:IQueue<'TVertex> * vertexColors:IDictionary<'TVertex,GraphColor>) -> unit
        @@ -80,10 +80,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IVertexListGraph<'TVertex,'TEdge> * vertexQueue:IQueue<'TVertex> * vertexColors:IDictionary<'TVertex,GraphColor>) -> unit
        @@ -94,10 +94,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IVertexListGraph<'TVertex,'TEdge> * vertexQueue:IQueue<'TVertex> * vertexColors:IDictionary<'TVertex,GraphColor> * outEdgeEnumerator:Func<IEnumerable<'TEdge>,IEnumerable<'TEdge>>) -> unit
        @@ -116,10 +116,10 @@

        Instance members

        - + BlackTarget -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -130,10 +130,10 @@

        Instance members

        - + DiscoverVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -145,10 +145,10 @@

        Instance members

        - + ExamineEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -159,10 +159,10 @@

        Instance members

        - + ExamineVertex -
        +
        Signature: VertexAction<'TVertex>
        @@ -173,10 +173,10 @@

        Instance members

        - + FinishVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -188,10 +188,10 @@

        Instance members

        - + GetVertexColor(vertex) -
        +
        Signature: vertex:'TVertex -> GraphColor
        Modifiers: abstract
        @@ -203,10 +203,10 @@

        Instance members

        - + GrayTarget -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -217,10 +217,10 @@

        Instance members

        - + InitializeVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -232,10 +232,10 @@

        Instance members

        - + NonTreeEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -246,10 +246,10 @@

        Instance members

        - + OutEdgeEnumerator -
        +
        Signature: Func<IEnumerable<'TEdge>,IEnumerable<'TEdge>>
        @@ -260,10 +260,10 @@

        Instance members

        - + StartVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -275,10 +275,10 @@

        Instance members

        - + TreeEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -290,10 +290,10 @@

        Instance members

        - + VertexColors -
        +
        Signature: IDictionary<'TVertex,GraphColor>
        @@ -304,10 +304,10 @@

        Instance members

        - + Visit(s) -
        +
        Signature: s:'TVertex -> unit
        diff --git a/reference/quickgraph-algorithms-search-depthfirstsearchalgorithm-2.html b/reference/quickgraph-algorithms-search-depthfirstsearchalgorithm-2.html index eba8b5cd3..15c9dd8ea 100644 --- a/reference/quickgraph-algorithms-search-depthfirstsearchalgorithm-2.html +++ b/reference/quickgraph-algorithms-search-depthfirstsearchalgorithm-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:IVertexListGraph<'TVertex,'TEdge> -> unit
        @@ -68,10 +68,10 @@

        Constructors

        - + new(visitedGraph, colors) -
        +
        Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * colors:IDictionary<'TVertex,GraphColor>) -> unit
        @@ -84,10 +84,10 @@

        Constructors

        - + new(host, visitedGraph) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IVertexListGraph<'TVertex,'TEdge>) -> unit
        @@ -100,10 +100,10 @@

        Constructors

        - + new(host, visitedGraph, colors) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IVertexListGraph<'TVertex,'TEdge> * colors:IDictionary<'TVertex,GraphColor>) -> unit
        @@ -116,10 +116,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IVertexListGraph<'TVertex,'TEdge> * colors:IDictionary<'TVertex,GraphColor> * outEdgeEnumerator:Func<IEnumerable<'TEdge>,IEnumerable<'TEdge>>) -> unit
        @@ -140,10 +140,10 @@

        Instance members

        - + BackEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -154,10 +154,10 @@

        Instance members

        - + DiscoverVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -169,10 +169,10 @@

        Instance members

        - + ExamineEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -183,10 +183,10 @@

        Instance members

        - + FinishVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -198,10 +198,10 @@

        Instance members

        - + ForwardOrCrossEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -212,10 +212,10 @@

        Instance members

        - + GetVertexColor(vertex) -
        +
        Signature: vertex:'TVertex -> GraphColor
        Modifiers: abstract
        @@ -227,10 +227,10 @@

        Instance members

        - + InitializeVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -242,10 +242,10 @@

        Instance members

        - + MaxDepth() -
        +
        Signature: unit -> unit
        @@ -256,10 +256,10 @@

        Instance members

        - + OutEdgeEnumerator -
        +
        Signature: Func<IEnumerable<'TEdge>,IEnumerable<'TEdge>>
        @@ -270,10 +270,10 @@

        Instance members

        - + StartVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -285,10 +285,10 @@

        Instance members

        - + TreeEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -300,10 +300,10 @@

        Instance members

        - + VertexColors -
        +
        Signature: IDictionary<'TVertex,GraphColor>
        @@ -314,10 +314,10 @@

        Instance members

        - + Visit(root) -
        +
        Signature: root:'TVertex -> unit
        diff --git a/reference/quickgraph-algorithms-search-edgedepthfirstsearchalgorithm-2.html b/reference/quickgraph-algorithms-search-edgedepthfirstsearchalgorithm-2.html index 1f241b380..f966eb548 100644 --- a/reference/quickgraph-algorithms-search-edgedepthfirstsearchalgorithm-2.html +++ b/reference/quickgraph-algorithms-search-edgedepthfirstsearchalgorithm-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(g) -
        +
        Signature: g:IEdgeListAndIncidenceGraph<'TVertex,'TEdge> -> unit
        @@ -66,10 +66,10 @@

        Constructors

        - + new(visitedGraph, colors) -
        +
        Signature: (visitedGraph:IEdgeListAndIncidenceGraph<'TVertex,'TEdge> * colors:IDictionary<'TEdge,GraphColor>) -> unit
        @@ -80,10 +80,10 @@

        Constructors

        - + new(host, visitedGraph, colors) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IEdgeListAndIncidenceGraph<'TVertex,'TEdge> * colors:IDictionary<'TEdge,GraphColor>) -> unit
        @@ -102,10 +102,10 @@

        Instance members

        - + BackEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -116,10 +116,10 @@

        Instance members

        - + DiscoverTreeEdge -
        +
        Signature: EdgeEdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -131,10 +131,10 @@

        Instance members

        - + EdgeColors -
        +
        Signature: IDictionary<'TEdge,GraphColor>
        Modifiers: abstract
        @@ -146,10 +146,10 @@

        Instance members

        - + ExamineEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -160,10 +160,10 @@

        Instance members

        - + FinishEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -175,10 +175,10 @@

        Instance members

        - + ForwardOrCrossEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -189,10 +189,10 @@

        Instance members

        - + InitializeEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -203,10 +203,10 @@

        Instance members

        - + MaxDepth() -
        +
        Signature: unit -> unit
        @@ -217,10 +217,10 @@

        Instance members

        - + StartEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -231,10 +231,10 @@

        Instance members

        - + StartVertex -
        +
        Signature: VertexAction<'TVertex>
        @@ -245,10 +245,10 @@

        Instance members

        - + TreeEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -260,10 +260,10 @@

        Instance members

        - + Visit(se, depth) -
        +
        Signature: (se:'TEdge * depth:int) -> unit
        diff --git a/reference/quickgraph-algorithms-search-implicitdepthfirstsearchalgorithm-2.html b/reference/quickgraph-algorithms-search-implicitdepthfirstsearchalgorithm-2.html index 0333947e7..59558f8ec 100644 --- a/reference/quickgraph-algorithms-search-implicitdepthfirstsearchalgorithm-2.html +++ b/reference/quickgraph-algorithms-search-implicitdepthfirstsearchalgorithm-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:IIncidenceGraph<'TVertex,'TEdge> -> unit
        @@ -66,10 +66,10 @@

        Constructors

        - + new(host, visitedGraph) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IIncidenceGraph<'TVertex,'TEdge>) -> unit
        @@ -88,10 +88,10 @@

        Instance members

        - + BackEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -104,10 +104,10 @@

        Instance members

        - + DiscoverVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -121,10 +121,10 @@

        Instance members

        - + ExamineEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -137,10 +137,10 @@

        Instance members

        - + FinishVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -156,10 +156,10 @@

        Instance members

        - + ForwardOrCrossEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -173,10 +173,10 @@

        Instance members

        - + MaxDepth() -
        +
        Signature: unit -> unit
        @@ -190,10 +190,10 @@

        Instance members

        - + StartVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -207,10 +207,10 @@

        Instance members

        - + TreeEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -226,10 +226,10 @@

        Instance members

        - + VertexColors -
        +
        Signature: IDictionary<'TVertex,GraphColor>
        diff --git a/reference/quickgraph-algorithms-search-implicitedgedepthfirstsearchalgorithm-2.html b/reference/quickgraph-algorithms-search-implicitedgedepthfirstsearchalgorithm-2.html index 257ae6d83..5f17f1efc 100644 --- a/reference/quickgraph-algorithms-search-implicitedgedepthfirstsearchalgorithm-2.html +++ b/reference/quickgraph-algorithms-search-implicitedgedepthfirstsearchalgorithm-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:IIncidenceGraph<'TVertex,'TEdge> -> unit
        @@ -66,10 +66,10 @@

        Constructors

        - + new(host, visitedGraph) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IIncidenceGraph<'TVertex,'TEdge>) -> unit
        @@ -88,10 +88,10 @@

        Instance members

        - + BackEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -104,10 +104,10 @@

        Instance members

        - + DiscoverTreeEdge -
        +
        Signature: EdgeEdgeAction<'TVertex,'TEdge>
        @@ -119,10 +119,10 @@

        Instance members

        - + EdgeColors -
        +
        Signature: IDictionary<'TEdge,GraphColor>
        @@ -135,10 +135,10 @@

        Instance members

        - + FinishEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -153,10 +153,10 @@

        Instance members

        - + ForwardOrCrossEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -170,10 +170,10 @@

        Instance members

        - + MaxDepth() -
        +
        Signature: unit -> unit
        @@ -187,10 +187,10 @@

        Instance members

        - + StartEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -203,10 +203,10 @@

        Instance members

        - + StartVertex -
        +
        Signature: VertexAction<'TVertex>
        @@ -219,10 +219,10 @@

        Instance members

        - + TreeEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-search-undirectedbreadthfirstsearchalgorithm-2.html b/reference/quickgraph-algorithms-search-undirectedbreadthfirstsearchalgorithm-2.html index 2c9b6ecf1..291048da5 100644 --- a/reference/quickgraph-algorithms-search-undirectedbreadthfirstsearchalgorithm-2.html +++ b/reference/quickgraph-algorithms-search-undirectedbreadthfirstsearchalgorithm-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(g) -
        +
        Signature: g:IUndirectedGraph<'TVertex,'TEdge> -> unit
        @@ -66,10 +66,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * vertexQueue:IQueue<'TVertex> * vertexColors:IDictionary<'TVertex,GraphColor>) -> unit
        @@ -80,10 +80,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * vertexQueue:IQueue<'TVertex> * vertexColors:IDictionary<'TVertex,GraphColor>) -> unit
        @@ -102,10 +102,10 @@

        Instance members

        - + BlackTarget -
        +
        Signature: IEvent<UndirectedEdgeAction<'TVertex,'TEdge>,UndirectedEdgeEventArgs<'TVertex,'TEdge>>
        @@ -116,10 +116,10 @@

        Instance members

        - + DiscoverVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -131,10 +131,10 @@

        Instance members

        - + ExamineEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -145,10 +145,10 @@

        Instance members

        - + ExamineVertex -
        +
        Signature: VertexAction<'TVertex>
        @@ -159,10 +159,10 @@

        Instance members

        - + FinishVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -174,10 +174,10 @@

        Instance members

        - + GetVertexColor(vertex) -
        +
        Signature: vertex:'TVertex -> GraphColor
        Modifiers: abstract
        @@ -189,10 +189,10 @@

        Instance members

        - + GrayTarget -
        +
        Signature: IEvent<UndirectedEdgeAction<'TVertex,'TEdge>,UndirectedEdgeEventArgs<'TVertex,'TEdge>>
        @@ -203,10 +203,10 @@

        Instance members

        - + InitializeVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -218,10 +218,10 @@

        Instance members

        - + NonTreeEdge -
        +
        Signature: IEvent<UndirectedEdgeAction<'TVertex,'TEdge>,UndirectedEdgeEventArgs<'TVertex,'TEdge>>
        @@ -232,10 +232,10 @@

        Instance members

        - + StartVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -247,10 +247,10 @@

        Instance members

        - + TreeEdge -
        +
        Signature: IEvent<UndirectedEdgeAction<'TVertex,'TEdge>,UndirectedEdgeEventArgs<'TVertex,'TEdge>>
        Modifiers: abstract
        @@ -262,10 +262,10 @@

        Instance members

        - + VertexColors -
        +
        Signature: IDictionary<'TVertex,GraphColor>
        @@ -276,10 +276,10 @@

        Instance members

        - + Visit(s) -
        +
        Signature: s:'TVertex -> unit
        diff --git a/reference/quickgraph-algorithms-search-undirecteddepthfirstsearchalgorithm-2.html b/reference/quickgraph-algorithms-search-undirecteddepthfirstsearchalgorithm-2.html index 08c5b60c6..9072c12ca 100644 --- a/reference/quickgraph-algorithms-search-undirecteddepthfirstsearchalgorithm-2.html +++ b/reference/quickgraph-algorithms-search-undirecteddepthfirstsearchalgorithm-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:IUndirectedGraph<'TVertex,'TEdge> -> unit
        @@ -68,10 +68,10 @@

        Constructors

        - + new(visitedGraph, colors) -
        +
        Signature: (visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * colors:IDictionary<'TVertex,GraphColor>) -> unit
        @@ -84,10 +84,10 @@

        Constructors

        - + new(host, visitedGraph, colors) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * colors:IDictionary<'TVertex,GraphColor>) -> unit
        @@ -100,10 +100,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * colors:IDictionary<'TVertex,GraphColor> * adjacentEdgeEnumerator:Func<IEnumerable<'TEdge>,IEnumerable<'TEdge>>) -> unit
        @@ -124,10 +124,10 @@

        Instance members

        - + AdjacentEdgeEnumerator -
        +
        Signature: Func<IEnumerable<'TEdge>,IEnumerable<'TEdge>>
        @@ -138,10 +138,10 @@

        Instance members

        - + BackEdge -
        +
        Signature: IEvent<UndirectedEdgeAction<'TVertex,'TEdge>,UndirectedEdgeEventArgs<'TVertex,'TEdge>>
        @@ -152,10 +152,10 @@

        Instance members

        - + DiscoverVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -167,10 +167,10 @@

        Instance members

        - + ExamineEdge -
        +
        Signature: IEvent<UndirectedEdgeAction<'TVertex,'TEdge>,UndirectedEdgeEventArgs<'TVertex,'TEdge>>
        @@ -181,10 +181,10 @@

        Instance members

        - + FinishVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -196,10 +196,10 @@

        Instance members

        - + ForwardOrCrossEdge -
        +
        Signature: IEvent<UndirectedEdgeAction<'TVertex,'TEdge>,UndirectedEdgeEventArgs<'TVertex,'TEdge>>
        @@ -210,10 +210,10 @@

        Instance members

        - + GetVertexColor(vertex) -
        +
        Signature: vertex:'TVertex -> GraphColor
        Modifiers: abstract
        @@ -225,10 +225,10 @@

        Instance members

        - + InitializeVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -240,10 +240,10 @@

        Instance members

        - + MaxDepth() -
        +
        Signature: unit -> unit
        @@ -254,10 +254,10 @@

        Instance members

        - + StartVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -269,10 +269,10 @@

        Instance members

        - + TreeEdge -
        +
        Signature: IEvent<UndirectedEdgeAction<'TVertex,'TEdge>,UndirectedEdgeEventArgs<'TVertex,'TEdge>>
        Modifiers: abstract
        @@ -284,10 +284,10 @@

        Instance members

        - + VertexColors -
        +
        Signature: IDictionary<'TVertex,GraphColor>
        @@ -298,10 +298,10 @@

        Instance members

        - + VertexMaxDepthReached -
        +
        Signature: VertexAction<'TVertex>
        @@ -312,10 +312,10 @@

        Instance members

        - + Visit(root) -
        +
        Signature: root:'TVertex -> unit
        diff --git a/reference/quickgraph-algorithms-services-ialgorithmcomponent.html b/reference/quickgraph-algorithms-services-ialgorithmcomponent.html index 2aa78e8d9..39b3c870f 100644 --- a/reference/quickgraph-algorithms-services-ialgorithmcomponent.html +++ b/reference/quickgraph-algorithms-services-ialgorithmcomponent.html @@ -50,10 +50,10 @@

        Instance members

        - + GetService() -
        +
        Signature: unit -> 'T
        Modifiers: abstract
        Type parameters: 'T
        @@ -65,10 +65,10 @@

        Instance members

        - + Services -
        +
        Signature: IAlgorithmServices
        Modifiers: abstract
        @@ -80,10 +80,10 @@

        Instance members

        - + TryGetService(service) -
        +
        Signature: service:byref<'T> -> bool
        Modifiers: abstract
        Type parameters: 'T
        diff --git a/reference/quickgraph-algorithms-services-ialgorithmservices.html b/reference/quickgraph-algorithms-services-ialgorithmservices.html index cc4505ee6..0ca547277 100644 --- a/reference/quickgraph-algorithms-services-ialgorithmservices.html +++ b/reference/quickgraph-algorithms-services-ialgorithmservices.html @@ -52,10 +52,10 @@

        Instance members

        - + CancelManager -
        +
        Signature: ICancelManager
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-services-icancelmanager.html b/reference/quickgraph-algorithms-services-icancelmanager.html index a11ae35a3..cd71852f5 100644 --- a/reference/quickgraph-algorithms-services-icancelmanager.html +++ b/reference/quickgraph-algorithms-services-icancelmanager.html @@ -50,10 +50,10 @@

        Instance members

        - + Cancel() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -67,10 +67,10 @@

        Instance members

        - + CancelRequested -
        +
        Signature: IEvent<EventHandler,EventArgs>
        Modifiers: abstract
        @@ -84,10 +84,10 @@

        Instance members

        - + CancelReseted -
        +
        Signature: IEvent<EventHandler,EventArgs>
        Modifiers: abstract
        @@ -101,10 +101,10 @@

        Instance members

        - + IsCancelling -
        +
        Signature: bool
        Modifiers: abstract
        @@ -118,10 +118,10 @@

        Instance members

        - + ResetCancel() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-shortestpath-astarshortestpathalgorithm-2.html b/reference/quickgraph-algorithms-shortestpath-astarshortestpathalgorithm-2.html index ac5ecd4b5..943e423f9 100644 --- a/reference/quickgraph-algorithms-shortestpath-astarshortestpathalgorithm-2.html +++ b/reference/quickgraph-algorithms-shortestpath-astarshortestpathalgorithm-2.html @@ -53,10 +53,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * costHeuristic:Func<'TVertex,float>) -> unit
        @@ -67,10 +67,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * costHeuristic:Func<'TVertex,float> * distanceRelaxer:IDistanceRelaxer) -> unit
        @@ -81,10 +81,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IVertexListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * costHeuristic:Func<'TVertex,float> * distanceRelaxer:IDistanceRelaxer) -> unit
        @@ -103,10 +103,10 @@

        Instance members

        - + ComputeNoInit(s) -
        +
        Signature: s:'TVertex -> unit
        @@ -117,10 +117,10 @@

        Instance members

        - + CostHeuristic -
        +
        Signature: Func<'TVertex,float>
        @@ -131,10 +131,10 @@

        Instance members

        - + DiscoverVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -146,10 +146,10 @@

        Instance members

        - + EdgeNotRelaxed -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -160,10 +160,10 @@

        Instance members

        - + ExamineEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -174,10 +174,10 @@

        Instance members

        - + ExamineVertex -
        +
        Signature: VertexAction<'TVertex>
        @@ -188,10 +188,10 @@

        Instance members

        - + FinishVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -203,10 +203,10 @@

        Instance members

        - + InitializeVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -218,10 +218,10 @@

        Instance members

        - + StartVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-shortestpath-bellmanfordshortestpathalgorithm-2.html b/reference/quickgraph-algorithms-shortestpath-bellmanfordshortestpathalgorithm-2.html index c8c7a8611..fbe16adb9 100644 --- a/reference/quickgraph-algorithms-shortestpath-bellmanfordshortestpathalgorithm-2.html +++ b/reference/quickgraph-algorithms-shortestpath-bellmanfordshortestpathalgorithm-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(visitedGraph, weights) -
        +
        Signature: (visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float>) -> unit
        @@ -66,10 +66,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
        @@ -80,10 +80,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
        @@ -102,10 +102,10 @@

        Instance members

        - + EdgeMinimized -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -120,10 +120,10 @@

        Instance members

        - + EdgeNotMinimized -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -139,10 +139,10 @@

        Instance members

        - + EdgeNotRelaxed -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -156,10 +156,10 @@

        Instance members

        - + ExamineEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -172,10 +172,10 @@

        Instance members

        - + FoundNegativeCycle -
        +
        Signature: bool
        @@ -186,10 +186,10 @@

        Instance members

        - + InitializeVertex -
        +
        Signature: VertexAction<'TVertex>
        @@ -203,10 +203,10 @@

        Instance members

        - + Predecessors -
        +
        Signature: IDictionary<'TVertex,'TVertex>
        diff --git a/reference/quickgraph-algorithms-shortestpath-dagshortestpathalgorithm-2.html b/reference/quickgraph-algorithms-shortestpath-dagshortestpathalgorithm-2.html index 85c902051..577c99869 100644 --- a/reference/quickgraph-algorithms-shortestpath-dagshortestpathalgorithm-2.html +++ b/reference/quickgraph-algorithms-shortestpath-dagshortestpathalgorithm-2.html @@ -53,10 +53,10 @@

        Constructors

        - + new(g, weights) -
        +
        Signature: (g:IVertexListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float>) -> unit
        @@ -67,10 +67,10 @@

        Constructors

        - + new(g, weights, distanceRelaxer) -
        +
        Signature: (g:IVertexListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
        @@ -81,10 +81,10 @@

        Constructors

        - + new(host, g, weights, distanceRelaxer) -
        +
        Signature: (host:IAlgorithmComponent * g:IVertexListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
        @@ -103,10 +103,10 @@

        Instance members

        - + ComputeNoInit(s) -
        +
        Signature: s:'TVertex -> unit
        @@ -117,10 +117,10 @@

        Instance members

        - + DiscoverVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -132,10 +132,10 @@

        Instance members

        - + EdgeNotRelaxed -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -146,10 +146,10 @@

        Instance members

        - + ExamineEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -160,10 +160,10 @@

        Instance members

        - + ExamineVertex -
        +
        Signature: VertexAction<'TVertex>
        @@ -174,10 +174,10 @@

        Instance members

        - + FinishVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -189,10 +189,10 @@

        Instance members

        - + InitializeVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -204,10 +204,10 @@

        Instance members

        - + StartVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-shortestpath-dijkstrashortestpathalgorithm-2.html b/reference/quickgraph-algorithms-shortestpath-dijkstrashortestpathalgorithm-2.html index bdcb3d01d..cde19be84 100644 --- a/reference/quickgraph-algorithms-shortestpath-dijkstrashortestpathalgorithm-2.html +++ b/reference/quickgraph-algorithms-shortestpath-dijkstrashortestpathalgorithm-2.html @@ -53,10 +53,10 @@

        Constructors

        - + new(visitedGraph, weights) -
        +
        Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float>) -> unit
        @@ -67,10 +67,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (visitedGraph:IVertexListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
        @@ -81,10 +81,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IVertexListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
        @@ -103,10 +103,10 @@

        Instance members

        - + ComputeNoInit(s) -
        +
        Signature: s:'TVertex -> unit
        @@ -117,10 +117,10 @@

        Instance members

        - + DiscoverVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -132,10 +132,10 @@

        Instance members

        - + EdgeNotRelaxed -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -146,10 +146,10 @@

        Instance members

        - + ExamineEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -160,10 +160,10 @@

        Instance members

        - + ExamineVertex -
        +
        Signature: VertexAction<'TVertex>
        @@ -174,10 +174,10 @@

        Instance members

        - + FinishVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -189,10 +189,10 @@

        Instance members

        - + InitializeVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -204,10 +204,10 @@

        Instance members

        - + StartVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-shortestpath-floydwarshallallshortestpathalgorithm-2.html b/reference/quickgraph-algorithms-shortestpath-floydwarshallallshortestpathalgorithm-2.html index 7ccf4aee7..e0c6c10aa 100644 --- a/reference/quickgraph-algorithms-shortestpath-floydwarshallallshortestpathalgorithm-2.html +++ b/reference/quickgraph-algorithms-shortestpath-floydwarshallallshortestpathalgorithm-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
        @@ -66,10 +66,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
        @@ -80,10 +80,10 @@

        Constructors

        - + new(visitedGraph, weights) -
        +
        Signature: (visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float>) -> unit
        @@ -102,10 +102,10 @@

        Instance members

        - + Dump(writer) -
        +
        Signature: writer:TextWriter -> unit
        @@ -116,10 +116,10 @@

        Instance members

        - + TryGetDistance(source, target, cost) -
        +
        Signature: (source:'TVertex * target:'TVertex * cost:byref<float>) -> bool
        @@ -130,10 +130,10 @@

        Instance members

        - + TryGetPath(source, target, path) -
        +
        Signature: (source:'TVertex * target:'TVertex * path:byref<IEnumerable<'TEdge>>) -> bool
        diff --git a/reference/quickgraph-algorithms-shortestpath-shortestpathalgorithmbase-3.html b/reference/quickgraph-algorithms-shortestpath-shortestpathalgorithmbase-3.html index 9d66f5d44..5cef445b1 100644 --- a/reference/quickgraph-algorithms-shortestpath-shortestpathalgorithmbase-3.html +++ b/reference/quickgraph-algorithms-shortestpath-shortestpathalgorithmbase-3.html @@ -50,10 +50,10 @@

        Constructors

        - + new(host, visitedGraph, weights) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:'TGraph * weights:Func<'TEdge,float>) -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:'TGraph * weights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + DistanceRelaxer -
        +
        Signature: IDistanceRelaxer
        @@ -100,10 +100,10 @@

        Instance members

        - + Distances -
        +
        Signature: Dictionary<'TVertex,float>
        @@ -114,10 +114,10 @@

        Instance members

        - + GetVertexColor(vertex) -
        +
        Signature: vertex:'TVertex -> GraphColor
        Modifiers: abstract
        @@ -129,10 +129,10 @@

        Instance members

        - + TreeEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -148,10 +148,10 @@

        Instance members

        - + TryGetDistance(vertex, distance) -
        +
        Signature: (vertex:'TVertex * distance:byref<float>) -> bool
        @@ -162,10 +162,10 @@

        Instance members

        - + VertexColors -
        +
        Signature: Dictionary<'TVertex,GraphColor>
        @@ -176,10 +176,10 @@

        Instance members

        - + Weights -
        +
        Signature: Func<'TEdge,float>
        diff --git a/reference/quickgraph-algorithms-shortestpath-undirecteddijkstrashortestpathalgorithm-2.html b/reference/quickgraph-algorithms-shortestpath-undirecteddijkstrashortestpathalgorithm-2.html index 74c0c75cf..efb5ee44e 100644 --- a/reference/quickgraph-algorithms-shortestpath-undirecteddijkstrashortestpathalgorithm-2.html +++ b/reference/quickgraph-algorithms-shortestpath-undirecteddijkstrashortestpathalgorithm-2.html @@ -53,10 +53,10 @@

        Constructors

        - + new(visitedGraph, weights) -
        +
        Signature: (visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float>) -> unit
        @@ -67,10 +67,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
        @@ -81,10 +81,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
        @@ -103,10 +103,10 @@

        Instance members

        - + ComputeNoInit(s) -
        +
        Signature: s:'TVertex -> unit
        @@ -117,10 +117,10 @@

        Instance members

        - + DiscoverVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -132,10 +132,10 @@

        Instance members

        - + EdgeNotRelaxed -
        +
        Signature: IEvent<UndirectedEdgeAction<'TVertex,'TEdge>,UndirectedEdgeEventArgs<'TVertex,'TEdge>>
        @@ -146,10 +146,10 @@

        Instance members

        - + ExamineEdge -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        @@ -160,10 +160,10 @@

        Instance members

        - + ExamineVertex -
        +
        Signature: VertexAction<'TVertex>
        @@ -174,10 +174,10 @@

        Instance members

        - + FinishVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -189,10 +189,10 @@

        Instance members

        - + InitializeVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -204,10 +204,10 @@

        Instance members

        - + StartVertex -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-shortestpath-undirectedshortestpathalgorithmbase-2.html b/reference/quickgraph-algorithms-shortestpath-undirectedshortestpathalgorithmbase-2.html index a22a83bc0..23085ba57 100644 --- a/reference/quickgraph-algorithms-shortestpath-undirectedshortestpathalgorithmbase-2.html +++ b/reference/quickgraph-algorithms-shortestpath-undirectedshortestpathalgorithmbase-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(host, visitedGraph, weights) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float>) -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IUndirectedGraph<'TVertex,'TEdge> * weights:Func<'TEdge,float> * distanceRelaxer:IDistanceRelaxer) -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + DistanceRelaxer -
        +
        Signature: IDistanceRelaxer
        @@ -100,10 +100,10 @@

        Instance members

        - + Distances -
        +
        Signature: Dictionary<'TVertex,float>
        @@ -114,10 +114,10 @@

        Instance members

        - + GetVertexColor(vertex) -
        +
        Signature: vertex:'TVertex -> GraphColor
        Modifiers: abstract
        @@ -129,10 +129,10 @@

        Instance members

        - + TreeEdge -
        +
        Signature: IEvent<UndirectedEdgeAction<'TVertex,'TEdge>,UndirectedEdgeEventArgs<'TVertex,'TEdge>>
        Modifiers: abstract
        @@ -148,10 +148,10 @@

        Instance members

        - + TryGetDistance(vertex, distance) -
        +
        Signature: (vertex:'TVertex * distance:byref<float>) -> bool
        @@ -162,10 +162,10 @@

        Instance members

        - + VertexColors -
        +
        Signature: Dictionary<'TVertex,GraphColor>
        @@ -176,10 +176,10 @@

        Instance members

        - + Weights -
        +
        Signature: Func<'TEdge,float>
        diff --git a/reference/quickgraph-algorithms-shortestpath-yen-yenshortestpathsalgorithm-1.html b/reference/quickgraph-algorithms-shortestpath-yen-yenshortestpathsalgorithm-1.html index bf961ee16..fc77167b5 100644 --- a/reference/quickgraph-algorithms-shortestpath-yen-yenshortestpathsalgorithm-1.html +++ b/reference/quickgraph-algorithms-shortestpath-yen-yenshortestpathsalgorithm-1.html @@ -50,11 +50,11 @@

        Constructors

        - - new(graph, s, t, k) + + new(graph, s, t, k, weights, filter) -
        - Signature: (graph:AdjacencyGraph<'TVertex,TaggedEquatableEdge<'TVertex,float>> * s:'TVertex * t:'TVertex * k:int) -> unit
        +
        + Signature: (graph:AdjacencyGraph<'TVertex,TaggedEquatableEdge<'TVertex,float>> * s:'TVertex * t:'TVertex * k:int * weights:Func<TaggedEquatableEdge<'TVertex,float>,float> * filter:Func<IEnumerable<IEnumerable<TaggedEquatableEdge<'TVertex,float>>>,IEnumerable<IEnumerable<TaggedEquatableEdge<'TVertex,float>>>>) -> unit
        @@ -72,15 +72,29 @@

        Instance members

        - + Execute() -
        +
        Signature: unit -> IEnumerable<IEnumerable<TaggedEquatableEdge<'TVertex,float>>>
        + + + + + + + RemovedEdges() + +
        + Signature: unit -> List<TaggedEquatableEdge<'TVertex,float>>
        +
        + + + diff --git a/reference/quickgraph-algorithms-tarjanofflineleastcommonancestoralgorithm-2.html b/reference/quickgraph-algorithms-tarjanofflineleastcommonancestoralgorithm-2.html index 794f9f930..24bbd31de 100644 --- a/reference/quickgraph-algorithms-tarjanofflineleastcommonancestoralgorithm-2.html +++ b/reference/quickgraph-algorithms-tarjanofflineleastcommonancestoralgorithm-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:IVertexListGraph<'TVertex,'TEdge> -> unit
        @@ -66,10 +66,10 @@

        Constructors

        - + new(host, visitedGraph) -
        +
        Signature: (host:IAlgorithmComponent * visitedGraph:IVertexListGraph<'TVertex,'TEdge>) -> unit
        @@ -88,10 +88,10 @@

        Instance members

        - + Ancestors -
        +
        Signature: IDictionary<SEquatableEdge<'TVertex>,'TVertex>
        @@ -102,10 +102,10 @@

        Instance members

        - + Compute(root, pairs) -
        +
        Signature: (root:'TVertex * pairs:IEnumerable<SEquatableEdge<'TVertex>>) -> unit
        @@ -116,10 +116,10 @@

        Instance members

        - + SetVertexPairs(pairs) -
        +
        Signature: pairs:IEnumerable<SEquatableEdge<'TVertex>> -> unit
        @@ -130,10 +130,10 @@

        Instance members

        - + TryGetVertexPairs(pairs) -
        +
        Signature: pairs:byref<IEnumerable<SEquatableEdge<'TVertex>>> -> bool
        diff --git a/reference/quickgraph-algorithms-topologicalsort-sourcefirstbidirectionaltopologicalsortalgorithm-2.html b/reference/quickgraph-algorithms-topologicalsort-sourcefirstbidirectionaltopologicalsortalgorithm-2.html index 4e3ac6f4d..51aa5a619 100644 --- a/reference/quickgraph-algorithms-topologicalsort-sourcefirstbidirectionaltopologicalsortalgorithm-2.html +++ b/reference/quickgraph-algorithms-topologicalsort-sourcefirstbidirectionaltopologicalsortalgorithm-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(visitedGraph, direction) -
        +
        Signature: (visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> * direction:TopologicalSortDirection) -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + AddVertex -
        +
        Signature: VertexAction<'TVertex>
        @@ -100,10 +100,10 @@

        Instance members

        - + Compute(vertices) -
        +
        Signature: vertices:IList<'TVertex> -> unit
        @@ -114,10 +114,10 @@

        Instance members

        - + Heap -
        +
        Signature: BinaryQueue<'TVertex,int>
        @@ -128,10 +128,10 @@

        Instance members

        - + InDegrees -
        +
        Signature: IDictionary<'TVertex,int>
        @@ -142,10 +142,10 @@

        Instance members

        - + SortedVertices -
        +
        Signature: ICollection<'TVertex>
        diff --git a/reference/quickgraph-algorithms-topologicalsort-sourcefirsttopologicalsortalgorithm-2.html b/reference/quickgraph-algorithms-topologicalsort-sourcefirsttopologicalsortalgorithm-2.html index 0634f1e57..2aab330d1 100644 --- a/reference/quickgraph-algorithms-topologicalsort-sourcefirsttopologicalsortalgorithm-2.html +++ b/reference/quickgraph-algorithms-topologicalsort-sourcefirsttopologicalsortalgorithm-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + AddVertex -
        +
        Signature: VertexAction<'TVertex>
        @@ -86,10 +86,10 @@

        Instance members

        - + Compute(vertices) -
        +
        Signature: vertices:IList<'TVertex> -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + Heap -
        +
        Signature: BinaryQueue<'TVertex,int>
        @@ -114,10 +114,10 @@

        Instance members

        - + InDegrees -
        +
        Signature: IDictionary<'TVertex,int>
        @@ -128,10 +128,10 @@

        Instance members

        - + SortedVertices -
        +
        Signature: ICollection<'TVertex>
        diff --git a/reference/quickgraph-algorithms-topologicalsort-topologicalsortalgorithm-2.html b/reference/quickgraph-algorithms-topologicalsort-topologicalsortalgorithm-2.html index 6aeaa7d38..1538131ad 100644 --- a/reference/quickgraph-algorithms-topologicalsort-topologicalsortalgorithm-2.html +++ b/reference/quickgraph-algorithms-topologicalsort-topologicalsortalgorithm-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(g) -
        +
        Signature: g:IVertexListGraph<'TVertex,'TEdge> -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(g, vertices) -
        +
        Signature: (g:IVertexListGraph<'TVertex,'TEdge> * vertices:IList<'TVertex>) -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + AllowCyclicGraph -
        +
        Signature: bool
        @@ -100,10 +100,10 @@

        Instance members

        - + Compute(vertices) -
        +
        Signature: vertices:IList<'TVertex> -> unit
        @@ -114,10 +114,38 @@

        Instance members

        - + + DiscoverVertex + +
        + Signature: VertexAction<'TVertex>
        +
        + + + + + + + + + + FinishVertex + +
        + Signature: VertexAction<'TVertex>
        +
        + + + + + + + + + SortedVertices -
        +
        Signature: IList<'TVertex>
        diff --git a/reference/quickgraph-algorithms-topologicalsort-undirectedfirsttopologicalsortalgorithm-2.html b/reference/quickgraph-algorithms-topologicalsort-undirectedfirsttopologicalsortalgorithm-2.html index c7081c2a5..fb9cd0810 100644 --- a/reference/quickgraph-algorithms-topologicalsort-undirectedfirsttopologicalsortalgorithm-2.html +++ b/reference/quickgraph-algorithms-topologicalsort-undirectedfirsttopologicalsortalgorithm-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:IUndirectedGraph<'TVertex,'TEdge> -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + AddVertex -
        +
        Signature: VertexAction<'TVertex>
        @@ -86,10 +86,10 @@

        Instance members

        - + AllowCyclicGraph() -
        +
        Signature: unit -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + Compute(vertices) -
        +
        Signature: vertices:IList<'TVertex> -> unit
        @@ -114,10 +114,10 @@

        Instance members

        - + Degrees -
        +
        Signature: IDictionary<'TVertex,int>
        @@ -128,10 +128,10 @@

        Instance members

        - + Heap -
        +
        Signature: BinaryQueue<'TVertex,int>
        @@ -142,10 +142,10 @@

        Instance members

        - + SortedVertices -
        +
        Signature: ICollection<'TVertex>
        diff --git a/reference/quickgraph-algorithms-topologicalsort-undirectedtopologicalsortalgorithm-2.html b/reference/quickgraph-algorithms-topologicalsort-undirectedtopologicalsortalgorithm-2.html index b1fa131ed..6cf936a21 100644 --- a/reference/quickgraph-algorithms-topologicalsort-undirectedtopologicalsortalgorithm-2.html +++ b/reference/quickgraph-algorithms-topologicalsort-undirectedtopologicalsortalgorithm-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(g) -
        +
        Signature: g:IUndirectedGraph<'TVertex,'TEdge> -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(g, vertices) -
        +
        Signature: (g:IUndirectedGraph<'TVertex,'TEdge> * vertices:IList<'TVertex>) -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + AllowCyclicGraph() -
        +
        Signature: unit -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + Compute(vertices) -
        +
        Signature: vertices:IList<'TVertex> -> unit
        @@ -114,10 +114,10 @@

        Instance members

        - + SortedVertices -
        +
        Signature: IList<'TVertex>
        diff --git a/reference/quickgraph-algorithms-transitiveclosurealgorithm-2.html b/reference/quickgraph-algorithms-transitiveclosurealgorithm-2.html new file mode 100644 index 000000000..3b2e698ad --- /dev/null +++ b/reference/quickgraph-algorithms-transitiveclosurealgorithm-2.html @@ -0,0 +1,112 @@ + + + + + TransitiveClosureAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
        +
        + +

        QuickGraph

        +
        +
        +
        +
        + + + + +

        TransitiveClosureAlgorithm<'TVertex, 'TEdge>

        +

        + Namespace: QuickGraph.Algorithms
        +

        +
        +
        +

        Constructors

        + + + + + + + + + + +
        ConstructorDescription
        + + + new(visitedGraph, createEdge) + +
        + Signature: (visitedGraph:BidirectionalGraph<'TVertex,'TEdge> * createEdge:Func<'TVertex,'TVertex,'TEdge>) -> unit
        +
        +         		+ +
        +

        Instance members

        + + + + + + + + + + +
        Instance memberDescription
        + + + TransitiveClosure() + +
        + Signature: unit -> unit
        +
        +         		+ +
        + +
        +
        + F# Project + +
        +
        +
        + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-transitivereductionalgorithm-2.html b/reference/quickgraph-algorithms-transitivereductionalgorithm-2.html new file mode 100644 index 000000000..fae70cb73 --- /dev/null +++ b/reference/quickgraph-algorithms-transitivereductionalgorithm-2.html @@ -0,0 +1,112 @@ + + + + + TransitiveReductionAlgorithm<'TVertex, 'TEdge> - QuickGraph + + + + + + + + + + + + + + + +
        +
        + +

        QuickGraph

        +
        +
        +
        +
        + + + + +

        TransitiveReductionAlgorithm<'TVertex, 'TEdge>

        +

        + Namespace: QuickGraph.Algorithms
        +

        +
        +
        +

        Constructors

        + + + + + + + + + + +
        ConstructorDescription
        + + + new(visitedGraph) + +
        + Signature: visitedGraph:BidirectionalGraph<'TVertex,'TEdge> -> unit
        +
        +         		+ +
        +

        Instance members

        + + + + + + + + + + +
        Instance memberDescription
        + + + TransitiveReduction() + +
        + Signature: unit -> unit
        +
        +         		+ +
        + +
        +
        + F# Project + +
        +
        +
        + Fork me on GitHub + + diff --git a/reference/quickgraph-algorithms-tsp-taskpriority.html b/reference/quickgraph-algorithms-tsp-taskpriority.html index a2db9711d..8b1aba08b 100644 --- a/reference/quickgraph-algorithms-tsp-taskpriority.html +++ b/reference/quickgraph-algorithms-tsp-taskpriority.html @@ -50,10 +50,10 @@

        Constructors

        - + new(cost, pathSize) -
        +
        Signature: (cost:float * pathSize:int) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + CompareTo(other) -
        +
        Signature: other:TaskPriority -> int
        Modifiers: abstract
        diff --git a/reference/quickgraph-algorithms-tsp-tsp-3.html b/reference/quickgraph-algorithms-tsp-tsp-3.html index 3a8599cdc..ff24fd4fa 100644 --- a/reference/quickgraph-algorithms-tsp-tsp-3.html +++ b/reference/quickgraph-algorithms-tsp-tsp-3.html @@ -50,10 +50,10 @@

        Constructors

        - + new(visitedGraph, weights) -
        +
        Signature: (visitedGraph:'TGraph * weights:Func<'TEdge,float>) -> unit
        diff --git a/reference/quickgraph-arrayadjacencygraph-2.html b/reference/quickgraph-arrayadjacencygraph-2.html index 1e54b079f..f02bde987 100644 --- a/reference/quickgraph-arrayadjacencygraph-2.html +++ b/reference/quickgraph-arrayadjacencygraph-2.html @@ -53,10 +53,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> unit
        @@ -75,10 +75,10 @@

        Instance members

        - + AllowParallelEdges -
        +
        Signature: bool
        Modifiers: abstract
        @@ -90,10 +90,10 @@

        Instance members

        - + Clone() -
        +
        Signature: unit -> ArrayAdjacencyGraph<'TVertex,'TEdge>
        @@ -106,10 +106,10 @@

        Instance members

        - + ContainsEdge(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> bool
        Modifiers: abstract
        @@ -121,10 +121,10 @@

        Instance members

        - + ContainsEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -136,10 +136,10 @@

        Instance members

        - + ContainsVertex(vertex) -
        +
        Signature: vertex:'TVertex -> bool
        Modifiers: abstract
        @@ -151,10 +151,10 @@

        Instance members

        - + EdgeCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -166,10 +166,10 @@

        Instance members

        - + Edges -
        +
        Signature: IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -181,10 +181,10 @@

        Instance members

        - + IsDirected -
        +
        Signature: bool
        Modifiers: abstract
        @@ -196,10 +196,10 @@

        Instance members

        - + IsEdgesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -211,10 +211,10 @@

        Instance members

        - + IsOutEdgesEmpty(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -226,10 +226,10 @@

        Instance members

        - + IsVerticesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -241,10 +241,10 @@

        Instance members

        - + OutDegree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -256,10 +256,10 @@

        Instance members

        - + OutEdge(v, index) -
        +
        Signature: (v:'TVertex * index:int) -> 'TEdge
        Modifiers: abstract
        @@ -271,10 +271,10 @@

        Instance members

        - + OutEdges(v) -
        +
        Signature: v:'TVertex -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -286,10 +286,10 @@

        Instance members

        - + TryGetEdge(source, target, edge) -
        +
        Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
        Modifiers: abstract
        @@ -301,10 +301,10 @@

        Instance members

        - + TryGetEdges(source, target, edges) -
        +
        Signature: (source:'TVertex * target:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        @@ -316,10 +316,10 @@

        Instance members

        - + TryGetOutEdges(v, edges) -
        +
        Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        @@ -331,10 +331,10 @@

        Instance members

        - + VertexCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -346,10 +346,10 @@

        Instance members

        - + Vertices -
        +
        Signature: IEnumerable<'TVertex>
        Modifiers: abstract
        diff --git a/reference/quickgraph-arraybidirectionalgraph-2.html b/reference/quickgraph-arraybidirectionalgraph-2.html index e0d1fdbe9..a4f55888d 100644 --- a/reference/quickgraph-arraybidirectionalgraph-2.html +++ b/reference/quickgraph-arraybidirectionalgraph-2.html @@ -53,10 +53,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> -> unit
        @@ -78,10 +78,10 @@

        Instance members

        - + AllowParallelEdges -
        +
        Signature: bool
        Modifiers: abstract
        @@ -93,10 +93,10 @@

        Instance members

        - + Clone() -
        +
        Signature: unit -> ArrayBidirectionalGraph<'TVertex,'TEdge>
        @@ -109,10 +109,10 @@

        Instance members

        - + ContainsEdge(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> bool
        Modifiers: abstract
        @@ -124,10 +124,10 @@

        Instance members

        - + ContainsEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -139,10 +139,10 @@

        Instance members

        - + ContainsVertex(vertex) -
        +
        Signature: vertex:'TVertex -> bool
        Modifiers: abstract
        @@ -154,10 +154,10 @@

        Instance members

        - + Degree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -169,10 +169,10 @@

        Instance members

        - + EdgeCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -184,10 +184,10 @@

        Instance members

        - + Edges -
        +
        Signature: IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -199,10 +199,10 @@

        Instance members

        - + InDegree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -214,10 +214,10 @@

        Instance members

        - + InEdge(v, index) -
        +
        Signature: (v:'TVertex * index:int) -> 'TEdge
        Modifiers: abstract
        @@ -229,10 +229,10 @@

        Instance members

        - + InEdges(v) -
        +
        Signature: v:'TVertex -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -244,10 +244,10 @@

        Instance members

        - + IsDirected -
        +
        Signature: bool
        Modifiers: abstract
        @@ -259,10 +259,10 @@

        Instance members

        - + IsEdgesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -274,10 +274,10 @@

        Instance members

        - + IsInEdgesEmpty(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -289,10 +289,10 @@

        Instance members

        - + IsOutEdgesEmpty(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -304,10 +304,10 @@

        Instance members

        - + IsVerticesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -319,10 +319,10 @@

        Instance members

        - + OutDegree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -334,10 +334,10 @@

        Instance members

        - + OutEdge(v, index) -
        +
        Signature: (v:'TVertex * index:int) -> 'TEdge
        Modifiers: abstract
        @@ -349,10 +349,10 @@

        Instance members

        - + OutEdges(v) -
        +
        Signature: v:'TVertex -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -364,10 +364,10 @@

        Instance members

        - + TryGetEdge(source, target, edge) -
        +
        Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
        Modifiers: abstract
        @@ -379,10 +379,10 @@

        Instance members

        - + TryGetEdges(source, target, edges) -
        +
        Signature: (source:'TVertex * target:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        @@ -394,10 +394,10 @@

        Instance members

        - + TryGetInEdges(v, edges) -
        +
        Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        @@ -409,10 +409,10 @@

        Instance members

        - + TryGetOutEdges(v, edges) -
        +
        Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        @@ -424,10 +424,10 @@

        Instance members

        - + VertexCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -439,10 +439,10 @@

        Instance members

        - + Vertices -
        +
        Signature: IEnumerable<'TVertex>
        Modifiers: abstract
        diff --git a/reference/quickgraph-arrayequalitycomparer-1.html b/reference/quickgraph-arrayequalitycomparer-1.html index d1e989731..f9972c814 100644 --- a/reference/quickgraph-arrayequalitycomparer-1.html +++ b/reference/quickgraph-arrayequalitycomparer-1.html @@ -52,10 +52,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -68,10 +68,10 @@

        Constructors

        - + new(elementEqualityComparer) -
        +
        Signature: elementEqualityComparer:IEqualityComparer<'T> -> unit
        @@ -92,10 +92,10 @@

        Instance members

        - + ElementEqualityComparer() -
        +
        Signature: unit -> unit
        @@ -108,10 +108,10 @@

        Instance members

        - + Equals(x, y) -
        +
        Signature: (x:'T [] * y:'T []) -> bool
        Modifiers: abstract
        @@ -125,10 +125,10 @@

        Instance members

        - + GetHashCode(x) -
        +
        Signature: (x:'T []) -> int
        Modifiers: abstract
        diff --git a/reference/quickgraph-arrayundirectedgraph-2.html b/reference/quickgraph-arrayundirectedgraph-2.html index 16454c819..7423b4e35 100644 --- a/reference/quickgraph-arrayundirectedgraph-2.html +++ b/reference/quickgraph-arrayundirectedgraph-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(graph) -
        +
        Signature: graph:IUndirectedGraph<'TVertex,'TEdge> -> unit
        @@ -74,10 +74,10 @@

        Instance members

        - + AdjacentDegree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -89,10 +89,10 @@

        Instance members

        - + AdjacentEdge(v, index) -
        +
        Signature: (v:'TVertex * index:int) -> 'TEdge
        Modifiers: abstract
        @@ -104,10 +104,10 @@

        Instance members

        - + AdjacentEdges(v) -
        +
        Signature: v:'TVertex -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -119,10 +119,10 @@

        Instance members

        - + AllowParallelEdges -
        +
        Signature: bool
        Modifiers: abstract
        @@ -134,10 +134,10 @@

        Instance members

        - + Clone() -
        +
        Signature: unit -> ArrayUndirectedGraph<'TVertex,'TEdge>
        @@ -150,10 +150,10 @@

        Instance members

        - + ContainsEdge(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> bool
        Modifiers: abstract
        @@ -165,10 +165,10 @@

        Instance members

        - + ContainsEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -180,10 +180,10 @@

        Instance members

        - + ContainsVertex(vertex) -
        +
        Signature: vertex:'TVertex -> bool
        Modifiers: abstract
        @@ -195,10 +195,10 @@

        Instance members

        - + EdgeCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -210,10 +210,10 @@

        Instance members

        - + EdgeEqualityComparer -
        +
        Signature: EdgeEqualityComparer<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -225,10 +225,10 @@

        Instance members

        - + Edges -
        +
        Signature: IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -240,10 +240,10 @@

        Instance members

        - + IsAdjacentEdgesEmpty(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -255,10 +255,10 @@

        Instance members

        - + IsDirected -
        +
        Signature: bool
        Modifiers: abstract
        @@ -270,10 +270,10 @@

        Instance members

        - + IsEdgesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -285,10 +285,10 @@

        Instance members

        - + IsVerticesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -300,10 +300,10 @@

        Instance members

        - + TryGetEdge(source, target, edge) -
        +
        Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
        Modifiers: abstract
        @@ -315,10 +315,10 @@

        Instance members

        - + VertexCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -330,10 +330,10 @@

        Instance members

        - + Vertices -
        +
        Signature: IEnumerable<'TVertex>
        Modifiers: abstract
        diff --git a/reference/quickgraph-bidirectionadaptergraph-2.html b/reference/quickgraph-bidirectionadaptergraph-2.html index ec62399d5..0f65ab94b 100644 --- a/reference/quickgraph-bidirectionadaptergraph-2.html +++ b/reference/quickgraph-bidirectionadaptergraph-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(baseGraph) -
        +
        Signature: baseGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> unit
        @@ -74,10 +74,10 @@

        Instance members

        - + AllowParallelEdges -
        +
        Signature: bool
        Modifiers: abstract
        @@ -89,10 +89,10 @@

        Instance members

        - + ContainsEdge(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> bool
        Modifiers: abstract
        @@ -104,10 +104,10 @@

        Instance members

        - + ContainsEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -119,10 +119,10 @@

        Instance members

        - + ContainsVertex(vertex) -
        +
        Signature: vertex:'TVertex -> bool
        Modifiers: abstract
        @@ -134,10 +134,10 @@

        Instance members

        - + Degree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -149,10 +149,10 @@

        Instance members

        - + EdgeCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -164,10 +164,10 @@

        Instance members

        - + Edges -
        +
        Signature: IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -179,10 +179,10 @@

        Instance members

        - + InDegree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -194,10 +194,10 @@

        Instance members

        - + InEdge(v, index) -
        +
        Signature: (v:'TVertex * index:int) -> 'TEdge
        Modifiers: abstract
        @@ -209,10 +209,10 @@

        Instance members

        - + InEdges(v) -
        +
        Signature: v:'TVertex -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -224,10 +224,10 @@

        Instance members

        - + IsDirected -
        +
        Signature: bool
        Modifiers: abstract
        @@ -239,10 +239,10 @@

        Instance members

        - + IsEdgesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -254,10 +254,10 @@

        Instance members

        - + IsInEdgesEmpty(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -269,10 +269,10 @@

        Instance members

        - + IsOutEdgesEmpty(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -284,10 +284,10 @@

        Instance members

        - + IsVerticesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -299,10 +299,10 @@

        Instance members

        - + OutDegree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -314,10 +314,10 @@

        Instance members

        - + OutEdge(v, index) -
        +
        Signature: (v:'TVertex * index:int) -> 'TEdge
        Modifiers: abstract
        @@ -329,10 +329,10 @@

        Instance members

        - + OutEdges(v) -
        +
        Signature: v:'TVertex -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -344,10 +344,10 @@

        Instance members

        - + TryGetEdge(source, target, edge) -
        +
        Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
        Modifiers: abstract
        @@ -359,10 +359,10 @@

        Instance members

        - + TryGetEdges(source, target, edges) -
        +
        Signature: (source:'TVertex * target:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        @@ -374,10 +374,10 @@

        Instance members

        - + TryGetInEdges(v, edges) -
        +
        Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        @@ -389,10 +389,10 @@

        Instance members

        - + TryGetOutEdges(v, edges) -
        +
        Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        @@ -404,10 +404,10 @@

        Instance members

        - + VertexCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -419,10 +419,10 @@

        Instance members

        - + Vertices -
        +
        Signature: IEnumerable<'TVertex>
        Modifiers: abstract
        diff --git a/reference/quickgraph-bidirectionalgraph-2.html b/reference/quickgraph-bidirectionalgraph-2.html index c4740224c..f33f387f2 100644 --- a/reference/quickgraph-bidirectionalgraph-2.html +++ b/reference/quickgraph-bidirectionalgraph-2.html @@ -54,10 +54,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -68,10 +68,10 @@

        Constructors

        - + new(allowParallelEdges) -
        +
        Signature: allowParallelEdges:bool -> unit
        @@ -82,10 +82,10 @@

        Constructors

        - + new(allowParallelEdges, vertexCapacity) -
        +
        Signature: (allowParallelEdges:bool * vertexCapacity:int) -> unit
        @@ -96,10 +96,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (allowParallelEdges:bool * capacity:int * vertexEdgesDictionaryFactory:Func<int,IVertexEdgeDictionary<'TVertex,'TEdge>>) -> unit
        @@ -110,10 +110,10 @@

        Constructors

        - + new(other) -
        +
        Signature: other:BidirectionalGraph<'TVertex,'TEdge> -> unit
        @@ -134,10 +134,10 @@

        Instance members

        - + AddEdge(e) -
        +
        Signature: e:'TEdge -> bool
        Modifiers: abstract
        @@ -149,10 +149,10 @@

        Instance members

        - + AddEdgeRange(edges) -
        +
        Signature: edges:IEnumerable<'TEdge> -> int
        Modifiers: abstract
        @@ -164,10 +164,10 @@

        Instance members

        - + AddVertex(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -179,10 +179,10 @@

        Instance members

        - + AddVertexRange(vertices) -
        +
        Signature: vertices:IEnumerable<'TVertex> -> int
        Modifiers: abstract
        @@ -194,10 +194,10 @@

        Instance members

        - + AddVerticesAndEdge(e) -
        +
        Signature: e:'TEdge -> bool
        Modifiers: abstract
        @@ -209,10 +209,10 @@

        Instance members

        - + AddVerticesAndEdgeRange(edges) -
        +
        Signature: edges:IEnumerable<'TEdge> -> int
        Modifiers: abstract
        @@ -224,10 +224,10 @@

        Instance members

        - + AllowParallelEdges -
        +
        Signature: bool
        Modifiers: abstract
        @@ -239,10 +239,10 @@

        Instance members

        - + Clear() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -254,10 +254,10 @@

        Instance members

        - + ClearEdges(v) -
        +
        Signature: v:'TVertex -> unit
        Modifiers: abstract
        @@ -269,10 +269,10 @@

        Instance members

        - + ClearInEdges(v) -
        +
        Signature: v:'TVertex -> unit
        Modifiers: abstract
        @@ -284,10 +284,10 @@

        Instance members

        - + ClearOutEdges(v) -
        +
        Signature: v:'TVertex -> unit
        Modifiers: abstract
        @@ -299,10 +299,10 @@

        Instance members

        - + Clone() -
        +
        Signature: unit -> BidirectionalGraph<'TVertex,'TEdge>
        @@ -313,10 +313,10 @@

        Instance members

        - + ContainsEdge(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> bool
        Modifiers: abstract
        @@ -328,10 +328,10 @@

        Instance members

        - + ContainsEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -343,10 +343,10 @@

        Instance members

        - + ContainsVertex(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -358,10 +358,10 @@

        Instance members

        - + Degree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -373,10 +373,10 @@

        Instance members

        - + EdgeAdded -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -388,10 +388,10 @@

        Instance members

        - + EdgeCapacity() -
        +
        Signature: unit -> unit
        @@ -402,10 +402,10 @@

        Instance members

        - + EdgeCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -417,10 +417,10 @@

        Instance members

        - + EdgeRemoved -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -432,10 +432,10 @@

        Instance members

        - + Edges -
        +
        Signature: IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -447,10 +447,10 @@

        Instance members

        - + InDegree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -462,10 +462,10 @@

        Instance members

        - + InEdge(v, index) -
        +
        Signature: (v:'TVertex * index:int) -> 'TEdge
        Modifiers: abstract
        @@ -477,10 +477,10 @@

        Instance members

        - + InEdges(v) -
        +
        Signature: v:'TVertex -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -492,10 +492,10 @@

        Instance members

        - + IsDirected -
        +
        Signature: bool
        Modifiers: abstract
        @@ -507,10 +507,10 @@

        Instance members

        - + IsEdgesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -522,10 +522,10 @@

        Instance members

        - + IsInEdgesEmpty(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -537,10 +537,10 @@

        Instance members

        - + IsOutEdgesEmpty(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -552,10 +552,10 @@

        Instance members

        - + IsVerticesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -567,10 +567,10 @@

        Instance members

        - + MergeVertex(v, edgeFactory) -
        +
        Signature: (v:'TVertex * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
        @@ -581,10 +581,10 @@

        Instance members

        - + MergeVertexIf(...) -
        +
        Signature: (vertexPredicate:VertexPredicate<'TVertex> * edgeFactory:EdgeFactory<'TVertex,'TEdge>) -> unit
        @@ -595,10 +595,10 @@

        Instance members

        - + OutDegree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -610,10 +610,10 @@

        Instance members

        - + OutEdge(v, index) -
        +
        Signature: (v:'TVertex * index:int) -> 'TEdge
        Modifiers: abstract
        @@ -625,10 +625,10 @@

        Instance members

        - + OutEdges(v) -
        +
        Signature: v:'TVertex -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -640,10 +640,10 @@

        Instance members

        - + RemoveEdge(e) -
        +
        Signature: e:'TEdge -> bool
        Modifiers: abstract
        @@ -655,10 +655,10 @@

        Instance members

        - + RemoveEdgeIf(predicate) -
        +
        Signature: predicate:EdgePredicate<'TVertex,'TEdge> -> int
        Modifiers: abstract
        @@ -670,10 +670,10 @@

        Instance members

        - + RemoveInEdgeIf(v, predicate) -
        +
        Signature: (v:'TVertex * predicate:EdgePredicate<'TVertex,'TEdge>) -> int
        Modifiers: abstract
        @@ -685,10 +685,10 @@

        Instance members

        - + RemoveOutEdgeIf(v, predicate) -
        +
        Signature: (v:'TVertex * predicate:EdgePredicate<'TVertex,'TEdge>) -> int
        Modifiers: abstract
        @@ -700,10 +700,10 @@

        Instance members

        - + RemoveVertex(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -715,10 +715,10 @@

        Instance members

        - + RemoveVertexIf(predicate) -
        +
        Signature: predicate:VertexPredicate<'TVertex> -> int
        Modifiers: abstract
        @@ -730,10 +730,10 @@

        Instance members

        - + TrimEdgeExcess() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -745,10 +745,10 @@

        Instance members

        - + TryGetEdge(source, target, edge) -
        +
        Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
        Modifiers: abstract
        @@ -760,10 +760,10 @@

        Instance members

        - + TryGetEdges(source, target, edges) -
        +
        Signature: (source:'TVertex * target:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        @@ -775,10 +775,10 @@

        Instance members

        - + TryGetInEdges(v, edges) -
        +
        Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        @@ -790,10 +790,10 @@

        Instance members

        - + TryGetOutEdges(v, edges) -
        +
        Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        @@ -805,10 +805,10 @@

        Instance members

        - + VertexAdded -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -820,10 +820,10 @@

        Instance members

        - + VertexCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -835,10 +835,10 @@

        Instance members

        - + VertexRemoved -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -850,10 +850,10 @@

        Instance members

        - + Vertices -
        +
        Signature: IEnumerable<'TVertex>
        Modifiers: abstract
        @@ -873,10 +873,10 @@

        Static members

        - + EdgeType -
        +
        Signature: Type
        @@ -887,10 +887,10 @@

        Static members

        - + LoadDot(dotSource, vertexFunc, edgeFunc) -
        +
        Signature: (dotSource:string * vertexFunc:Func<string,IDictionary<string,string>,'TVertex> * edgeFunc:Func<'TVertex,'TVertex,IDictionary<string,string>,'TEdge>) -> BidirectionalGraph<'TVertex,'TEdge>
        diff --git a/reference/quickgraph-bidirectionalmatrixgraph-1.html b/reference/quickgraph-bidirectionalmatrixgraph-1.html index d408b67b5..33df55a40 100644 --- a/reference/quickgraph-bidirectionalmatrixgraph-1.html +++ b/reference/quickgraph-bidirectionalmatrixgraph-1.html @@ -50,10 +50,10 @@

        Constructors

        - + new(vertexCount) -
        +
        Signature: vertexCount:int -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + AddEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + AddEdgeRange(edges) -
        +
        Signature: edges:IEnumerable<'TEdge> -> int
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + AllowParallelEdges -
        +
        Signature: bool
        Modifiers: abstract
        @@ -117,10 +117,10 @@

        Instance members

        - + Clear() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -132,10 +132,10 @@

        Instance members

        - + ClearEdges(v) -
        +
        Signature: v:int -> unit
        @@ -146,10 +146,10 @@

        Instance members

        - + ClearInEdges(v) -
        +
        Signature: v:int -> unit
        @@ -160,10 +160,10 @@

        Instance members

        - + ClearOutEdges(v) -
        +
        Signature: v:int -> unit
        @@ -174,10 +174,10 @@

        Instance members

        - + Clone() -
        +
        Signature: unit -> BidirectionalMatrixGraph<'TEdge>
        @@ -188,10 +188,10 @@

        Instance members

        - + ContainsEdge(source, target) -
        +
        Signature: (source:int * target:int) -> bool
        Modifiers: abstract
        @@ -203,10 +203,10 @@

        Instance members

        - + ContainsEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -218,10 +218,10 @@

        Instance members

        - + ContainsVertex(vertex) -
        +
        Signature: vertex:int -> bool
        Modifiers: abstract
        @@ -233,10 +233,10 @@

        Instance members

        - + Degree(v) -
        +
        Signature: v:int -> int
        Modifiers: abstract
        @@ -248,10 +248,10 @@

        Instance members

        - + EdgeAdded -
        +
        Signature: EdgeAction<int,'TEdge>
        Modifiers: abstract
        @@ -263,10 +263,10 @@

        Instance members

        - + EdgeCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -278,10 +278,10 @@

        Instance members

        - + EdgeRemoved -
        +
        Signature: EdgeAction<int,'TEdge>
        Modifiers: abstract
        @@ -293,10 +293,10 @@

        Instance members

        - + Edges -
        +
        Signature: IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -308,10 +308,10 @@

        Instance members

        - + InDegree(v) -
        +
        Signature: v:int -> int
        Modifiers: abstract
        @@ -323,10 +323,10 @@

        Instance members

        - + InEdge(v, index) -
        +
        Signature: (v:int * index:int) -> 'TEdge
        Modifiers: abstract
        @@ -338,10 +338,10 @@

        Instance members

        - + InEdges(v) -
        +
        Signature: v:int -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -353,10 +353,10 @@

        Instance members

        - + IsDirected -
        +
        Signature: bool
        Modifiers: abstract
        @@ -368,10 +368,10 @@

        Instance members

        - + IsEdgesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -383,10 +383,10 @@

        Instance members

        - + IsInEdgesEmpty(v) -
        +
        Signature: v:int -> bool
        Modifiers: abstract
        @@ -398,10 +398,10 @@

        Instance members

        - + IsOutEdgesEmpty(v) -
        +
        Signature: v:int -> bool
        Modifiers: abstract
        @@ -413,10 +413,10 @@

        Instance members

        - + IsVerticesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -428,10 +428,10 @@

        Instance members

        - + OutDegree(v) -
        +
        Signature: v:int -> int
        Modifiers: abstract
        @@ -443,10 +443,10 @@

        Instance members

        - + OutEdge(v, index) -
        +
        Signature: (v:int * index:int) -> 'TEdge
        Modifiers: abstract
        @@ -458,10 +458,10 @@

        Instance members

        - + OutEdges(v) -
        +
        Signature: v:int -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -473,10 +473,10 @@

        Instance members

        - + RemoveEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -488,10 +488,10 @@

        Instance members

        - + RemoveEdgeIf(predicate) -
        +
        Signature: predicate:EdgePredicate<int,'TEdge> -> int
        Modifiers: abstract
        @@ -503,10 +503,10 @@

        Instance members

        - + RemoveInEdgeIf(v, edgePredicate) -
        +
        Signature: (v:int * edgePredicate:EdgePredicate<int,'TEdge>) -> int
        @@ -517,10 +517,10 @@

        Instance members

        - + RemoveOutEdgeIf(v, predicate) -
        +
        Signature: (v:int * predicate:EdgePredicate<int,'TEdge>) -> int
        @@ -531,10 +531,10 @@

        Instance members

        - + TryGetEdge(source, target, edge) -
        +
        Signature: (source:int * target:int * edge:byref<'TEdge>) -> bool
        Modifiers: abstract
        @@ -546,10 +546,10 @@

        Instance members

        - + TryGetEdges(source, target, edges) -
        +
        Signature: (source:int * target:int * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        @@ -561,10 +561,10 @@

        Instance members

        - + TryGetInEdges(v, edges) -
        +
        Signature: (v:int * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        @@ -576,10 +576,10 @@

        Instance members

        - + TryGetOutEdges(v, edges) -
        +
        Signature: (v:int * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        @@ -591,10 +591,10 @@

        Instance members

        - + VertexCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -606,10 +606,10 @@

        Instance members

        - + Vertices -
        +
        Signature: IEnumerable<int>
        Modifiers: abstract
        diff --git a/reference/quickgraph-clusteredadjacencygraph-2.html b/reference/quickgraph-clusteredadjacencygraph-2.html index 003e4b899..99242e5ae 100644 --- a/reference/quickgraph-clusteredadjacencygraph-2.html +++ b/reference/quickgraph-clusteredadjacencygraph-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(wrapped) -
        +
        Signature: wrapped:AdjacencyGraph<'TVertex,'TEdge> -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(parent) -
        +
        Signature: parent:ClusteredAdjacencyGraph<'TVertex,'TEdge> -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + AddCluster() -
        +
        Signature: unit -> ClusteredAdjacencyGraph<'TVertex,'TEdge>
        @@ -100,10 +100,10 @@

        Instance members

        - + AddEdge(e) -
        +
        Signature: e:'TEdge -> bool
        Modifiers: abstract
        @@ -115,10 +115,10 @@

        Instance members

        - + AddEdgeRange(edges) -
        +
        Signature: edges:IEnumerable<'TEdge> -> int
        @@ -129,10 +129,10 @@

        Instance members

        - + AddVertex(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -144,10 +144,10 @@

        Instance members

        - + AddVertexRange(vertices) -
        +
        Signature: vertices:IEnumerable<'TVertex> -> int
        Modifiers: abstract
        @@ -159,10 +159,10 @@

        Instance members

        - + AddVerticesAndEdge(e) -
        +
        Signature: e:'TEdge -> bool
        Modifiers: abstract
        @@ -174,10 +174,10 @@

        Instance members

        - + AddVerticesAndEdgeRange(edges) -
        +
        Signature: edges:IEnumerable<'TEdge> -> int
        @@ -188,10 +188,10 @@

        Instance members

        - + AllowParallelEdges -
        +
        Signature: bool
        Modifiers: abstract
        @@ -203,10 +203,10 @@

        Instance members

        - + Clear() -
        +
        Signature: unit -> unit
        @@ -217,10 +217,10 @@

        Instance members

        - + ClearOutEdges(v) -
        +
        Signature: v:'TVertex -> unit
        @@ -231,10 +231,10 @@

        Instance members

        - + Clusters -
        +
        Signature: IEnumerable
        Modifiers: abstract
        @@ -246,10 +246,10 @@

        Instance members

        - + ClustersCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -261,10 +261,10 @@

        Instance members

        - + Colapsed() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -276,10 +276,10 @@

        Instance members

        - + ContainsEdge(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> bool
        Modifiers: abstract
        @@ -291,10 +291,10 @@

        Instance members

        - + ContainsEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -306,10 +306,10 @@

        Instance members

        - + ContainsVertex(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -321,10 +321,10 @@

        Instance members

        - + EdgeCapacity() -
        +
        Signature: unit -> unit
        @@ -335,10 +335,10 @@

        Instance members

        - + EdgeCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -350,10 +350,10 @@

        Instance members

        - + Edges -
        +
        Signature: IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -365,10 +365,10 @@

        Instance members

        - + IsDirected -
        +
        Signature: bool
        Modifiers: abstract
        @@ -380,10 +380,10 @@

        Instance members

        - + IsEdgesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -395,10 +395,10 @@

        Instance members

        - + IsOutEdgesEmpty(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -410,10 +410,10 @@

        Instance members

        - + IsVerticesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -425,10 +425,10 @@

        Instance members

        - + OutDegree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -440,10 +440,10 @@

        Instance members

        - + OutEdge(v, index) -
        +
        Signature: (v:'TVertex * index:int) -> 'TEdge
        Modifiers: abstract
        @@ -455,10 +455,10 @@

        Instance members

        - + OutEdges(v) -
        +
        Signature: v:'TVertex -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -470,10 +470,10 @@

        Instance members

        - + Parent -
        +
        Signature: ClusteredAdjacencyGraph<'TVertex,'TEdge>
        @@ -484,10 +484,10 @@

        Instance members

        - + RemoveCluster(cluster) -
        +
        Signature: cluster:IClusteredGraph -> unit
        Modifiers: abstract
        @@ -499,10 +499,10 @@

        Instance members

        - + RemoveEdge(e) -
        +
        Signature: e:'TEdge -> bool
        Modifiers: abstract
        @@ -514,10 +514,10 @@

        Instance members

        - + RemoveEdgeIf(predicate) -
        +
        Signature: predicate:EdgePredicate<'TVertex,'TEdge> -> int
        @@ -528,10 +528,10 @@

        Instance members

        - + RemoveOutEdgeIf(v, predicate) -
        +
        Signature: (v:'TVertex * predicate:EdgePredicate<'TVertex,'TEdge>) -> int
        @@ -542,10 +542,10 @@

        Instance members

        - + RemoveVertex(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -557,10 +557,10 @@

        Instance members

        - + RemoveVertexIf(predicate) -
        +
        Signature: predicate:VertexPredicate<'TVertex> -> int
        @@ -571,10 +571,10 @@

        Instance members

        - + TryGetEdge(source, target, edge) -
        +
        Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
        Modifiers: abstract
        @@ -586,10 +586,10 @@

        Instance members

        - + TryGetEdges(source, target, edges) -
        +
        Signature: (source:'TVertex * target:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        @@ -601,10 +601,10 @@

        Instance members

        - + TryGetOutEdges(v, edges) -
        +
        Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        @@ -616,10 +616,10 @@

        Instance members

        - + VertexCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -631,10 +631,10 @@

        Instance members

        - + Vertices -
        +
        Signature: IEnumerable<'TVertex>
        Modifiers: abstract
        @@ -646,10 +646,10 @@

        Instance members

        - + Wrapped -
        +
        Signature: AdjacencyGraph<'TVertex,'TEdge>
        @@ -668,10 +668,10 @@

        Static members

        - + EdgeType -
        +
        Signature: Type
        diff --git a/reference/quickgraph-collections-binaryheap-2.html b/reference/quickgraph-collections-binaryheap-2.html index 1f22b2842..de799d66a 100644 --- a/reference/quickgraph-collections-binaryheap-2.html +++ b/reference/quickgraph-collections-binaryheap-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -66,10 +66,10 @@

        Constructors

        - + new(priorityComparison) -
        +
        Signature: priorityComparison:Comparison<'TPriority> -> unit
        @@ -80,10 +80,10 @@

        Constructors

        - + new(capacity, priorityComparison) -
        +
        Signature: (capacity:int * priorityComparison:Comparison<'TPriority>) -> unit
        @@ -102,10 +102,10 @@

        Instance members

        - + Add(priority, value) -
        +
        Signature: (priority:'TPriority * value:'TValue) -> unit
        @@ -116,10 +116,10 @@

        Instance members

        - + Capacity -
        +
        Signature: int
        @@ -130,10 +130,10 @@

        Instance members

        - + Count -
        +
        Signature: int
        @@ -144,10 +144,10 @@

        Instance members

        - + GetEnumerator() -
        +
        Signature: unit -> IEnumerator<KeyValuePair<'TPriority,'TValue>>
        Modifiers: abstract
        @@ -159,10 +159,10 @@

        Instance members

        - + IndexOf(value) -
        +
        Signature: value:'TValue -> int
        @@ -173,10 +173,10 @@

        Instance members

        - + IsConsistent() -
        +
        Signature: unit -> bool
        @@ -187,10 +187,10 @@

        Instance members

        - + Minimum() -
        +
        Signature: unit -> KeyValuePair<'TPriority,'TValue>
        @@ -201,10 +201,10 @@

        Instance members

        - + MinimumUpdate(priority, value) -
        +
        Signature: (priority:'TPriority * value:'TValue) -> bool
        @@ -215,10 +215,10 @@

        Instance members

        - + PriorityComparison -
        +
        Signature: Comparison<'TPriority>
        @@ -229,10 +229,10 @@

        Instance members

        - + RemoveAt(index) -
        +
        Signature: index:int -> KeyValuePair<'TPriority,'TValue>
        @@ -246,10 +246,10 @@

        Instance members

        - + RemoveMinimum() -
        +
        Signature: unit -> KeyValuePair<'TPriority,'TValue>
        @@ -260,10 +260,10 @@

        Instance members

        - + ToPriorityValueArray() -
        +
        Signature: unit -> KeyValuePair<'TPriority,'TValue> []
        @@ -274,10 +274,10 @@

        Instance members

        - + ToString2() -
        +
        Signature: unit -> string
        @@ -288,10 +288,10 @@

        Instance members

        - + ToStringTree() -
        +
        Signature: unit -> string
        @@ -302,10 +302,10 @@

        Instance members

        - + ToValueArray() -
        +
        Signature: unit -> 'TValue []
        @@ -316,10 +316,10 @@

        Instance members

        - + Update(priority, value) -
        +
        Signature: (priority:'TPriority * value:'TValue) -> unit
        diff --git a/reference/quickgraph-collections-binaryqueue-2.html b/reference/quickgraph-collections-binaryqueue-2.html index 0245c5c29..2e236e63c 100644 --- a/reference/quickgraph-collections-binaryqueue-2.html +++ b/reference/quickgraph-collections-binaryqueue-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(distances) -
        +
        Signature: distances:Func<'TVertex,'TDistance> -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(distances, distanceComparison) -
        +
        Signature: (distances:Func<'TVertex,'TDistance> * distanceComparison:Comparison<'TDistance>) -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + Contains(value) -
        +
        Signature: value:'TVertex -> bool
        Modifiers: abstract
        @@ -101,10 +101,10 @@

        Instance members

        - + Count -
        +
        Signature: int
        Modifiers: abstract
        @@ -116,10 +116,10 @@

        Instance members

        - + Dequeue() -
        +
        Signature: unit -> 'TVertex
        Modifiers: abstract
        @@ -131,10 +131,10 @@

        Instance members

        - + Enqueue(value) -
        +
        Signature: value:'TVertex -> unit
        Modifiers: abstract
        @@ -146,10 +146,10 @@

        Instance members

        - + Peek() -
        +
        Signature: unit -> 'TVertex
        Modifiers: abstract
        @@ -161,10 +161,10 @@

        Instance members

        - + ToArray() -
        +
        Signature: unit -> 'TVertex []
        Modifiers: abstract
        @@ -176,10 +176,10 @@

        Instance members

        - + ToArray2() -
        +
        Signature: unit -> KeyValuePair<'TDistance,'TVertex> []
        @@ -190,10 +190,10 @@

        Instance members

        - + ToString2() -
        +
        Signature: unit -> string
        @@ -204,10 +204,10 @@

        Instance members

        - + Update(v) -
        +
        Signature: v:'TVertex -> unit
        Modifiers: abstract
        diff --git a/reference/quickgraph-collections-edgeedgedictionary-2.html b/reference/quickgraph-collections-edgeedgedictionary-2.html index 3e103c07e..b09ed003f 100644 --- a/reference/quickgraph-collections-edgeedgedictionary-2.html +++ b/reference/quickgraph-collections-edgeedgedictionary-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(capacity) -
        +
        Signature: capacity:int -> unit
        @@ -78,10 +78,10 @@

        Constructors

        - + new(info, context) -
        +
        Signature: (info:SerializationInfo * context:StreamingContext) -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + Clone() -
        +
        Signature: unit -> EdgeEdgeDictionary<'TVertex,'TEdge>
        diff --git a/reference/quickgraph-collections-edgelist-2.html b/reference/quickgraph-collections-edgelist-2.html index 2149db4aa..6fb13ee2e 100644 --- a/reference/quickgraph-collections-edgelist-2.html +++ b/reference/quickgraph-collections-edgelist-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(capacity) -
        +
        Signature: capacity:int -> unit
        @@ -78,10 +78,10 @@

        Constructors

        - + new(list) -
        +
        Signature: list:EdgeList<'TVertex,'TEdge> -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + Clone() -
        +
        Signature: unit -> EdgeList<'TVertex,'TEdge>
        diff --git a/reference/quickgraph-collections-fibonacciheap-2.html b/reference/quickgraph-collections-fibonacciheap-2.html index 99ea1e1fb..c2e39e298 100644 --- a/reference/quickgraph-collections-fibonacciheap-2.html +++ b/reference/quickgraph-collections-fibonacciheap-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(Direction) -
        +
        Signature: Direction:HeapDirection -> unit
        @@ -78,10 +78,10 @@

        Constructors

        - + new(Direction, priorityComparison) -
        +
        Signature: (Direction:HeapDirection * priorityComparison:Comparison<'TPriority>) -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + ChangeKey(node, newKey) -
        +
        Signature: (node:FibonacciHeapCell<'TPriority,'TValue> * newKey:'TPriority) -> unit
        @@ -114,10 +114,10 @@

        Instance members

        - + Count -
        +
        Signature: int
        @@ -128,10 +128,10 @@

        Instance members

        - + Delete(node) -
        +
        Signature: node:FibonacciHeapCell<'TPriority,'TValue> -> unit
        @@ -142,10 +142,10 @@

        Instance members

        - + Dequeue() -
        +
        Signature: unit -> KeyValuePair<'TPriority,'TValue>
        @@ -156,10 +156,10 @@

        Instance members

        - + Direction -
        +
        Signature: HeapDirection
        @@ -170,10 +170,10 @@

        Instance members

        - + DrawHeap() -
        +
        Signature: unit -> string
        @@ -184,10 +184,10 @@

        Instance members

        - + Enqueue(Priority, Value) -
        +
        Signature: (Priority:'TPriority * Value:'TValue) -> FibonacciHeapCell<'TPriority,'TValue>
        @@ -198,10 +198,10 @@

        Instance members

        - + GetDestructiveEnumerator() -
        +
        Signature: unit -> IEnumerable<KeyValuePair<'TPriority,'TValue>>
        @@ -212,10 +212,10 @@

        Instance members

        - + GetEnumerator() -
        +
        Signature: unit -> IEnumerator<KeyValuePair<'TPriority,'TValue>>
        Modifiers: abstract
        @@ -227,10 +227,10 @@

        Instance members

        - + IsEmpty -
        +
        Signature: bool
        @@ -241,10 +241,10 @@

        Instance members

        - + Merge(other) -
        +
        Signature: other:FibonacciHeap<'TPriority,'TValue> -> unit
        @@ -255,10 +255,10 @@

        Instance members

        - + PriorityComparison -
        +
        Signature: Comparison<'TPriority>
        @@ -269,10 +269,10 @@

        Instance members

        - + Top -
        +
        Signature: FibonacciHeapCell<'TPriority,'TValue>
        diff --git a/reference/quickgraph-collections-fibonacciheapcell-2.html b/reference/quickgraph-collections-fibonacciheapcell-2.html index 766b8c5d4..4a19010cf 100644 --- a/reference/quickgraph-collections-fibonacciheapcell-2.html +++ b/reference/quickgraph-collections-fibonacciheapcell-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + ToKeyValuePair() -
        +
        Signature: unit -> KeyValuePair<'TPriority,'TValue>
        diff --git a/reference/quickgraph-collections-fibonacciheaplinkedlist-2.html b/reference/quickgraph-collections-fibonacciheaplinkedlist-2.html index d8aefab7d..2ea92e386 100644 --- a/reference/quickgraph-collections-fibonacciheaplinkedlist-2.html +++ b/reference/quickgraph-collections-fibonacciheaplinkedlist-2.html @@ -50,10 +50,10 @@

        Instance members

        - + First -
        +
        Signature: FibonacciHeapCell<'TPriority,'TValue>
        @@ -64,10 +64,10 @@

        Instance members

        - + GetEnumerator() -
        +
        Signature: unit -> IEnumerator<FibonacciHeapCell<'TPriority,'TValue>>
        Modifiers: abstract
        diff --git a/reference/quickgraph-collections-fibonacciqueue-2.html b/reference/quickgraph-collections-fibonacciqueue-2.html index 34c5f0b66..329305647 100644 --- a/reference/quickgraph-collections-fibonacciqueue-2.html +++ b/reference/quickgraph-collections-fibonacciqueue-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(distances) -
        +
        Signature: distances:Func<'TVertex,'TDistance> -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(valueCount, values, distances) -
        +
        Signature: (valueCount:int * values:IEnumerable<'TVertex> * distances:Func<'TVertex,'TDistance>) -> unit
        @@ -78,10 +78,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (valueCount:int * values:IEnumerable<'TVertex> * distances:Func<'TVertex,'TDistance> * distanceComparison:Comparison<'TDistance>) -> unit
        @@ -92,10 +92,10 @@

        Constructors

        - + new(values, distanceComparison) -
        +
        Signature: (values:Dictionary<'TVertex,'TDistance> * distanceComparison:Comparison<'TDistance>) -> unit
        @@ -106,10 +106,10 @@

        Constructors

        - + new(values) -
        +
        Signature: values:Dictionary<'TVertex,'TDistance> -> unit
        @@ -128,10 +128,10 @@

        Instance members

        - + Contains(value) -
        +
        Signature: value:'TVertex -> bool
        Modifiers: abstract
        @@ -143,10 +143,10 @@

        Instance members

        - + Count -
        +
        Signature: int
        Modifiers: abstract
        @@ -158,10 +158,10 @@

        Instance members

        - + Dequeue() -
        +
        Signature: unit -> 'TVertex
        Modifiers: abstract
        @@ -173,10 +173,10 @@

        Instance members

        - + Enqueue(value) -
        +
        Signature: value:'TVertex -> unit
        Modifiers: abstract
        @@ -188,10 +188,10 @@

        Instance members

        - + Peek() -
        +
        Signature: unit -> 'TVertex
        Modifiers: abstract
        @@ -203,10 +203,10 @@

        Instance members

        - + ToArray() -
        +
        Signature: unit -> 'TVertex []
        Modifiers: abstract
        @@ -218,10 +218,10 @@

        Instance members

        - + Update(v) -
        +
        Signature: v:'TVertex -> unit
        Modifiers: abstract
        diff --git a/reference/quickgraph-collections-forestdisjointset-1.html b/reference/quickgraph-collections-forestdisjointset-1.html index 29c50a74b..4457264aa 100644 --- a/reference/quickgraph-collections-forestdisjointset-1.html +++ b/reference/quickgraph-collections-forestdisjointset-1.html @@ -53,10 +53,10 @@

        Constructors

        - + new(elementCapacity) -
        +
        Signature: elementCapacity:int -> unit
        @@ -67,10 +67,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -89,10 +89,10 @@

        Instance members

        - + AreInSameSet(left, right) -
        +
        Signature: (left:'T * right:'T) -> bool
        Modifiers: abstract
        @@ -104,10 +104,10 @@

        Instance members

        - + Contains(value) -
        +
        Signature: value:'T -> bool
        Modifiers: abstract
        @@ -119,10 +119,10 @@

        Instance members

        - + ElementCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -134,10 +134,10 @@

        Instance members

        - + FindSet(value) -
        +
        Signature: value:'T -> 'T
        Modifiers: abstract
        @@ -149,10 +149,10 @@

        Instance members

        - + MakeSet(value) -
        +
        Signature: value:'T -> unit
        Modifiers: abstract
        @@ -166,10 +166,10 @@

        Instance members

        - + SetCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -181,10 +181,10 @@

        Instance members

        - + Union(left, right) -
        +
        Signature: (left:'T * right:'T) -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-collections-idisjointset-1.html b/reference/quickgraph-collections-idisjointset-1.html index 5f1e70226..03567861c 100644 --- a/reference/quickgraph-collections-idisjointset-1.html +++ b/reference/quickgraph-collections-idisjointset-1.html @@ -52,10 +52,10 @@

        Instance members

        - + AreInSameSet(left, right) -
        +
        Signature: (left:'T * right:'T) -> bool
        Modifiers: abstract
        @@ -69,10 +69,10 @@

        Instance members

        - + Contains(value) -
        +
        Signature: value:'T -> bool
        Modifiers: abstract
        @@ -86,10 +86,10 @@

        Instance members

        - + ElementCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -103,10 +103,10 @@

        Instance members

        - + FindSet(value) -
        +
        Signature: value:'T -> 'T
        Modifiers: abstract
        @@ -120,10 +120,10 @@

        Instance members

        - + MakeSet(value) -
        +
        Signature: value:'T -> unit
        Modifiers: abstract
        @@ -137,10 +137,10 @@

        Instance members

        - + SetCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -154,10 +154,10 @@

        Instance members

        - + Union(left, right) -
        +
        Signature: (left:'T * right:'T) -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-collections-iedgelist-2.html b/reference/quickgraph-collections-iedgelist-2.html index 82d18b9d4..b50dc4b40 100644 --- a/reference/quickgraph-collections-iedgelist-2.html +++ b/reference/quickgraph-collections-iedgelist-2.html @@ -52,10 +52,10 @@

        Instance members

        - + Clone() -
        +
        Signature: unit -> IEdgeList<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -69,10 +69,10 @@

        Instance members

        - + TrimExcess() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        diff --git a/reference/quickgraph-collections-ipriorityqueue-1.html b/reference/quickgraph-collections-ipriorityqueue-1.html index 44e379d7c..0d21b6bc0 100644 --- a/reference/quickgraph-collections-ipriorityqueue-1.html +++ b/reference/quickgraph-collections-ipriorityqueue-1.html @@ -50,10 +50,10 @@

        Instance members

        - + Update(value) -
        +
        Signature: value:'T -> unit
        Modifiers: abstract
        diff --git a/reference/quickgraph-collections-iqueue-1.html b/reference/quickgraph-collections-iqueue-1.html index bdca8ab88..e04e000b4 100644 --- a/reference/quickgraph-collections-iqueue-1.html +++ b/reference/quickgraph-collections-iqueue-1.html @@ -50,10 +50,10 @@

        Instance members

        - + Contains(value) -
        +
        Signature: value:'T -> bool
        Modifiers: abstract
        @@ -65,10 +65,10 @@

        Instance members

        - + Count -
        +
        Signature: int
        Modifiers: abstract
        @@ -80,10 +80,10 @@

        Instance members

        - + Dequeue() -
        +
        Signature: unit -> 'T
        Modifiers: abstract
        @@ -95,10 +95,10 @@

        Instance members

        - + Enqueue(value) -
        +
        Signature: value:'T -> unit
        Modifiers: abstract
        @@ -110,10 +110,10 @@

        Instance members

        - + Peek() -
        +
        Signature: unit -> 'T
        Modifiers: abstract
        @@ -125,10 +125,10 @@

        Instance members

        - + ToArray() -
        +
        Signature: unit -> 'T []
        Modifiers: abstract
        diff --git a/reference/quickgraph-collections-ivertexedgedictionary-2.html b/reference/quickgraph-collections-ivertexedgedictionary-2.html index 88417ba19..a9c9a05f8 100644 --- a/reference/quickgraph-collections-ivertexedgedictionary-2.html +++ b/reference/quickgraph-collections-ivertexedgedictionary-2.html @@ -52,10 +52,10 @@

        Instance members

        - + Clone() -
        +
        Signature: unit -> IVertexEdgeDictionary<'TVertex,'TEdge>
        Modifiers: abstract
        diff --git a/reference/quickgraph-collections-queue-1.html b/reference/quickgraph-collections-queue-1.html index 85867ab04..7f092cfe3 100644 --- a/reference/quickgraph-collections-queue-1.html +++ b/reference/quickgraph-collections-queue-1.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-collections-softheap-2.html b/reference/quickgraph-collections-softheap-2.html index 96b7d2577..3fce0d147 100644 --- a/reference/quickgraph-collections-softheap-2.html +++ b/reference/quickgraph-collections-softheap-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(maximumErrorRate, keyMaxValue) -
        +
        Signature: (maximumErrorRate:float * keyMaxValue:'TKey) -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (maximumErrorRate:float * keyMaxValue:'TKey * comparison:Comparison<'TKey>) -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + Add(key, value) -
        +
        Signature: (key:'TKey * value:'TValue) -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + Comparison -
        +
        Signature: Comparison<'TKey>
        @@ -114,10 +114,10 @@

        Instance members

        - + Count -
        +
        Signature: int
        @@ -128,10 +128,10 @@

        Instance members

        - + DeleteMin() -
        +
        Signature: unit -> KeyValuePair<'TKey,'TValue>
        @@ -142,10 +142,10 @@

        Instance members

        - + ErrorRate -
        +
        Signature: float
        @@ -156,10 +156,10 @@

        Instance members

        - + GetEnumerator() -
        +
        Signature: unit -> IEnumerator<KeyValuePair<'TKey,'TValue>>
        Modifiers: abstract
        @@ -171,10 +171,10 @@

        Instance members

        - + KeyMaxValue -
        +
        Signature: 'TKey
        @@ -185,10 +185,10 @@

        Instance members

        - + MinRank -
        +
        Signature: int
        diff --git a/reference/quickgraph-collections-termedgelist-2.html b/reference/quickgraph-collections-termedgelist-2.html index 58c32e79f..b7855773c 100644 --- a/reference/quickgraph-collections-termedgelist-2.html +++ b/reference/quickgraph-collections-termedgelist-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(capacity) -
        +
        Signature: capacity:int -> unit
        @@ -78,10 +78,10 @@

        Constructors

        - + new(list) -
        +
        Signature: list:TermEdgeList<'TVertex,'TEdge> -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + Add(item) -
        +
        Signature: item:'TEdge -> unit
        Modifiers: abstract
        @@ -115,10 +115,10 @@

        Instance members

        - + Clear() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -130,10 +130,10 @@

        Instance members

        - + Clone() -
        +
        Signature: unit -> TermEdgeList<'TVertex,'TEdge>
        @@ -144,10 +144,10 @@

        Instance members

        - + Contains(item) -
        +
        Signature: item:'TEdge -> bool
        Modifiers: abstract
        @@ -159,10 +159,10 @@

        Instance members

        - + CopyTo(array, arrayIndex) -
        +
        Signature: (array:'TEdge [] * arrayIndex:int) -> unit
        Modifiers: abstract
        @@ -174,10 +174,10 @@

        Instance members

        - + Count -
        +
        Signature: int
        Modifiers: abstract
        @@ -189,10 +189,10 @@

        Instance members

        - + GetEnumerator() -
        +
        Signature: unit -> IEnumerator<'TEdge>
        Modifiers: abstract
        @@ -204,10 +204,10 @@

        Instance members

        - + IndexOf(item) -
        +
        Signature: item:'TEdge -> int
        Modifiers: abstract
        @@ -219,10 +219,10 @@

        Instance members

        - + Insert(index, item) -
        +
        Signature: (index:int * item:'TEdge) -> unit
        Modifiers: abstract
        @@ -234,10 +234,10 @@

        Instance members

        - + IsReadOnly -
        +
        Signature: bool
        Modifiers: abstract
        @@ -249,10 +249,10 @@

        Instance members

        - + [()] -
        +
        Signature: unit -> int
        Modifiers: abstract
        @@ -264,10 +264,10 @@

        Instance members

        - + Remove(item) -
        +
        Signature: item:'TEdge -> bool
        Modifiers: abstract
        @@ -279,10 +279,10 @@

        Instance members

        - + RemoveAt(index) -
        +
        Signature: index:int -> unit
        Modifiers: abstract
        @@ -294,10 +294,10 @@

        Instance members

        - + TrimExcess() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        diff --git a/reference/quickgraph-collections-vertexedgedictionary-2.html b/reference/quickgraph-collections-vertexedgedictionary-2.html index df2f28175..fa9a7229e 100644 --- a/reference/quickgraph-collections-vertexedgedictionary-2.html +++ b/reference/quickgraph-collections-vertexedgedictionary-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(capacity) -
        +
        Signature: capacity:int -> unit
        @@ -78,10 +78,10 @@

        Constructors

        - + new(info, context) -
        +
        Signature: (info:SerializationInfo * context:StreamingContext) -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + Clone() -
        +
        Signature: unit -> VertexEdgeDictionary<'TVertex,'TEdge>
        diff --git a/reference/quickgraph-collections-vertexlist-1.html b/reference/quickgraph-collections-vertexlist-1.html index 6db2bd47a..1fe715567 100644 --- a/reference/quickgraph-collections-vertexlist-1.html +++ b/reference/quickgraph-collections-vertexlist-1.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(capacity) -
        +
        Signature: capacity:int -> unit
        @@ -78,10 +78,10 @@

        Constructors

        - + new(other) -
        +
        Signature: other:VertexList<'TVertex> -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + Clone() -
        +
        Signature: unit -> VertexList<'TVertex>
        diff --git a/reference/quickgraph-compressedsparserowgraph-1.html b/reference/quickgraph-compressedsparserowgraph-1.html index 029b0875f..f27e81e15 100644 --- a/reference/quickgraph-compressedsparserowgraph-1.html +++ b/reference/quickgraph-compressedsparserowgraph-1.html @@ -53,10 +53,10 @@

        Instance members

        - + AllowParallelEdges -
        +
        Signature: bool
        Modifiers: abstract
        @@ -68,10 +68,10 @@

        Instance members

        - + Clone() -
        +
        Signature: unit -> CompressedSparseRowGraph<'TVertex>
        @@ -82,10 +82,10 @@

        Instance members

        - + ContainsEdge(edge) -
        +
        Signature: edge:SEquatableEdge<'TVertex> -> bool
        Modifiers: abstract
        @@ -97,10 +97,10 @@

        Instance members

        - + ContainsEdge(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> bool
        Modifiers: abstract
        @@ -112,10 +112,10 @@

        Instance members

        - + ContainsVertex(vertex) -
        +
        Signature: vertex:'TVertex -> bool
        Modifiers: abstract
        @@ -127,10 +127,10 @@

        Instance members

        - + EdgeCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -142,10 +142,10 @@

        Instance members

        - + Edges -
        +
        Signature: IEnumerable<SEquatableEdge<'TVertex>>
        Modifiers: abstract
        @@ -157,10 +157,10 @@

        Instance members

        - + IsDirected -
        +
        Signature: bool
        Modifiers: abstract
        @@ -172,10 +172,10 @@

        Instance members

        - + IsEdgesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -187,10 +187,10 @@

        Instance members

        - + IsOutEdgesEmpty(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -202,10 +202,10 @@

        Instance members

        - + IsVerticesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -217,10 +217,10 @@

        Instance members

        - + OutDegree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -232,10 +232,10 @@

        Instance members

        - + OutEdge(v, index) -
        +
        Signature: (v:'TVertex * index:int) -> SEquatableEdge<'TVertex>
        Modifiers: abstract
        @@ -247,10 +247,10 @@

        Instance members

        - + OutEdges(v) -
        +
        Signature: v:'TVertex -> IEnumerable<SEquatableEdge<'TVertex>>
        Modifiers: abstract
        @@ -262,10 +262,10 @@

        Instance members

        - + TryGetEdge(source, target, edge) -
        +
        Signature: (source:'TVertex * target:'TVertex * edge:byref<SEquatableEdge<'TVertex>>) -> bool
        Modifiers: abstract
        @@ -277,10 +277,10 @@

        Instance members

        - + TryGetEdges(source, target, edges) -
        +
        Signature: (source:'TVertex * target:'TVertex * edges:byref<IEnumerable<SEquatableEdge<'TVertex>>>) -> bool
        Modifiers: abstract
        @@ -292,10 +292,10 @@

        Instance members

        - + TryGetOutEdges(v, edges) -
        +
        Signature: (v:'TVertex * edges:byref<IEnumerable<SEquatableEdge<'TVertex>>>) -> bool
        Modifiers: abstract
        @@ -307,10 +307,10 @@

        Instance members

        - + VertexCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -322,10 +322,10 @@

        Instance members

        - + Vertices -
        +
        Signature: IEnumerable<'TVertex>
        Modifiers: abstract
        @@ -345,10 +345,10 @@

        Static members

        - + FromGraph(visitedGraph) -
        +
        Signature: visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> CompressedSparseRowGraph<'TVertex>
        diff --git a/reference/quickgraph-contracts-graphcontract.html b/reference/quickgraph-contracts-graphcontract.html index 38510d161..14399b873 100644 --- a/reference/quickgraph-contracts-graphcontract.html +++ b/reference/quickgraph-contracts-graphcontract.html @@ -52,10 +52,10 @@

        Static members

        - + EdgeCountEqual(left, right) -
        +
        Signature: (left:IEdgeListGraph<'TVertex,'TEdge> * right:IEdgeListGraph<'TVertex,'TEdge>) -> bool
        Type parameters: 'TVertex, 'TEdge
        @@ -66,10 +66,10 @@

        Static members

        - + InEdgeSet(g, e) -
        +
        Signature: (g:IEdgeListGraph<'TVertex,'TEdge> * e:'TEdge) -> bool
        Type parameters: 'TVertex, 'TEdge
        @@ -80,10 +80,10 @@

        Static members

        - + InVertexSet(g, v) -
        +
        Signature: (g:IVertexSet<'TVertex> * v:'TVertex) -> bool
        Type parameters: 'TVertex
        @@ -94,10 +94,10 @@

        Static members

        - + InVertexSet(g, e) -
        +
        Signature: (g:IEdgeListGraph<'TVertex,'TEdge> * e:'TEdge) -> bool
        Type parameters: 'TVertex, 'TEdge
        @@ -108,10 +108,10 @@

        Static members

        - + VertexCountEqual(left, right) -
        +
        Signature: (left:IVertexSet<'TVertex> * right:IVertexSet<'TVertex>) -> bool
        Type parameters: 'TVertex
        diff --git a/reference/quickgraph-createedgedelegate-2.html b/reference/quickgraph-createedgedelegate-2.html index bcaaaeb3f..247f9b41f 100644 --- a/reference/quickgraph-createedgedelegate-2.html +++ b/reference/quickgraph-createedgedelegate-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(object, method) -
        +
        Signature: (object:obj * method:nativeint) -> unit
        @@ -74,10 +74,10 @@

        Instance members

        - + BeginInvoke(...) -
        +
        Signature: (g:IVertexListGraph<'TVertex,'TEdge> * source:'TVertex * target:'TVertex * callback:AsyncCallback * object:obj) -> IAsyncResult
        Modifiers: abstract
        @@ -89,10 +89,10 @@

        Instance members

        - + EndInvoke(result) -
        +
        Signature: result:IAsyncResult -> 'TEdge
        Modifiers: abstract
        @@ -104,10 +104,10 @@

        Instance members

        - + Invoke(g, source, target) -
        +
        Signature: (g:IVertexListGraph<'TVertex,'TEdge> * source:'TVertex * target:'TVertex) -> 'TEdge
        Modifiers: abstract
        diff --git a/reference/quickgraph-createvertexdelegate-2.html b/reference/quickgraph-createvertexdelegate-2.html index cd4f18186..c9643a38a 100644 --- a/reference/quickgraph-createvertexdelegate-2.html +++ b/reference/quickgraph-createvertexdelegate-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(object, method) -
        +
        Signature: (object:obj * method:nativeint) -> unit
        @@ -74,10 +74,10 @@

        Instance members

        - + BeginInvoke(g, callback, object) -
        +
        Signature: (g:IVertexListGraph<'TVertex,'TEdge> * callback:AsyncCallback * object:obj) -> IAsyncResult
        Modifiers: abstract
        @@ -89,10 +89,10 @@

        Instance members

        - + EndInvoke(result) -
        +
        Signature: result:IAsyncResult -> 'TVertex
        Modifiers: abstract
        @@ -104,10 +104,10 @@

        Instance members

        - + Invoke(g) -
        +
        Signature: g:IVertexListGraph<'TVertex,'TEdge> -> 'TVertex
        Modifiers: abstract
        diff --git a/reference/quickgraph-data-datarelationedge.html b/reference/quickgraph-data-datarelationedge.html index b49df93dc..7336df845 100644 --- a/reference/quickgraph-data-datarelationedge.html +++ b/reference/quickgraph-data-datarelationedge.html @@ -50,10 +50,10 @@

        Constructors

        - + new(relation) -
        +
        Signature: relation:DataRelation -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Relation -
        +
        Signature: DataRelation
        @@ -86,10 +86,10 @@

        Instance members

        - + Source -
        +
        Signature: DataTable
        Modifiers: abstract
        @@ -101,10 +101,10 @@

        Instance members

        - + Target -
        +
        Signature: DataTable
        Modifiers: abstract
        diff --git a/reference/quickgraph-data-datasetgraph.html b/reference/quickgraph-data-datasetgraph.html index 1ebc6a12a..9743c282c 100644 --- a/reference/quickgraph-data-datasetgraph.html +++ b/reference/quickgraph-data-datasetgraph.html @@ -50,10 +50,10 @@

        Instance members

        - + DataSet -
        +
        Signature: DataSet
        diff --git a/reference/quickgraph-data-datasetgraphextensions.html b/reference/quickgraph-data-datasetgraphextensions.html index 301daaba1..ec494afa8 100644 --- a/reference/quickgraph-data-datasetgraphextensions.html +++ b/reference/quickgraph-data-datasetgraphextensions.html @@ -50,10 +50,10 @@

        Static members

        - + ToGraph(ds) -
        +
        Signature: ds:DataSet -> DataSetGraph
        @@ -64,10 +64,10 @@

        Static members

        - + ToGraphviz(visitedGraph) -
        +
        Signature: visitedGraph:DataSetGraph -> string
        diff --git a/reference/quickgraph-data-datasetgraphpopulatoralgorithm.html b/reference/quickgraph-data-datasetgraphpopulatoralgorithm.html index e3d7c404a..5b68e5071 100644 --- a/reference/quickgraph-data-datasetgraphpopulatoralgorithm.html +++ b/reference/quickgraph-data-datasetgraphpopulatoralgorithm.html @@ -50,10 +50,10 @@

        Constructors

        - + new(visitedGraph, dataSet) -
        +
        Signature: (visitedGraph:IMutableVertexAndEdgeListGraph<DataTable,DataRelationEdge> * dataSet:DataSet) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + DataSet -
        +
        Signature: DataSet
        diff --git a/reference/quickgraph-data-datasetgraphvizalgorithm.html b/reference/quickgraph-data-datasetgraphvizalgorithm.html index 9d2a7df49..665f40fef 100644 --- a/reference/quickgraph-data-datasetgraphvizalgorithm.html +++ b/reference/quickgraph-data-datasetgraphvizalgorithm.html @@ -52,10 +52,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:DataSetGraph -> unit
        @@ -66,10 +66,10 @@

        Constructors

        - + new(visitedGraph, path, imageType) -
        +
        Signature: (visitedGraph:DataSetGraph * path:string * imageType:GraphvizImageType) -> unit
        diff --git a/reference/quickgraph-delegatebidirectionalincidencegraph-2.html b/reference/quickgraph-delegatebidirectionalincidencegraph-2.html index b65d5ba2c..fdc95df28 100644 --- a/reference/quickgraph-delegatebidirectionalincidencegraph-2.html +++ b/reference/quickgraph-delegatebidirectionalincidencegraph-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(tryGetOutEdges, tryGetInEdges) -
        +
        Signature: (tryGetOutEdges:TryFunc<'TVertex,IEnumerable<'TEdge>> * tryGetInEdges:TryFunc<'TVertex,IEnumerable<'TEdge>>) -> unit
        @@ -74,10 +74,10 @@

        Instance members

        - + Degree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -89,10 +89,10 @@

        Instance members

        - + InDegree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -104,10 +104,10 @@

        Instance members

        - + InEdge(v, index) -
        +
        Signature: (v:'TVertex * index:int) -> 'TEdge
        Modifiers: abstract
        @@ -119,10 +119,10 @@

        Instance members

        - + InEdges(v) -
        +
        Signature: v:'TVertex -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -134,10 +134,10 @@

        Instance members

        - + IsInEdgesEmpty(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -149,10 +149,10 @@

        Instance members

        - + TryGetInEdges(v, edges) -
        +
        Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        @@ -164,10 +164,10 @@

        Instance members

        - + TryGetInEdgesFunc -
        +
        Signature: TryFunc<'TVertex,IEnumerable<'TEdge>>
        diff --git a/reference/quickgraph-delegateimplicitgraph-2.html b/reference/quickgraph-delegateimplicitgraph-2.html index 433a78872..628ace074 100644 --- a/reference/quickgraph-delegateimplicitgraph-2.html +++ b/reference/quickgraph-delegateimplicitgraph-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(tryGetOutEdges) -
        +
        Signature: tryGetOutEdges:TryFunc<'TVertex,IEnumerable<'TEdge>> -> unit
        @@ -74,10 +74,10 @@

        Instance members

        - + AllowParallelEdges -
        +
        Signature: bool
        Modifiers: abstract
        @@ -89,10 +89,10 @@

        Instance members

        - + ContainsVertex(vertex) -
        +
        Signature: vertex:'TVertex -> bool
        Modifiers: abstract
        @@ -104,10 +104,10 @@

        Instance members

        - + IsDirected -
        +
        Signature: bool
        Modifiers: abstract
        @@ -119,10 +119,10 @@

        Instance members

        - + IsOutEdgesEmpty(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -134,10 +134,10 @@

        Instance members

        - + OutDegree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -149,10 +149,10 @@

        Instance members

        - + OutEdge(v, index) -
        +
        Signature: (v:'TVertex * index:int) -> 'TEdge
        Modifiers: abstract
        @@ -164,10 +164,10 @@

        Instance members

        - + OutEdges(v) -
        +
        Signature: v:'TVertex -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -179,10 +179,10 @@

        Instance members

        - + TryGetOutEdges(v, edges) -
        +
        Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        @@ -194,10 +194,10 @@

        Instance members

        - + TryGetOutEdgesFunc -
        +
        Signature: TryFunc<'TVertex,IEnumerable<'TEdge>>
        diff --git a/reference/quickgraph-delegateimplicitundirectedgraph-2.html b/reference/quickgraph-delegateimplicitundirectedgraph-2.html index 6e9460126..27f66321f 100644 --- a/reference/quickgraph-delegateimplicitundirectedgraph-2.html +++ b/reference/quickgraph-delegateimplicitundirectedgraph-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (tryGetAdjacenyEdges:TryFunc<'TVertex,IEnumerable<'TEdge>> * allowParallelEdges:bool) -> unit
        @@ -74,10 +74,10 @@

        Instance members

        - + AdjacentDegree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -89,10 +89,10 @@

        Instance members

        - + AdjacentEdge(v, index) -
        +
        Signature: (v:'TVertex * index:int) -> 'TEdge
        Modifiers: abstract
        @@ -104,10 +104,10 @@

        Instance members

        - + AdjacentEdges(v) -
        +
        Signature: v:'TVertex -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -119,10 +119,10 @@

        Instance members

        - + AllowParallelEdges -
        +
        Signature: bool
        Modifiers: abstract
        @@ -134,10 +134,10 @@

        Instance members

        - + ContainsEdge(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> bool
        Modifiers: abstract
        @@ -149,10 +149,10 @@

        Instance members

        - + ContainsVertex(vertex) -
        +
        Signature: vertex:'TVertex -> bool
        Modifiers: abstract
        @@ -164,10 +164,10 @@

        Instance members

        - + EdgeEqualityComparer -
        +
        Signature: EdgeEqualityComparer<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -179,10 +179,10 @@

        Instance members

        - + IsAdjacentEdgesEmpty(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -194,10 +194,10 @@

        Instance members

        - + IsDirected -
        +
        Signature: bool
        Modifiers: abstract
        @@ -209,10 +209,10 @@

        Instance members

        - + TryGetAdjacencyEdgesFunc -
        +
        Signature: TryFunc<'TVertex,IEnumerable<'TEdge>>
        @@ -223,10 +223,10 @@

        Instance members

        - + TryGetAdjacentEdges(v, edges) -
        +
        Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
        @@ -237,10 +237,10 @@

        Instance members

        - + TryGetEdge(source, target, edge) -
        +
        Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-delegateincidencegraph-2.html b/reference/quickgraph-delegateincidencegraph-2.html index 627030b39..a46a5edd0 100644 --- a/reference/quickgraph-delegateincidencegraph-2.html +++ b/reference/quickgraph-delegateincidencegraph-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(tryGetOutEdges) -
        +
        Signature: tryGetOutEdges:TryFunc<'TVertex,IEnumerable<'TEdge>> -> unit
        @@ -74,10 +74,10 @@

        Instance members

        - + ContainsEdge(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> bool
        Modifiers: abstract
        @@ -89,10 +89,10 @@

        Instance members

        - + TryGetEdge(source, target, edge) -
        +
        Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
        Modifiers: abstract
        @@ -104,10 +104,10 @@

        Instance members

        - + TryGetEdges(source, target, edges) -
        +
        Signature: (source:'TVertex * target:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-delegateundirectedgraph-2.html b/reference/quickgraph-delegateundirectedgraph-2.html index 2ad329ee8..cc2df5926 100644 --- a/reference/quickgraph-delegateundirectedgraph-2.html +++ b/reference/quickgraph-delegateundirectedgraph-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (vertices:IEnumerable<'TVertex> * tryGetAdjacentEdges:TryFunc<'TVertex,IEnumerable<'TEdge>> * allowParallelEdges:bool) -> unit
        @@ -74,10 +74,10 @@

        Instance members

        - + ContainsEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -89,10 +89,10 @@

        Instance members

        - + EdgeCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -104,10 +104,10 @@

        Instance members

        - + Edges -
        +
        Signature: IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -119,10 +119,10 @@

        Instance members

        - + IsEdgesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -134,10 +134,10 @@

        Instance members

        - + IsVerticesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -149,10 +149,10 @@

        Instance members

        - + VertexCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -164,10 +164,10 @@

        Instance members

        - + Vertices -
        +
        Signature: IEnumerable<'TVertex>
        Modifiers: abstract
        diff --git a/reference/quickgraph-delegatevertexandedgelistgraph-2.html b/reference/quickgraph-delegatevertexandedgelistgraph-2.html index e2821bcbf..340763526 100644 --- a/reference/quickgraph-delegatevertexandedgelistgraph-2.html +++ b/reference/quickgraph-delegatevertexandedgelistgraph-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(vertices, tryGetOutEdges) -
        +
        Signature: (vertices:IEnumerable<'TVertex> * tryGetOutEdges:TryFunc<'TVertex,IEnumerable<'TEdge>>) -> unit
        @@ -74,10 +74,10 @@

        Instance members

        - + ContainsEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -89,10 +89,10 @@

        Instance members

        - + EdgeCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -104,10 +104,10 @@

        Instance members

        - + Edges -
        +
        Signature: IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -119,10 +119,10 @@

        Instance members

        - + IsEdgesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -134,10 +134,10 @@

        Instance members

        - + IsVerticesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -149,10 +149,10 @@

        Instance members

        - + VertexCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -164,10 +164,10 @@

        Instance members

        - + Vertices -
        +
        Signature: IEnumerable<'TVertex>
        Modifiers: abstract
        diff --git a/reference/quickgraph-dotparseradapter.html b/reference/quickgraph-dotparseradapter.html index c2de1dae5..dbd74ea72 100644 --- a/reference/quickgraph-dotparseradapter.html +++ b/reference/quickgraph-dotparseradapter.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-doubleequalitycomparer.html b/reference/quickgraph-doubleequalitycomparer.html index a48c54b06..856b3abfe 100644 --- a/reference/quickgraph-doubleequalitycomparer.html +++ b/reference/quickgraph-doubleequalitycomparer.html @@ -52,10 +52,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -68,10 +68,10 @@

        Constructors

        - + new(tolerance) -
        +
        Signature: tolerance:float -> unit
        @@ -92,10 +92,10 @@

        Instance members

        - + Equals(x, y) -
        +
        Signature: (x:float * y:float) -> bool
        Modifiers: abstract
        @@ -109,10 +109,10 @@

        Instance members

        - + GetHashCode(x) -
        +
        Signature: x:float -> int
        Modifiers: abstract
        @@ -126,10 +126,10 @@

        Instance members

        - + Tolerance() -
        +
        Signature: unit -> unit
        @@ -150,10 +150,10 @@

        Static members

        - + DefaultTolerance -
        +
        Signature: float
        diff --git a/reference/quickgraph-edge-1.html b/reference/quickgraph-edge-1.html index ff7687fcb..0ec220fc6 100644 --- a/reference/quickgraph-edge-1.html +++ b/reference/quickgraph-edge-1.html @@ -52,10 +52,10 @@

        Constructors

        - + new(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> unit
        @@ -76,10 +76,10 @@

        Instance members

        - + Source -
        +
        Signature: 'TVertex
        Modifiers: abstract
        @@ -93,10 +93,10 @@

        Instance members

        - + Target -
        +
        Signature: 'TVertex
        Modifiers: abstract
        @@ -110,10 +110,10 @@

        Instance members

        - + ToString() -
        +
        Signature: unit -> string
        Modifiers: abstract
        diff --git a/reference/quickgraph-edgeaction-2.html b/reference/quickgraph-edgeaction-2.html index a96030cba..e84e0ec77 100644 --- a/reference/quickgraph-edgeaction-2.html +++ b/reference/quickgraph-edgeaction-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(object, method) -
        +
        Signature: (object:obj * method:nativeint) -> unit
        @@ -74,10 +74,10 @@

        Instance members

        - + BeginInvoke(e, callback, object) -
        +
        Signature: (e:'TEdge * callback:AsyncCallback * object:obj) -> IAsyncResult
        Modifiers: abstract
        @@ -89,10 +89,10 @@

        Instance members

        - + EndInvoke(result) -
        +
        Signature: result:IAsyncResult -> unit
        Modifiers: abstract
        @@ -104,10 +104,10 @@

        Instance members

        - + Invoke(e) -
        +
        Signature: e:'TEdge -> unit
        Modifiers: abstract
        diff --git a/reference/quickgraph-edgeedgeaction-2.html b/reference/quickgraph-edgeedgeaction-2.html index 65831e439..22f75a15c 100644 --- a/reference/quickgraph-edgeedgeaction-2.html +++ b/reference/quickgraph-edgeedgeaction-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(object, method) -
        +
        Signature: (object:obj * method:nativeint) -> unit
        @@ -74,10 +74,10 @@

        Instance members

        - + BeginInvoke(...) -
        +
        Signature: (edge:'TEdge * targetEdge:'TEdge * callback:AsyncCallback * object:obj) -> IAsyncResult
        Modifiers: abstract
        @@ -89,10 +89,10 @@

        Instance members

        - + EndInvoke(result) -
        +
        Signature: result:IAsyncResult -> unit
        Modifiers: abstract
        @@ -104,10 +104,10 @@

        Instance members

        - + Invoke(edge, targetEdge) -
        +
        Signature: (edge:'TEdge * targetEdge:'TEdge) -> unit
        Modifiers: abstract
        diff --git a/reference/quickgraph-edgeequalitycomparer-2.html b/reference/quickgraph-edgeequalitycomparer-2.html index f3ebecebb..2c881a318 100644 --- a/reference/quickgraph-edgeequalitycomparer-2.html +++ b/reference/quickgraph-edgeequalitycomparer-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(object, method) -
        +
        Signature: (object:obj * method:nativeint) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + BeginInvoke(...) -
        +
        Signature: (edge:'TEdge * source:'TVertex * target:'TVertex * callback:AsyncCallback * object:obj) -> IAsyncResult
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + EndInvoke(result) -
        +
        Signature: result:IAsyncResult -> bool
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + Invoke(edge, source, target) -
        +
        Signature: (edge:'TEdge * source:'TVertex * target:'TVertex) -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-edgeeventargs-2.html b/reference/quickgraph-edgeeventargs-2.html index 8a0db3426..e3b227752 100644 --- a/reference/quickgraph-edgeeventargs-2.html +++ b/reference/quickgraph-edgeeventargs-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(edge) -
        +
        Signature: edge:'TEdge -> unit
        @@ -76,10 +76,10 @@

        Instance members

        - + Edge -
        +
        Signature: 'TEdge
        diff --git a/reference/quickgraph-edgeextensions.html b/reference/quickgraph-edgeextensions.html index d9c7312ee..61044935b 100644 --- a/reference/quickgraph-edgeextensions.html +++ b/reference/quickgraph-edgeextensions.html @@ -50,10 +50,10 @@

        Static members

        - + GetOtherVertex(edge, vertex) -
        +
        Signature: (edge:'TEdge * vertex:'TVertex) -> 'TVertex
        Type parameters: 'TVertex, 'TEdge
        @@ -66,10 +66,10 @@

        Static members

        - + GetUndirectedVertexEquality() -
        +
        Signature: unit -> EdgeEqualityComparer<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -84,10 +84,10 @@

        Static members

        - + HasCycles(path) -
        +
        Signature: path:IEnumerable<'TEdge> -> bool
        Type parameters: 'TVertex, 'TEdge
        @@ -98,10 +98,10 @@

        Static members

        - + IsAdjacent(edge, vertex) -
        +
        Signature: (edge:'TEdge * vertex:'TVertex) -> bool
        Type parameters: 'TVertex, 'TEdge
        @@ -115,10 +115,10 @@

        Static members

        - + IsPath(path) -
        +
        Signature: path:IEnumerable<'TEdge> -> bool
        Type parameters: 'TVertex, 'TEdge
        @@ -129,10 +129,10 @@

        Static members

        - + IsPathWithoutCycles(path) -
        +
        Signature: path:IEnumerable<'TEdge> -> bool
        Type parameters: 'TVertex, 'TEdge
        @@ -143,10 +143,10 @@

        Static members

        - + IsPredecessor(...) -
        +
        Signature: (predecessors:IDictionary<'TVertex,'TEdge> * root:'TVertex * vertex:'TVertex) -> bool
        Type parameters: 'TVertex, 'TEdge
        @@ -159,10 +159,10 @@

        Static members

        - + IsSelfEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Type parameters: 'TVertex, 'TEdge
        @@ -175,10 +175,10 @@

        Static members

        - + ReverseEdges(edges) -
        +
        Signature: edges:IEnumerable<'TEdge> -> IEnumerable<SReversedEdge<'TVertex,'TEdge>>
        Type parameters: 'TVertex, 'TEdge
        @@ -191,10 +191,10 @@

        Static members

        - + SortedVertexEquality(...) -
        +
        Signature: (edge:'TEdge * source:'TVertex * target:'TVertex) -> bool
        Type parameters: 'TVertex, 'TEdge
        @@ -207,10 +207,10 @@

        Static members

        - + ToVertexPair(edge) -
        +
        Signature: edge:'TEdge -> SEquatableEdge<'TVertex>
        Type parameters: 'TVertex, 'TEdge
        @@ -223,10 +223,10 @@

        Static members

        - + TryGetPath(predecessors, v, result) -
        +
        Signature: (predecessors:IDictionary<'TVertex,'TEdge> * v:'TVertex * result:byref<IEnumerable<'TEdge>>) -> bool
        Type parameters: 'TVertex, 'TEdge
        @@ -239,10 +239,10 @@

        Static members

        - + UndirectedVertexEquality(...) -
        +
        Signature: (edge:'TEdge * source:'TVertex * target:'TVertex) -> bool
        Type parameters: 'TVertex, 'TEdge
        diff --git a/reference/quickgraph-edgefactory-2.html b/reference/quickgraph-edgefactory-2.html index 192e536d9..31fc54b6b 100644 --- a/reference/quickgraph-edgefactory-2.html +++ b/reference/quickgraph-edgefactory-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(object, method) -
        +
        Signature: (object:obj * method:nativeint) -> unit
        @@ -74,10 +74,10 @@

        Instance members

        - + BeginInvoke(...) -
        +
        Signature: (source:'TVertex * target:'TVertex * callback:AsyncCallback * object:obj) -> IAsyncResult
        Modifiers: abstract
        @@ -89,10 +89,10 @@

        Instance members

        - + EndInvoke(result) -
        +
        Signature: result:IAsyncResult -> 'TEdge
        Modifiers: abstract
        @@ -104,10 +104,10 @@

        Instance members

        - + Invoke(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> 'TEdge
        Modifiers: abstract
        diff --git a/reference/quickgraph-edgeidentity-2.html b/reference/quickgraph-edgeidentity-2.html index aaa3da754..517cd965b 100644 --- a/reference/quickgraph-edgeidentity-2.html +++ b/reference/quickgraph-edgeidentity-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(object, method) -
        +
        Signature: (object:obj * method:nativeint) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + BeginInvoke(edge, callback, object) -
        +
        Signature: (edge:'TEdge * callback:AsyncCallback * object:obj) -> IAsyncResult
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + EndInvoke(result) -
        +
        Signature: result:IAsyncResult -> string
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + Invoke(edge) -
        +
        Signature: edge:'TEdge -> string
        Modifiers: abstract
        diff --git a/reference/quickgraph-edgelistgraph-2.html b/reference/quickgraph-edgelistgraph-2.html index 042153673..18d3d537b 100644 --- a/reference/quickgraph-edgelistgraph-2.html +++ b/reference/quickgraph-edgelistgraph-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(isDirected, allowParralelEdges) -
        +
        Signature: (isDirected:bool * allowParralelEdges:bool) -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + AddEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -101,10 +101,10 @@

        Instance members

        - + AddEdgeRange(edges) -
        +
        Signature: edges:IEnumerable<'TEdge> -> int
        Modifiers: abstract
        @@ -116,10 +116,10 @@

        Instance members

        - + AddVerticesAndEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        @@ -130,10 +130,10 @@

        Instance members

        - + AddVerticesAndEdgeRange(edges) -
        +
        Signature: edges:IEnumerable<'TEdge> -> int
        @@ -144,10 +144,10 @@

        Instance members

        - + AllowParallelEdges -
        +
        Signature: bool
        Modifiers: abstract
        @@ -159,10 +159,10 @@

        Instance members

        - + Clear() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -174,10 +174,10 @@

        Instance members

        - + Clone() -
        +
        Signature: unit -> EdgeListGraph<'TVertex,'TEdge>
        @@ -188,10 +188,10 @@

        Instance members

        - + ContainsEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -203,10 +203,10 @@

        Instance members

        - + ContainsVertex(vertex) -
        +
        Signature: vertex:'TVertex -> bool
        Modifiers: abstract
        @@ -218,10 +218,10 @@

        Instance members

        - + EdgeAdded -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -233,10 +233,10 @@

        Instance members

        - + EdgeCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -248,10 +248,10 @@

        Instance members

        - + EdgeRemoved -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -263,10 +263,10 @@

        Instance members

        - + Edges -
        +
        Signature: IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -278,10 +278,10 @@

        Instance members

        - + IsDirected -
        +
        Signature: bool
        Modifiers: abstract
        @@ -293,10 +293,10 @@

        Instance members

        - + IsEdgesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -308,10 +308,10 @@

        Instance members

        - + IsVerticesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -323,10 +323,10 @@

        Instance members

        - + RemoveEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -338,10 +338,10 @@

        Instance members

        - + RemoveEdgeIf(predicate) -
        +
        Signature: predicate:EdgePredicate<'TVertex,'TEdge> -> int
        Modifiers: abstract
        @@ -353,10 +353,10 @@

        Instance members

        - + VertexCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -368,10 +368,10 @@

        Instance members

        - + Vertices -
        +
        Signature: IEnumerable<'TVertex>
        Modifiers: abstract
        diff --git a/reference/quickgraph-edgepredicate-2.html b/reference/quickgraph-edgepredicate-2.html index 576ccdf9d..78c4d7063 100644 --- a/reference/quickgraph-edgepredicate-2.html +++ b/reference/quickgraph-edgepredicate-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(object, method) -
        +
        Signature: (object:obj * method:nativeint) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + BeginInvoke(e, callback, object) -
        +
        Signature: (e:'TEdge * callback:AsyncCallback * object:obj) -> IAsyncResult
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + EndInvoke(result) -
        +
        Signature: result:IAsyncResult -> bool
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + Invoke(e) -
        +
        Signature: e:'TEdge -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-enumerablecontract.html b/reference/quickgraph-enumerablecontract.html index fb6574bc9..3eb3e5f64 100644 --- a/reference/quickgraph-enumerablecontract.html +++ b/reference/quickgraph-enumerablecontract.html @@ -50,10 +50,10 @@

        Static members

        - + All(...) -
        +
        Signature: (lowerBound:int * exclusiveUpperBound:int * predicate:Func<int,bool>) -> bool
        @@ -64,10 +64,10 @@

        Static members

        - + ElementsNotNull(elements) -
        +
        Signature: elements:IEnumerable<'T> -> bool
        Type parameters: 'T
        diff --git a/reference/quickgraph-equalityextensions.html b/reference/quickgraph-equalityextensions.html index 36ca73bbf..554270c48 100644 --- a/reference/quickgraph-equalityextensions.html +++ b/reference/quickgraph-equalityextensions.html @@ -52,10 +52,10 @@

        Static members

        - + Equals1(lhs, rhs, elementEquality) -
        +
        Signature: (lhs:IList<'T> * rhs:IList<'T> * elementEquality:IEqualityComparer<'T>) -> bool
        Type parameters: 'T
        @@ -71,10 +71,10 @@

        Static members

        - + Equals1(lhs, rhs) -
        +
        Signature: (lhs:IList<'T> * rhs:IList<'T>) -> bool
        Type parameters: 'T
        @@ -90,10 +90,10 @@

        Static members

        - + Equals1(lhs, rhs, tolerance) -
        +
        Signature: (lhs:IList<float32> * rhs:IList<float32> * tolerance:float32) -> bool
        @@ -107,10 +107,10 @@

        Static members

        - + Equals1(lhs, rhs, tolerance) -
        +
        Signature: (lhs:IList<float> * rhs:IList<float> * tolerance:float) -> bool
        @@ -124,10 +124,10 @@

        Static members

        - + Equals1(lhs, rhs, elementEquality) -
        +
        Signature: (lhs:'T [] * rhs:'T [] * elementEquality:IEqualityComparer<'T>) -> bool
        Type parameters: 'T
        @@ -143,10 +143,10 @@

        Static members

        - + Equals1(lhs, rhs) -
        +
        Signature: (lhs:'T [] * rhs:'T []) -> bool
        Type parameters: 'T
        @@ -162,10 +162,10 @@

        Static members

        - + Equals1(lhs, rhs, tolerance) -
        +
        Signature: (lhs:float32 [] * rhs:float32 [] * tolerance:float32) -> bool
        @@ -179,10 +179,10 @@

        Static members

        - + Equals1(lhs, rhs, tolerance) -
        +
        Signature: (lhs:float [] * rhs:float [] * tolerance:float) -> bool
        @@ -196,10 +196,10 @@

        Static members

        - + Equals1(lhs, rhs) -
        +
        Signature: (lhs:IDictionary<'TKey,'TValue> * rhs:IDictionary<'TKey,'TValue>) -> bool
        Type parameters: 'TKey, 'TValue
        @@ -215,10 +215,10 @@

        Static members

        - + Equals1(lhs, rhs, valueEquality) -
        +
        Signature: (lhs:IDictionary<'TKey,'TValue> * rhs:IDictionary<'TKey,'TValue> * valueEquality:IEqualityComparer<'TValue>) -> bool
        Type parameters: 'TKey, 'TValue
        @@ -234,10 +234,10 @@

        Static members

        - + Equals2(lhs, rhs) -
        +
        Signature: (lhs:'T [] [] * rhs:'T [] []) -> bool
        Type parameters: 'T
        @@ -251,10 +251,10 @@

        Static members

        - + Equals2(lhs, rhs, elementEquality) -
        +
        Signature: (lhs:'T [] [] * rhs:'T [] [] * elementEquality:IEqualityComparer<'T>) -> bool
        Type parameters: 'T
        @@ -268,10 +268,10 @@

        Static members

        - + Equals3(lhs, rhs) -
        +
        Signature: (lhs:'T [] [] [] * rhs:'T [] [] []) -> bool
        Type parameters: 'T
        @@ -285,10 +285,10 @@

        Static members

        - + Equals3(lhs, rhs, elementEquality) -
        +
        Signature: (lhs:'T [] [] [] * rhs:'T [] [] [] * elementEquality:IEqualityComparer<'T>) -> bool
        Type parameters: 'T
        diff --git a/reference/quickgraph-equatableedge-1.html b/reference/quickgraph-equatableedge-1.html index e74804c02..6e8799276 100644 --- a/reference/quickgraph-equatableedge-1.html +++ b/reference/quickgraph-equatableedge-1.html @@ -52,10 +52,10 @@

        Constructors

        - + new(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> unit
        @@ -74,10 +74,10 @@

        Instance members

        - + Equals(other) -
        +
        Signature: other:EquatableEdge<'TVertex> -> bool
        Modifiers: abstract
        @@ -89,10 +89,10 @@

        Instance members

        - + Equals(obj) -
        +
        Signature: obj:obj -> bool
        Modifiers: abstract
        @@ -104,10 +104,10 @@

        Instance members

        - + GetHashCode() -
        +
        Signature: unit -> int
        Modifiers: abstract
        diff --git a/reference/quickgraph-equatabletermedge-1.html b/reference/quickgraph-equatabletermedge-1.html index a5d7e9d1f..edba4bd8e 100644 --- a/reference/quickgraph-equatabletermedge-1.html +++ b/reference/quickgraph-equatabletermedge-1.html @@ -52,10 +52,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (source:'TVertex * target:'TVertex * sourceTerminal:int * targetTerminal:int) -> unit
        @@ -66,10 +66,10 @@

        Constructors

        - + new(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> unit
        @@ -88,10 +88,10 @@

        Instance members

        - + Equals(other) -
        +
        Signature: other:EquatableTermEdge<'TVertex> -> bool
        Modifiers: abstract
        @@ -103,10 +103,10 @@

        Instance members

        - + Equals(obj) -
        +
        Signature: obj:obj -> bool
        Modifiers: abstract
        @@ -118,10 +118,10 @@

        Instance members

        - + GetHashCode() -
        +
        Signature: unit -> int
        Modifiers: abstract
        diff --git a/reference/quickgraph-equategraphs.html b/reference/quickgraph-equategraphs.html index a07ebd1b2..8a8ec92e7 100644 --- a/reference/quickgraph-equategraphs.html +++ b/reference/quickgraph-equategraphs.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Static members

        - + Equate(...) -
        +
        Signature: (g:IVertexAndEdgeListGraph<'V,'E> * h:IVertexAndEdgeListGraph<'V,'E> * vertexEquality:IEqualityComparer<'V> * edgeEquality:IEqualityComparer<'E>) -> bool
        Type parameters: 'V, 'E
        @@ -86,10 +86,10 @@

        Static members

        - + Equate(g, h) -
        +
        Signature: (g:IVertexAndEdgeListGraph<'V,'E> * h:IVertexAndEdgeListGraph<'V,'E>) -> bool
        Type parameters: 'V, 'E
        diff --git a/reference/quickgraph-floatequalitycomparer.html b/reference/quickgraph-floatequalitycomparer.html index c98861193..2ad807d42 100644 --- a/reference/quickgraph-floatequalitycomparer.html +++ b/reference/quickgraph-floatequalitycomparer.html @@ -52,10 +52,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -68,10 +68,10 @@

        Constructors

        - + new(tolerance) -
        +
        Signature: tolerance:float32 -> unit
        @@ -92,10 +92,10 @@

        Instance members

        - + Equals(x, y) -
        +
        Signature: (x:float32 * y:float32) -> bool
        Modifiers: abstract
        @@ -109,10 +109,10 @@

        Instance members

        - + GetHashCode(x) -
        +
        Signature: x:float32 -> int
        Modifiers: abstract
        @@ -126,10 +126,10 @@

        Instance members

        - + Tolerance() -
        +
        Signature: unit -> unit
        @@ -150,10 +150,10 @@

        Static members

        - + DefaultTolerance -
        +
        Signature: float32
        diff --git a/reference/quickgraph-fsa-graphbasedfsa-dfanode-1.html b/reference/quickgraph-fsa-graphbasedfsa-dfanode-1.html index 361a5e85b..48d8e73f0 100644 --- a/reference/quickgraph-fsa-graphbasedfsa-dfanode-1.html +++ b/reference/quickgraph-fsa-graphbasedfsa-dfanode-1.html @@ -51,10 +51,10 @@

        Record Fields

        - + Id -
        +
        Signature: int
        @@ -69,10 +69,10 @@

        Record Fields

        - + IsFinal -
        +
        Signature: bool
        @@ -87,10 +87,10 @@

        Record Fields

        - + IsStart -
        +
        Signature: bool
        @@ -105,10 +105,10 @@

        Record Fields

        - + Name -
        +
        Signature: string
        @@ -123,10 +123,10 @@

        Record Fields

        - + Transitions -
        +
        Signature: ('a * DfaNode<'a>) list
        Modifiers: mutable
        diff --git a/reference/quickgraph-fsa-graphbasedfsa-edgefsa-1.html b/reference/quickgraph-fsa-graphbasedfsa-edgefsa-1.html index 03121b812..12b5286b5 100644 --- a/reference/quickgraph-fsa-graphbasedfsa-edgefsa-1.html +++ b/reference/quickgraph-fsa-graphbasedfsa-edgefsa-1.html @@ -51,10 +51,10 @@

        Constructors

        - + new(s, e, t) -
        +
        Signature: (s:int * e:int * t:Symb<'a>) -> EdgeFSA<'a>
        diff --git a/reference/quickgraph-fsa-graphbasedfsa-fsa-1.html b/reference/quickgraph-fsa-graphbasedfsa-fsa-1.html index 56fe50e64..45e962ea6 100644 --- a/reference/quickgraph-fsa-graphbasedfsa-fsa-1.html +++ b/reference/quickgraph-fsa-graphbasedfsa-fsa-1.html @@ -51,10 +51,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> FSA<'a>
        @@ -70,10 +70,10 @@

        Constructors

        - + new(initial, final, transitions) -
        +
        Signature: (initial:ResizeArray<int> * final:ResizeArray<int> * transitions:ResizeArray<int * Symb<'a> * int>) -> FSA<'a>
        @@ -97,10 +97,10 @@

        Instance members

        - + Complementation(...) -
        +
        Signature: (alphabet:seq<'?7299> * newSmb:('?7299 -> Symb<'a>) * getChar:(Symb<'a> -> '?7299)) -> FSA<'a>
        @@ -115,10 +115,10 @@

        Instance members

        - + Concat(fsa2) -
        +
        Signature: fsa2:FSA<'a> -> FSA<'a>
        @@ -133,10 +133,10 @@

        Instance members

        - + FinalState() -
        +
        Signature: unit -> ResizeArray<int>
        @@ -152,10 +152,10 @@

        Instance members

        - + FinalState() -
        +
        Signature: unit -> unit
        @@ -171,10 +171,10 @@

        Instance members

        - + InitState() -
        +
        Signature: unit -> ResizeArray<int>
        @@ -190,10 +190,10 @@

        Instance members

        - + InitState() -
        +
        Signature: unit -> unit
        @@ -209,10 +209,10 @@

        Instance members

        - + IsEmpty -
        +
        Signature: bool
        @@ -228,10 +228,10 @@

        Instance members

        - + NfaToDfa() -
        +
        Signature: unit -> FSA<'a>
        @@ -246,10 +246,10 @@

        Instance members

        - + PrintToDOT(filePath, printSmb) -
        +
        Signature: (filePath:string * printSmb:('a -> string) option) -> unit
        @@ -264,10 +264,10 @@

        Instance members

        - + RemoveExtraPaths() -
        +
        Signature: unit -> FSA<'a>
        @@ -282,10 +282,10 @@

        Instance members

        - + Union(fsa2) -
        +
        Signature: fsa2:FSA<'a> -> FSA<'a>
        @@ -308,10 +308,10 @@

        Static members

        - + Concat(fsa1, fsa2) -
        +
        Signature: (fsa1:FSA<'a> * fsa2:FSA<'a>) -> FSA<'a>
        @@ -326,10 +326,10 @@

        Static members

        - + CreateAnyWordsFsa(fsaParams) -
        +
        Signature: fsaParams:FsaParams<'?7309,'a> -> FSA<'a>
        @@ -346,10 +346,10 @@

        Static members

        - + CustomizableReplace(...) -
        +
        Signature: (fsa1:FSA<'a> * fsa2:FSA<'a> * fsa3:FSA<'a> * smb1:'?7296 * smb2:'?7296 * getChar:(Symb<'a> -> '?7296) * newSmb:('?7296 -> Symb<'a>) * equalSmbl:('a -> 'a -> bool)) -> ReplaceAppetite * ReplaceOrder * ReplaceAmount -> FSA<'a>
        @@ -364,10 +364,10 @@

        Static members

        - + GreedyReplace(...) -
        +
        Signature: (fsa1:FSA<'a> * fsa2:FSA<'a> * fsa3:FSA<'a> * smb1:'?7290 * smb2:'?7290 * getChar:(Symb<'a> -> '?7290) * newSmb:('?7290 -> Symb<'a>) * equalSmbl:('a -> 'a -> bool)) -> FSA<'a>
        @@ -382,10 +382,10 @@

        Static members

        - + Intersection(fsa1, fsa2, equalSmbl) -
        +
        Signature: (fsa1:FSA<'a> * fsa2:FSA<'a> * equalSmbl:('a -> 'a -> bool)) -> FSA<'a>
        @@ -400,10 +400,10 @@

        Static members

        - + IsSubFsa(a1, a2, fsaParams) -
        +
        Signature: (a1:FSA<'a> * a2:FSA<'a> * fsaParams:FsaParams<'?7306,'a>) -> bool
        @@ -422,10 +422,10 @@

        Static members

        - + ReluctantReplace(...) -
        +
        Signature: (fsa1:FSA<'a> * fsa2:FSA<'a> * fsa3:FSA<'a> * smb1:'?7293 * smb2:'?7293 * getChar:(Symb<'a> -> '?7293) * newSmb:('?7293 -> Symb<'a>) * equalSmbl:('a -> 'a -> bool)) -> FSA<'a>
        @@ -440,10 +440,10 @@

        Static members

        - + Replace(...) -
        +
        Signature: (fsa1:FSA<'a> * fsa2:FSA<'a> * fsa3:FSA<'a> * smb1:'?7287 * smb2:'?7287 * getChar:(Symb<'a> -> '?7287) * newSmb:('?7287 -> Symb<'a>) * equalSmbl:('a -> 'a -> bool)) -> FSA<'a>
        @@ -460,10 +460,10 @@

        Static members

        - + Union(fsa1, fsa2) -
        +
        Signature: (fsa1:FSA<'a> * fsa2:FSA<'a>) -> FSA<'a>
        @@ -478,10 +478,10 @@

        Static members

        - + Widen(fsa1, fsa2, fsaParams) -
        +
        Signature: (fsa1:FSA<'a> * fsa2:FSA<'a> * fsaParams:FsaParams<'?7312,'a>) -> FSA<'a>
        diff --git a/reference/quickgraph-fsa-graphbasedfsa-fsaparams-2.html b/reference/quickgraph-fsa-graphbasedfsa-fsaparams-2.html index 2ddc6c09a..a268f4431 100644 --- a/reference/quickgraph-fsa-graphbasedfsa-fsaparams-2.html +++ b/reference/quickgraph-fsa-graphbasedfsa-fsaparams-2.html @@ -51,10 +51,10 @@

        Record Fields

        - + Alphabet -
        +
        Signature: HashSet<'a>
        @@ -69,10 +69,10 @@

        Record Fields

        - + GetChar -
        +
        Signature: Symb<'b> -> 'a
        @@ -87,10 +87,10 @@

        Record Fields

        - + NewSymbol -
        +
        Signature: 'a -> Symb<'b>
        @@ -105,10 +105,10 @@

        Record Fields

        - + SeparatorSmbl1 -
        +
        Signature: 'a
        @@ -123,10 +123,10 @@

        Record Fields

        - + SeparatorSmbl2 -
        +
        Signature: 'a
        @@ -141,10 +141,10 @@

        Record Fields

        - + SymbolsAreEqual -
        +
        Signature: 'b -> 'b -> bool
        diff --git a/reference/quickgraph-fsa-graphbasedfsa-multimap-2.html b/reference/quickgraph-fsa-graphbasedfsa-multimap-2.html index 87e1f9d4e..c0d620d59 100644 --- a/reference/quickgraph-fsa-graphbasedfsa-multimap-2.html +++ b/reference/quickgraph-fsa-graphbasedfsa-multimap-2.html @@ -51,10 +51,10 @@

        Instance members

        - + Comparer -
        +
        Signature: IEqualityComparer<'a>
        @@ -65,10 +65,10 @@

        Instance members

        - + Count -
        +
        Signature: int
        Modifiers: abstract
        @@ -80,10 +80,10 @@

        Instance members

        - + [()] -
        +
        Signature: unit -> 'a
        Modifiers: abstract
        @@ -95,10 +95,10 @@

        Instance members

        - + Keys -
        +
        Signature: KeyCollection<'a,ResizeArray<'b>>
        @@ -109,10 +109,10 @@

        Instance members

        - + Values -
        +
        Signature: ValueCollection<'a,ResizeArray<'b>>
        diff --git a/reference/quickgraph-fsa-graphbasedfsa-nodesetset.html b/reference/quickgraph-fsa-graphbasedfsa-nodesetset.html index 7f9bdcd17..69dbbbac4 100644 --- a/reference/quickgraph-fsa-graphbasedfsa-nodesetset.html +++ b/reference/quickgraph-fsa-graphbasedfsa-nodesetset.html @@ -51,10 +51,10 @@

        Instance members

        - + Count -
        +
        Signature: int
        @@ -66,10 +66,10 @@

        Instance members

        - + IsEmpty -
        +
        Signature: bool
        @@ -81,10 +81,10 @@

        Instance members

        - + MaximumElement -
        +
        Signature: NfaNodeIdSet
        @@ -96,10 +96,10 @@

        Instance members

        - + MinimumElement -
        +
        Signature: NfaNodeIdSet
        diff --git a/reference/quickgraph-fsa-graphbasedfsa-replaceamount.html b/reference/quickgraph-fsa-graphbasedfsa-replaceamount.html index 97b348800..8871f4349 100644 --- a/reference/quickgraph-fsa-graphbasedfsa-replaceamount.html +++ b/reference/quickgraph-fsa-graphbasedfsa-replaceamount.html @@ -51,10 +51,10 @@

        Union Cases

        - + All -
        +
        Signature:
        @@ -69,10 +69,10 @@

        Union Cases

        - + OnlyFirst -
        +
        Signature:
        diff --git a/reference/quickgraph-fsa-graphbasedfsa-replaceappetite.html b/reference/quickgraph-fsa-graphbasedfsa-replaceappetite.html index e4e42f4c0..f481ec3c6 100644 --- a/reference/quickgraph-fsa-graphbasedfsa-replaceappetite.html +++ b/reference/quickgraph-fsa-graphbasedfsa-replaceappetite.html @@ -51,10 +51,10 @@

        Union Cases

        - + Declarative -
        +
        Signature:
        @@ -69,10 +69,10 @@

        Union Cases

        - + Greedy -
        +
        Signature:
        @@ -87,10 +87,10 @@

        Union Cases

        - + Reluctant -
        +
        Signature:
        diff --git a/reference/quickgraph-fsa-graphbasedfsa-replaceorder.html b/reference/quickgraph-fsa-graphbasedfsa-replaceorder.html index 1c7d40457..a59d77222 100644 --- a/reference/quickgraph-fsa-graphbasedfsa-replaceorder.html +++ b/reference/quickgraph-fsa-graphbasedfsa-replaceorder.html @@ -51,10 +51,10 @@

        Union Cases

        - + Anymost -
        +
        Signature:
        @@ -69,10 +69,10 @@

        Union Cases

        - + Leftmost -
        +
        Signature:
        diff --git a/reference/quickgraph-fsa-graphbasedfsa-symb-1.html b/reference/quickgraph-fsa-graphbasedfsa-symb-1.html index e42588651..c1a98a90e 100644 --- a/reference/quickgraph-fsa-graphbasedfsa-symb-1.html +++ b/reference/quickgraph-fsa-graphbasedfsa-symb-1.html @@ -51,10 +51,10 @@

        Union Cases

        - + Eps -
        +
        Signature:
        @@ -69,10 +69,10 @@

        Union Cases

        - + Smbl('a) -
        +
        Signature: 'a
        diff --git a/reference/quickgraph-fsa-graphbasedfsa.html b/reference/quickgraph-fsa-graphbasedfsa.html index 1f010fadf..3b0a430f7 100644 --- a/reference/quickgraph-fsa-graphbasedfsa.html +++ b/reference/quickgraph-fsa-graphbasedfsa.html @@ -130,10 +130,10 @@

        Functions and values

        - + AddToMultiMap trDict a b -
        +
        Signature: trDict:MultiMap<'?7190,'?7191> -> a:'?7190 -> b:'?7191 -> unit
        Type parameters: '?7190, '?7191
        @@ -148,10 +148,10 @@

        Functions and values

        - + fsaToDot (...) -
        +
        Signature: strs:seq<string> -> initState:ResizeArray<int> -> finalState:ResizeArray<int> -> filePrintPath:string -> unit
        @@ -166,10 +166,10 @@

        Functions and values

        - + newDfaNodeId -
        +
        Signature: unit -> int
        @@ -184,10 +184,10 @@

        Functions and values

        - + reset -
        +
        Signature: unit -> unit
        @@ -202,10 +202,10 @@

        Functions and values

        - + setVertexRemoved fsa startV -
        +
        Signature: fsa:'?7193 -> startV:'?7194 -> seq<'?7194>
        Type parameters: '?7193, '?7194, '?7195
        diff --git a/reference/quickgraph-fst-fsttable-edge-2.html b/reference/quickgraph-fst-fsttable-edge-2.html index 14616e262..1868e6bbd 100644 --- a/reference/quickgraph-fst-fsttable-edge-2.html +++ b/reference/quickgraph-fst-fsttable-edge-2.html @@ -51,10 +51,10 @@

        Record Fields

        - + EndV -
        +
        Signature: int
        @@ -69,10 +69,10 @@

        Record Fields

        - + InSymb -
        +
        Signature: 'iType
        @@ -87,10 +87,10 @@

        Record Fields

        - + OutSymb -
        +
        Signature: 'oType
        @@ -105,10 +105,10 @@

        Record Fields

        - + StartV -
        +
        Signature: int
        @@ -131,10 +131,10 @@

        Constructors

        - + new(startV, inSymb, outSymb, endV) -
        +
        Signature: (startV:int * inSymb:'iType * outSymb:'oType * endV:int) -> Edge<'iType,'oType>
        diff --git a/reference/quickgraph-fst-fsttable-fst-2.html b/reference/quickgraph-fst-fsttable-fst-2.html index a08b96617..671ddc827 100644 --- a/reference/quickgraph-fst-fsttable-fst-2.html +++ b/reference/quickgraph-fst-fsttable-fst-2.html @@ -51,10 +51,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> FST<'iType,'oType>
        @@ -78,10 +78,10 @@

        Instance members

        - + FinalState() -
        +
        Signature: unit -> ResizeArray<int>
        @@ -97,10 +97,10 @@

        Instance members

        - + FinalState() -
        +
        Signature: unit -> unit
        @@ -116,10 +116,10 @@

        Instance members

        - + Init(...) -
        +
        Signature: (initState:ResizeArray<int> * tableOfTransitions:ResizeArray<ResizeArray<int * int>> * arrayOfFunction:ResizeArray<('iType -> 'oType)> * finalState:ResizeArray<int>) -> unit
        @@ -134,10 +134,10 @@

        Instance members

        - + InitState() -
        +
        Signature: unit -> ResizeArray<int>
        @@ -153,10 +153,10 @@

        Instance members

        - + InitState() -
        +
        Signature: unit -> unit
        @@ -172,10 +172,10 @@

        Instance members

        - + LoadFromSimpleFST(fst) -
        +
        Signature: fst:SimpleFST<'iType,'oType> -> unit
        @@ -190,10 +190,10 @@

        Instance members

        - + printFST(filePath) -
        +
        Signature: filePath:string -> unit
        diff --git a/reference/quickgraph-fst-fsttable-simplefst-2.html b/reference/quickgraph-fst-fsttable-simplefst-2.html index 6c17b5073..74975eedb 100644 --- a/reference/quickgraph-fst-fsttable-simplefst-2.html +++ b/reference/quickgraph-fst-fsttable-simplefst-2.html @@ -51,10 +51,10 @@

        Record Fields

        - + Edges -
        +
        Signature: ResizeArray<Edge<'iType,'oType>>
        @@ -69,10 +69,10 @@

        Record Fields

        - + FinalState -
        +
        Signature: ResizeArray<int>
        @@ -87,10 +87,10 @@

        Record Fields

        - + InitState -
        +
        Signature: ResizeArray<int>
        @@ -113,10 +113,10 @@

        Constructors

        - + new(initState, edges, finalState) -
        +
        Signature: (initState:ResizeArray<int> * edges:ResizeArray<Edge<'iType,'oType>> * finalState:ResizeArray<int>) -> SimpleFST<'iType,'oType>
        diff --git a/reference/quickgraph-fst-fsttable.html b/reference/quickgraph-fst-fsttable.html index 975ca36e4..20ef37818 100644 --- a/reference/quickgraph-fst-fsttable.html +++ b/reference/quickgraph-fst-fsttable.html @@ -82,10 +82,10 @@

        Functions and values

        - + fstToDot (...) -
        +
        Signature: strs:seq<string> -> initState:ResizeArray<int> -> finalState:ResizeArray<int> -> filePrintPath:string -> unit
        @@ -100,10 +100,10 @@

        Functions and values

        - + maxVal -
        +
        Signature: uint64
        diff --git a/reference/quickgraph-fst-graphbasedfst-edgefst-2.html b/reference/quickgraph-fst-graphbasedfst-edgefst-2.html index 34c81b0e4..13e00318d 100644 --- a/reference/quickgraph-fst-graphbasedfst-edgefst-2.html +++ b/reference/quickgraph-fst-graphbasedfst-edgefst-2.html @@ -51,10 +51,10 @@

        Constructors

        - + new(s, e, t) -
        +
        Signature: (s:int * e:int * t:(Symb<'a> * Symb<'b>)) -> EdgeFST<'a,'b>
        diff --git a/reference/quickgraph-fst-graphbasedfst-fst-2.html b/reference/quickgraph-fst-graphbasedfst-fst-2.html index 6f80a3bf1..b504c91b2 100644 --- a/reference/quickgraph-fst-graphbasedfst-fst-2.html +++ b/reference/quickgraph-fst-graphbasedfst-fst-2.html @@ -51,10 +51,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> FST<'iType,'oType>
        @@ -70,10 +70,10 @@

        Constructors

        - + new(initial, final, transitions) -
        +
        Signature: (initial:ResizeArray<int> * final:ResizeArray<int> * transitions:ResizeArray<int * (Symb<'iType> * Symb<'oType>) * int>) -> FST<'iType,'oType>
        @@ -89,10 +89,10 @@

        Constructors

        - + new(initial, final, transitions) -
        +
        Signature: (initial:ResizeArray<int> * final:ResizeArray<int> * transitions:ResizeArray<EdgeFST<'iType,'oType>>) -> FST<'iType,'oType>
        @@ -116,10 +116,10 @@

        Instance members

        - + CachedEdges -
        +
        Signature: ResizeArray<EdgeFST<'iType,'oType>>
        @@ -135,10 +135,10 @@

        Instance members

        - + Concat(fst2) -
        +
        Signature: fst2:FST<'iType,'oType> -> FST<'iType,'oType>
        @@ -153,10 +153,10 @@

        Instance members

        - + FinalState() -
        +
        Signature: unit -> ResizeArray<int>
        @@ -172,10 +172,10 @@

        Instance members

        - + FinalState() -
        +
        Signature: unit -> unit
        @@ -191,10 +191,10 @@

        Instance members

        - + InitState() -
        +
        Signature: unit -> ResizeArray<int>
        @@ -210,10 +210,10 @@

        Instance members

        - + InitState() -
        +
        Signature: unit -> unit
        @@ -229,10 +229,10 @@

        Instance members

        - + IsEmpty -
        +
        Signature: bool
        @@ -248,10 +248,10 @@

        Instance members

        - + PrintToDOT(filePath, printSmb) -
        +
        Signature: (filePath:string * printSmb:('iType -> string) option) -> unit
        @@ -266,10 +266,10 @@

        Instance members

        - + RecachEdges() -
        +
        Signature: unit -> unit
        @@ -284,10 +284,10 @@

        Instance members

        - + Union(fst2) -
        +
        Signature: fst2:FST<'iType,'oType> -> FST<'iType,'oType>
        @@ -310,10 +310,10 @@

        Static members

        - + Compose(fst1, fst2, alphabet) -
        +
        Signature: (fst1:FST<'?7661,'?7662> * fst2:FST<'?7663,'?7664> * alphabet:HashSet<Symb<'?7662>>) -> Test<FST<'?7661,'?7664>,Symb<'?7661> []>
        Type parameters: '?7663, '?7664
        @@ -328,10 +328,10 @@

        Static members

        - + Concat(fst1, fst2) -
        +
        Signature: (fst1:FST<'iType,'oType> * fst2:FST<'iType,'oType>) -> FST<'iType,'oType>
        @@ -346,10 +346,10 @@

        Static members

        - + FSAtoFST(fsa, transform, smblEOF) -
        +
        Signature: (fsa:FSA<'?7650> * transform:(Symb<'?7650> -> Symb<'iType> * Symb<'oType>) * smblEOF:Symb<'?7650>) -> FST<'iType,'oType>
        @@ -366,10 +366,10 @@

        Static members

        - + oldCompose(fst1, fst2, alphabet) -
        +
        Signature: (fst1:FST<'?7654,'?7655> * fst2:FST<'?7656,'?7657> * alphabet:HashSet<Symb<'?7655>>) -> Test<FST<'?7654,'?7657>,Symb<'?7654> []>
        Type parameters: '?7656, '?7657
        @@ -386,10 +386,10 @@

        Static members

        - + Union(fst1, fst2) -
        +
        Signature: (fst1:FST<'iType,'oType> * fst2:FST<'iType,'oType>) -> FST<'iType,'oType>
        diff --git a/reference/quickgraph-fst-graphbasedfst-test-2.html b/reference/quickgraph-fst-graphbasedfst-test-2.html index c9290187e..b5dae0537 100644 --- a/reference/quickgraph-fst-graphbasedfst-test-2.html +++ b/reference/quickgraph-fst-graphbasedfst-test-2.html @@ -51,10 +51,10 @@

        Union Cases

        - + Error('error) -
        +
        Signature: 'error
        @@ -69,10 +69,10 @@

        Union Cases

        - + Success('success) -
        +
        Signature: 'success
        diff --git a/reference/quickgraph-fst-graphbasedfst.html b/reference/quickgraph-fst-graphbasedfst.html index 943957c08..9547a0c15 100644 --- a/reference/quickgraph-fst-graphbasedfst.html +++ b/reference/quickgraph-fst-graphbasedfst.html @@ -82,10 +82,10 @@

        Functions and values

        - + getReachableV fst startV -
        +
        Signature: fst:'?7577 -> startV:'?7578 -> ResizeArray<'?7578>
        Type parameters: '?7577, '?7578, '?7579
        @@ -100,10 +100,10 @@

        Functions and values

        - + setVertexRemoved fst startV -
        +
        Signature: fst:'?7573 -> startV:'?7574 -> ResizeArray<'?7574>
        Type parameters: '?7573, '?7574, '?7575
        diff --git a/reference/quickgraph-glee-gleedefaultgraphpopulator-2.html b/reference/quickgraph-glee-gleedefaultgraphpopulator-2.html index dfbdfb644..dd74c15c1 100644 --- a/reference/quickgraph-glee-gleedefaultgraphpopulator-2.html +++ b/reference/quickgraph-glee-gleedefaultgraphpopulator-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:IEdgeListGraph<'TVertex,'TEdge> -> unit
        diff --git a/reference/quickgraph-glee-gleeedgeeventargs-2.html b/reference/quickgraph-glee-gleeedgeeventargs-2.html index 9c8fbffa6..93cadd0e2 100644 --- a/reference/quickgraph-glee-gleeedgeeventargs-2.html +++ b/reference/quickgraph-glee-gleeedgeeventargs-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(edge, gedge) -
        +
        Signature: (edge:'TEdge * gedge:Edge) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + GEdge -
        +
        Signature: Edge
        diff --git a/reference/quickgraph-glee-gleeedgeeventhandler-2.html b/reference/quickgraph-glee-gleeedgeeventhandler-2.html index 6b822639c..1b40f4e9a 100644 --- a/reference/quickgraph-glee-gleeedgeeventhandler-2.html +++ b/reference/quickgraph-glee-gleeedgeeventhandler-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(object, method) -
        +
        Signature: (object:obj * method:nativeint) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + BeginInvoke(sender, e, callback, object) -
        +
        Signature: (sender:obj * e:GleeEdgeEventArgs<'Vertex,'Edge> * callback:AsyncCallback * object:obj) -> IAsyncResult
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + EndInvoke(result) -
        +
        Signature: result:IAsyncResult -> unit
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + Invoke(sender, e) -
        +
        Signature: (sender:obj * e:GleeEdgeEventArgs<'Vertex,'Edge>) -> unit
        Modifiers: abstract
        diff --git a/reference/quickgraph-glee-gleegraphextensions.html b/reference/quickgraph-glee-gleegraphextensions.html index ceae2b3bc..b8f936721 100644 --- a/reference/quickgraph-glee-gleegraphextensions.html +++ b/reference/quickgraph-glee-gleegraphextensions.html @@ -50,10 +50,10 @@

        Static members

        - + CreateGleePopulator(...) -
        +
        Signature: (visitedGraph:IEdgeListGraph<'TVertex,'TEdge> * formatProvider:IFormatProvider * format:string) -> GleeGraphPopulator<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -64,10 +64,10 @@

        Static members

        - + CreateGleePopulator(visitedGraph) -
        +
        Signature: visitedGraph:IEdgeListGraph<'TVertex,'TEdge> -> GleeGraphPopulator<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -78,10 +78,10 @@

        Static members

        - + CreateIdentifiableGleePopulator(...) -
        +
        Signature: (visitedGraph:IEdgeListGraph<'TVertex,'TEdge> * vertexIdentities:VertexIdentity<'TVertex>) -> GleeGraphPopulator<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -92,10 +92,10 @@

        Static members

        - + ShowDialog(graph) -
        +
        Signature: graph:Graph -> unit
        @@ -106,10 +106,10 @@

        Static members

        - + ToGleeGraph(...) -
        +
        Signature: (visitedGraph:IEdgeListGraph<'TVertex,'TEdge> * nodeAdded:GleeVertexNodeEventHandler<'TVertex> * edgeAdded:GleeEdgeEventHandler<'TVertex,'TEdge>) -> Graph
        Type parameters: 'TVertex, 'TEdge
        @@ -120,10 +120,10 @@

        Static members

        - + ToIdentifiableGleeGraph(...) -
        +
        Signature: (visitedGraph:IEdgeListGraph<'TVertex,'TEdge> * vertexIdentities:VertexIdentity<'TVertex> * nodeAdded:GleeVertexNodeEventHandler<'TVertex> * edgeAdded:GleeEdgeEventHandler<'TVertex,'TEdge>) -> Graph
        Type parameters: 'TVertex, 'TEdge
        diff --git a/reference/quickgraph-glee-gleegraphpopulator-2.html b/reference/quickgraph-glee-gleegraphpopulator-2.html index 4002be421..ee40624d8 100644 --- a/reference/quickgraph-glee-gleegraphpopulator-2.html +++ b/reference/quickgraph-glee-gleegraphpopulator-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:IEdgeListGraph<'TVertex,'TEdge> -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + EdgeAdded -
        +
        Signature: IEvent<GleeEdgeEventHandler<'TVertex,'TEdge>,GleeEdgeEventArgs<'TVertex,'TEdge>>
        @@ -86,10 +86,10 @@

        Instance members

        - + GleeGraph -
        +
        Signature: Graph
        @@ -100,10 +100,10 @@

        Instance members

        - + NodeAdded -
        +
        Signature: IEvent<GleeVertexNodeEventHandler<'TVertex>,GleeVertexEventArgs<'TVertex>>
        diff --git a/reference/quickgraph-glee-gleeindentifiablegraphpopulator-2.html b/reference/quickgraph-glee-gleeindentifiablegraphpopulator-2.html index c64ad612d..5f7457cec 100644 --- a/reference/quickgraph-glee-gleeindentifiablegraphpopulator-2.html +++ b/reference/quickgraph-glee-gleeindentifiablegraphpopulator-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(visitedGraph, vertexIdentities) -
        +
        Signature: (visitedGraph:IEdgeListGraph<'TVertex,'TEdge> * vertexIdentities:VertexIdentity<'TVertex>) -> unit
        diff --git a/reference/quickgraph-glee-gleetostringgraphpopulator-2.html b/reference/quickgraph-glee-gleetostringgraphpopulator-2.html index 9d7f95ff0..47cd17a5d 100644 --- a/reference/quickgraph-glee-gleetostringgraphpopulator-2.html +++ b/reference/quickgraph-glee-gleetostringgraphpopulator-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (visitedGraph:IEdgeListGraph<'TVertex,'TEdge> * formatProvider:IFormatProvider * format:string) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Format -
        +
        Signature: string
        @@ -86,10 +86,10 @@

        Instance members

        - + FormatProvider -
        +
        Signature: IFormatProvider
        diff --git a/reference/quickgraph-glee-gleevertexeventargs-1.html b/reference/quickgraph-glee-gleevertexeventargs-1.html index b36f2fb8f..85655f874 100644 --- a/reference/quickgraph-glee-gleevertexeventargs-1.html +++ b/reference/quickgraph-glee-gleevertexeventargs-1.html @@ -50,10 +50,10 @@

        Constructors

        - + new(vertex, node) -
        +
        Signature: (vertex:'TVertex * node:Node) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Node -
        +
        Signature: Node
        diff --git a/reference/quickgraph-glee-gleevertexnodeeventhandler-1.html b/reference/quickgraph-glee-gleevertexnodeeventhandler-1.html index ad3dc8a30..c01c609d7 100644 --- a/reference/quickgraph-glee-gleevertexnodeeventhandler-1.html +++ b/reference/quickgraph-glee-gleevertexnodeeventhandler-1.html @@ -50,10 +50,10 @@

        Constructors

        - + new(object, method) -
        +
        Signature: (object:obj * method:nativeint) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + BeginInvoke(...) -
        +
        Signature: (sender:obj * args:GleeVertexEventArgs<'Vertex> * callback:AsyncCallback * object:obj) -> IAsyncResult
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + EndInvoke(result) -
        +
        Signature: result:IAsyncResult -> unit
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + Invoke(sender, args) -
        +
        Signature: (sender:obj * args:GleeVertexEventArgs<'Vertex>) -> unit
        Modifiers: abstract
        diff --git a/reference/quickgraph-graphextensions.html b/reference/quickgraph-graphextensions.html index 6b3b96e70..44d5c9845 100644 --- a/reference/quickgraph-graphextensions.html +++ b/reference/quickgraph-graphextensions.html @@ -52,10 +52,10 @@

        Static members

        - + ToAdjacencyGraph(edges) -
        +
        Signature: (edges:'TVertex [] []) -> AdjacencyGraph<'TVertex,SEquatableEdge<'TVertex>>
        Type parameters: 'TVertex
        @@ -68,10 +68,10 @@

        Static members

        - + ToAdjacencyGraph(...) -
        +
        Signature: (edges:IEnumerable<'TEdge> * allowParallelEdges:bool) -> AdjacencyGraph<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -84,10 +84,10 @@

        Static members

        - + ToAdjacencyGraph(edges) -
        +
        Signature: edges:IEnumerable<'TEdge> -> AdjacencyGraph<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -100,10 +100,10 @@

        Static members

        - + ToAdjacencyGraph(...) -
        +
        Signature: (vertices:IEnumerable<'TVertex> * outEdgesFactory:Func<'TVertex,IEnumerable<'TEdge>> * allowParallelEdges:bool) -> AdjacencyGraph<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -117,10 +117,10 @@

        Static members

        - + ToAdjacencyGraph(...) -
        +
        Signature: (vertices:IEnumerable<'TVertex> * outEdgesFactory:Func<'TVertex,IEnumerable<'TEdge>>) -> AdjacencyGraph<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -134,10 +134,10 @@

        Static members

        - + ToAdjacencyGraph(vertexPairs) -
        +
        Signature: vertexPairs:IEnumerable<SEquatableEdge<'TVertex>> -> AdjacencyGraph<'TVertex,SEquatableEdge<'TVertex>>
        Type parameters: 'TVertex
        @@ -150,10 +150,10 @@

        Static members

        - + ToArrayAdjacencyGraph(graph) -
        +
        Signature: graph:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> ArrayAdjacencyGraph<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -166,10 +166,10 @@

        Static members

        - + ToArrayBidirectionalGraph(graph) -
        +
        Signature: graph:IBidirectionalGraph<'TVertex,'TEdge> -> ArrayBidirectionalGraph<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -182,10 +182,10 @@

        Static members

        - + ToArrayUndirectedGraph(graph) -
        +
        Signature: graph:IUndirectedGraph<'TVertex,'TEdge> -> ArrayUndirectedGraph<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -198,10 +198,10 @@

        Static members

        - + ToBidirectionalGraph(graph) -
        +
        Signature: graph:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> IBidirectionalGraph<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -214,10 +214,10 @@

        Static members

        - + ToBidirectionalGraph(...) -
        +
        Signature: (edges:IEnumerable<'TEdge> * allowParallelEdges:bool) -> BidirectionalGraph<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -230,10 +230,10 @@

        Static members

        - + ToBidirectionalGraph(edges) -
        +
        Signature: edges:IEnumerable<'TEdge> -> BidirectionalGraph<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -246,10 +246,10 @@

        Static members

        - + ToBidirectionalGraph(...) -
        +
        Signature: (vertices:IEnumerable<'TVertex> * outEdgesFactory:Func<'TVertex,IEnumerable<'TEdge>> * allowParallelEdges:bool) -> BidirectionalGraph<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -263,10 +263,10 @@

        Static members

        - + ToBidirectionalGraph(...) -
        +
        Signature: (vertices:IEnumerable<'TVertex> * outEdgesFactory:Func<'TVertex,IEnumerable<'TEdge>>) -> BidirectionalGraph<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -280,10 +280,10 @@

        Static members

        - + ToBidirectionalGraph(vertexPairs) -
        +
        Signature: vertexPairs:IEnumerable<SEquatableEdge<'TVertex>> -> BidirectionalGraph<'TVertex,SEquatableEdge<'TVertex>>
        Type parameters: 'TVertex
        @@ -296,10 +296,10 @@

        Static members

        - + ToCompressedRowGraph(visitedGraph) -
        +
        Signature: visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> CompressedSparseRowGraph<'TVertex>
        Type parameters: 'TVertex, 'TEdge
        @@ -312,10 +312,10 @@

        Static members

        - + ToDelegateBidirectionalIncidenceGraph(...) -
        +
        Signature: (tryGetOutEdges:TryFunc<'TVertex,IEnumerable<'TEdge>> * tryGetInEdges:TryFunc<'TVertex,IEnumerable<'TEdge>>) -> DelegateBidirectionalIncidenceGraph<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -328,10 +328,10 @@

        Static members

        - + ToDelegateIncidenceGraph(tryGetOutEdges) -
        +
        Signature: tryGetOutEdges:TryFunc<'TVertex,IEnumerable<'TEdge>> -> DelegateIncidenceGraph<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -344,10 +344,10 @@

        Static members

        - + ToDelegateIncidenceGraph(getOutEdges) -
        +
        Signature: getOutEdges:Func<'TVertex,IEnumerable<'TEdge>> -> DelegateIncidenceGraph<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -360,10 +360,10 @@

        Static members

        - + ToDelegateUndirectedGraph(dictionary) -
        +
        Signature: dictionary:IDictionary<'TVertex,'TValue> -> DelegateVertexAndEdgeListGraph<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge, 'TValue
        @@ -376,10 +376,10 @@

        Static members

        - + ToDelegateUndirectedGraph(...) -
        +
        Signature: (dictionary:IDictionary<'TVertex,'TValue> * keyValueToOutEdges:Converter<KeyValuePair<'TVertex,'TValue>,IEnumerable<'TEdge>>) -> DelegateVertexAndEdgeListGraph<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge, 'TValue
        @@ -392,10 +392,10 @@

        Static members

        - + ToDelegateUndirectedGraph(...) -
        +
        Signature: (vertices:IEnumerable<'TVertex> * tryGetAdjacentEdges:TryFunc<'TVertex,IEnumerable<'TEdge>>) -> DelegateUndirectedGraph<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -408,10 +408,10 @@

        Static members

        - + ToDelegateUndirectedGraph(...) -
        +
        Signature: (vertices:IEnumerable<'TVertex> * getAdjacentEdges:Func<'TVertex,IEnumerable<'TEdge>>) -> DelegateUndirectedGraph<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -424,10 +424,10 @@

        Static members

        - + ToDelegateVertexAndEdgeListGraph(...) -
        +
        Signature: (vertices:IEnumerable<'TVertex> * tryGetOutEdges:TryFunc<'TVertex,IEnumerable<'TEdge>>) -> DelegateVertexAndEdgeListGraph<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -440,10 +440,10 @@

        Static members

        - + ToDelegateVertexAndEdgeListGraph(...) -
        +
        Signature: (vertices:IEnumerable<'TVertex> * getOutEdges:Func<'TVertex,IEnumerable<'TEdge>>) -> DelegateVertexAndEdgeListGraph<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -456,10 +456,10 @@

        Static members

        - + ToTryFunc(func) -
        +
        Signature: func:Func<'T,'TResult> -> TryFunc<'T,'TResult>
        Type parameters: 'T, 'TResult
        @@ -472,10 +472,10 @@

        Static members

        - + ToUndirectedGraph(edges) -
        +
        Signature: edges:IEnumerable<'TEdge> -> UndirectedGraph<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -488,10 +488,10 @@

        Static members

        - + ToUndirectedGraph(...) -
        +
        Signature: (edges:IEnumerable<'TEdge> * allowParralelEdges:bool) -> UndirectedGraph<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge
        @@ -504,10 +504,10 @@

        Static members

        - + ToUndirectedGraph(vertexPairs) -
        +
        Signature: vertexPairs:IEnumerable<SEquatableEdge<'TVertex>> -> UndirectedGraph<'TVertex,SEquatableEdge<'TVertex>>
        Type parameters: 'TVertex
        @@ -520,10 +520,10 @@

        Static members

        - + ToVertexAndEdgeListGraph(dictionary) -
        +
        Signature: dictionary:IDictionary<'TVertex,'TValue> -> DelegateVertexAndEdgeListGraph<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge, 'TValue
        @@ -536,10 +536,10 @@

        Static members

        - + ToVertexAndEdgeListGraph(...) -
        +
        Signature: (dictionary:IDictionary<'TVertex,'TValue> * keyValueToOutEdges:Converter<KeyValuePair<'TVertex,'TValue>,IEnumerable<'TEdge>>) -> DelegateVertexAndEdgeListGraph<'TVertex,'TEdge>
        Type parameters: 'TVertex, 'TEdge, 'TValue
        diff --git a/reference/quickgraph-graphviz-condensatedgraphrenderer-3.html b/reference/quickgraph-graphviz-condensatedgraphrenderer-3.html index e98c408fd..5855441e4 100644 --- a/reference/quickgraph-graphviz-condensatedgraphrenderer-3.html +++ b/reference/quickgraph-graphviz-condensatedgraphrenderer-3.html @@ -50,10 +50,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:IVertexAndEdgeListGraph<'TGraph,CondensedEdge<'TVertex,'TEdge,'TGraph>> -> unit
        diff --git a/reference/quickgraph-graphviz-dot-graphvizarrow.html b/reference/quickgraph-graphviz-dot-graphvizarrow.html index 4406841a3..8b5ea74ca 100644 --- a/reference/quickgraph-graphviz-dot-graphvizarrow.html +++ b/reference/quickgraph-graphviz-dot-graphvizarrow.html @@ -50,10 +50,10 @@

        Constructors

        - + new(shape) -
        +
        Signature: shape:GraphvizArrowShape -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(shape, clip, fill) -
        +
        Signature: (shape:GraphvizArrowShape * clip:GraphvizArrowClipping * fill:GraphvizArrowFilling) -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + Clipping() -
        +
        Signature: unit -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + Filling() -
        +
        Signature: unit -> unit
        @@ -114,10 +114,10 @@

        Instance members

        - + Shape() -
        +
        Signature: unit -> unit
        @@ -128,10 +128,10 @@

        Instance members

        - + ToDot() -
        +
        Signature: unit -> string
        @@ -142,10 +142,10 @@

        Instance members

        - + ToString() -
        +
        Signature: unit -> string
        Modifiers: abstract
        diff --git a/reference/quickgraph-graphviz-dot-graphvizedge.html b/reference/quickgraph-graphviz-dot-graphvizedge.html index f397a9035..5ff6c6c0e 100644 --- a/reference/quickgraph-graphviz-dot-graphvizedge.html +++ b/reference/quickgraph-graphviz-dot-graphvizedge.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Comment() -
        +
        Signature: unit -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + Dir() -
        +
        Signature: unit -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + Font() -
        +
        Signature: unit -> unit
        @@ -114,10 +114,10 @@

        Instance members

        - + FontColor() -
        +
        Signature: unit -> unit
        @@ -128,10 +128,10 @@

        Instance members

        - + Head() -
        +
        Signature: unit -> unit
        @@ -142,10 +142,10 @@

        Instance members

        - + HeadArrow() -
        +
        Signature: unit -> unit
        @@ -156,10 +156,10 @@

        Instance members

        - + HeadPort() -
        +
        Signature: unit -> unit
        @@ -170,10 +170,10 @@

        Instance members

        - + IsConstrained() -
        +
        Signature: unit -> unit
        @@ -184,10 +184,10 @@

        Instance members

        - + IsDecorated() -
        +
        Signature: unit -> unit
        @@ -198,10 +198,10 @@

        Instance members

        - + Label() -
        +
        Signature: unit -> unit
        @@ -212,10 +212,10 @@

        Instance members

        - + Layer() -
        +
        Signature: unit -> unit
        @@ -226,10 +226,10 @@

        Instance members

        - + Length() -
        +
        Signature: unit -> unit
        @@ -240,10 +240,10 @@

        Instance members

        - + MinLength() -
        +
        Signature: unit -> unit
        @@ -254,10 +254,10 @@

        Instance members

        - + StrokeColor() -
        +
        Signature: unit -> unit
        @@ -268,10 +268,10 @@

        Instance members

        - + Style() -
        +
        Signature: unit -> unit
        @@ -282,10 +282,10 @@

        Instance members

        - + Tail() -
        +
        Signature: unit -> unit
        @@ -296,10 +296,10 @@

        Instance members

        - + TailArrow() -
        +
        Signature: unit -> unit
        @@ -310,10 +310,10 @@

        Instance members

        - + TailPort() -
        +
        Signature: unit -> unit
        @@ -324,10 +324,10 @@

        Instance members

        - + ToDot() -
        +
        Signature: unit -> string
        @@ -338,10 +338,10 @@

        Instance members

        - + ToolTip() -
        +
        Signature: unit -> unit
        @@ -352,10 +352,10 @@

        Instance members

        - + ToString() -
        +
        Signature: unit -> string
        Modifiers: abstract
        @@ -367,10 +367,10 @@

        Instance members

        - + Url() -
        +
        Signature: unit -> unit
        @@ -381,10 +381,10 @@

        Instance members

        - + Weight() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-graphviz-dot-graphvizedgeextremity.html b/reference/quickgraph-graphviz-dot-graphvizedgeextremity.html index 594f06bc5..912ac1664 100644 --- a/reference/quickgraph-graphviz-dot-graphvizedgeextremity.html +++ b/reference/quickgraph-graphviz-dot-graphvizedgeextremity.html @@ -50,10 +50,10 @@

        Constructors

        - + new(isHead) -
        +
        Signature: isHead:bool -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + AddParameters(dic) -
        +
        Signature: dic:IDictionary -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + IsClipped() -
        +
        Signature: unit -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + IsHead -
        +
        Signature: bool
        @@ -114,10 +114,10 @@

        Instance members

        - + Label() -
        +
        Signature: unit -> unit
        @@ -128,10 +128,10 @@

        Instance members

        - + Logical() -
        +
        Signature: unit -> unit
        @@ -142,10 +142,10 @@

        Instance members

        - + Same() -
        +
        Signature: unit -> unit
        @@ -156,10 +156,10 @@

        Instance members

        - + ToolTip() -
        +
        Signature: unit -> unit
        @@ -170,10 +170,10 @@

        Instance members

        - + Url() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-graphviz-dot-graphvizedgelabel.html b/reference/quickgraph-graphviz-dot-graphvizedgelabel.html index 51e99d9cc..6934b4d3b 100644 --- a/reference/quickgraph-graphviz-dot-graphvizedgelabel.html +++ b/reference/quickgraph-graphviz-dot-graphvizedgelabel.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + AddParameters(dic) -
        +
        Signature: dic:IDictionary -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + Angle() -
        +
        Signature: unit -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + Distance() -
        +
        Signature: unit -> unit
        @@ -114,10 +114,10 @@

        Instance members

        - + Float() -
        +
        Signature: unit -> unit
        @@ -128,10 +128,10 @@

        Instance members

        - + Font() -
        +
        Signature: unit -> unit
        @@ -142,10 +142,10 @@

        Instance members

        - + FontColor() -
        +
        Signature: unit -> unit
        @@ -156,10 +156,10 @@

        Instance members

        - + Value() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-graphviz-dot-graphvizgraph.html b/reference/quickgraph-graphviz-dot-graphvizgraph.html index 2fbe3d7b4..f40a13e4c 100644 --- a/reference/quickgraph-graphviz-dot-graphvizgraph.html +++ b/reference/quickgraph-graphviz-dot-graphvizgraph.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + BackgroundColor() -
        +
        Signature: unit -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + ClusterRank() -
        +
        Signature: unit -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + Comment() -
        +
        Signature: unit -> unit
        @@ -114,10 +114,10 @@

        Instance members

        - + Font() -
        +
        Signature: unit -> unit
        @@ -128,10 +128,10 @@

        Instance members

        - + FontColor() -
        +
        Signature: unit -> unit
        @@ -142,10 +142,10 @@

        Instance members

        - + IsCentered() -
        +
        Signature: unit -> unit
        @@ -156,10 +156,10 @@

        Instance members

        - + IsCompounded() -
        +
        Signature: unit -> unit
        @@ -170,10 +170,10 @@

        Instance members

        - + IsConcentrated() -
        +
        Signature: unit -> unit
        @@ -184,10 +184,10 @@

        Instance members

        - + IsLandscape() -
        +
        Signature: unit -> unit
        @@ -198,10 +198,10 @@

        Instance members

        - + IsNormalized() -
        +
        Signature: unit -> unit
        @@ -212,10 +212,10 @@

        Instance members

        - + IsReMinCross() -
        +
        Signature: unit -> unit
        @@ -226,10 +226,10 @@

        Instance members

        - + Label() -
        +
        Signature: unit -> unit
        @@ -240,10 +240,10 @@

        Instance members

        - + LabelJustification() -
        +
        Signature: unit -> unit
        @@ -254,10 +254,10 @@

        Instance members

        - + LabelLocation() -
        +
        Signature: unit -> unit
        @@ -268,10 +268,10 @@

        Instance members

        - + Layers -
        +
        Signature: GraphvizLayerCollection
        @@ -282,10 +282,10 @@

        Instance members

        - + McLimit() -
        +
        Signature: unit -> unit
        @@ -296,10 +296,10 @@

        Instance members

        - + Name() -
        +
        Signature: unit -> unit
        @@ -310,10 +310,10 @@

        Instance members

        - + NodeSeparation() -
        +
        Signature: unit -> unit
        @@ -324,10 +324,10 @@

        Instance members

        - + NsLimit() -
        +
        Signature: unit -> unit
        @@ -338,10 +338,10 @@

        Instance members

        - + NsLimit1() -
        +
        Signature: unit -> unit
        @@ -352,10 +352,10 @@

        Instance members

        - + OutputOrder() -
        +
        Signature: unit -> unit
        @@ -366,10 +366,10 @@

        Instance members

        - + PageDirection() -
        +
        Signature: unit -> unit
        @@ -380,10 +380,10 @@

        Instance members

        - + PageSize() -
        +
        Signature: unit -> unit
        @@ -394,10 +394,10 @@

        Instance members

        - + Quantum() -
        +
        Signature: unit -> unit
        @@ -408,10 +408,10 @@

        Instance members

        - + RankDirection() -
        +
        Signature: unit -> unit
        @@ -422,10 +422,10 @@

        Instance members

        - + RankSeparation() -
        +
        Signature: unit -> unit
        @@ -436,10 +436,10 @@

        Instance members

        - + Ratio() -
        +
        Signature: unit -> unit
        @@ -450,10 +450,10 @@

        Instance members

        - + Resolution() -
        +
        Signature: unit -> unit
        @@ -464,10 +464,10 @@

        Instance members

        - + Rotate() -
        +
        Signature: unit -> unit
        @@ -478,10 +478,10 @@

        Instance members

        - + SamplePoints() -
        +
        Signature: unit -> unit
        @@ -492,10 +492,10 @@

        Instance members

        - + SearchSize() -
        +
        Signature: unit -> unit
        @@ -506,10 +506,10 @@

        Instance members

        - + Size() -
        +
        Signature: unit -> unit
        @@ -520,10 +520,10 @@

        Instance members

        - + StyleSheet() -
        +
        Signature: unit -> unit
        @@ -534,10 +534,10 @@

        Instance members

        - + ToDot() -
        +
        Signature: unit -> string
        @@ -548,10 +548,10 @@

        Instance members

        - + ToString() -
        +
        Signature: unit -> string
        Modifiers: abstract
        @@ -563,10 +563,10 @@

        Instance members

        - + Url() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-graphviz-dot-graphvizlayer.html b/reference/quickgraph-graphviz-dot-graphvizlayer.html index c6da8e066..8970bcf72 100644 --- a/reference/quickgraph-graphviz-dot-graphvizlayer.html +++ b/reference/quickgraph-graphviz-dot-graphvizlayer.html @@ -50,10 +50,10 @@

        Constructors

        - + new(name) -
        +
        Signature: name:string -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Name() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-graphviz-dot-graphvizlayercollection.html b/reference/quickgraph-graphviz-dot-graphvizlayercollection.html index 875965c99..aea4ce621 100644 --- a/reference/quickgraph-graphviz-dot-graphvizlayercollection.html +++ b/reference/quickgraph-graphviz-dot-graphvizlayercollection.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(items) -
        +
        Signature: (items:GraphvizLayer []) -> unit
        @@ -78,10 +78,10 @@

        Constructors

        - + new(items) -
        +
        Signature: items:GraphvizLayerCollection -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + Separators() -
        +
        Signature: unit -> unit
        @@ -114,10 +114,10 @@

        Instance members

        - + ToDot() -
        +
        Signature: unit -> string
        diff --git a/reference/quickgraph-graphviz-dot-graphvizrecord.html b/reference/quickgraph-graphviz-dot-graphvizrecord.html index 929a1b461..67a4780c5 100644 --- a/reference/quickgraph-graphviz-dot-graphvizrecord.html +++ b/reference/quickgraph-graphviz-dot-graphvizrecord.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Cells -
        +
        Signature: GraphvizRecordCellCollection
        @@ -86,10 +86,10 @@

        Instance members

        - + ToDot() -
        +
        Signature: unit -> string
        @@ -100,10 +100,10 @@

        Instance members

        - + ToString() -
        +
        Signature: unit -> string
        Modifiers: abstract
        diff --git a/reference/quickgraph-graphviz-dot-graphvizrecordcell.html b/reference/quickgraph-graphviz-dot-graphvizrecordcell.html index 83dc478b9..19e6edcee 100644 --- a/reference/quickgraph-graphviz-dot-graphvizrecordcell.html +++ b/reference/quickgraph-graphviz-dot-graphvizrecordcell.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Cells -
        +
        Signature: GraphvizRecordCellCollection
        @@ -86,10 +86,10 @@

        Instance members

        - + Escaper -
        +
        Signature: GraphvizRecordEscaper
        @@ -100,10 +100,10 @@

        Instance members

        - + HasPort -
        +
        Signature: bool
        @@ -114,10 +114,10 @@

        Instance members

        - + HasText -
        +
        Signature: bool
        @@ -128,10 +128,10 @@

        Instance members

        - + Port() -
        +
        Signature: unit -> unit
        @@ -142,10 +142,10 @@

        Instance members

        - + Text() -
        +
        Signature: unit -> unit
        @@ -156,10 +156,10 @@

        Instance members

        - + ToDot() -
        +
        Signature: unit -> string
        @@ -170,10 +170,10 @@

        Instance members

        - + ToString() -
        +
        Signature: unit -> string
        Modifiers: abstract
        diff --git a/reference/quickgraph-graphviz-dot-graphvizrecordcellcollection.html b/reference/quickgraph-graphviz-dot-graphvizrecordcellcollection.html index 0f0e4fb42..6c55d9f4b 100644 --- a/reference/quickgraph-graphviz-dot-graphvizrecordcellcollection.html +++ b/reference/quickgraph-graphviz-dot-graphvizrecordcellcollection.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(items) -
        +
        Signature: (items:GraphvizRecordCell []) -> unit
        @@ -78,10 +78,10 @@

        Constructors

        - + new(items) -
        +
        Signature: items:GraphvizRecordCellCollection -> unit
        diff --git a/reference/quickgraph-graphviz-dot-graphvizrecordescaper.html b/reference/quickgraph-graphviz-dot-graphvizrecordescaper.html index 7220f19e1..835515a9f 100644 --- a/reference/quickgraph-graphviz-dot-graphvizrecordescaper.html +++ b/reference/quickgraph-graphviz-dot-graphvizrecordescaper.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Escape(text) -
        +
        Signature: text:string -> string
        @@ -86,10 +86,10 @@

        Instance members

        - + MatchEvaluator(m) -
        +
        Signature: m:Match -> string
        diff --git a/reference/quickgraph-graphviz-dot-graphvizvertex.html b/reference/quickgraph-graphviz-dot-graphvizvertex.html index b673067cb..c1d71a118 100644 --- a/reference/quickgraph-graphviz-dot-graphvizvertex.html +++ b/reference/quickgraph-graphviz-dot-graphvizvertex.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + BottomLabel() -
        +
        Signature: unit -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + Comment() -
        +
        Signature: unit -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + Distorsion() -
        +
        Signature: unit -> unit
        @@ -114,10 +114,10 @@

        Instance members

        - + FillColor() -
        +
        Signature: unit -> unit
        @@ -128,10 +128,10 @@

        Instance members

        - + FixedSize() -
        +
        Signature: unit -> unit
        @@ -142,10 +142,10 @@

        Instance members

        - + Font() -
        +
        Signature: unit -> unit
        @@ -156,10 +156,10 @@

        Instance members

        - + FontColor() -
        +
        Signature: unit -> unit
        @@ -170,10 +170,10 @@

        Instance members

        - + Group() -
        +
        Signature: unit -> unit
        @@ -184,10 +184,10 @@

        Instance members

        - + Label() -
        +
        Signature: unit -> unit
        @@ -198,10 +198,10 @@

        Instance members

        - + Layer() -
        +
        Signature: unit -> unit
        @@ -212,10 +212,10 @@

        Instance members

        - + Orientation() -
        +
        Signature: unit -> unit
        @@ -226,10 +226,10 @@

        Instance members

        - + Peripheries() -
        +
        Signature: unit -> unit
        @@ -240,10 +240,10 @@

        Instance members

        - + Position() -
        +
        Signature: unit -> unit
        @@ -254,10 +254,10 @@

        Instance members

        - + Record() -
        +
        Signature: unit -> unit
        @@ -268,10 +268,10 @@

        Instance members

        - + Regular() -
        +
        Signature: unit -> unit
        @@ -282,10 +282,10 @@

        Instance members

        - + Shape() -
        +
        Signature: unit -> unit
        @@ -296,10 +296,10 @@

        Instance members

        - + Sides() -
        +
        Signature: unit -> unit
        @@ -310,10 +310,10 @@

        Instance members

        - + Size() -
        +
        Signature: unit -> unit
        @@ -324,10 +324,10 @@

        Instance members

        - + Skew() -
        +
        Signature: unit -> unit
        @@ -338,10 +338,10 @@

        Instance members

        - + StrokeColor() -
        +
        Signature: unit -> unit
        @@ -352,10 +352,10 @@

        Instance members

        - + Style() -
        +
        Signature: unit -> unit
        @@ -366,10 +366,10 @@

        Instance members

        - + ToDot() -
        +
        Signature: unit -> string
        @@ -380,10 +380,10 @@

        Instance members

        - + ToolTip() -
        +
        Signature: unit -> unit
        @@ -394,10 +394,10 @@

        Instance members

        - + TopLabel() -
        +
        Signature: unit -> unit
        @@ -408,10 +408,10 @@

        Instance members

        - + ToString() -
        +
        Signature: unit -> string
        Modifiers: abstract
        @@ -423,10 +423,10 @@

        Instance members

        - + Url() -
        +
        Signature: unit -> unit
        @@ -437,10 +437,10 @@

        Instance members

        - + Z() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-graphviz-edgemergecondensatedgraphrenderer-2.html b/reference/quickgraph-graphviz-edgemergecondensatedgraphrenderer-2.html index 2d42b28ee..418c31789 100644 --- a/reference/quickgraph-graphviz-edgemergecondensatedgraphrenderer-2.html +++ b/reference/quickgraph-graphviz-edgemergecondensatedgraphrenderer-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:IVertexAndEdgeListGraph<'TVertex,MergedEdge<'TVertex,'TEdge>> -> unit
        diff --git a/reference/quickgraph-graphviz-filedotengine.html b/reference/quickgraph-graphviz-filedotengine.html index 1496b60d9..5a8d3776b 100644 --- a/reference/quickgraph-graphviz-filedotengine.html +++ b/reference/quickgraph-graphviz-filedotengine.html @@ -52,10 +52,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -74,10 +74,10 @@

        Instance members

        - + Run(imageType, dot, outputFileName) -
        +
        Signature: (imageType:GraphvizImageType * dot:string * outputFileName:string) -> string
        Modifiers: abstract
        diff --git a/reference/quickgraph-graphviz-formatclustereventargs-2.html b/reference/quickgraph-graphviz-formatclustereventargs-2.html index ef42100a1..16a701a56 100644 --- a/reference/quickgraph-graphviz-formatclustereventargs-2.html +++ b/reference/quickgraph-graphviz-formatclustereventargs-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(cluster, graphFormat) -
        +
        Signature: (cluster:IVertexAndEdgeListGraph<'TVertex,'TEdge> * graphFormat:GraphvizGraph) -> unit
        @@ -74,10 +74,10 @@

        Instance members

        - + Cluster -
        +
        Signature: IVertexAndEdgeListGraph<'TVertex,'TEdge>
        @@ -88,10 +88,10 @@

        Instance members

        - + GraphFormat -
        +
        Signature: GraphvizGraph
        diff --git a/reference/quickgraph-graphviz-formatclustereventhandler-2.html b/reference/quickgraph-graphviz-formatclustereventhandler-2.html index 1c822a147..115768c4c 100644 --- a/reference/quickgraph-graphviz-formatclustereventhandler-2.html +++ b/reference/quickgraph-graphviz-formatclustereventhandler-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(object, method) -
        +
        Signature: (object:obj * method:nativeint) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + BeginInvoke(sender, e, callback, object) -
        +
        Signature: (sender:obj * e:FormatClusterEventArgs<'TVertex,'TEdge> * callback:AsyncCallback * object:obj) -> IAsyncResult
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + EndInvoke(result) -
        +
        Signature: result:IAsyncResult -> unit
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + Invoke(sender, e) -
        +
        Signature: (sender:obj * e:FormatClusterEventArgs<'TVertex,'TEdge>) -> unit
        Modifiers: abstract
        diff --git a/reference/quickgraph-graphviz-formatedgeaction-2.html b/reference/quickgraph-graphviz-formatedgeaction-2.html index 972324357..ba7bf0640 100644 --- a/reference/quickgraph-graphviz-formatedgeaction-2.html +++ b/reference/quickgraph-graphviz-formatedgeaction-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(object, method) -
        +
        Signature: (object:obj * method:nativeint) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + BeginInvoke(sender, e, callback, object) -
        +
        Signature: (sender:obj * e:FormatEdgeEventArgs<'TVertex,'TEdge> * callback:AsyncCallback * object:obj) -> IAsyncResult
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + EndInvoke(result) -
        +
        Signature: result:IAsyncResult -> unit
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + Invoke(sender, e) -
        +
        Signature: (sender:obj * e:FormatEdgeEventArgs<'TVertex,'TEdge>) -> unit
        Modifiers: abstract
        diff --git a/reference/quickgraph-graphviz-formatedgeeventargs-2.html b/reference/quickgraph-graphviz-formatedgeeventargs-2.html index 3c2237eb8..84917eedb 100644 --- a/reference/quickgraph-graphviz-formatedgeeventargs-2.html +++ b/reference/quickgraph-graphviz-formatedgeeventargs-2.html @@ -50,10 +50,10 @@

        Instance members

        - + EdgeFormatter -
        +
        Signature: GraphvizEdge
        diff --git a/reference/quickgraph-graphviz-formatvertexeventargs-1.html b/reference/quickgraph-graphviz-formatvertexeventargs-1.html index 98391aad1..da42db95e 100644 --- a/reference/quickgraph-graphviz-formatvertexeventargs-1.html +++ b/reference/quickgraph-graphviz-formatvertexeventargs-1.html @@ -50,10 +50,10 @@

        Instance members

        - + VertexFormatter -
        +
        Signature: GraphvizVertex
        diff --git a/reference/quickgraph-graphviz-formatvertexeventhandler-1.html b/reference/quickgraph-graphviz-formatvertexeventhandler-1.html index f363b8339..7a5c970ac 100644 --- a/reference/quickgraph-graphviz-formatvertexeventhandler-1.html +++ b/reference/quickgraph-graphviz-formatvertexeventhandler-1.html @@ -50,10 +50,10 @@

        Constructors

        - + new(object, method) -
        +
        Signature: (object:obj * method:nativeint) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + BeginInvoke(sender, e, callback, object) -
        +
        Signature: (sender:obj * e:FormatVertexEventArgs<'TVertex> * callback:AsyncCallback * object:obj) -> IAsyncResult
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + EndInvoke(result) -
        +
        Signature: result:IAsyncResult -> unit
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + Invoke(sender, e) -
        +
        Signature: (sender:obj * e:FormatVertexEventArgs<'TVertex>) -> unit
        Modifiers: abstract
        diff --git a/reference/quickgraph-graphviz-graphrendererbase-2.html b/reference/quickgraph-graphviz-graphrendererbase-2.html index e5a058706..cadf3f620 100644 --- a/reference/quickgraph-graphviz-graphrendererbase-2.html +++ b/reference/quickgraph-graphviz-graphrendererbase-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:IEdgeListGraph<'TVertex,'TEdge> -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Generate(dot, fileName) -
        +
        Signature: (dot:IDotEngine * fileName:string) -> string
        @@ -86,10 +86,10 @@

        Instance members

        - + Graphviz -
        +
        Signature: GraphvizAlgorithm<'TVertex,'TEdge>
        @@ -100,10 +100,10 @@

        Instance members

        - + VisitedGraph -
        +
        Signature: IEdgeListGraph<'TVertex,'TEdge>
        diff --git a/reference/quickgraph-graphviz-graphvizalgorithm-2.html b/reference/quickgraph-graphviz-graphvizalgorithm-2.html index 248b233a5..14484523e 100644 --- a/reference/quickgraph-graphviz-graphvizalgorithm-2.html +++ b/reference/quickgraph-graphviz-graphvizalgorithm-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(g) -
        +
        Signature: g:IEdgeListGraph<'TVertex,'TEdge> -> unit
        @@ -66,10 +66,10 @@

        Constructors

        - + new(g, path, imageType) -
        +
        Signature: (g:IEdgeListGraph<'TVertex,'TEdge> * path:string * imageType:GraphvizImageType) -> unit
        @@ -88,10 +88,10 @@

        Instance members

        - + CommonEdgeFormat -
        +
        Signature: GraphvizEdge
        @@ -102,10 +102,10 @@

        Instance members

        - + CommonVertexFormat -
        +
        Signature: GraphvizVertex
        @@ -116,10 +116,10 @@

        Instance members

        - + Escape(value) -
        +
        Signature: value:string -> string
        @@ -130,10 +130,10 @@

        Instance members

        - + FormatCluster -
        +
        Signature: IEvent<FormatClusterEventHandler<'TVertex,'TEdge>,FormatClusterEventArgs<'TVertex,'TEdge>>
        @@ -144,10 +144,10 @@

        Instance members

        - + FormatEdge -
        +
        Signature: IEvent<FormatEdgeAction<'TVertex,'TEdge>,FormatEdgeEventArgs<'TVertex,'TEdge>>
        @@ -158,10 +158,10 @@

        Instance members

        - + FormatVertex -
        +
        Signature: IEvent<FormatVertexEventHandler<'TVertex>,FormatVertexEventArgs<'TVertex>>
        @@ -172,10 +172,10 @@

        Instance members

        - + Generate() -
        +
        Signature: unit -> string
        @@ -186,10 +186,10 @@

        Instance members

        - + Generate(dot, outputFileName) -
        +
        Signature: (dot:IDotEngine * outputFileName:string) -> string
        @@ -200,10 +200,10 @@

        Instance members

        - + GraphFormat -
        +
        Signature: GraphvizGraph
        @@ -214,10 +214,10 @@

        Instance members

        - + ImageType() -
        +
        Signature: unit -> unit
        @@ -230,10 +230,10 @@

        Instance members

        - + Output -
        +
        Signature: StringWriter
        @@ -246,10 +246,10 @@

        Instance members

        - + VisitedGraph() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-graphviz-graphvizextensions.html b/reference/quickgraph-graphviz-graphvizextensions.html index 623323740..403fbbbbc 100644 --- a/reference/quickgraph-graphviz-graphvizextensions.html +++ b/reference/quickgraph-graphviz-graphvizextensions.html @@ -52,10 +52,10 @@

        Static members

        - + ToGraphviz(graph) -
        +
        Signature: graph:IEdgeListGraph<'TVertex,'TEdge> -> string
        Type parameters: 'TVertex, 'TEdge
        @@ -68,10 +68,10 @@

        Static members

        - + ToGraphviz(graph, initialization) -
        +
        Signature: (graph:IEdgeListGraph<'TVertex,'TEdge> * initialization:Action<GraphvizAlgorithm<'TVertex,'TEdge>>) -> string
        Type parameters: 'TVertex, 'TEdge
        @@ -84,10 +84,10 @@

        Static members

        - + ToSvg(graph) -
        +
        Signature: graph:IEdgeListGraph<'TVertex,'TEdge> -> string
        Type parameters: 'TVertex, 'TEdge
        @@ -101,10 +101,10 @@

        Static members

        - + ToSvg(graph, initialization) -
        +
        Signature: (graph:IEdgeListGraph<'TVertex,'TEdge> * initialization:Action<GraphvizAlgorithm<'TVertex,'TEdge>>) -> string
        Type parameters: 'TVertex, 'TEdge
        @@ -118,10 +118,10 @@

        Static members

        - + ToSvg(dot) -
        +
        Signature: dot:string -> string
        diff --git a/reference/quickgraph-graphviz-idotengine.html b/reference/quickgraph-graphviz-idotengine.html index 06f7e0bc6..a8fd71049 100644 --- a/reference/quickgraph-graphviz-idotengine.html +++ b/reference/quickgraph-graphviz-idotengine.html @@ -50,10 +50,10 @@

        Instance members

        - + Run(imageType, dot, outputFileName) -
        +
        Signature: (imageType:GraphvizImageType * dot:string * outputFileName:string) -> string
        Modifiers: abstract
        diff --git a/reference/quickgraph-graphviz-svghtmlwrapper.html b/reference/quickgraph-graphviz-svghtmlwrapper.html index 04b4a8174..1b86f7318 100644 --- a/reference/quickgraph-graphviz-svghtmlwrapper.html +++ b/reference/quickgraph-graphviz-svghtmlwrapper.html @@ -50,10 +50,10 @@

        Static members

        - + DumpHtml(size, svgFileName) -
        +
        Signature: (size:Size * svgFileName:string) -> string
        @@ -64,10 +64,10 @@

        Static members

        - + ParseSize(svg) -
        +
        Signature: svg:string -> Size
        @@ -78,10 +78,10 @@

        Static members

        - + WrapSvg(svgFileName) -
        +
        Signature: svgFileName:string -> string
        diff --git a/reference/quickgraph-ibidirectionalincidencegraph-2.html b/reference/quickgraph-ibidirectionalincidencegraph-2.html index 224514603..1e0d5bf3c 100644 --- a/reference/quickgraph-ibidirectionalincidencegraph-2.html +++ b/reference/quickgraph-ibidirectionalincidencegraph-2.html @@ -53,10 +53,10 @@

        Instance members

        - + Degree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -71,10 +71,10 @@

        Instance members

        - + InDegree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -88,10 +88,10 @@

        Instance members

        - + InEdge(v, index) -
        +
        Signature: (v:'TVertex * index:int) -> 'TEdge
        Modifiers: abstract
        @@ -105,10 +105,10 @@

        Instance members

        - + InEdges(v) -
        +
        Signature: v:'TVertex -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -122,10 +122,10 @@

        Instance members

        - + IsInEdgesEmpty(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -139,10 +139,10 @@

        Instance members

        - + TryGetInEdges(v, edges) -
        +
        Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-icloneableedge-2.html b/reference/quickgraph-icloneableedge-2.html index c8d738971..e9935d383 100644 --- a/reference/quickgraph-icloneableedge-2.html +++ b/reference/quickgraph-icloneableedge-2.html @@ -52,10 +52,10 @@

        Instance members

        - + Clone(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> 'TEdge
        Modifiers: abstract
        diff --git a/reference/quickgraph-iclusteredgraph.html b/reference/quickgraph-iclusteredgraph.html index 1c4cd9c90..584a2de90 100644 --- a/reference/quickgraph-iclusteredgraph.html +++ b/reference/quickgraph-iclusteredgraph.html @@ -50,10 +50,10 @@

        Instance members

        - + AddCluster() -
        +
        Signature: unit -> IClusteredGraph
        Modifiers: abstract
        @@ -65,10 +65,10 @@

        Instance members

        - + Clusters -
        +
        Signature: IEnumerable
        Modifiers: abstract
        @@ -80,10 +80,10 @@

        Instance members

        - + ClustersCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -95,10 +95,10 @@

        Instance members

        - + Colapsed() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -110,10 +110,10 @@

        Instance members

        - + RemoveCluster(g) -
        +
        Signature: g:IClusteredGraph -> unit
        Modifiers: abstract
        diff --git a/reference/quickgraph-identifiableedgefactory-2.html b/reference/quickgraph-identifiableedgefactory-2.html index 680e492de..babb6c0d9 100644 --- a/reference/quickgraph-identifiableedgefactory-2.html +++ b/reference/quickgraph-identifiableedgefactory-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(object, method) -
        +
        Signature: (object:obj * method:nativeint) -> unit
        @@ -74,10 +74,10 @@

        Instance members

        - + BeginInvoke(...) -
        +
        Signature: (source:'TVertex * target:'TVertex * id:string * callback:AsyncCallback * object:obj) -> IAsyncResult
        Modifiers: abstract
        @@ -89,10 +89,10 @@

        Instance members

        - + EndInvoke(result) -
        +
        Signature: result:IAsyncResult -> 'TEdge
        Modifiers: abstract
        @@ -104,10 +104,10 @@

        Instance members

        - + Invoke(source, target, id) -
        +
        Signature: (source:'TVertex * target:'TVertex * id:string) -> 'TEdge
        Modifiers: abstract
        diff --git a/reference/quickgraph-identifiablevertexfactory-1.html b/reference/quickgraph-identifiablevertexfactory-1.html index 3b2ec6943..2bcb3a310 100644 --- a/reference/quickgraph-identifiablevertexfactory-1.html +++ b/reference/quickgraph-identifiablevertexfactory-1.html @@ -52,10 +52,10 @@

        Constructors

        - + new(object, method) -
        +
        Signature: (object:obj * method:nativeint) -> unit
        @@ -74,10 +74,10 @@

        Instance members

        - + BeginInvoke(id, callback, object) -
        +
        Signature: (id:string * callback:AsyncCallback * object:obj) -> IAsyncResult
        Modifiers: abstract
        @@ -89,10 +89,10 @@

        Instance members

        - + EndInvoke(result) -
        +
        Signature: result:IAsyncResult -> 'TVertex
        Modifiers: abstract
        @@ -104,10 +104,10 @@

        Instance members

        - + Invoke(id) -
        +
        Signature: id:string -> 'TVertex
        Modifiers: abstract
        diff --git a/reference/quickgraph-iedge-1.html b/reference/quickgraph-iedge-1.html index db8fc8c03..e8fa8543c 100644 --- a/reference/quickgraph-iedge-1.html +++ b/reference/quickgraph-iedge-1.html @@ -52,10 +52,10 @@

        Instance members

        - + Source -
        +
        Signature: 'TVertex
        Modifiers: abstract
        @@ -69,10 +69,10 @@

        Instance members

        - + Target -
        +
        Signature: 'TVertex
        Modifiers: abstract
        diff --git a/reference/quickgraph-iedgeset-2.html b/reference/quickgraph-iedgeset-2.html index 8e0e44521..532992fff 100644 --- a/reference/quickgraph-iedgeset-2.html +++ b/reference/quickgraph-iedgeset-2.html @@ -52,10 +52,10 @@

        Instance members

        - + ContainsEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -69,10 +69,10 @@

        Instance members

        - + EdgeCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -86,10 +86,10 @@

        Instance members

        - + Edges -
        +
        Signature: IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -103,10 +103,10 @@

        Instance members

        - + IsEdgesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-igraph-2.html b/reference/quickgraph-igraph-2.html index cfdf9a200..173a8f00e 100644 --- a/reference/quickgraph-igraph-2.html +++ b/reference/quickgraph-igraph-2.html @@ -53,10 +53,10 @@

        Instance members

        - + AllowParallelEdges -
        +
        Signature: bool
        Modifiers: abstract
        @@ -70,10 +70,10 @@

        Instance members

        - + IsDirected -
        +
        Signature: bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-ihierarchy-2.html b/reference/quickgraph-ihierarchy-2.html index 0c886759b..0c162cc6b 100644 --- a/reference/quickgraph-ihierarchy-2.html +++ b/reference/quickgraph-ihierarchy-2.html @@ -50,10 +50,10 @@

        Instance members

        - + ChildrenEdges(vertex) -
        +
        Signature: vertex:'TVertex -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -68,10 +68,10 @@

        Instance members

        - + ChildrenVertices(vertex) -
        +
        Signature: vertex:'TVertex -> IEnumerable<'TVertex>
        Modifiers: abstract
        @@ -86,10 +86,10 @@

        Instance members

        - + GetParent(vertex) -
        +
        Signature: vertex:'TVertex -> 'TVertex
        Modifiers: abstract
        @@ -103,10 +103,10 @@

        Instance members

        - + GetParentEdge(vertex) -
        +
        Signature: vertex:'TVertex -> 'TEdge
        Modifiers: abstract
        @@ -120,10 +120,10 @@

        Instance members

        - + InducedEdgeCount(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> int
        Modifiers: abstract
        @@ -138,10 +138,10 @@

        Instance members

        - + IsCrossEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -156,10 +156,10 @@

        Instance members

        - + IsInnerNode(vertex) -
        +
        Signature: vertex:'TVertex -> bool
        Modifiers: abstract
        @@ -174,10 +174,10 @@

        Instance members

        - + IsPredecessorOf(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> bool
        Modifiers: abstract
        @@ -192,10 +192,10 @@

        Instance members

        - + IsRealEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -210,10 +210,10 @@

        Instance members

        - + Root -
        +
        Signature: 'TVertex
        Modifiers: abstract
        diff --git a/reference/quickgraph-ihyperedge-1.html b/reference/quickgraph-ihyperedge-1.html index 790d6d1e7..ffb268067 100644 --- a/reference/quickgraph-ihyperedge-1.html +++ b/reference/quickgraph-ihyperedge-1.html @@ -50,10 +50,10 @@

        Instance members

        - + EndPointCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -65,10 +65,10 @@

        Instance members

        - + EndPoints -
        +
        Signature: IEnumerable<'TVertex>
        Modifiers: abstract
        diff --git a/reference/quickgraph-iimplicitgraph-2.html b/reference/quickgraph-iimplicitgraph-2.html index bfbb6e4f6..695f14ff0 100644 --- a/reference/quickgraph-iimplicitgraph-2.html +++ b/reference/quickgraph-iimplicitgraph-2.html @@ -52,10 +52,10 @@

        Instance members

        - + IsOutEdgesEmpty(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -69,10 +69,10 @@

        Instance members

        - + OutDegree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -86,10 +86,10 @@

        Instance members

        - + OutEdge(v, index) -
        +
        Signature: (v:'TVertex * index:int) -> 'TEdge
        Modifiers: abstract
        @@ -103,10 +103,10 @@

        Instance members

        - + OutEdges(v) -
        +
        Signature: v:'TVertex -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -120,10 +120,10 @@

        Instance members

        - + TryGetOutEdges(v, edges) -
        +
        Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-iimplicitundirectedgraph-2.html b/reference/quickgraph-iimplicitundirectedgraph-2.html index f6a2db5ea..1a1fed2f8 100644 --- a/reference/quickgraph-iimplicitundirectedgraph-2.html +++ b/reference/quickgraph-iimplicitundirectedgraph-2.html @@ -50,10 +50,10 @@

        Instance members

        - + AdjacentDegree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -65,10 +65,10 @@

        Instance members

        - + AdjacentEdge(v, index) -
        +
        Signature: (v:'TVertex * index:int) -> 'TEdge
        Modifiers: abstract
        @@ -80,10 +80,10 @@

        Instance members

        - + AdjacentEdges(v) -
        +
        Signature: v:'TVertex -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -95,10 +95,10 @@

        Instance members

        - + ContainsEdge(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> bool
        Modifiers: abstract
        @@ -110,10 +110,10 @@

        Instance members

        - + EdgeEqualityComparer -
        +
        Signature: EdgeEqualityComparer<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -125,10 +125,10 @@

        Instance members

        - + IsAdjacentEdgesEmpty(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -140,10 +140,10 @@

        Instance members

        - + TryGetEdge(source, target, edge) -
        +
        Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-iimplicitvertexset-1.html b/reference/quickgraph-iimplicitvertexset-1.html index 805ae15d7..3ea11fec5 100644 --- a/reference/quickgraph-iimplicitvertexset-1.html +++ b/reference/quickgraph-iimplicitvertexset-1.html @@ -52,10 +52,10 @@

        Instance members

        - + ContainsVertex(vertex) -
        +
        Signature: vertex:'TVertex -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-iincidencegraph-2.html b/reference/quickgraph-iincidencegraph-2.html index 105512d98..2ffecd0e7 100644 --- a/reference/quickgraph-iincidencegraph-2.html +++ b/reference/quickgraph-iincidencegraph-2.html @@ -50,10 +50,10 @@

        Instance members

        - + ContainsEdge(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> bool
        Modifiers: abstract
        @@ -65,10 +65,10 @@

        Instance members

        - + TryGetEdge(source, target, edge) -
        +
        Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
        Modifiers: abstract
        @@ -80,10 +80,10 @@

        Instance members

        - + TryGetEdges(source, target, edges) -
        +
        Signature: (source:'TVertex * target:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-imutablebidirectionalgraph-2.html b/reference/quickgraph-imutablebidirectionalgraph-2.html index 940f2f767..3b80d5649 100644 --- a/reference/quickgraph-imutablebidirectionalgraph-2.html +++ b/reference/quickgraph-imutablebidirectionalgraph-2.html @@ -52,10 +52,10 @@

        Instance members

        - + ClearEdges(v) -
        +
        Signature: v:'TVertex -> unit
        Modifiers: abstract
        @@ -69,10 +69,10 @@

        Instance members

        - + ClearInEdges(v) -
        +
        Signature: v:'TVertex -> unit
        Modifiers: abstract
        @@ -86,10 +86,10 @@

        Instance members

        - + RemoveInEdgeIf(v, edgePredicate) -
        +
        Signature: (v:'TVertex * edgePredicate:EdgePredicate<'TVertex,'TEdge>) -> int
        Modifiers: abstract
        diff --git a/reference/quickgraph-imutableedgelistgraph-2.html b/reference/quickgraph-imutableedgelistgraph-2.html index e5440f39a..31a2018c7 100644 --- a/reference/quickgraph-imutableedgelistgraph-2.html +++ b/reference/quickgraph-imutableedgelistgraph-2.html @@ -52,10 +52,10 @@

        Instance members

        - + AddEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -69,10 +69,10 @@

        Instance members

        - + AddEdgeRange(edges) -
        +
        Signature: edges:IEnumerable<'TEdge> -> int
        Modifiers: abstract
        @@ -86,10 +86,10 @@

        Instance members

        - + EdgeAdded -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -103,10 +103,10 @@

        Instance members

        - + EdgeRemoved -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -120,10 +120,10 @@

        Instance members

        - + RemoveEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -137,10 +137,10 @@

        Instance members

        - + RemoveEdgeIf(predicate) -
        +
        Signature: predicate:EdgePredicate<'TVertex,'TEdge> -> int
        Modifiers: abstract
        diff --git a/reference/quickgraph-imutablegraph-2.html b/reference/quickgraph-imutablegraph-2.html index d6fa7e832..c788f66dd 100644 --- a/reference/quickgraph-imutablegraph-2.html +++ b/reference/quickgraph-imutablegraph-2.html @@ -52,10 +52,10 @@

        Instance members

        - + Clear() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        diff --git a/reference/quickgraph-imutableincidencegraph-2.html b/reference/quickgraph-imutableincidencegraph-2.html index 252c573aa..7128318e4 100644 --- a/reference/quickgraph-imutableincidencegraph-2.html +++ b/reference/quickgraph-imutableincidencegraph-2.html @@ -52,10 +52,10 @@

        Instance members

        - + ClearOutEdges(v) -
        +
        Signature: v:'TVertex -> unit
        Modifiers: abstract
        @@ -69,10 +69,10 @@

        Instance members

        - + RemoveOutEdgeIf(v, predicate) -
        +
        Signature: (v:'TVertex * predicate:EdgePredicate<'TVertex,'TEdge>) -> int
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + TrimEdgeExcess() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        diff --git a/reference/quickgraph-imutableundirectedgraph-2.html b/reference/quickgraph-imutableundirectedgraph-2.html index 3fb2d3e5a..8d73ff5c7 100644 --- a/reference/quickgraph-imutableundirectedgraph-2.html +++ b/reference/quickgraph-imutableundirectedgraph-2.html @@ -52,10 +52,10 @@

        Instance members

        - + ClearAdjacentEdges(vertex) -
        +
        Signature: vertex:'TVertex -> unit
        Modifiers: abstract
        @@ -67,10 +67,10 @@

        Instance members

        - + RemoveAdjacentEdgeIf(vertex, predicate) -
        +
        Signature: (vertex:'TVertex * predicate:EdgePredicate<'TVertex,'TEdge>) -> int
        Modifiers: abstract
        diff --git a/reference/quickgraph-imutablevertexandedgeset-2.html b/reference/quickgraph-imutablevertexandedgeset-2.html index 52797f66e..b0762c951 100644 --- a/reference/quickgraph-imutablevertexandedgeset-2.html +++ b/reference/quickgraph-imutablevertexandedgeset-2.html @@ -52,10 +52,10 @@

        Instance members

        - + AddVerticesAndEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -69,10 +69,10 @@

        Instance members

        - + AddVerticesAndEdgeRange(edges) -
        +
        Signature: edges:IEnumerable<'TEdge> -> int
        Modifiers: abstract
        diff --git a/reference/quickgraph-imutablevertexset-1.html b/reference/quickgraph-imutablevertexset-1.html index 5ccd744fa..310170fc5 100644 --- a/reference/quickgraph-imutablevertexset-1.html +++ b/reference/quickgraph-imutablevertexset-1.html @@ -52,10 +52,10 @@

        Instance members

        - + AddVertex(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -67,10 +67,10 @@

        Instance members

        - + AddVertexRange(vertices) -
        +
        Signature: vertices:IEnumerable<'TVertex> -> int
        Modifiers: abstract
        @@ -82,10 +82,10 @@

        Instance members

        - + RemoveVertex(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -97,10 +97,10 @@

        Instance members

        - + RemoveVertexIf(pred) -
        +
        Signature: pred:VertexPredicate<'TVertex> -> int
        Modifiers: abstract
        @@ -112,10 +112,10 @@

        Instance members

        - + VertexAdded -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -127,10 +127,10 @@

        Instance members

        - + VertexRemoved -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        diff --git a/reference/quickgraph-itagged-1.html b/reference/quickgraph-itagged-1.html index 4414a5058..c68515bb6 100644 --- a/reference/quickgraph-itagged-1.html +++ b/reference/quickgraph-itagged-1.html @@ -52,10 +52,10 @@

        Instance members

        - + Tag() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -69,10 +69,10 @@

        Instance members

        - + TagChanged -
        +
        Signature: IEvent<EventHandler,EventArgs>
        Modifiers: abstract
        diff --git a/reference/quickgraph-itermbidirectionalgraph-2.html b/reference/quickgraph-itermbidirectionalgraph-2.html index a3c7dc4e9..8fec02afe 100644 --- a/reference/quickgraph-itermbidirectionalgraph-2.html +++ b/reference/quickgraph-itermbidirectionalgraph-2.html @@ -50,10 +50,10 @@

        Instance members

        - + InDegreeAt(v, terminal) -
        +
        Signature: (v:'TVertex * terminal:int) -> int
        Modifiers: abstract
        @@ -65,10 +65,10 @@

        Instance members

        - + InEdgesAt(v, terminal) -
        +
        Signature: (v:'TVertex * terminal:int) -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -80,10 +80,10 @@

        Instance members

        - + InTerminalCount(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -95,10 +95,10 @@

        Instance members

        - + IsInEdgesEmptyAt(v, terminal) -
        +
        Signature: (v:'TVertex * terminal:int) -> bool
        Modifiers: abstract
        @@ -110,10 +110,10 @@

        Instance members

        - + IsOutEdgesEmptyAt(v, terminal) -
        +
        Signature: (v:'TVertex * terminal:int) -> bool
        Modifiers: abstract
        @@ -125,10 +125,10 @@

        Instance members

        - + OutDegreeAt(v, terminal) -
        +
        Signature: (v:'TVertex * terminal:int) -> int
        Modifiers: abstract
        @@ -140,10 +140,10 @@

        Instance members

        - + OutEdgesAt(v, terminal) -
        +
        Signature: (v:'TVertex * terminal:int) -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -155,10 +155,10 @@

        Instance members

        - + OutTerminalCount(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -170,10 +170,10 @@

        Instance members

        - + TryGetInEdgesAt(v, terminal, edges) -
        +
        Signature: (v:'TVertex * terminal:int * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        @@ -185,10 +185,10 @@

        Instance members

        - + TryGetOutEdgesAt(v, terminal, edges) -
        +
        Signature: (v:'TVertex * terminal:int * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-itermedge-1.html b/reference/quickgraph-itermedge-1.html index f2858a8c8..6c900d0a4 100644 --- a/reference/quickgraph-itermedge-1.html +++ b/reference/quickgraph-itermedge-1.html @@ -52,10 +52,10 @@

        Instance members

        - + SourceTerminal -
        +
        Signature: int
        Modifiers: abstract
        @@ -69,10 +69,10 @@

        Instance members

        - + TargetTerminal -
        +
        Signature: int
        Modifiers: abstract
        diff --git a/reference/quickgraph-ivertexset-1.html b/reference/quickgraph-ivertexset-1.html index 275cc2081..b21444abc 100644 --- a/reference/quickgraph-ivertexset-1.html +++ b/reference/quickgraph-ivertexset-1.html @@ -52,10 +52,10 @@

        Instance members

        - + IsVerticesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -69,10 +69,10 @@

        Instance members

        - + VertexCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -86,10 +86,10 @@

        Instance members

        - + Vertices -
        +
        Signature: IEnumerable<'TVertex>
        Modifiers: abstract
        diff --git a/reference/quickgraph-negativecyclegraphexception.html b/reference/quickgraph-negativecyclegraphexception.html index c89786687..79993f3d3 100644 --- a/reference/quickgraph-negativecyclegraphexception.html +++ b/reference/quickgraph-negativecyclegraphexception.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(message) -
        +
        Signature: message:string -> unit
        @@ -78,10 +78,10 @@

        Constructors

        - + new(message, inner) -
        +
        Signature: (message:string * inner:exn) -> unit
        @@ -92,10 +92,10 @@

        Constructors

        - + new(info, context) -
        +
        Signature: (info:SerializationInfo * context:StreamingContext) -> unit
        diff --git a/reference/quickgraph-negativeweightexception.html b/reference/quickgraph-negativeweightexception.html index 4efea9bad..b873b37c1 100644 --- a/reference/quickgraph-negativeweightexception.html +++ b/reference/quickgraph-negativeweightexception.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(message) -
        +
        Signature: message:string -> unit
        @@ -78,10 +78,10 @@

        Constructors

        - + new(message, inner) -
        +
        Signature: (message:string * inner:exn) -> unit
        @@ -92,10 +92,10 @@

        Constructors

        - + new(info, context) -
        +
        Signature: (info:SerializationInfo * context:StreamingContext) -> unit
        diff --git a/reference/quickgraph-nonacyclicgraphexception.html b/reference/quickgraph-nonacyclicgraphexception.html index 57d2eed24..15146b7ba 100644 --- a/reference/quickgraph-nonacyclicgraphexception.html +++ b/reference/quickgraph-nonacyclicgraphexception.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(message) -
        +
        Signature: message:string -> unit
        @@ -78,10 +78,10 @@

        Constructors

        - + new(message, inner) -
        +
        Signature: (message:string * inner:exn) -> unit
        @@ -92,10 +92,10 @@

        Constructors

        - + new(info, context) -
        +
        Signature: (info:SerializationInfo * context:StreamingContext) -> unit
        diff --git a/reference/quickgraph-nonstronglyconnectedgraphexception.html b/reference/quickgraph-nonstronglyconnectedgraphexception.html index 6a9037977..2e1e53b09 100644 --- a/reference/quickgraph-nonstronglyconnectedgraphexception.html +++ b/reference/quickgraph-nonstronglyconnectedgraphexception.html @@ -52,10 +52,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -66,10 +66,10 @@

        Constructors

        - + new(message) -
        +
        Signature: message:string -> unit
        @@ -80,10 +80,10 @@

        Constructors

        - + new(message, inner) -
        +
        Signature: (message:string * inner:exn) -> unit
        @@ -94,10 +94,10 @@

        Constructors

        - + new(info, context) -
        +
        Signature: (info:SerializationInfo * context:StreamingContext) -> unit
        diff --git a/reference/quickgraph-nopathfoundexception.html b/reference/quickgraph-nopathfoundexception.html index b83eb1abf..17bb61d07 100644 --- a/reference/quickgraph-nopathfoundexception.html +++ b/reference/quickgraph-nopathfoundexception.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-paralleledgenotallowedexception.html b/reference/quickgraph-paralleledgenotallowedexception.html index 6a2ec6c03..67f1e9bd3 100644 --- a/reference/quickgraph-paralleledgenotallowedexception.html +++ b/reference/quickgraph-paralleledgenotallowedexception.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(message) -
        +
        Signature: message:string -> unit
        @@ -78,10 +78,10 @@

        Constructors

        - + new(message, inner) -
        +
        Signature: (message:string * inner:exn) -> unit
        @@ -92,10 +92,10 @@

        Constructors

        - + new(info, context) -
        +
        Signature: (info:SerializationInfo * context:StreamingContext) -> unit
        diff --git a/reference/quickgraph-petri-allwaystrueconditionexpression-1.html b/reference/quickgraph-petri-allwaystrueconditionexpression-1.html index b6c3f0256..beb852255 100644 --- a/reference/quickgraph-petri-allwaystrueconditionexpression-1.html +++ b/reference/quickgraph-petri-allwaystrueconditionexpression-1.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + IsEnabled(tokens) -
        +
        Signature: tokens:IList<'Token> -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-petri-iarc-1.html b/reference/quickgraph-petri-iarc-1.html index f21d5e871..3d6eef36f 100644 --- a/reference/quickgraph-petri-iarc-1.html +++ b/reference/quickgraph-petri-iarc-1.html @@ -54,10 +54,10 @@

        Instance members

        - + Annotation() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -71,10 +71,10 @@

        Instance members

        - + IsInputArc -
        +
        Signature: bool
        Modifiers: abstract
        @@ -89,10 +89,10 @@

        Instance members

        - + Place -
        +
        Signature: IPlace<'Token>
        Modifiers: abstract
        @@ -107,10 +107,10 @@

        Instance members

        - + Transition -
        +
        Signature: ITransition<'Token>
        Modifiers: abstract
        diff --git a/reference/quickgraph-petri-iconditionexpression-1.html b/reference/quickgraph-petri-iconditionexpression-1.html index e61f3e603..898286100 100644 --- a/reference/quickgraph-petri-iconditionexpression-1.html +++ b/reference/quickgraph-petri-iconditionexpression-1.html @@ -50,10 +50,10 @@

        Instance members

        - + IsEnabled(tokens) -
        +
        Signature: tokens:IList<'Token> -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-petri-identityexpression-1.html b/reference/quickgraph-petri-identityexpression-1.html index 831c5a280..a1c8530e5 100644 --- a/reference/quickgraph-petri-identityexpression-1.html +++ b/reference/quickgraph-petri-identityexpression-1.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Eval(marking) -
        +
        Signature: marking:IList<'Token> -> IList<'Token>
        Modifiers: abstract
        diff --git a/reference/quickgraph-petri-iexpression-1.html b/reference/quickgraph-petri-iexpression-1.html index 3a86a5e24..a8c8d2067 100644 --- a/reference/quickgraph-petri-iexpression-1.html +++ b/reference/quickgraph-petri-iexpression-1.html @@ -50,10 +50,10 @@

        Instance members

        - + Eval(marking) -
        +
        Signature: marking:IList<'Token> -> IList<'Token>
        Modifiers: abstract
        diff --git a/reference/quickgraph-petri-imutablepetrinet-1.html b/reference/quickgraph-petri-imutablepetrinet-1.html index fac934e1f..194e7c293 100644 --- a/reference/quickgraph-petri-imutablepetrinet-1.html +++ b/reference/quickgraph-petri-imutablepetrinet-1.html @@ -50,10 +50,10 @@

        Instance members

        - + AddArc(place, transition) -
        +
        Signature: (place:IPlace<'Token> * transition:ITransition<'Token>) -> IArc<'Token>
        Modifiers: abstract
        @@ -65,10 +65,10 @@

        Instance members

        - + AddArc(transition, place) -
        +
        Signature: (transition:ITransition<'Token> * place:IPlace<'Token>) -> IArc<'Token>
        Modifiers: abstract
        @@ -80,10 +80,10 @@

        Instance members

        - + AddPlace(name) -
        +
        Signature: name:string -> IPlace<'Token>
        Modifiers: abstract
        @@ -95,10 +95,10 @@

        Instance members

        - + AddTransition(name) -
        +
        Signature: name:string -> ITransition<'Token>
        Modifiers: abstract
        diff --git a/reference/quickgraph-petri-ipetrinet-1.html b/reference/quickgraph-petri-ipetrinet-1.html index ea4001733..16525dc22 100644 --- a/reference/quickgraph-petri-ipetrinet-1.html +++ b/reference/quickgraph-petri-ipetrinet-1.html @@ -52,10 +52,10 @@

        Instance members

        - + Arcs -
        +
        Signature: IList<IArc<'Token>>
        Modifiers: abstract
        @@ -69,10 +69,10 @@

        Instance members

        - + Graph -
        +
        Signature: IPetriGraph<'Token>
        Modifiers: abstract
        @@ -84,10 +84,10 @@

        Instance members

        - + Places -
        +
        Signature: IList<IPlace<'Token>>
        Modifiers: abstract
        @@ -101,10 +101,10 @@

        Instance members

        - + Transitions -
        +
        Signature: IList<ITransition<'Token>>
        Modifiers: abstract
        diff --git a/reference/quickgraph-petri-ipetrivertex.html b/reference/quickgraph-petri-ipetrivertex.html index 59a61d0da..54e5ff10c 100644 --- a/reference/quickgraph-petri-ipetrivertex.html +++ b/reference/quickgraph-petri-ipetrivertex.html @@ -52,10 +52,10 @@

        Instance members

        - + Name -
        +
        Signature: string
        Modifiers: abstract
        diff --git a/reference/quickgraph-petri-iplace-1.html b/reference/quickgraph-petri-iplace-1.html index db9b96e7f..f31dd1c5d 100644 --- a/reference/quickgraph-petri-iplace-1.html +++ b/reference/quickgraph-petri-iplace-1.html @@ -52,10 +52,10 @@

        Instance members

        - + Marking -
        +
        Signature: IList<'Token>
        Modifiers: abstract
        @@ -67,10 +67,10 @@

        Instance members

        - + ToStringWithMarking() -
        +
        Signature: unit -> string
        Modifiers: abstract
        diff --git a/reference/quickgraph-petri-itransition-1.html b/reference/quickgraph-petri-itransition-1.html index 2bb158a14..7384bcd93 100644 --- a/reference/quickgraph-petri-itransition-1.html +++ b/reference/quickgraph-petri-itransition-1.html @@ -52,10 +52,10 @@

        Instance members

        - + Condition() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        diff --git a/reference/quickgraph-petri-petrinet-1.html b/reference/quickgraph-petri-petrinet-1.html index a2ffa84b6..c4c05708e 100644 --- a/reference/quickgraph-petri-petrinet-1.html +++ b/reference/quickgraph-petri-petrinet-1.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + AddArc(place, transition) -
        +
        Signature: (place:IPlace<'Token> * transition:ITransition<'Token>) -> IArc<'Token>
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + AddArc(transition, place) -
        +
        Signature: (transition:ITransition<'Token> * place:IPlace<'Token>) -> IArc<'Token>
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + AddPlace(name) -
        +
        Signature: name:string -> IPlace<'Token>
        Modifiers: abstract
        @@ -117,10 +117,10 @@

        Instance members

        - + AddTransition(name) -
        +
        Signature: name:string -> ITransition<'Token>
        Modifiers: abstract
        @@ -132,10 +132,10 @@

        Instance members

        - + Arcs -
        +
        Signature: IList<IArc<'Token>>
        Modifiers: abstract
        @@ -147,10 +147,10 @@

        Instance members

        - + Clone() -
        +
        Signature: unit -> PetriNet<'Token>
        @@ -161,10 +161,10 @@

        Instance members

        - + Graph -
        +
        Signature: IPetriGraph<'Token>
        Modifiers: abstract
        @@ -176,10 +176,10 @@

        Instance members

        - + Places -
        +
        Signature: IList<IPlace<'Token>>
        Modifiers: abstract
        @@ -191,10 +191,10 @@

        Instance members

        - + ToString() -
        +
        Signature: unit -> string
        Modifiers: abstract
        @@ -206,10 +206,10 @@

        Instance members

        - + Transitions -
        +
        Signature: IList<ITransition<'Token>>
        Modifiers: abstract
        diff --git a/reference/quickgraph-petri-petrinetsimulator-1.html b/reference/quickgraph-petri-petrinetsimulator-1.html index 16c66ac29..a3649024e 100644 --- a/reference/quickgraph-petri-petrinetsimulator-1.html +++ b/reference/quickgraph-petri-petrinetsimulator-1.html @@ -50,10 +50,10 @@

        Constructors

        - + new(net) -
        +
        Signature: net:IPetriNet<'Token> -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Initialize() -
        +
        Signature: unit -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + Net -
        +
        Signature: IPetriNet<'Token>
        @@ -100,10 +100,10 @@

        Instance members

        - + SimulateStep() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-predicates-filteredbidirectionalgraph-3.html b/reference/quickgraph-predicates-filteredbidirectionalgraph-3.html index 4293d9c11..c9b73bf89 100644 --- a/reference/quickgraph-predicates-filteredbidirectionalgraph-3.html +++ b/reference/quickgraph-predicates-filteredbidirectionalgraph-3.html @@ -50,10 +50,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (baseGraph:'TGraph * vertexPredicate:VertexPredicate<'TVertex> * edgePredicate:EdgePredicate<'TVertex,'TEdge>) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + ContainsEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + Degree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + EdgeCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -117,10 +117,10 @@

        Instance members

        - + Edges -
        +
        Signature: IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -132,10 +132,10 @@

        Instance members

        - + InDegree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -147,10 +147,10 @@

        Instance members

        - + InEdge(v, index) -
        +
        Signature: (v:'TVertex * index:int) -> 'TEdge
        Modifiers: abstract
        @@ -162,10 +162,10 @@

        Instance members

        - + InEdges(v) -
        +
        Signature: v:'TVertex -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -177,10 +177,10 @@

        Instance members

        - + IsEdgesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -192,10 +192,10 @@

        Instance members

        - + IsInEdgesEmpty(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -207,10 +207,10 @@

        Instance members

        - + TryGetInEdges(v, edges) -
        +
        Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-predicates-filterededgelistgraph-3.html b/reference/quickgraph-predicates-filterededgelistgraph-3.html index d98c6dfce..11d02ea19 100644 --- a/reference/quickgraph-predicates-filterededgelistgraph-3.html +++ b/reference/quickgraph-predicates-filterededgelistgraph-3.html @@ -50,10 +50,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (baseGraph:'TGraph * vertexPredicate:VertexPredicate<'TVertex> * edgePredicate:EdgePredicate<'TVertex,'TEdge>) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + ContainsEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + EdgeCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + Edges -
        +
        Signature: IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -117,10 +117,10 @@

        Instance members

        - + IsEdgesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -132,10 +132,10 @@

        Instance members

        - + IsVerticesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -147,10 +147,10 @@

        Instance members

        - + VertexCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -162,10 +162,10 @@

        Instance members

        - + Vertices -
        +
        Signature: IEnumerable<'TVertex>
        Modifiers: abstract
        diff --git a/reference/quickgraph-predicates-filteredgraph-3.html b/reference/quickgraph-predicates-filteredgraph-3.html index 321a5a611..ecca13913 100644 --- a/reference/quickgraph-predicates-filteredgraph-3.html +++ b/reference/quickgraph-predicates-filteredgraph-3.html @@ -50,10 +50,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (baseGraph:'TGraph * vertexPredicate:VertexPredicate<'TVertex> * edgePredicate:EdgePredicate<'TVertex,'TEdge>) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + AllowParallelEdges -
        +
        Signature: bool
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + BaseGraph -
        +
        Signature: 'TGraph
        @@ -103,10 +103,10 @@

        Instance members

        - + EdgePredicate -
        +
        Signature: EdgePredicate<'TVertex,'TEdge>
        @@ -119,10 +119,10 @@

        Instance members

        - + IsDirected -
        +
        Signature: bool
        Modifiers: abstract
        @@ -134,10 +134,10 @@

        Instance members

        - + VertexPredicate -
        +
        Signature: VertexPredicate<'TVertex>
        diff --git a/reference/quickgraph-predicates-filteredimplicitgraph-3.html b/reference/quickgraph-predicates-filteredimplicitgraph-3.html index a8b572c9a..a82c6f363 100644 --- a/reference/quickgraph-predicates-filteredimplicitgraph-3.html +++ b/reference/quickgraph-predicates-filteredimplicitgraph-3.html @@ -50,10 +50,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (baseGraph:'TGraph * vertexPredicate:VertexPredicate<'TVertex> * edgePredicate:EdgePredicate<'TVertex,'TEdge>) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + IsOutEdgesEmpty(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + OutDegree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + OutEdge(v, index) -
        +
        Signature: (v:'TVertex * index:int) -> 'TEdge
        Modifiers: abstract
        @@ -117,10 +117,10 @@

        Instance members

        - + OutEdges(v) -
        +
        Signature: v:'TVertex -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -132,10 +132,10 @@

        Instance members

        - + TryGetOutEdges(v, edges) -
        +
        Signature: (v:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-predicates-filteredimplicitvertexset-3.html b/reference/quickgraph-predicates-filteredimplicitvertexset-3.html index 7a6a190eb..7ce7bf813 100644 --- a/reference/quickgraph-predicates-filteredimplicitvertexset-3.html +++ b/reference/quickgraph-predicates-filteredimplicitvertexset-3.html @@ -50,10 +50,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (baseGraph:'TGraph * vertexPredicate:VertexPredicate<'TVertex> * edgePredicate:EdgePredicate<'TVertex,'TEdge>) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + ContainsVertex(vertex) -
        +
        Signature: vertex:'TVertex -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-predicates-filteredincidencegraph-3.html b/reference/quickgraph-predicates-filteredincidencegraph-3.html index fd5bed169..41cf4603f 100644 --- a/reference/quickgraph-predicates-filteredincidencegraph-3.html +++ b/reference/quickgraph-predicates-filteredincidencegraph-3.html @@ -50,10 +50,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (baseGraph:'TGraph * vertexPredicate:VertexPredicate<'TVertex> * edgePredicate:EdgePredicate<'TVertex,'TEdge>) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + ContainsEdge(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> bool
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + TryGetEdge(source, target, edge) -
        +
        Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + TryGetEdges(source, target, edges) -
        +
        Signature: (source:'TVertex * target:'TVertex * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-predicates-filteredundirectedgraph-3.html b/reference/quickgraph-predicates-filteredundirectedgraph-3.html index 94c030e06..15641248b 100644 --- a/reference/quickgraph-predicates-filteredundirectedgraph-3.html +++ b/reference/quickgraph-predicates-filteredundirectedgraph-3.html @@ -50,10 +50,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (baseGraph:'TGraph * vertexPredicate:VertexPredicate<'TVertex> * edgePredicate:EdgePredicate<'TVertex,'TEdge>) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + AdjacentDegree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + AdjacentEdge(v, index) -
        +
        Signature: (v:'TVertex * index:int) -> 'TEdge
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + AdjacentEdges(v) -
        +
        Signature: v:'TVertex -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -117,10 +117,10 @@

        Instance members

        - + ContainsEdge(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> bool
        Modifiers: abstract
        @@ -132,10 +132,10 @@

        Instance members

        - + ContainsEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -147,10 +147,10 @@

        Instance members

        - + ContainsVertex(vertex) -
        +
        Signature: vertex:'TVertex -> bool
        Modifiers: abstract
        @@ -162,10 +162,10 @@

        Instance members

        - + EdgeCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -177,10 +177,10 @@

        Instance members

        - + EdgeEqualityComparer -
        +
        Signature: EdgeEqualityComparer<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -192,10 +192,10 @@

        Instance members

        - + Edges -
        +
        Signature: IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -207,10 +207,10 @@

        Instance members

        - + IsAdjacentEdgesEmpty(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -222,10 +222,10 @@

        Instance members

        - + IsEdgesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -237,10 +237,10 @@

        Instance members

        - + IsVerticesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -252,10 +252,10 @@

        Instance members

        - + TryGetEdge(source, target, edge) -
        +
        Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
        Modifiers: abstract
        @@ -267,10 +267,10 @@

        Instance members

        - + VertexCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -282,10 +282,10 @@

        Instance members

        - + Vertices -
        +
        Signature: IEnumerable<'TVertex>
        Modifiers: abstract
        diff --git a/reference/quickgraph-predicates-filteredvertexandedgelistgraph-3.html b/reference/quickgraph-predicates-filteredvertexandedgelistgraph-3.html index 9d8d34d9e..73ddf3bf4 100644 --- a/reference/quickgraph-predicates-filteredvertexandedgelistgraph-3.html +++ b/reference/quickgraph-predicates-filteredvertexandedgelistgraph-3.html @@ -50,10 +50,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (baseGraph:'TGraph * vertexPredicate:VertexPredicate<'TVertex> * edgePredicate:EdgePredicate<'TVertex,'TEdge>) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + ContainsEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + EdgeCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + Edges -
        +
        Signature: IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -117,10 +117,10 @@

        Instance members

        - + IsEdgesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-predicates-filteredvertexlistgraph-3.html b/reference/quickgraph-predicates-filteredvertexlistgraph-3.html index 3130c7672..f6ab7251a 100644 --- a/reference/quickgraph-predicates-filteredvertexlistgraph-3.html +++ b/reference/quickgraph-predicates-filteredvertexlistgraph-3.html @@ -50,10 +50,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (baseGraph:'Graph * vertexPredicate:VertexPredicate<'TVertex> * edgePredicate:EdgePredicate<'TVertex,'TEdge>) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + IsVerticesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + VertexCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + Vertices -
        +
        Signature: IEnumerable<'TVertex>
        Modifiers: abstract
        diff --git a/reference/quickgraph-predicates-indictionaryvertexpredicate-2.html b/reference/quickgraph-predicates-indictionaryvertexpredicate-2.html index b951d9555..758933dee 100644 --- a/reference/quickgraph-predicates-indictionaryvertexpredicate-2.html +++ b/reference/quickgraph-predicates-indictionaryvertexpredicate-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(dictionary) -
        +
        Signature: dictionary:IDictionary<'TVertex,'TValue> -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Test(v) -
        +
        Signature: v:'TVertex -> bool
        diff --git a/reference/quickgraph-predicates-isolatedvertexpredicate-2.html b/reference/quickgraph-predicates-isolatedvertexpredicate-2.html index 26eb18cda..fa70eb634 100644 --- a/reference/quickgraph-predicates-isolatedvertexpredicate-2.html +++ b/reference/quickgraph-predicates-isolatedvertexpredicate-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> -> unit
        @@ -74,10 +74,10 @@

        Instance members

        - + Test(v) -
        +
        Signature: v:'TVertex -> bool
        diff --git a/reference/quickgraph-predicates-residualedgepredicate-2.html b/reference/quickgraph-predicates-residualedgepredicate-2.html index 7b918a605..95ca3607b 100644 --- a/reference/quickgraph-predicates-residualedgepredicate-2.html +++ b/reference/quickgraph-predicates-residualedgepredicate-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(residualCapacities) -
        +
        Signature: residualCapacities:IDictionary<'TEdge,float> -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + ResidualCapacities -
        +
        Signature: IDictionary<'TEdge,float>
        @@ -86,10 +86,10 @@

        Instance members

        - + Test(e) -
        +
        Signature: e:'TEdge -> bool
        diff --git a/reference/quickgraph-predicates-reversedresidualedgepredicate-2.html b/reference/quickgraph-predicates-reversedresidualedgepredicate-2.html index c364e4c3e..e9e9f7b2b 100644 --- a/reference/quickgraph-predicates-reversedresidualedgepredicate-2.html +++ b/reference/quickgraph-predicates-reversedresidualedgepredicate-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(residualCapacities, reversedEdges) -
        +
        Signature: (residualCapacities:IDictionary<'TEdge,float> * reversedEdges:IDictionary<'TEdge,'TEdge>) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + ResidualCapacities -
        +
        Signature: IDictionary<'TEdge,float>
        @@ -88,10 +88,10 @@

        Instance members

        - + ReversedEdges -
        +
        Signature: IDictionary<'TEdge,'TEdge>
        @@ -104,10 +104,10 @@

        Instance members

        - + Test(e) -
        +
        Signature: e:'TEdge -> bool
        diff --git a/reference/quickgraph-predicates-sinkvertexpredicate-2.html b/reference/quickgraph-predicates-sinkvertexpredicate-2.html index 4d2a8befa..cc29ab71e 100644 --- a/reference/quickgraph-predicates-sinkvertexpredicate-2.html +++ b/reference/quickgraph-predicates-sinkvertexpredicate-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:IIncidenceGraph<'TVertex,'TEdge> -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Test(v) -
        +
        Signature: v:'TVertex -> bool
        diff --git a/reference/quickgraph-quickgraphexception.html b/reference/quickgraph-quickgraphexception.html index b8c9ea74e..4b07bc090 100644 --- a/reference/quickgraph-quickgraphexception.html +++ b/reference/quickgraph-quickgraphexception.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(message) -
        +
        Signature: message:string -> unit
        @@ -78,10 +78,10 @@

        Constructors

        - + new(message, inner) -
        +
        Signature: (message:string * inner:exn) -> unit
        @@ -92,10 +92,10 @@

        Constructors

        - + new(info, context) -
        +
        Signature: (info:SerializationInfo * context:StreamingContext) -> unit
        diff --git a/reference/quickgraph-quickgraphresourcemanager.html b/reference/quickgraph-quickgraphresourcemanager.html index 72268adb7..e6cc32827 100644 --- a/reference/quickgraph-quickgraphresourcemanager.html +++ b/reference/quickgraph-quickgraphresourcemanager.html @@ -50,10 +50,10 @@

        Static members

        - + DumpResources(path) -
        +
        Signature: path:string -> unit
        @@ -64,10 +64,10 @@

        Static members

        - + GetBanner() -
        +
        Signature: unit -> Image
        @@ -78,10 +78,10 @@

        Static members

        - + GetLogo() -
        +
        Signature: unit -> Image
        diff --git a/reference/quickgraph-referenceequalitycomparer-1.html b/reference/quickgraph-referenceequalitycomparer-1.html index 87ad51222..340ef8b9d 100644 --- a/reference/quickgraph-referenceequalitycomparer-1.html +++ b/reference/quickgraph-referenceequalitycomparer-1.html @@ -52,10 +52,10 @@

        Instance members

        - + Equals(x, y) -
        +
        Signature: (x:'T * y:'T) -> bool
        Modifiers: abstract
        @@ -69,10 +69,10 @@

        Instance members

        - + GetHashCode(x) -
        +
        Signature: x:'T -> int
        Modifiers: abstract
        @@ -94,10 +94,10 @@

        Static members

        - + Instance -
        +
        Signature: ReferenceEqualityComparer<'T>
        diff --git a/reference/quickgraph-reversedbidirectionalgraph-2.html b/reference/quickgraph-reversedbidirectionalgraph-2.html index e7be47efc..a5fa89e46 100644 --- a/reference/quickgraph-reversedbidirectionalgraph-2.html +++ b/reference/quickgraph-reversedbidirectionalgraph-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(originalGraph) -
        +
        Signature: originalGraph:IBidirectionalGraph<'TVertex,'TEdge> -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + AllowParallelEdges -
        +
        Signature: bool
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + ContainsEdge(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> bool
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + ContainsEdge(edge) -
        +
        Signature: edge:SReversedEdge<'TVertex,'TEdge> -> bool
        Modifiers: abstract
        @@ -117,10 +117,10 @@

        Instance members

        - + ContainsVertex(vertex) -
        +
        Signature: vertex:'TVertex -> bool
        Modifiers: abstract
        @@ -132,10 +132,10 @@

        Instance members

        - + Degree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -147,10 +147,10 @@

        Instance members

        - + EdgeCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -162,10 +162,10 @@

        Instance members

        - + Edges -
        +
        Signature: IEnumerable<SReversedEdge<'TVertex,'TEdge>>
        Modifiers: abstract
        @@ -177,10 +177,10 @@

        Instance members

        - + InDegree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -192,10 +192,10 @@

        Instance members

        - + InEdge(v, index) -
        +
        Signature: (v:'TVertex * index:int) -> SReversedEdge<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -207,10 +207,10 @@

        Instance members

        - + InEdges(v) -
        +
        Signature: v:'TVertex -> IEnumerable<SReversedEdge<'TVertex,'TEdge>>
        Modifiers: abstract
        @@ -222,10 +222,10 @@

        Instance members

        - + IsDirected -
        +
        Signature: bool
        Modifiers: abstract
        @@ -237,10 +237,10 @@

        Instance members

        - + IsEdgesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -252,10 +252,10 @@

        Instance members

        - + IsInEdgesEmpty(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -267,10 +267,10 @@

        Instance members

        - + IsOutEdgesEmpty(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -282,10 +282,10 @@

        Instance members

        - + IsVerticesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -297,10 +297,10 @@

        Instance members

        - + OriginalGraph -
        +
        Signature: IBidirectionalGraph<'TVertex,'TEdge>
        @@ -311,10 +311,10 @@

        Instance members

        - + OutDegree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -326,10 +326,10 @@

        Instance members

        - + OutEdge(v, index) -
        +
        Signature: (v:'TVertex * index:int) -> SReversedEdge<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -341,10 +341,10 @@

        Instance members

        - + OutEdges(v) -
        +
        Signature: v:'TVertex -> IEnumerable<SReversedEdge<'TVertex,'TEdge>>
        Modifiers: abstract
        @@ -356,10 +356,10 @@

        Instance members

        - + TryGetEdge(source, target, edge) -
        +
        Signature: (source:'TVertex * target:'TVertex * edge:byref<SReversedEdge<'TVertex,'TEdge>>) -> bool
        Modifiers: abstract
        @@ -371,10 +371,10 @@

        Instance members

        - + TryGetEdges(source, target, edges) -
        +
        Signature: (source:'TVertex * target:'TVertex * edges:byref<IEnumerable<SReversedEdge<'TVertex,'TEdge>>>) -> bool
        Modifiers: abstract
        @@ -386,10 +386,10 @@

        Instance members

        - + TryGetInEdges(v, edges) -
        +
        Signature: (v:'TVertex * edges:byref<IEnumerable<SReversedEdge<'TVertex,'TEdge>>>) -> bool
        Modifiers: abstract
        @@ -401,10 +401,10 @@

        Instance members

        - + TryGetOutEdges(v, edges) -
        +
        Signature: (v:'TVertex * edges:byref<IEnumerable<SReversedEdge<'TVertex,'TEdge>>>) -> bool
        Modifiers: abstract
        @@ -416,10 +416,10 @@

        Instance members

        - + VertexCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -431,10 +431,10 @@

        Instance members

        - + Vertices -
        +
        Signature: IEnumerable<'TVertex>
        Modifiers: abstract
        diff --git a/reference/quickgraph-samples-graphcreation.html b/reference/quickgraph-samples-graphcreation.html index e682e55e8..0e56f5118 100644 --- a/reference/quickgraph-samples-graphcreation.html +++ b/reference/quickgraph-samples-graphcreation.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + DelegateGraph() -
        +
        Signature: unit -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + EdgeArrayToAdjacencyGraph() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-samples-graphvizsamples.html b/reference/quickgraph-samples-graphvizsamples.html index 54db6be2b..be8c59389 100644 --- a/reference/quickgraph-samples-graphvizsamples.html +++ b/reference/quickgraph-samples-graphvizsamples.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + RenderGraphWithGraphviz() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-samples-wikisamples.html b/reference/quickgraph-samples-wikisamples.html index 8018337b2..382fe0485 100644 --- a/reference/quickgraph-samples-wikisamples.html +++ b/reference/quickgraph-samples-wikisamples.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + ShortestPath() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-sedge-1.html b/reference/quickgraph-sedge-1.html index 4da310d72..d5a3cc688 100644 --- a/reference/quickgraph-sedge-1.html +++ b/reference/quickgraph-sedge-1.html @@ -52,10 +52,10 @@

        Constructors

        - + new(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> unit
        @@ -76,10 +76,10 @@

        Instance members

        - + Source -
        +
        Signature: 'TVertex
        Modifiers: abstract
        @@ -93,10 +93,10 @@

        Instance members

        - + Target -
        +
        Signature: 'TVertex
        Modifiers: abstract
        @@ -110,10 +110,10 @@

        Instance members

        - + ToString() -
        +
        Signature: unit -> string
        Modifiers: abstract
        diff --git a/reference/quickgraph-sequatableedge-1.html b/reference/quickgraph-sequatableedge-1.html index 8045d7758..2d30980e3 100644 --- a/reference/quickgraph-sequatableedge-1.html +++ b/reference/quickgraph-sequatableedge-1.html @@ -52,10 +52,10 @@

        Constructors

        - + new(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> unit
        @@ -76,10 +76,10 @@

        Instance members

        - + Equals(other) -
        +
        Signature: other:SEquatableEdge<'TVertex> -> bool
        Modifiers: abstract
        @@ -93,10 +93,10 @@

        Instance members

        - + Equals(obj) -
        +
        Signature: obj:obj -> bool
        Modifiers: abstract
        @@ -110,10 +110,10 @@

        Instance members

        - + GetHashCode() -
        +
        Signature: unit -> int
        Modifiers: abstract
        @@ -127,10 +127,10 @@

        Instance members

        - + Source -
        +
        Signature: 'TVertex
        Modifiers: abstract
        @@ -144,10 +144,10 @@

        Instance members

        - + Target -
        +
        Signature: 'TVertex
        Modifiers: abstract
        @@ -161,10 +161,10 @@

        Instance members

        - + ToString() -
        +
        Signature: unit -> string
        Modifiers: abstract
        diff --git a/reference/quickgraph-sequatableundirectededge-1.html b/reference/quickgraph-sequatableundirectededge-1.html index 40501fe9c..7d0d4dc19 100644 --- a/reference/quickgraph-sequatableundirectededge-1.html +++ b/reference/quickgraph-sequatableundirectededge-1.html @@ -52,10 +52,10 @@

        Constructors

        - + new(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> unit
        @@ -76,10 +76,10 @@

        Instance members

        - + Equals(other) -
        +
        Signature: other:SEquatableUndirectedEdge<'TVertex> -> bool
        Modifiers: abstract
        @@ -93,10 +93,10 @@

        Instance members

        - + Equals(obj) -
        +
        Signature: obj:obj -> bool
        Modifiers: abstract
        @@ -110,10 +110,10 @@

        Instance members

        - + GetHashCode() -
        +
        Signature: unit -> int
        Modifiers: abstract
        @@ -127,10 +127,10 @@

        Instance members

        - + Source -
        +
        Signature: 'TVertex
        Modifiers: abstract
        @@ -144,10 +144,10 @@

        Instance members

        - + Target -
        +
        Signature: 'TVertex
        Modifiers: abstract
        @@ -161,10 +161,10 @@

        Instance members

        - + ToString() -
        +
        Signature: unit -> string
        Modifiers: abstract
        diff --git a/reference/quickgraph-serialization-directedgraphml-directedgraph.html b/reference/quickgraph-serialization-directedgraphml-directedgraph.html index 933064e06..f8bc74517 100644 --- a/reference/quickgraph-serialization-directedgraphml-directedgraph.html +++ b/reference/quickgraph-serialization-directedgraphml-directedgraph.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Background() -
        +
        Signature: unit -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + BackgroundImage() -
        +
        Signature: unit -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + ButterflyMode() -
        +
        Signature: unit -> unit
        @@ -114,10 +114,10 @@

        Instance members

        - + ButterflyModeSpecified() -
        +
        Signature: unit -> unit
        @@ -128,10 +128,10 @@

        Instance members

        - + Categories() -
        +
        Signature: unit -> unit
        @@ -142,10 +142,10 @@

        Instance members

        - + GraphDirection() -
        +
        Signature: unit -> unit
        @@ -156,10 +156,10 @@

        Instance members

        - + GraphDirectionSpecified() -
        +
        Signature: unit -> unit
        @@ -170,10 +170,10 @@

        Instance members

        - + IdentifierAliases() -
        +
        Signature: unit -> unit
        @@ -184,10 +184,10 @@

        Instance members

        - + Layout() -
        +
        Signature: unit -> unit
        @@ -198,10 +198,10 @@

        Instance members

        - + LayoutSpecified() -
        +
        Signature: unit -> unit
        @@ -212,10 +212,10 @@

        Instance members

        - + Links() -
        +
        Signature: unit -> unit
        @@ -226,10 +226,10 @@

        Instance members

        - + NeighborhoodDistance() -
        +
        Signature: unit -> unit
        @@ -240,10 +240,10 @@

        Instance members

        - + Nodes() -
        +
        Signature: unit -> unit
        @@ -254,10 +254,10 @@

        Instance members

        - + Paths() -
        +
        Signature: unit -> unit
        @@ -268,10 +268,10 @@

        Instance members

        - + Properties() -
        +
        Signature: unit -> unit
        @@ -282,10 +282,10 @@

        Instance members

        - + QualifiedNames() -
        +
        Signature: unit -> unit
        @@ -296,10 +296,10 @@

        Instance members

        - + Styles() -
        +
        Signature: unit -> unit
        @@ -310,10 +310,10 @@

        Instance members

        - + Title() -
        +
        Signature: unit -> unit
        @@ -324,10 +324,10 @@

        Instance members

        - + ZoomLevel() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-serialization-directedgraphml-directedgraphalias.html b/reference/quickgraph-serialization-directedgraphml-directedgraphalias.html index 02d09418e..42b2ee1c1 100644 --- a/reference/quickgraph-serialization-directedgraphml-directedgraphalias.html +++ b/reference/quickgraph-serialization-directedgraphml-directedgraphalias.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Id() -
        +
        Signature: unit -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + n() -
        +
        Signature: unit -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + Uri() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-serialization-directedgraphml-directedgraphcategory.html b/reference/quickgraph-serialization-directedgraphml-directedgraphcategory.html index d2ba74e64..a8db62bac 100644 --- a/reference/quickgraph-serialization-directedgraphml-directedgraphcategory.html +++ b/reference/quickgraph-serialization-directedgraphml-directedgraphcategory.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Background() -
        +
        Signature: unit -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + BasedOn() -
        +
        Signature: unit -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + CanBeDataDriven() -
        +
        Signature: unit -> unit
        @@ -114,10 +114,10 @@

        Instance members

        - + CanLinkedNodesBeDataDriven() -
        +
        Signature: unit -> unit
        @@ -128,10 +128,10 @@

        Instance members

        - + DefaultAction() -
        +
        Signature: unit -> unit
        @@ -142,10 +142,10 @@

        Instance members

        - + Details() -
        +
        Signature: unit -> unit
        @@ -156,10 +156,10 @@

        Instance members

        - + FontFamily() -
        +
        Signature: unit -> unit
        @@ -170,10 +170,10 @@

        Instance members

        - + FontSize() -
        +
        Signature: unit -> unit
        @@ -184,10 +184,10 @@

        Instance members

        - + FontSizeSpecified() -
        +
        Signature: unit -> unit
        @@ -198,10 +198,10 @@

        Instance members

        - + FontStyle() -
        +
        Signature: unit -> unit
        @@ -212,10 +212,10 @@

        Instance members

        - + FontStyleSpecified() -
        +
        Signature: unit -> unit
        @@ -226,10 +226,10 @@

        Instance members

        - + FontWeight() -
        +
        Signature: unit -> unit
        @@ -240,10 +240,10 @@

        Instance members

        - + FontWeightSpecified() -
        +
        Signature: unit -> unit
        @@ -254,10 +254,10 @@

        Instance members

        - + HorizontalAlignment() -
        +
        Signature: unit -> unit
        @@ -268,10 +268,10 @@

        Instance members

        - + HorizontalAlignmentSpecified() -
        +
        Signature: unit -> unit
        @@ -282,10 +282,10 @@

        Instance members

        - + Icon() -
        +
        Signature: unit -> unit
        @@ -296,10 +296,10 @@

        Instance members

        - + Id() -
        +
        Signature: unit -> unit
        @@ -310,10 +310,10 @@

        Instance members

        - + InboundName() -
        +
        Signature: unit -> unit
        @@ -324,10 +324,10 @@

        Instance members

        - + IncomingActionLabel() -
        +
        Signature: unit -> unit
        @@ -338,10 +338,10 @@

        Instance members

        - + IsContainment() -
        +
        Signature: unit -> unit
        @@ -352,10 +352,10 @@

        Instance members

        - + IsContainmentSpecified() -
        +
        Signature: unit -> unit
        @@ -366,10 +366,10 @@

        Instance members

        - + IsProviderRoot() -
        +
        Signature: unit -> unit
        @@ -380,10 +380,10 @@

        Instance members

        - + IsProviderRootSpecified() -
        +
        Signature: unit -> unit
        @@ -394,10 +394,10 @@

        Instance members

        - + IsTag() -
        +
        Signature: unit -> unit
        @@ -408,10 +408,10 @@

        Instance members

        - + IsTagSpecified() -
        +
        Signature: unit -> unit
        @@ -422,10 +422,10 @@

        Instance members

        - + Label() -
        +
        Signature: unit -> unit
        @@ -436,10 +436,10 @@

        Instance members

        - + NavigationActionLabel() -
        +
        Signature: unit -> unit
        @@ -450,10 +450,10 @@

        Instance members

        - + OutboundName() -
        +
        Signature: unit -> unit
        @@ -464,10 +464,10 @@

        Instance members

        - + OutgoingActionLabel() -
        +
        Signature: unit -> unit
        @@ -478,10 +478,10 @@

        Instance members

        - + Shape() -
        +
        Signature: unit -> unit
        @@ -492,10 +492,10 @@

        Instance members

        - + SourceCategory() -
        +
        Signature: unit -> unit
        @@ -506,10 +506,10 @@

        Instance members

        - + Stroke() -
        +
        Signature: unit -> unit
        @@ -520,10 +520,10 @@

        Instance members

        - + StrokeDashArray() -
        +
        Signature: unit -> unit
        @@ -534,10 +534,10 @@

        Instance members

        - + Style() -
        +
        Signature: unit -> unit
        @@ -548,10 +548,10 @@

        Instance members

        - + TargetCategory() -
        +
        Signature: unit -> unit
        @@ -562,10 +562,10 @@

        Instance members

        - + VerticalAlignment() -
        +
        Signature: unit -> unit
        @@ -576,10 +576,10 @@

        Instance members

        - + VerticalAlignmentSpecified() -
        +
        Signature: unit -> unit
        @@ -590,10 +590,10 @@

        Instance members

        - + Visibility() -
        +
        Signature: unit -> unit
        @@ -604,10 +604,10 @@

        Instance members

        - + VisibilitySpecified() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-serialization-directedgraphml-directedgraphlink.html b/reference/quickgraph-serialization-directedgraphml-directedgraphlink.html index b4f0a5bfb..3e3e0e4a8 100644 --- a/reference/quickgraph-serialization-directedgraphml-directedgraphlink.html +++ b/reference/quickgraph-serialization-directedgraphml-directedgraphlink.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + AttractConsumers() -
        +
        Signature: unit -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + AttractConsumersSpecified() -
        +
        Signature: unit -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + Background() -
        +
        Signature: unit -> unit
        @@ -114,10 +114,10 @@

        Instance members

        - + Category() -
        +
        Signature: unit -> unit
        @@ -128,10 +128,10 @@

        Instance members

        - + Category1() -
        +
        Signature: unit -> unit
        @@ -142,10 +142,10 @@

        Instance members

        - + FontFamily() -
        +
        Signature: unit -> unit
        @@ -156,10 +156,10 @@

        Instance members

        - + FontSize() -
        +
        Signature: unit -> unit
        @@ -170,10 +170,10 @@

        Instance members

        - + FontSizeSpecified() -
        +
        Signature: unit -> unit
        @@ -184,10 +184,10 @@

        Instance members

        - + FontStyle() -
        +
        Signature: unit -> unit
        @@ -198,10 +198,10 @@

        Instance members

        - + FontStyleSpecified() -
        +
        Signature: unit -> unit
        @@ -212,10 +212,10 @@

        Instance members

        - + FontWeight() -
        +
        Signature: unit -> unit
        @@ -226,10 +226,10 @@

        Instance members

        - + FontWeightSpecified() -
        +
        Signature: unit -> unit
        @@ -240,10 +240,10 @@

        Instance members

        - + Label() -
        +
        Signature: unit -> unit
        @@ -254,10 +254,10 @@

        Instance members

        - + Seeder() -
        +
        Signature: unit -> unit
        @@ -268,10 +268,10 @@

        Instance members

        - + SeederSpecified() -
        +
        Signature: unit -> unit
        @@ -282,10 +282,10 @@

        Instance members

        - + Source() -
        +
        Signature: unit -> unit
        @@ -296,10 +296,10 @@

        Instance members

        - + Stroke() -
        +
        Signature: unit -> unit
        @@ -310,10 +310,10 @@

        Instance members

        - + StrokeDashArray() -
        +
        Signature: unit -> unit
        @@ -324,10 +324,10 @@

        Instance members

        - + Target() -
        +
        Signature: unit -> unit
        @@ -338,10 +338,10 @@

        Instance members

        - + Visibility() -
        +
        Signature: unit -> unit
        @@ -352,10 +352,10 @@

        Instance members

        - + VisibilitySpecified() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-serialization-directedgraphml-directedgraphlinkcategory.html b/reference/quickgraph-serialization-directedgraphml-directedgraphlinkcategory.html index f873cc181..3e6ebbbbc 100644 --- a/reference/quickgraph-serialization-directedgraphml-directedgraphlinkcategory.html +++ b/reference/quickgraph-serialization-directedgraphml-directedgraphlinkcategory.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Ref() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-serialization-directedgraphml-directedgraphname.html b/reference/quickgraph-serialization-directedgraphml-directedgraphname.html index b469bd699..e4ae613d9 100644 --- a/reference/quickgraph-serialization-directedgraphml-directedgraphname.html +++ b/reference/quickgraph-serialization-directedgraphml-directedgraphname.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Formatter() -
        +
        Signature: unit -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + Id() -
        +
        Signature: unit -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + Label() -
        +
        Signature: unit -> unit
        @@ -114,10 +114,10 @@

        Instance members

        - + ValueType() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-serialization-directedgraphml-directedgraphnode.html b/reference/quickgraph-serialization-directedgraphml-directedgraphnode.html index c19f4bc9c..bf029cc51 100644 --- a/reference/quickgraph-serialization-directedgraphml-directedgraphnode.html +++ b/reference/quickgraph-serialization-directedgraphml-directedgraphnode.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Access() -
        +
        Signature: unit -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + Assembly() -
        +
        Signature: unit -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + Background() -
        +
        Signature: unit -> unit
        @@ -114,10 +114,10 @@

        Instance members

        - + Category() -
        +
        Signature: unit -> unit
        @@ -128,10 +128,10 @@

        Instance members

        - + Category1() -
        +
        Signature: unit -> unit
        @@ -142,10 +142,10 @@

        Instance members

        - + CodeGenIncoming() -
        +
        Signature: unit -> unit
        @@ -156,10 +156,10 @@

        Instance members

        - + CodeGenIncomingSpecified() -
        +
        Signature: unit -> unit
        @@ -170,10 +170,10 @@

        Instance members

        - + CodeGenSourceName() -
        +
        Signature: unit -> unit
        @@ -184,10 +184,10 @@

        Instance members

        - + CodeGenTargetName() -
        +
        Signature: unit -> unit
        @@ -198,10 +198,10 @@

        Instance members

        - + CodeSchemaProperty_CallSequenceNumber() -
        +
        Signature: unit -> unit
        @@ -212,10 +212,10 @@

        Instance members

        - + CodeSchemaProperty_CallSequenceNumberSpecified(...) -
        +
        Signature: unit -> unit
        @@ -226,10 +226,10 @@

        Instance members

        - + CodeSchemaProperty_DisableEnabledErrorHandler(...) -
        +
        Signature: unit -> unit
        @@ -240,10 +240,10 @@

        Instance members

        - + CodeSchemaProperty_DisableEnabledErrorHandlerSpecified(...) -
        +
        Signature: unit -> unit
        @@ -254,10 +254,10 @@

        Instance members

        - + CodeSchemaProperty_DisableEnabledException(...) -
        +
        Signature: unit -> unit
        @@ -268,10 +268,10 @@

        Instance members

        - + CodeSchemaProperty_DisableEnabledExceptionSpecified(...) -
        +
        Signature: unit -> unit
        @@ -282,10 +282,10 @@

        Instance members

        - + CodeSchemaProperty_EndColumn() -
        +
        Signature: unit -> unit
        @@ -296,10 +296,10 @@

        Instance members

        - + CodeSchemaProperty_EndColumnSpecified() -
        +
        Signature: unit -> unit
        @@ -310,10 +310,10 @@

        Instance members

        - + CodeSchemaProperty_EndLine() -
        +
        Signature: unit -> unit
        @@ -324,10 +324,10 @@

        Instance members

        - + CodeSchemaProperty_EndLineSpecified() -
        +
        Signature: unit -> unit
        @@ -338,10 +338,10 @@

        Instance members

        - + CodeSchemaProperty_FrameDepth() -
        +
        Signature: unit -> unit
        @@ -352,10 +352,10 @@

        Instance members

        - + CodeSchemaProperty_FrameDepthSpecified() -
        +
        Signature: unit -> unit
        @@ -366,10 +366,10 @@

        Instance members

        - + CodeSchemaProperty_FrameKind() -
        +
        Signature: unit -> unit
        @@ -380,10 +380,10 @@

        Instance members

        - + CodeSchemaProperty_FrameKindSpecified() -
        +
        Signature: unit -> unit
        @@ -394,10 +394,10 @@

        Instance members

        - + CodeSchemaProperty_Icon() -
        +
        Signature: unit -> unit
        @@ -408,10 +408,10 @@

        Instance members

        - + CodeSchemaProperty_InstanceTrackingInformation(...) -
        +
        Signature: unit -> unit
        @@ -422,10 +422,10 @@

        Instance members

        - + CodeSchemaProperty_IsAbstract() -
        +
        Signature: unit -> unit
        @@ -436,10 +436,10 @@

        Instance members

        - + CodeSchemaProperty_IsAbstractSpecified() -
        +
        Signature: unit -> unit
        @@ -450,10 +450,10 @@

        Instance members

        - + CodeSchemaProperty_IsAnonymous() -
        +
        Signature: unit -> unit
        @@ -464,10 +464,10 @@

        Instance members

        - + CodeSchemaProperty_IsAnonymousSpecified(...) -
        +
        Signature: unit -> unit
        @@ -478,10 +478,10 @@

        Instance members

        - + CodeSchemaProperty_IsArray() -
        +
        Signature: unit -> unit
        @@ -492,10 +492,10 @@

        Instance members

        - + CodeSchemaProperty_IsArraySpecified() -
        +
        Signature: unit -> unit
        @@ -506,10 +506,10 @@

        Instance members

        - + CodeSchemaProperty_IsByReference() -
        +
        Signature: unit -> unit
        @@ -520,10 +520,10 @@

        Instance members

        - + CodeSchemaProperty_IsByReferenceSpecified(...) -
        +
        Signature: unit -> unit
        @@ -534,10 +534,10 @@

        Instance members

        - + CodeSchemaProperty_IsCallToThis() -
        +
        Signature: unit -> unit
        @@ -548,10 +548,10 @@

        Instance members

        - + CodeSchemaProperty_IsCallToThisSpecified(...) -
        +
        Signature: unit -> unit
        @@ -562,10 +562,10 @@

        Instance members

        - + CodeSchemaProperty_IsConstructor() -
        +
        Signature: unit -> unit
        @@ -576,10 +576,10 @@

        Instance members

        - + CodeSchemaProperty_IsConstructorSpecified(...) -
        +
        Signature: unit -> unit
        @@ -590,10 +590,10 @@

        Instance members

        - + CodeSchemaProperty_IsDo() -
        +
        Signature: unit -> unit
        @@ -604,10 +604,10 @@

        Instance members

        - + CodeSchemaProperty_IsDoSpecified() -
        +
        Signature: unit -> unit
        @@ -618,10 +618,10 @@

        Instance members

        - + CodeSchemaProperty_IsFinal() -
        +
        Signature: unit -> unit
        @@ -632,10 +632,10 @@

        Instance members

        - + CodeSchemaProperty_IsFinalSpecified() -
        +
        Signature: unit -> unit
        @@ -646,10 +646,10 @@

        Instance members

        - + CodeSchemaProperty_IsFor() -
        +
        Signature: unit -> unit
        @@ -660,10 +660,10 @@

        Instance members

        - + CodeSchemaProperty_IsForEach() -
        +
        Signature: unit -> unit
        @@ -674,10 +674,10 @@

        Instance members

        - + CodeSchemaProperty_IsForEachSpecified() -
        +
        Signature: unit -> unit
        @@ -688,10 +688,10 @@

        Instance members

        - + CodeSchemaProperty_IsForSpecified() -
        +
        Signature: unit -> unit
        @@ -702,10 +702,10 @@

        Instance members

        - + CodeSchemaProperty_IsGeneric() -
        +
        Signature: unit -> unit
        @@ -716,10 +716,10 @@

        Instance members

        - + CodeSchemaProperty_IsGenericInstance() -
        +
        Signature: unit -> unit
        @@ -730,10 +730,10 @@

        Instance members

        - + CodeSchemaProperty_IsGenericInstanceSpecified(...) -
        +
        Signature: unit -> unit
        @@ -744,10 +744,10 @@

        Instance members

        - + CodeSchemaProperty_IsGenericSpecified() -
        +
        Signature: unit -> unit
        @@ -758,10 +758,10 @@

        Instance members

        - + CodeSchemaProperty_IsHideBySignature() -
        +
        Signature: unit -> unit
        @@ -772,10 +772,10 @@

        Instance members

        - + CodeSchemaProperty_IsHideBySignatureSpecified(...) -
        +
        Signature: unit -> unit
        @@ -786,10 +786,10 @@

        Instance members

        - + CodeSchemaProperty_IsInternal() -
        +
        Signature: unit -> unit
        @@ -800,10 +800,10 @@

        Instance members

        - + CodeSchemaProperty_IsInternalSpecified() -
        +
        Signature: unit -> unit
        @@ -814,10 +814,10 @@

        Instance members

        - + CodeSchemaProperty_IsOperator() -
        +
        Signature: unit -> unit
        @@ -828,10 +828,10 @@

        Instance members

        - + CodeSchemaProperty_IsOperatorSpecified() -
        +
        Signature: unit -> unit
        @@ -842,10 +842,10 @@

        Instance members

        - + CodeSchemaProperty_IsOut() -
        +
        Signature: unit -> unit
        @@ -856,10 +856,10 @@

        Instance members

        - + CodeSchemaProperty_IsOutSpecified() -
        +
        Signature: unit -> unit
        @@ -870,10 +870,10 @@

        Instance members

        - + CodeSchemaProperty_IsParameterArray() -
        +
        Signature: unit -> unit
        @@ -884,10 +884,10 @@

        Instance members

        - + CodeSchemaProperty_IsParameterArraySpecified(...) -
        +
        Signature: unit -> unit
        @@ -898,10 +898,10 @@

        Instance members

        - + CodeSchemaProperty_IsPrivate() -
        +
        Signature: unit -> unit
        @@ -912,10 +912,10 @@

        Instance members

        - + CodeSchemaProperty_IsPrivateSpecified() -
        +
        Signature: unit -> unit
        @@ -926,10 +926,10 @@

        Instance members

        - + CodeSchemaProperty_IsPropertyGet() -
        +
        Signature: unit -> unit
        @@ -940,10 +940,10 @@

        Instance members

        - + CodeSchemaProperty_IsPropertyGetSpecified(...) -
        +
        Signature: unit -> unit
        @@ -954,10 +954,10 @@

        Instance members

        - + CodeSchemaProperty_IsPropertySet() -
        +
        Signature: unit -> unit
        @@ -968,10 +968,10 @@

        Instance members

        - + CodeSchemaProperty_IsPropertySetSpecified(...) -
        +
        Signature: unit -> unit
        @@ -982,10 +982,10 @@

        Instance members

        - + CodeSchemaProperty_IsProtected() -
        +
        Signature: unit -> unit
        @@ -996,10 +996,10 @@

        Instance members

        - + CodeSchemaProperty_IsProtectedOrInternal(...) -
        +
        Signature: unit -> unit
        @@ -1010,10 +1010,10 @@

        Instance members

        - + CodeSchemaProperty_IsProtectedOrInternalSpecified(...) -
        +
        Signature: unit -> unit
        @@ -1024,10 +1024,10 @@

        Instance members

        - + CodeSchemaProperty_IsProtectedSpecified(...) -
        +
        Signature: unit -> unit
        @@ -1038,10 +1038,10 @@

        Instance members

        - + CodeSchemaProperty_IsPrototype() -
        +
        Signature: unit -> unit
        @@ -1052,10 +1052,10 @@

        Instance members

        - + CodeSchemaProperty_IsPrototypeSpecified(...) -
        +
        Signature: unit -> unit
        @@ -1066,10 +1066,10 @@

        Instance members

        - + CodeSchemaProperty_IsPublic() -
        +
        Signature: unit -> unit
        @@ -1080,10 +1080,10 @@

        Instance members

        - + CodeSchemaProperty_IsPublicSpecified() -
        +
        Signature: unit -> unit
        @@ -1094,10 +1094,10 @@

        Instance members

        - + CodeSchemaProperty_IsSpecialName() -
        +
        Signature: unit -> unit
        @@ -1108,10 +1108,10 @@

        Instance members

        - + CodeSchemaProperty_IsSpecialNameSpecified(...) -
        +
        Signature: unit -> unit
        @@ -1122,10 +1122,10 @@

        Instance members

        - + CodeSchemaProperty_IsStatic() -
        +
        Signature: unit -> unit
        @@ -1136,10 +1136,10 @@

        Instance members

        - + CodeSchemaProperty_IsStaticSpecified() -
        +
        Signature: unit -> unit
        @@ -1150,10 +1150,10 @@

        Instance members

        - + CodeSchemaProperty_IsUntilLoop() -
        +
        Signature: unit -> unit
        @@ -1164,10 +1164,10 @@

        Instance members

        - + CodeSchemaProperty_IsUntilLoopSpecified(...) -
        +
        Signature: unit -> unit
        @@ -1178,10 +1178,10 @@

        Instance members

        - + CodeSchemaProperty_IsVirtual() -
        +
        Signature: unit -> unit
        @@ -1192,10 +1192,10 @@

        Instance members

        - + CodeSchemaProperty_IsVirtualSpecified() -
        +
        Signature: unit -> unit
        @@ -1206,10 +1206,10 @@

        Instance members

        - + CodeSchemaProperty_IsWhile() -
        +
        Signature: unit -> unit
        @@ -1220,10 +1220,10 @@

        Instance members

        - + CodeSchemaProperty_IsWhileSpecified() -
        +
        Signature: unit -> unit
        @@ -1234,10 +1234,10 @@

        Instance members

        - + CodeSchemaProperty_PreserveData() -
        +
        Signature: unit -> unit
        @@ -1248,10 +1248,10 @@

        Instance members

        - + CodeSchemaProperty_PreserveDataSpecified(...) -
        +
        Signature: unit -> unit
        @@ -1262,10 +1262,10 @@

        Instance members

        - + CodeSchemaProperty_SingleInstanceSourceLink(...) -
        +
        Signature: unit -> unit
        @@ -1276,10 +1276,10 @@

        Instance members

        - + CodeSchemaProperty_SingleInstanceSourceLinkSpecified(...) -
        +
        Signature: unit -> unit
        @@ -1290,10 +1290,10 @@

        Instance members

        - + CodeSchemaProperty_SingleInstanceTargetLink(...) -
        +
        Signature: unit -> unit
        @@ -1304,10 +1304,10 @@

        Instance members

        - + CodeSchemaProperty_SingleInstanceTargetLinkSpecified(...) -
        +
        Signature: unit -> unit
        @@ -1318,10 +1318,10 @@

        Instance members

        - + CodeSchemaProperty_SourceText() -
        +
        Signature: unit -> unit
        @@ -1332,10 +1332,10 @@

        Instance members

        - + CodeSchemaProperty_StartColumn() -
        +
        Signature: unit -> unit
        @@ -1346,10 +1346,10 @@

        Instance members

        - + CodeSchemaProperty_StartColumnSpecified(...) -
        +
        Signature: unit -> unit
        @@ -1360,10 +1360,10 @@

        Instance members

        - + CodeSchemaProperty_StartLine() -
        +
        Signature: unit -> unit
        @@ -1374,10 +1374,10 @@

        Instance members

        - + CodeSchemaProperty_StartLineSpecified() -
        +
        Signature: unit -> unit
        @@ -1388,10 +1388,10 @@

        Instance members

        - + CodeSchemaProperty_StatementKind() -
        +
        Signature: unit -> unit
        @@ -1402,10 +1402,10 @@

        Instance members

        - + CodeSchemaProperty_StatementNumber() -
        +
        Signature: unit -> unit
        @@ -1416,10 +1416,10 @@

        Instance members

        - + CodeSchemaProperty_StatementNumberSpecified(...) -
        +
        Signature: unit -> unit
        @@ -1430,10 +1430,10 @@

        Instance members

        - + CodeSchemaProperty_StatementType() -
        +
        Signature: unit -> unit
        @@ -1444,10 +1444,10 @@

        Instance members

        - + Description() -
        +
        Signature: unit -> unit
        @@ -1458,10 +1458,10 @@

        Instance members

        - + FilePath() -
        +
        Signature: unit -> unit
        @@ -1472,10 +1472,10 @@

        Instance members

        - + FontFamily() -
        +
        Signature: unit -> unit
        @@ -1486,10 +1486,10 @@

        Instance members

        - + FontSize() -
        +
        Signature: unit -> unit
        @@ -1500,10 +1500,10 @@

        Instance members

        - + FontSizeSpecified() -
        +
        Signature: unit -> unit
        @@ -1514,10 +1514,10 @@

        Instance members

        - + FontStyle() -
        +
        Signature: unit -> unit
        @@ -1528,10 +1528,10 @@

        Instance members

        - + FontStyleSpecified() -
        +
        Signature: unit -> unit
        @@ -1542,10 +1542,10 @@

        Instance members

        - + FontWeight() -
        +
        Signature: unit -> unit
        @@ -1556,10 +1556,10 @@

        Instance members

        - + FontWeightSpecified() -
        +
        Signature: unit -> unit
        @@ -1570,10 +1570,10 @@

        Instance members

        - + FunctionTypeFlags() -
        +
        Signature: unit -> unit
        @@ -1584,10 +1584,10 @@

        Instance members

        - + Group() -
        +
        Signature: unit -> unit
        @@ -1598,10 +1598,10 @@

        Instance members

        - + GroupSpecified() -
        +
        Signature: unit -> unit
        @@ -1612,10 +1612,10 @@

        Instance members

        - + HorizontalAlignment() -
        +
        Signature: unit -> unit
        @@ -1626,10 +1626,10 @@

        Instance members

        - + HorizontalAlignmentSpecified() -
        +
        Signature: unit -> unit
        @@ -1640,10 +1640,10 @@

        Instance members

        - + Icon() -
        +
        Signature: unit -> unit
        @@ -1654,10 +1654,10 @@

        Instance members

        - + Id() -
        +
        Signature: unit -> unit
        @@ -1668,10 +1668,10 @@

        Instance members

        - + IsAbstract() -
        +
        Signature: unit -> unit
        @@ -1682,10 +1682,10 @@

        Instance members

        - + IsAbstractSpecified() -
        +
        Signature: unit -> unit
        @@ -1696,10 +1696,10 @@

        Instance members

        - + IsCodeType() -
        +
        Signature: unit -> unit
        @@ -1710,10 +1710,10 @@

        Instance members

        - + IsCodeTypeSpecified() -
        +
        Signature: unit -> unit
        @@ -1724,10 +1724,10 @@

        Instance members

        - + IsDocumentation() -
        +
        Signature: unit -> unit
        @@ -1738,10 +1738,10 @@

        Instance members

        - + IsDocumentationSpecified() -
        +
        Signature: unit -> unit
        @@ -1752,10 +1752,10 @@

        Instance members

        - + IsHub() -
        +
        Signature: unit -> unit
        @@ -1766,10 +1766,10 @@

        Instance members

        - + IsHubSpecified() -
        +
        Signature: unit -> unit
        @@ -1780,10 +1780,10 @@

        Instance members

        - + IsOverloaded() -
        +
        Signature: unit -> unit
        @@ -1794,10 +1794,10 @@

        Instance members

        - + IsOverloadedSpecified() -
        +
        Signature: unit -> unit
        @@ -1808,10 +1808,10 @@

        Instance members

        - + IsOverridable() -
        +
        Signature: unit -> unit
        @@ -1822,10 +1822,10 @@

        Instance members

        - + IsOverridableSpecified() -
        +
        Signature: unit -> unit
        @@ -1836,10 +1836,10 @@

        Instance members

        - + IsVertical() -
        +
        Signature: unit -> unit
        @@ -1850,10 +1850,10 @@

        Instance members

        - + IsVerticalSpecified() -
        +
        Signature: unit -> unit
        @@ -1864,10 +1864,10 @@

        Instance members

        - + Label() -
        +
        Signature: unit -> unit
        @@ -1878,10 +1878,10 @@

        Instance members

        - + Language() -
        +
        Signature: unit -> unit
        @@ -1892,10 +1892,10 @@

        Instance members

        - + LinesOfCode() -
        +
        Signature: unit -> unit
        @@ -1906,10 +1906,10 @@

        Instance members

        - + LinesOfCodeSpecified() -
        +
        Signature: unit -> unit
        @@ -1920,10 +1920,10 @@

        Instance members

        - + Location() -
        +
        Signature: unit -> unit
        @@ -1934,10 +1934,10 @@

        Instance members

        - + MustImplement() -
        +
        Signature: unit -> unit
        @@ -1948,10 +1948,10 @@

        Instance members

        - + Namespace() -
        +
        Signature: unit -> unit
        @@ -1962,10 +1962,10 @@

        Instance members

        - + Reference() -
        +
        Signature: unit -> unit
        @@ -1976,10 +1976,10 @@

        Instance members

        - + Shape() -
        +
        Signature: unit -> unit
        @@ -1990,10 +1990,10 @@

        Instance members

        - + Style() -
        +
        Signature: unit -> unit
        @@ -2004,10 +2004,10 @@

        Instance members

        - + TypeName() -
        +
        Signature: unit -> unit
        @@ -2018,10 +2018,10 @@

        Instance members

        - + VerticalAlignment() -
        +
        Signature: unit -> unit
        @@ -2032,10 +2032,10 @@

        Instance members

        - + VerticalAlignmentSpecified() -
        +
        Signature: unit -> unit
        @@ -2046,10 +2046,10 @@

        Instance members

        - + Visibility() -
        +
        Signature: unit -> unit
        @@ -2060,10 +2060,10 @@

        Instance members

        - + VisibilitySpecified() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-serialization-directedgraphml-directedgraphnodecategory.html b/reference/quickgraph-serialization-directedgraphml-directedgraphnodecategory.html index 9ad7652b8..c81fee665 100644 --- a/reference/quickgraph-serialization-directedgraphml-directedgraphnodecategory.html +++ b/reference/quickgraph-serialization-directedgraphml-directedgraphnodecategory.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Ref() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-serialization-directedgraphml-directedgraphpath.html b/reference/quickgraph-serialization-directedgraphml-directedgraphpath.html index 710aad2da..91cb2a453 100644 --- a/reference/quickgraph-serialization-directedgraphml-directedgraphpath.html +++ b/reference/quickgraph-serialization-directedgraphml-directedgraphpath.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Id() -
        +
        Signature: unit -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + Value() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-serialization-directedgraphml-directedgraphproperty.html b/reference/quickgraph-serialization-directedgraphml-directedgraphproperty.html index 10c908a3f..0abdf7676 100644 --- a/reference/quickgraph-serialization-directedgraphml-directedgraphproperty.html +++ b/reference/quickgraph-serialization-directedgraphml-directedgraphproperty.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + DataType() -
        +
        Signature: unit -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + Description() -
        +
        Signature: unit -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + Group() -
        +
        Signature: unit -> unit
        @@ -114,10 +114,10 @@

        Instance members

        - + Id() -
        +
        Signature: unit -> unit
        @@ -128,10 +128,10 @@

        Instance members

        - + IsReference() -
        +
        Signature: unit -> unit
        @@ -142,10 +142,10 @@

        Instance members

        - + IsReferenceSpecified() -
        +
        Signature: unit -> unit
        @@ -156,10 +156,10 @@

        Instance members

        - + Label() -
        +
        Signature: unit -> unit
        @@ -170,10 +170,10 @@

        Instance members

        - + ReferenceTemplate() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-serialization-directedgraphml-directedgraphstyle.html b/reference/quickgraph-serialization-directedgraphml-directedgraphstyle.html index 0dbbb362b..a0733f281 100644 --- a/reference/quickgraph-serialization-directedgraphml-directedgraphstyle.html +++ b/reference/quickgraph-serialization-directedgraphml-directedgraphstyle.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Condition() -
        +
        Signature: unit -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + GroupLabel() -
        +
        Signature: unit -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + IsEnabled() -
        +
        Signature: unit -> unit
        @@ -114,10 +114,10 @@

        Instance members

        - + IsEnabledSpecified() -
        +
        Signature: unit -> unit
        @@ -128,10 +128,10 @@

        Instance members

        - + Setter() -
        +
        Signature: unit -> unit
        @@ -142,10 +142,10 @@

        Instance members

        - + TargetType() -
        +
        Signature: unit -> unit
        @@ -156,10 +156,10 @@

        Instance members

        - + ToolTip() -
        +
        Signature: unit -> unit
        @@ -170,10 +170,10 @@

        Instance members

        - + ValueLabel() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-serialization-directedgraphml-directedgraphstylecondition.html b/reference/quickgraph-serialization-directedgraphml-directedgraphstylecondition.html index 8a1f47347..a0bc34145 100644 --- a/reference/quickgraph-serialization-directedgraphml-directedgraphstylecondition.html +++ b/reference/quickgraph-serialization-directedgraphml-directedgraphstylecondition.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Expression() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-serialization-directedgraphml-directedgraphstylesetter.html b/reference/quickgraph-serialization-directedgraphml-directedgraphstylesetter.html index 0c34265aa..451d85eda 100644 --- a/reference/quickgraph-serialization-directedgraphml-directedgraphstylesetter.html +++ b/reference/quickgraph-serialization-directedgraphml-directedgraphstylesetter.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Expression() -
        +
        Signature: unit -> unit
        @@ -86,10 +86,10 @@

        Instance members

        - + Property() -
        +
        Signature: unit -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + Value() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-serialization-directedgraphmlalgorithm-2.html b/reference/quickgraph-serialization-directedgraphmlalgorithm-2.html index 7c894e654..df2a6d000 100644 --- a/reference/quickgraph-serialization-directedgraphmlalgorithm-2.html +++ b/reference/quickgraph-serialization-directedgraphmlalgorithm-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * vertexIdentities:VertexIdentity<'TVertex> * edgeIdentities:EdgeIdentity<'TVertex,'TEdge>) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + DirectedGraph -
        +
        Signature: DirectedGraph
        @@ -86,10 +86,10 @@

        Instance members

        - + FormatEdge -
        +
        Signature: Action<'TEdge,DirectedGraphLink>
        @@ -102,10 +102,10 @@

        Instance members

        - + FormatGraph -
        +
        Signature: Action<IVertexAndEdgeListGraph<'TVertex,'TEdge>,DirectedGraph>
        @@ -118,10 +118,10 @@

        Instance members

        - + FormatNode -
        +
        Signature: Action<'TVertex,DirectedGraphNode>
        diff --git a/reference/quickgraph-serialization-directedgraphmlextensions.html b/reference/quickgraph-serialization-directedgraphmlextensions.html index 164d1f3cf..6209a0312 100644 --- a/reference/quickgraph-serialization-directedgraphmlextensions.html +++ b/reference/quickgraph-serialization-directedgraphmlextensions.html @@ -52,10 +52,10 @@

        Static members

        - + DirectedGraphSerializer -
        +
        Signature: XmlSerializer
        @@ -68,10 +68,10 @@

        Static members

        - + OpenAsDGML(graph, filename) -
        +
        Signature: (graph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * filename:string) -> unit
        Type parameters: 'TVertex, 'TEdge
        @@ -82,10 +82,10 @@

        Static members

        - + ToDirectedGraphML(visitedGraph) -
        +
        Signature: visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> -> DirectedGraph
        Type parameters: 'TVertex, 'TEdge
        @@ -98,10 +98,10 @@

        Static members

        - + ToDirectedGraphML(...) -
        +
        Signature: (visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * vertexColors:Func<'TVertex,GraphColor>) -> DirectedGraph
        Type parameters: 'TVertex, 'TEdge
        @@ -114,10 +114,10 @@

        Static members

        - + ToDirectedGraphML(...) -
        +
        Signature: (visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * vertexIdentities:VertexIdentity<'TVertex> * edgeIdentities:EdgeIdentity<'TVertex,'TEdge>) -> DirectedGraph
        Type parameters: 'TVertex, 'TEdge
        @@ -130,10 +130,10 @@

        Static members

        - + ToDirectedGraphML(...) -
        +
        Signature: (visitedGraph:IVertexAndEdgeListGraph<'TVertex,'TEdge> * vertexIdentities:VertexIdentity<'TVertex> * edgeIdentities:EdgeIdentity<'TVertex,'TEdge> * _formatNode:Action<'TVertex,DirectedGraphNode> * _formatEdge:Action<'TEdge,DirectedGraphLink>) -> DirectedGraph
        Type parameters: 'TVertex, 'TEdge
        @@ -146,10 +146,10 @@

        Static members

        - + WriteXml(graph, fileName) -
        +
        Signature: (graph:DirectedGraph * fileName:string) -> unit
        @@ -162,10 +162,10 @@

        Static members

        - + WriteXml(graph, writer) -
        +
        Signature: (graph:DirectedGraph * writer:XmlWriter) -> unit
        @@ -178,10 +178,10 @@

        Static members

        - + WriteXml(graph, stream) -
        +
        Signature: (graph:DirectedGraph * stream:Stream) -> unit
        @@ -194,10 +194,10 @@

        Static members

        - + WriteXml(graph, writer) -
        +
        Signature: (graph:DirectedGraph * writer:TextWriter) -> unit
        diff --git a/reference/quickgraph-serialization-graphmldeserializer-3.html b/reference/quickgraph-serialization-graphmldeserializer-3.html index bb794e1e4..f4ffcde8b 100644 --- a/reference/quickgraph-serialization-graphmldeserializer-3.html +++ b/reference/quickgraph-serialization-graphmldeserializer-3.html @@ -52,10 +52,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -74,10 +74,10 @@

        Instance members

        - + Deserialize(...) -
        +
        Signature: (reader:XmlReader * visitedGraph:'TGraph * vertexFactory:IdentifiableVertexFactory<'TVertex> * edgeFactory:IdentifiableEdgeFactory<'TVertex,'TEdge>) -> unit
        diff --git a/reference/quickgraph-serialization-graphmlextensions.html b/reference/quickgraph-serialization-graphmlextensions.html index da723c6c7..b861aced0 100644 --- a/reference/quickgraph-serialization-graphmlextensions.html +++ b/reference/quickgraph-serialization-graphmlextensions.html @@ -50,10 +50,10 @@

        Static members

        - + DeserializeAndValidateFromGraphML(...) -
        +
        Signature: (graph:'TGraph * reader:TextReader * vertexFactory:IdentifiableVertexFactory<'TVertex> * edgeFactory:IdentifiableEdgeFactory<'TVertex,'TEdge>) -> unit
        Type parameters: 'TVertex, 'TEdge, 'TGraph
        @@ -64,10 +64,10 @@

        Static members

        - + DeserializeFromGraphML(...) -
        +
        Signature: (graph:'TGraph * fileName:string * vertexFactory:IdentifiableVertexFactory<'TVertex> * edgeFactory:IdentifiableEdgeFactory<'TVertex,'TEdge>) -> unit
        Type parameters: 'TVertex, 'TEdge, 'TGraph
        @@ -78,10 +78,10 @@

        Static members

        - + DeserializeFromGraphML(...) -
        +
        Signature: (graph:'TGraph * reader:TextReader * vertexFactory:IdentifiableVertexFactory<'TVertex> * edgeFactory:IdentifiableEdgeFactory<'TVertex,'TEdge>) -> unit
        Type parameters: 'TVertex, 'TEdge, 'TGraph
        @@ -92,10 +92,10 @@

        Static members

        - + DeserializeFromGraphML(...) -
        +
        Signature: (graph:'TGraph * reader:XmlReader * vertexFactory:IdentifiableVertexFactory<'TVertex> * edgeFactory:IdentifiableEdgeFactory<'TVertex,'TEdge>) -> unit
        Type parameters: 'TVertex, 'TEdge, 'TGraph
        @@ -106,10 +106,10 @@

        Static members

        - + SerializeToGraphML(...) -
        +
        Signature: (graph:'TGraph * fileName:string * vertexIdentities:VertexIdentity<'TVertex> * edgeIdentities:EdgeIdentity<'TVertex,'TEdge>) -> unit
        Type parameters: 'TVertex, 'TEdge, 'TGraph
        @@ -120,10 +120,10 @@

        Static members

        - + SerializeToGraphML(graph, fileName) -
        +
        Signature: (graph:'TGraph * fileName:string) -> unit
        Type parameters: 'TVertex, 'TEdge, 'TGraph
        @@ -134,10 +134,10 @@

        Static members

        - + SerializeToGraphML(...) -
        +
        Signature: (graph:'TGraph * writer:XmlWriter * vertexIdentities:VertexIdentity<'TVertex> * edgeIdentities:EdgeIdentity<'TVertex,'TEdge>) -> unit
        Type parameters: 'TVertex, 'TEdge, 'TGraph
        @@ -148,10 +148,10 @@

        Static members

        - + SerializeToGraphML(graph, writer) -
        +
        Signature: (graph:'TGraph * writer:XmlWriter) -> unit
        Type parameters: 'TVertex, 'TEdge, 'TGraph
        diff --git a/reference/quickgraph-serialization-graphmlserializer-3.html b/reference/quickgraph-serialization-graphmlserializer-3.html index 4ac44ca28..7683c83e8 100644 --- a/reference/quickgraph-serialization-graphmlserializer-3.html +++ b/reference/quickgraph-serialization-graphmlserializer-3.html @@ -52,10 +52,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -74,10 +74,10 @@

        Instance members

        - + Serialize(...) -
        +
        Signature: (writer:XmlWriter * visitedGraph:'TGraph * vertexIdentities:VertexIdentity<'TVertex> * edgeIdentities:EdgeIdentity<'TVertex,'TEdge>) -> unit
        @@ -96,10 +96,10 @@

        Static members

        - + MoveNextData(reader) -
        +
        Signature: reader:XmlReader -> bool
        diff --git a/reference/quickgraph-serialization-graphmlxmlresolver.html b/reference/quickgraph-serialization-graphmlxmlresolver.html index bd44cd4a4..0feafac84 100644 --- a/reference/quickgraph-serialization-graphmlxmlresolver.html +++ b/reference/quickgraph-serialization-graphmlxmlresolver.html @@ -53,10 +53,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -67,10 +67,10 @@

        Constructors

        - + new(baseResolver) -
        +
        Signature: baseResolver:XmlResolver -> unit
        @@ -89,10 +89,10 @@

        Instance members

        - + Credentials() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -104,10 +104,10 @@

        Instance members

        - + GetEntity(...) -
        +
        Signature: (absoluteUri:Uri * role:string * ofObjectToReturn:Type) -> obj
        Modifiers: abstract
        diff --git a/reference/quickgraph-serialization-serializationextensions.html b/reference/quickgraph-serialization-serializationextensions.html index 6741283d3..d961a3a15 100644 --- a/reference/quickgraph-serialization-serializationextensions.html +++ b/reference/quickgraph-serialization-serializationextensions.html @@ -50,10 +50,10 @@

        Static members

        - + DeserializeFromBinary(stream) -
        +
        Signature: stream:Stream -> 'TGraph
        Type parameters: 'TVertex, 'TEdge, 'TGraph
        @@ -66,10 +66,10 @@

        Static members

        - + DeserializeFromXml(...) -
        +
        Signature: (doc:IXPathNavigable * graphXPath:string * verticesXPath:string * edgesXPath:string * graphFactory:Func<XPathNavigator,'TGraph> * vertexFactory:Func<XPathNavigator,'TVertex> * edgeFactory:Func<XPathNavigator,'TEdge>) -> 'TGraph
        Type parameters: 'TVertex, 'TEdge, 'TGraph
        @@ -82,10 +82,10 @@

        Static members

        - + DeserializeFromXml(...) -
        +
        Signature: (reader:XmlReader * graphPredicate:Predicate<XmlReader> * vertexPredicate:Predicate<XmlReader> * edgePredicate:Predicate<XmlReader> * graphFactory:Func<XmlReader,'TGraph> * vertexFactory:Func<XmlReader,'TVertex> * edgeFactory:Func<XmlReader,'TEdge>) -> 'TGraph
        Type parameters: 'TVertex, 'TEdge, 'TGraph
        @@ -98,10 +98,10 @@

        Static members

        - + DeserializeFromXml(...) -
        +
        Signature: (reader:XmlReader * graphElementName:string * vertexElementName:string * edgeElementName:string * namespaceUri:string * graphFactory:Func<XmlReader,'TGraph> * vertexFactory:Func<XmlReader,'TVertex> * edgeFactory:Func<XmlReader,'TEdge>) -> 'TGraph
        Type parameters: 'TVertex, 'TEdge, 'TGraph
        @@ -114,10 +114,10 @@

        Static members

        - + SerializeToBinary(graph, stream) -
        +
        Signature: (graph:IGraph<'TVertex,'TEdge> * stream:Stream) -> unit
        Type parameters: 'TVertex, 'TEdge
        @@ -130,10 +130,10 @@

        Static members

        - + SerializeToXml(...) -
        +
        Signature: (graph:'TGraph * writer:XmlWriter * vertexIdentity:VertexIdentity<'TVertex> * edgeIdentity:EdgeIdentity<'TVertex,'TEdge> * graphElementName:string * vertexElementName:string * edgeElementName:string * namespaceUri:string) -> unit
        Type parameters: 'TVertex, 'TEdge, 'TGraph
        @@ -146,10 +146,10 @@

        Static members

        - + SerializeToXml(...) -
        +
        Signature: (graph:'TGraph * writer:XmlWriter * vertexIdentity:VertexIdentity<'TVertex> * edgeIdentity:EdgeIdentity<'TVertex,'TEdge> * graphElementName:string * vertexElementName:string * edgeElementName:string * namespaceUri:string * writeGraphAttributes:Action<XmlWriter,'TGraph> * writeVertexAttributes:Action<XmlWriter,'TVertex> * writeEdgeAttributes:Action<XmlWriter,'TEdge>) -> unit
        Type parameters: 'TVertex, 'TEdge, 'TGraph
        diff --git a/reference/quickgraph-serialization-serializerbase-2.html b/reference/quickgraph-serialization-serializerbase-2.html index 0e080d337..374bfa20f 100644 --- a/reference/quickgraph-serialization-serializerbase-2.html +++ b/reference/quickgraph-serialization-serializerbase-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + EmitDocumentDeclaration() -
        +
        Signature: unit -> unit
        diff --git a/reference/quickgraph-serialization-xmlreaderextensions.html b/reference/quickgraph-serialization-xmlreaderextensions.html index 819f904d0..4e856b6d5 100644 --- a/reference/quickgraph-serialization-xmlreaderextensions.html +++ b/reference/quickgraph-serialization-xmlreaderextensions.html @@ -50,10 +50,10 @@

        Static members

        - + ReadElementContentAsArray(...) -
        +
        Signature: (xmlReader:XmlReader * localName:string * namespaceURI:string * stringToT:Func<string,'T>) -> 'T []
        Type parameters: 'T
        @@ -66,10 +66,10 @@

        Static members

        - + ReadElementContentAsBooleanArray(...) -
        +
        Signature: (xmlReader:XmlReader * localName:string * namespaceURI:string) -> bool []
        @@ -80,10 +80,10 @@

        Static members

        - + ReadElementContentAsDoubleArray(...) -
        +
        Signature: (xmlReader:XmlReader * localName:string * namespaceURI:string) -> float []
        @@ -94,10 +94,10 @@

        Static members

        - + ReadElementContentAsInt32Array(...) -
        +
        Signature: (xmlReader:XmlReader * localName:string * namespaceURI:string) -> int []
        @@ -108,10 +108,10 @@

        Static members

        - + ReadElementContentAsInt64Array(...) -
        +
        Signature: (xmlReader:XmlReader * localName:string * namespaceURI:string) -> int64 []
        @@ -122,10 +122,10 @@

        Static members

        - + ReadElementContentAsSingleArray(...) -
        +
        Signature: (xmlReader:XmlReader * localName:string * namespaceURI:string) -> float32 []
        @@ -136,10 +136,10 @@

        Static members

        - + ReadElementContentAsStringArray(...) -
        +
        Signature: (xmlReader:XmlReader * localName:string * namespaceURI:string) -> string []
        diff --git a/reference/quickgraph-serialization-xmlserializableedge-1.html b/reference/quickgraph-serialization-xmlserializableedge-1.html index 16c07b466..867fdc9ff 100644 --- a/reference/quickgraph-serialization-xmlserializableedge-1.html +++ b/reference/quickgraph-serialization-xmlserializableedge-1.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Source() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + Target() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        diff --git a/reference/quickgraph-serialization-xmlserializablegraph-3.html b/reference/quickgraph-serialization-xmlserializablegraph-3.html index 09a2c2246..49b317fa1 100644 --- a/reference/quickgraph-serialization-xmlserializablegraph-3.html +++ b/reference/quickgraph-serialization-xmlserializablegraph-3.html @@ -52,10 +52,10 @@

        Constructors

        - + new(graph) -
        +
        Signature: graph:'TGraph -> unit
        @@ -66,10 +66,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -88,10 +88,10 @@

        Instance members

        - + Edges -
        +
        Signature: IEnumerable<'TEdge>
        @@ -102,10 +102,10 @@

        Instance members

        - + Graph -
        +
        Signature: 'TGraph
        diff --git a/reference/quickgraph-serialization-xmlwriterextensions.html b/reference/quickgraph-serialization-xmlwriterextensions.html index 0d1c6ca48..92e37d85e 100644 --- a/reference/quickgraph-serialization-xmlwriterextensions.html +++ b/reference/quickgraph-serialization-xmlwriterextensions.html @@ -50,10 +50,10 @@

        Static members

        - + WriteArray(xmlWriter, value) -
        +
        Signature: (xmlWriter:XmlWriter * value:IList<'T>) -> unit
        Type parameters: 'T
        @@ -68,10 +68,10 @@

        Static members

        - + WriteBooleanArray(xmlWriter, value) -
        +
        Signature: (xmlWriter:XmlWriter * value:IList<bool>) -> unit
        @@ -82,10 +82,10 @@

        Static members

        - + WriteDoubleArray(xmlWriter, value) -
        +
        Signature: (xmlWriter:XmlWriter * value:IList<float>) -> unit
        @@ -96,10 +96,10 @@

        Static members

        - + WriteInt32Array(xmlWriter, value) -
        +
        Signature: (xmlWriter:XmlWriter * value:IList<int>) -> unit
        @@ -110,10 +110,10 @@

        Static members

        - + WriteInt64Array(xmlWriter, value) -
        +
        Signature: (xmlWriter:XmlWriter * value:IList<int64>) -> unit
        @@ -124,10 +124,10 @@

        Static members

        - + WriteSingleArray(xmlWriter, value) -
        +
        Signature: (xmlWriter:XmlWriter * value:IList<float32>) -> unit
        @@ -138,10 +138,10 @@

        Static members

        - + WriteStringArray(xmlWriter, value) -
        +
        Signature: (xmlWriter:XmlWriter * value:IList<string>) -> unit
        diff --git a/reference/quickgraph-sreversededge-2.html b/reference/quickgraph-sreversededge-2.html index e4babceeb..93e9a0d16 100644 --- a/reference/quickgraph-sreversededge-2.html +++ b/reference/quickgraph-sreversededge-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(originalEdge) -
        +
        Signature: originalEdge:'TEdge -> unit
        @@ -74,10 +74,10 @@

        Instance members

        - + Equals(obj) -
        +
        Signature: obj:obj -> bool
        Modifiers: abstract
        @@ -89,10 +89,10 @@

        Instance members

        - + Equals(other) -
        +
        Signature: other:SReversedEdge<'TVertex,'TEdge> -> bool
        Modifiers: abstract
        @@ -104,10 +104,10 @@

        Instance members

        - + GetHashCode() -
        +
        Signature: unit -> int
        Modifiers: abstract
        @@ -119,10 +119,10 @@

        Instance members

        - + OriginalEdge -
        +
        Signature: 'TEdge
        @@ -133,10 +133,10 @@

        Instance members

        - + Source -
        +
        Signature: 'TVertex
        Modifiers: abstract
        @@ -148,10 +148,10 @@

        Instance members

        - + Target -
        +
        Signature: 'TVertex
        Modifiers: abstract
        @@ -163,10 +163,10 @@

        Instance members

        - + ToString() -
        +
        Signature: unit -> string
        Modifiers: abstract
        diff --git a/reference/quickgraph-staggededge-2.html b/reference/quickgraph-staggededge-2.html index 2bc614c87..a7db2ef19 100644 --- a/reference/quickgraph-staggededge-2.html +++ b/reference/quickgraph-staggededge-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(source, target, tag) -
        +
        Signature: (source:'TVertex * target:'TVertex * tag:'TTag) -> unit
        @@ -74,10 +74,10 @@

        Instance members

        - + Source -
        +
        Signature: 'TVertex
        Modifiers: abstract
        @@ -89,10 +89,10 @@

        Instance members

        - + Tag() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -104,10 +104,10 @@

        Instance members

        - + TagChanged -
        +
        Signature: IEvent<EventHandler,EventArgs>
        Modifiers: abstract
        @@ -119,10 +119,10 @@

        Instance members

        - + Target -
        +
        Signature: 'TVertex
        Modifiers: abstract
        @@ -134,10 +134,10 @@

        Instance members

        - + ToString() -
        +
        Signature: unit -> string
        Modifiers: abstract
        diff --git a/reference/quickgraph-staggedequatableedge-2.html b/reference/quickgraph-staggedequatableedge-2.html index 814248269..e784d958b 100644 --- a/reference/quickgraph-staggedequatableedge-2.html +++ b/reference/quickgraph-staggedequatableedge-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(source, target, tag) -
        +
        Signature: (source:'TVertex * target:'TVertex * tag:'TTag) -> unit
        @@ -74,10 +74,10 @@

        Instance members

        - + Equals(other) -
        +
        Signature: other:STaggedEquatableEdge<'TVertex,'TTag> -> bool
        Modifiers: abstract
        @@ -91,10 +91,10 @@

        Instance members

        - + Equals(obj) -
        +
        Signature: obj:obj -> bool
        Modifiers: abstract
        @@ -108,10 +108,10 @@

        Instance members

        - + GetHashCode() -
        +
        Signature: unit -> int
        Modifiers: abstract
        @@ -125,10 +125,10 @@

        Instance members

        - + Source -
        +
        Signature: 'TVertex
        Modifiers: abstract
        @@ -140,10 +140,10 @@

        Instance members

        - + Tag() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -155,10 +155,10 @@

        Instance members

        - + TagChanged -
        +
        Signature: IEvent<EventHandler,EventArgs>
        Modifiers: abstract
        @@ -170,10 +170,10 @@

        Instance members

        - + Target -
        +
        Signature: 'TVertex
        Modifiers: abstract
        @@ -185,10 +185,10 @@

        Instance members

        - + ToString() -
        +
        Signature: unit -> string
        Modifiers: abstract
        diff --git a/reference/quickgraph-sundirectededge-1.html b/reference/quickgraph-sundirectededge-1.html index 55dc8c207..d5a334e18 100644 --- a/reference/quickgraph-sundirectededge-1.html +++ b/reference/quickgraph-sundirectededge-1.html @@ -52,10 +52,10 @@

        Constructors

        - + new(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> unit
        @@ -76,10 +76,10 @@

        Instance members

        - + Source -
        +
        Signature: 'TVertex
        Modifiers: abstract
        @@ -93,10 +93,10 @@

        Instance members

        - + Target -
        +
        Signature: 'TVertex
        Modifiers: abstract
        @@ -110,10 +110,10 @@

        Instance members

        - + ToString() -
        +
        Signature: unit -> string
        Modifiers: abstract
        diff --git a/reference/quickgraph-sundirectedtaggededge-2.html b/reference/quickgraph-sundirectedtaggededge-2.html index 28c787533..dc21d5eba 100644 --- a/reference/quickgraph-sundirectedtaggededge-2.html +++ b/reference/quickgraph-sundirectedtaggededge-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(source, target, tag) -
        +
        Signature: (source:'TVertex * target:'TVertex * tag:'TTag) -> unit
        @@ -76,10 +76,10 @@

        Instance members

        - + Source -
        +
        Signature: 'TVertex
        Modifiers: abstract
        @@ -93,10 +93,10 @@

        Instance members

        - + Tag() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -108,10 +108,10 @@

        Instance members

        - + TagChanged -
        +
        Signature: IEvent<EventHandler,EventArgs>
        Modifiers: abstract
        @@ -123,10 +123,10 @@

        Instance members

        - + Target -
        +
        Signature: 'TVertex
        Modifiers: abstract
        @@ -140,10 +140,10 @@

        Instance members

        - + ToString() -
        +
        Signature: unit -> string
        Modifiers: abstract
        diff --git a/reference/quickgraph-taggededge-2.html b/reference/quickgraph-taggededge-2.html index 03dc968ff..51c9b0cfe 100644 --- a/reference/quickgraph-taggededge-2.html +++ b/reference/quickgraph-taggededge-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(source, target, tag) -
        +
        Signature: (source:'TVertex * target:'TVertex * tag:'TTag) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Tag() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + TagChanged -
        +
        Signature: IEvent<EventHandler,EventArgs>
        Modifiers: abstract
        diff --git a/reference/quickgraph-taggedequatableedge-2.html b/reference/quickgraph-taggedequatableedge-2.html index b4dfefd59..535ca318e 100644 --- a/reference/quickgraph-taggedequatableedge-2.html +++ b/reference/quickgraph-taggedequatableedge-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(source, target, tag) -
        +
        Signature: (source:'TVertex * target:'TVertex * tag:'TTag) -> unit
        @@ -74,10 +74,10 @@

        Instance members

        - + Tag() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -89,10 +89,10 @@

        Instance members

        - + TagChanged -
        +
        Signature: IEvent<EventHandler,EventArgs>
        Modifiers: abstract
        diff --git a/reference/quickgraph-taggedundirectededge-2.html b/reference/quickgraph-taggedundirectededge-2.html index 51c41f723..36fd5b7d4 100644 --- a/reference/quickgraph-taggedundirectededge-2.html +++ b/reference/quickgraph-taggedundirectededge-2.html @@ -52,10 +52,10 @@

        Constructors

        - + new(source, target, tag) -
        +
        Signature: (source:'TVertex * target:'TVertex * tag:'TTag) -> unit
        @@ -76,10 +76,10 @@

        Instance members

        - + Tag() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -93,10 +93,10 @@

        Instance members

        - + TagChanged -
        +
        Signature: IEvent<EventHandler,EventArgs>
        Modifiers: abstract
        @@ -110,10 +110,10 @@

        Instance members

        - + ToString() -
        +
        Signature: unit -> string
        Modifiers: abstract
        diff --git a/reference/quickgraph-termbidirectionalgraph-2.html b/reference/quickgraph-termbidirectionalgraph-2.html index 4640d1081..983c5cdcf 100644 --- a/reference/quickgraph-termbidirectionalgraph-2.html +++ b/reference/quickgraph-termbidirectionalgraph-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + InDegreeAt(v, terminal) -
        +
        Signature: (v:'TVertex * terminal:int) -> int
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + InEdgesAt(v, terminal) -
        +
        Signature: (v:'TVertex * terminal:int) -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + InTerminalCount(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -117,10 +117,10 @@

        Instance members

        - + IsInEdgesEmptyAt(v, terminal) -
        +
        Signature: (v:'TVertex * terminal:int) -> bool
        Modifiers: abstract
        @@ -132,10 +132,10 @@

        Instance members

        - + IsOutEdgesEmptyAt(v, terminal) -
        +
        Signature: (v:'TVertex * terminal:int) -> bool
        Modifiers: abstract
        @@ -147,10 +147,10 @@

        Instance members

        - + OutDegreeAt(v, terminal) -
        +
        Signature: (v:'TVertex * terminal:int) -> int
        Modifiers: abstract
        @@ -162,10 +162,10 @@

        Instance members

        - + OutEdgesAt(v, terminal) -
        +
        Signature: (v:'TVertex * terminal:int) -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -177,10 +177,10 @@

        Instance members

        - + OutTerminalCount(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -192,10 +192,10 @@

        Instance members

        - + TryGetInEdgesAt(v, terminal, edges) -
        +
        Signature: (v:'TVertex * terminal:int * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        @@ -207,10 +207,10 @@

        Instance members

        - + TryGetOutEdgesAt(v, terminal, edges) -
        +
        Signature: (v:'TVertex * terminal:int * edges:byref<IEnumerable<'TEdge>>) -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-termedge-1.html b/reference/quickgraph-termedge-1.html index 3becae55c..e56cf1451 100644 --- a/reference/quickgraph-termedge-1.html +++ b/reference/quickgraph-termedge-1.html @@ -52,10 +52,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (source:'TVertex * target:'TVertex * sourceTerminal:int * targetTerminal:int) -> unit
        @@ -68,10 +68,10 @@

        Constructors

        - + new(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> unit
        @@ -92,10 +92,10 @@

        Instance members

        - + Source -
        +
        Signature: 'TVertex
        Modifiers: abstract
        @@ -109,10 +109,10 @@

        Instance members

        - + SourceTerminal -
        +
        Signature: int
        Modifiers: abstract
        @@ -126,10 +126,10 @@

        Instance members

        - + Target -
        +
        Signature: 'TVertex
        Modifiers: abstract
        @@ -143,10 +143,10 @@

        Instance members

        - + TargetTerminal -
        +
        Signature: int
        Modifiers: abstract
        @@ -160,10 +160,10 @@

        Instance members

        - + ToString() -
        +
        Signature: unit -> string
        Modifiers: abstract
        diff --git a/reference/quickgraph-tryfunc-2.html b/reference/quickgraph-tryfunc-2.html index f924a2a23..7070bfe1a 100644 --- a/reference/quickgraph-tryfunc-2.html +++ b/reference/quickgraph-tryfunc-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(object, method) -
        +
        Signature: (object:obj * method:nativeint) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + BeginInvoke(...) -
        +
        Signature: (arg:'T * result:byref<'TResult> * callback:AsyncCallback * object:obj) -> IAsyncResult
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + EndInvoke(result, __result) -
        +
        Signature: (result:byref<'TResult> * __result:IAsyncResult) -> bool
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + Invoke(arg, result) -
        +
        Signature: (arg:'T * result:byref<'TResult>) -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-tryfunc-3.html b/reference/quickgraph-tryfunc-3.html index a7b587239..3fcaf7df4 100644 --- a/reference/quickgraph-tryfunc-3.html +++ b/reference/quickgraph-tryfunc-3.html @@ -50,10 +50,10 @@

        Constructors

        - + new(object, method) -
        +
        Signature: (object:obj * method:nativeint) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + BeginInvoke(...) -
        +
        Signature: (arg:'T1 * arg2:'T2 * result:byref<'TResult> * callback:AsyncCallback * object:obj) -> IAsyncResult
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + EndInvoke(result, __result) -
        +
        Signature: (result:byref<'TResult> * __result:IAsyncResult) -> bool
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + Invoke(arg, arg2, result) -
        +
        Signature: (arg:'T1 * arg2:'T2 * result:byref<'TResult>) -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-tryfunc-4.html b/reference/quickgraph-tryfunc-4.html index eaf3f6a7b..cbd05a1fa 100644 --- a/reference/quickgraph-tryfunc-4.html +++ b/reference/quickgraph-tryfunc-4.html @@ -50,10 +50,10 @@

        Constructors

        - + new(object, method) -
        +
        Signature: (object:obj * method:nativeint) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + BeginInvoke(...) -
        +
        Signature: (arg:'T1 * arg2:'T2 * arg3:'T3 * result:byref<'TResult> * callback:AsyncCallback * object:obj) -> IAsyncResult
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + EndInvoke(result, __result) -
        +
        Signature: (result:byref<'TResult> * __result:IAsyncResult) -> bool
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + Invoke(arg, arg2, arg3, result) -
        +
        Signature: (arg:'T1 * arg2:'T2 * arg3:'T3 * result:byref<'TResult>) -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-tryfunc-5.html b/reference/quickgraph-tryfunc-5.html index 4c747f4d6..951f941c7 100644 --- a/reference/quickgraph-tryfunc-5.html +++ b/reference/quickgraph-tryfunc-5.html @@ -50,10 +50,10 @@

        Constructors

        - + new(object, method) -
        +
        Signature: (object:obj * method:nativeint) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + BeginInvoke(...) -
        +
        Signature: (arg:'T1 * arg2:'T2 * arg3:'T3 * arg4:'T4 * result:byref<'TResult> * callback:AsyncCallback * object:obj) -> IAsyncResult
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + EndInvoke(result, __result) -
        +
        Signature: (result:byref<'TResult> * __result:IAsyncResult) -> bool
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + Invoke(arg, arg2, arg3, arg4, result) -
        +
        Signature: (arg:'T1 * arg2:'T2 * arg3:'T3 * arg4:'T4 * result:byref<'TResult>) -> bool
        Modifiers: abstract
        diff --git a/reference/quickgraph-undirectedbidirectionalgraph-2.html b/reference/quickgraph-undirectedbidirectionalgraph-2.html index a58842d5b..9c20dc792 100644 --- a/reference/quickgraph-undirectedbidirectionalgraph-2.html +++ b/reference/quickgraph-undirectedbidirectionalgraph-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(visitedGraph) -
        +
        Signature: visitedGraph:IBidirectionalGraph<'TVertex,'TEdge> -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + AdjacentDegree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + AdjacentEdge(v, index) -
        +
        Signature: (v:'TVertex * index:int) -> 'TEdge
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + AdjacentEdges(v) -
        +
        Signature: v:'TVertex -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -117,10 +117,10 @@

        Instance members

        - + AllowParallelEdges -
        +
        Signature: bool
        Modifiers: abstract
        @@ -132,10 +132,10 @@

        Instance members

        - + ContainsEdge(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> bool
        Modifiers: abstract
        @@ -147,10 +147,10 @@

        Instance members

        - + ContainsEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -162,10 +162,10 @@

        Instance members

        - + ContainsVertex(vertex) -
        +
        Signature: vertex:'TVertex -> bool
        Modifiers: abstract
        @@ -177,10 +177,10 @@

        Instance members

        - + EdgeCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -192,10 +192,10 @@

        Instance members

        - + EdgeEqualityComparer -
        +
        Signature: EdgeEqualityComparer<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -207,10 +207,10 @@

        Instance members

        - + Edges -
        +
        Signature: IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -222,10 +222,10 @@

        Instance members

        - + IsAdjacentEdgesEmpty(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -237,10 +237,10 @@

        Instance members

        - + IsDirected -
        +
        Signature: bool
        Modifiers: abstract
        @@ -252,10 +252,10 @@

        Instance members

        - + IsEdgesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -267,10 +267,10 @@

        Instance members

        - + IsVerticesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -282,10 +282,10 @@

        Instance members

        - + TryGetEdge(source, target, edge) -
        +
        Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
        Modifiers: abstract
        @@ -297,10 +297,10 @@

        Instance members

        - + VertexCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -312,10 +312,10 @@

        Instance members

        - + Vertices -
        +
        Signature: IEnumerable<'TVertex>
        Modifiers: abstract
        @@ -327,10 +327,10 @@

        Instance members

        - + VisitedGraph -
        +
        Signature: IBidirectionalGraph<'TVertex,'TEdge>
        diff --git a/reference/quickgraph-undirectededge-1.html b/reference/quickgraph-undirectededge-1.html index 89b2e0c99..27ef8960d 100644 --- a/reference/quickgraph-undirectededge-1.html +++ b/reference/quickgraph-undirectededge-1.html @@ -52,10 +52,10 @@

        Constructors

        - + new(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> unit
        @@ -76,10 +76,10 @@

        Instance members

        - + Source -
        +
        Signature: 'TVertex
        Modifiers: abstract
        @@ -93,10 +93,10 @@

        Instance members

        - + Target -
        +
        Signature: 'TVertex
        Modifiers: abstract
        @@ -110,10 +110,10 @@

        Instance members

        - + ToString() -
        +
        Signature: unit -> string
        Modifiers: abstract
        diff --git a/reference/quickgraph-undirectededgeaction-2.html b/reference/quickgraph-undirectededgeaction-2.html index f6713d137..463c0844f 100644 --- a/reference/quickgraph-undirectededgeaction-2.html +++ b/reference/quickgraph-undirectededgeaction-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(object, method) -
        +
        Signature: (object:obj * method:nativeint) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + BeginInvoke(sender, e, callback, object) -
        +
        Signature: (sender:obj * e:UndirectedEdgeEventArgs<'TVertex,'TEdge> * callback:AsyncCallback * object:obj) -> IAsyncResult
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + EndInvoke(result) -
        +
        Signature: result:IAsyncResult -> unit
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + Invoke(sender, e) -
        +
        Signature: (sender:obj * e:UndirectedEdgeEventArgs<'TVertex,'TEdge>) -> unit
        Modifiers: abstract
        diff --git a/reference/quickgraph-undirectededgeeventargs-2.html b/reference/quickgraph-undirectededgeeventargs-2.html index b3d0fb4e1..b49d8d940 100644 --- a/reference/quickgraph-undirectededgeeventargs-2.html +++ b/reference/quickgraph-undirectededgeeventargs-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(edge, reversed) -
        +
        Signature: (edge:'TEdge * reversed:bool) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Reversed -
        +
        Signature: bool
        @@ -86,10 +86,10 @@

        Instance members

        - + Source -
        +
        Signature: 'TVertex
        @@ -100,10 +100,10 @@

        Instance members

        - + Target -
        +
        Signature: 'TVertex
        diff --git a/reference/quickgraph-undirectedgraph-2.html b/reference/quickgraph-undirectedgraph-2.html index a0ec28ff6..85904d156 100644 --- a/reference/quickgraph-undirectedgraph-2.html +++ b/reference/quickgraph-undirectedgraph-2.html @@ -50,10 +50,10 @@

        Constructors

        - + new(...) -
        +
        Signature: (allowParallelEdges:bool * edgeEqualityComparer:EdgeEqualityComparer<'TVertex,'TEdge>) -> unit
        @@ -64,10 +64,10 @@

        Constructors

        - + new(allowParallelEdges) -
        +
        Signature: allowParallelEdges:bool -> unit
        @@ -78,10 +78,10 @@

        Constructors

        - + new() -
        +
        Signature: unit -> unit
        @@ -100,10 +100,10 @@

        Instance members

        - + AddEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -115,10 +115,10 @@

        Instance members

        - + AddEdgeRange(edges) -
        +
        Signature: edges:IEnumerable<'TEdge> -> int
        Modifiers: abstract
        @@ -130,10 +130,10 @@

        Instance members

        - + AddVertex(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -145,10 +145,10 @@

        Instance members

        - + AddVertexRange(vertices) -
        +
        Signature: vertices:IEnumerable<'TVertex> -> int
        Modifiers: abstract
        @@ -160,10 +160,10 @@

        Instance members

        - + AddVerticesAndEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -175,10 +175,10 @@

        Instance members

        - + AddVerticesAndEdgeRange(edges) -
        +
        Signature: edges:IEnumerable<'TEdge> -> int
        Modifiers: abstract
        @@ -190,10 +190,10 @@

        Instance members

        - + AdjacentDegree(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        @@ -205,10 +205,10 @@

        Instance members

        - + AdjacentEdge(v, index) -
        +
        Signature: (v:'TVertex * index:int) -> 'TEdge
        Modifiers: abstract
        @@ -220,10 +220,10 @@

        Instance members

        - + AdjacentEdges(v) -
        +
        Signature: v:'TVertex -> IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -235,10 +235,10 @@

        Instance members

        - + AdjacentVertices(v) -
        +
        Signature: v:'TVertex -> IEnumerable<'TVertex>
        @@ -249,10 +249,10 @@

        Instance members

        - + AllowParallelEdges -
        +
        Signature: bool
        Modifiers: abstract
        @@ -264,10 +264,10 @@

        Instance members

        - + Clear() -
        +
        Signature: unit -> unit
        Modifiers: abstract
        @@ -279,10 +279,10 @@

        Instance members

        - + ClearAdjacentEdges(v) -
        +
        Signature: v:'TVertex -> unit
        Modifiers: abstract
        @@ -294,10 +294,10 @@

        Instance members

        - + Clone() -
        +
        Signature: unit -> UndirectedGraph<'TVertex,'TEdge>
        @@ -308,10 +308,10 @@

        Instance members

        - + ContainsEdge(source, target) -
        +
        Signature: (source:'TVertex * target:'TVertex) -> bool
        Modifiers: abstract
        @@ -323,10 +323,10 @@

        Instance members

        - + ContainsEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -338,10 +338,10 @@

        Instance members

        - + ContainsVertex(vertex) -
        +
        Signature: vertex:'TVertex -> bool
        Modifiers: abstract
        @@ -353,10 +353,10 @@

        Instance members

        - + EdgeAdded -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -368,10 +368,10 @@

        Instance members

        - + EdgeCapacity() -
        +
        Signature: unit -> unit
        @@ -382,10 +382,10 @@

        Instance members

        - + EdgeCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -397,10 +397,10 @@

        Instance members

        - + EdgeEqualityComparer -
        +
        Signature: EdgeEqualityComparer<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -412,10 +412,10 @@

        Instance members

        - + EdgeRemoved -
        +
        Signature: EdgeAction<'TVertex,'TEdge>
        Modifiers: abstract
        @@ -427,10 +427,10 @@

        Instance members

        - + Edges -
        +
        Signature: IEnumerable<'TEdge>
        Modifiers: abstract
        @@ -442,10 +442,10 @@

        Instance members

        - + IsAdjacentEdgesEmpty(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -457,10 +457,10 @@

        Instance members

        - + IsDirected -
        +
        Signature: bool
        Modifiers: abstract
        @@ -472,10 +472,10 @@

        Instance members

        - + IsEdgesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -487,10 +487,10 @@

        Instance members

        - + IsVerticesEmpty -
        +
        Signature: bool
        Modifiers: abstract
        @@ -502,10 +502,10 @@

        Instance members

        - + RemoveAdjacentEdgeIf(v, predicate) -
        +
        Signature: (v:'TVertex * predicate:EdgePredicate<'TVertex,'TEdge>) -> int
        Modifiers: abstract
        @@ -517,10 +517,10 @@

        Instance members

        - + RemoveEdge(edge) -
        +
        Signature: edge:'TEdge -> bool
        Modifiers: abstract
        @@ -532,10 +532,10 @@

        Instance members

        - + RemoveEdgeIf(predicate) -
        +
        Signature: predicate:EdgePredicate<'TVertex,'TEdge> -> int
        Modifiers: abstract
        @@ -547,10 +547,10 @@

        Instance members

        - + RemoveEdges(edges) -
        +
        Signature: edges:IEnumerable<'TEdge> -> int
        @@ -561,10 +561,10 @@

        Instance members

        - + RemoveVertex(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        @@ -576,10 +576,10 @@

        Instance members

        - + RemoveVertexIf(pred) -
        +
        Signature: pred:VertexPredicate<'TVertex> -> int
        Modifiers: abstract
        @@ -591,10 +591,24 @@

        Instance members

        - + + ToBidirectionalGraph() + +
        + Signature: unit -> BidirectionalGraph<'TVertex,'TEdge>
        +
        + + + + + + + + + TrimEdgeExcess() -
        +
        Signature: unit -> unit
        @@ -605,10 +619,10 @@

        Instance members

        - + TryGetEdge(source, target, edge) -
        +
        Signature: (source:'TVertex * target:'TVertex * edge:byref<'TEdge>) -> bool
        Modifiers: abstract
        @@ -620,10 +634,10 @@

        Instance members

        - + VertexAdded -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -635,10 +649,10 @@

        Instance members

        - + VertexCount -
        +
        Signature: int
        Modifiers: abstract
        @@ -650,10 +664,10 @@

        Instance members

        - + VertexRemoved -
        +
        Signature: VertexAction<'TVertex>
        Modifiers: abstract
        @@ -665,10 +679,10 @@

        Instance members

        - + Vertices -
        +
        Signature: IEnumerable<'TVertex>
        Modifiers: abstract
        @@ -688,10 +702,10 @@

        Static members

        - + LoadDot(dotSource, vertexFunc, edgeFunc) -
        +
        Signature: (dotSource:string * vertexFunc:Func<string,IDictionary<string,string>,'TVertex> * edgeFunc:Func<'TVertex,'TVertex,IDictionary<string,string>,'TEdge>) -> UndirectedGraph<'TVertex,'TEdge>
        diff --git a/reference/quickgraph-vertexaction-1.html b/reference/quickgraph-vertexaction-1.html index 7a508df72..07962a5de 100644 --- a/reference/quickgraph-vertexaction-1.html +++ b/reference/quickgraph-vertexaction-1.html @@ -50,10 +50,10 @@

        Constructors

        - + new(object, method) -
        +
        Signature: (object:obj * method:nativeint) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + BeginInvoke(vertex, callback, object) -
        +
        Signature: (vertex:'TVertex * callback:AsyncCallback * object:obj) -> IAsyncResult
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + EndInvoke(result) -
        +
        Signature: result:IAsyncResult -> unit
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + Invoke(vertex) -
        +
        Signature: vertex:'TVertex -> unit
        Modifiers: abstract
        diff --git a/reference/quickgraph-vertexeventargs-1.html b/reference/quickgraph-vertexeventargs-1.html index ad1df443d..b39504b23 100644 --- a/reference/quickgraph-vertexeventargs-1.html +++ b/reference/quickgraph-vertexeventargs-1.html @@ -50,10 +50,10 @@

        Constructors

        - + new(vertex) -
        +
        Signature: vertex:'TVertex -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + Vertex -
        +
        Signature: 'TVertex
        diff --git a/reference/quickgraph-vertexeventhandler-1.html b/reference/quickgraph-vertexeventhandler-1.html index d1f8322b1..f7786e5ee 100644 --- a/reference/quickgraph-vertexeventhandler-1.html +++ b/reference/quickgraph-vertexeventhandler-1.html @@ -50,10 +50,10 @@

        Constructors

        - + new(object, method) -
        +
        Signature: (object:obj * method:nativeint) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + BeginInvoke(sender, e, callback, object) -
        +
        Signature: (sender:obj * e:VertexEventArgs<'TVertex> * callback:AsyncCallback * object:obj) -> IAsyncResult
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + EndInvoke(result) -
        +
        Signature: result:IAsyncResult -> unit
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + Invoke(sender, e) -
        +
        Signature: (sender:obj * e:VertexEventArgs<'TVertex>) -> unit
        Modifiers: abstract
        diff --git a/reference/quickgraph-vertexfactory-1.html b/reference/quickgraph-vertexfactory-1.html index 3c03b832c..4ad1905e3 100644 --- a/reference/quickgraph-vertexfactory-1.html +++ b/reference/quickgraph-vertexfactory-1.html @@ -50,10 +50,10 @@

        Constructors

        - + new(object, method) -
        +
        Signature: (object:obj * method:nativeint) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + BeginInvoke(callback, object) -
        +
        Signature: (callback:AsyncCallback * object:obj) -> IAsyncResult
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + EndInvoke(result) -
        +
        Signature: result:IAsyncResult -> 'TVertex
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + Invoke() -
        +
        Signature: unit -> 'TVertex
        Modifiers: abstract
        diff --git a/reference/quickgraph-vertexidentity-1.html b/reference/quickgraph-vertexidentity-1.html index e76e3a98c..85a79170c 100644 --- a/reference/quickgraph-vertexidentity-1.html +++ b/reference/quickgraph-vertexidentity-1.html @@ -50,10 +50,10 @@

        Constructors

        - + new(object, method) -
        +
        Signature: (object:obj * method:nativeint) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + BeginInvoke(v, callback, object) -
        +
        Signature: (v:'TVertex * callback:AsyncCallback * object:obj) -> IAsyncResult
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + EndInvoke(result) -
        +
        Signature: result:IAsyncResult -> string
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + Invoke(v) -
        +
        Signature: v:'TVertex -> string
        Modifiers: abstract
        diff --git a/reference/quickgraph-vertexindexer-1.html b/reference/quickgraph-vertexindexer-1.html index 0f9ed54ea..7b96b8c5a 100644 --- a/reference/quickgraph-vertexindexer-1.html +++ b/reference/quickgraph-vertexindexer-1.html @@ -50,10 +50,10 @@

        Constructors

        - + new(object, method) -
        +
        Signature: (object:obj * method:nativeint) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + BeginInvoke(v, callback, object) -
        +
        Signature: (v:'TVertex * callback:AsyncCallback * object:obj) -> IAsyncResult
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + EndInvoke(result) -
        +
        Signature: result:IAsyncResult -> int
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + Invoke(v) -
        +
        Signature: v:'TVertex -> int
        Modifiers: abstract
        diff --git a/reference/quickgraph-vertexpredicate-1.html b/reference/quickgraph-vertexpredicate-1.html index 2cd937d1c..82d253aa3 100644 --- a/reference/quickgraph-vertexpredicate-1.html +++ b/reference/quickgraph-vertexpredicate-1.html @@ -50,10 +50,10 @@

        Constructors

        - + new(object, method) -
        +
        Signature: (object:obj * method:nativeint) -> unit
        @@ -72,10 +72,10 @@

        Instance members

        - + BeginInvoke(v, callback, object) -
        +
        Signature: (v:'TVertex * callback:AsyncCallback * object:obj) -> IAsyncResult
        Modifiers: abstract
        @@ -87,10 +87,10 @@

        Instance members

        - + EndInvoke(result) -
        +
        Signature: result:IAsyncResult -> bool
        Modifiers: abstract
        @@ -102,10 +102,10 @@

        Instance members

        - + Invoke(v) -
        +
        Signature: v:'TVertex -> bool
        Modifiers: abstract
        diff --git a/release-notes.html b/release-notes.html index 0fc2d2913..45e3974db 100644 --- a/release-notes.html +++ b/release-notes.html @@ -32,13 +32,19 @@

        QuickGraph

        +

        3.7.4 August 27 2018

        +
          +
        • More algorithms (TransitiveClosure, YenShortestPaths, etc.)
          • +
        • Code cleanup
          • +
        • Minor fixes
          • +

        3.7.3 August 23 2016

        • Minor fix in packet dependences specification
        -

        3.7.2 August 17 2016

        +

        3.7.2 August 18 2016

          -
        • Update DotParser to latest version
          • +
        • Update DotParser to latest version (1.0.6)

        3.7.1 July 12 2016