[Lemon-user] number of STATE_TREE vars at end of network simplex

[Matthew Galati]

Ok. I have to think about how that would translate to an LP basis -
which expects the number of basics to be the number of rows. Or, maybe
I should just decompose the graph and solve each separately - which
would be more efficient anyway - and can be multi-threaded.

Thanks,
Matt

On 3/3/10, Alpar Juttner <alpar at cs.elte.hu> wrote:
>
>
> "Matthew Galati" <magh at lehigh.edu> wrote:
>
>>I checked and the graph is, in fact, disconnected. It has 4 connected
>>components. Does this somehow explain the fact that the number of basics is
>>less than the number of rows?
>
> Yes, it does.  The number of edges in a spanning  forest (thus the size of
> the basis) is equal to the number of nodes minus the number of connected
> components, i.e. 256-4=252 in your case.
>
> Regards,
> Alpar
> Sent from my Android phone with K-9. Please excuse my brevity.

-- 
Sent from my mobile device