void shuffleConnections

( int nRecurrent,
  vector<int> &target,
  vector<int> &steal )

For recurrent connections: After lists (vectors) of candidate connections have been created, they are shuffled so that they can be pulled iteratively from the list, while maintaining randomness.

Documentation

For recurrent connections: After lists (vectors) of candidate connections have been created, they are shuffled so that they can be pulled iteratively from the list, while maintaining randomness. This version is two unique cell groups becoming recurrent with each other, so one list is for potatial connections to form, while the other list is poential connections to steal

Parameters:
- nRecurrent The number of remaining recurrent connections that must be made
target - Collection of potential connections to create
steal - Collection of potential connections to steal

Alphabetic index HTML hierarchy of classes or Java



This page was generated with the help of DOC++.