Joined
Last Seen
-3 Reputation Points
- Strength to Increase Rep
- +0
- Strength to Decrease Rep
- -0
0% Quality Score
- Upvotes Received
- 0
- Posts with Upvotes
- 0
- Upvoting Members
- 0
- Downvotes Received
- 1
- Posts with Downvotes
- 1
- Downvoting Members
- 1
0 Endorsements
Ranked #107.41K
~102 People Reached
Favorite Forums
Computer Science
x
1
|
explanation of this algorithm [ICODE] function equivalence(m,n) //n variables,m equivalence relations //bit is a boolean array //seq is an array of pointers each one is pointing to the list of elements called equivalence elements for i = i to n do seq(i)<-bit(i)<-0; for k=1 to m do [read-next pair(i,j) getnode(x); … 
|