Pyphi: 0.4.0

Will Mayner &
Optimizations: compute.big_mip is faster for reducible networks when executed in parallel; it returns immediately upon finding a reducible cut, rather than evaluating all cuts. NOTE: This introduces a race condition in cases where there is more than one reducible cut; there is no guarantee as to which cut will be found first and returned. compute.complexes prunes out subsystems that contain nodes without either inputs or outputs (any subsystem containing such a node must necessarily have...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.