Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
A
abc
Overview
Overview
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
lvzhengyang
abc
Commits
c6999c3c
Commit
c6999c3c
authored
Apr 23, 2014
by
Alan Mishchenko
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Experiments with permutations.
parent
d948ef80
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
16 additions
and
5 deletions
+16
-5
src/misc/extra/extraUtilPerm.c
+16
-5
No files found.
src/misc/extra/extraUtilPerm.c
View file @
c6999c3c
...
@@ -590,7 +590,7 @@ int Abc_ZddPerm( Abc_ZddMan * p, int a, int Var )
...
@@ -590,7 +590,7 @@ int Abc_ZddPerm( Abc_ZddMan * p, int a, int Var )
int
Abc_ZddPermProduct
(
Abc_ZddMan
*
p
,
int
a
,
int
b
)
int
Abc_ZddPermProduct
(
Abc_ZddMan
*
p
,
int
a
,
int
b
)
{
{
Abc_ZddObj
*
B
;
Abc_ZddObj
*
A
,
*
B
;
int
r0
,
r1
,
r
;
int
r0
,
r1
,
r
;
if
(
a
==
0
)
return
0
;
if
(
a
==
0
)
return
0
;
if
(
a
==
1
)
return
b
;
if
(
a
==
1
)
return
b
;
...
@@ -598,10 +598,16 @@ int Abc_ZddPermProduct( Abc_ZddMan * p, int a, int b )
...
@@ -598,10 +598,16 @@ int Abc_ZddPermProduct( Abc_ZddMan * p, int a, int b )
if
(
b
==
1
)
return
a
;
if
(
b
==
1
)
return
a
;
if
(
(
r
=
Abc_ZddCacheLookup
(
p
,
a
,
b
,
ABC_ZDD_OPER_PERM_PROD
))
>=
0
)
if
(
(
r
=
Abc_ZddCacheLookup
(
p
,
a
,
b
,
ABC_ZDD_OPER_PERM_PROD
))
>=
0
)
return
r
;
return
r
;
A
=
Abc_ZddNode
(
p
,
a
);
B
=
Abc_ZddNode
(
p
,
b
);
B
=
Abc_ZddNode
(
p
,
b
);
r0
=
Abc_ZddPermProduct
(
p
,
a
,
B
->
False
);
if
(
p
->
pV2TJ
[
A
->
Var
]
<
p
->
pV2TI
[
B
->
Var
]
)
// Aj < Bi
r1
=
Abc_ZddPermProduct
(
p
,
a
,
B
->
True
);
r0
=
Abc_ZddPermProduct
(
p
,
A
->
False
,
b
),
r1
=
Abc_ZddPerm
(
p
,
r1
,
B
->
Var
);
r1
=
Abc_ZddPermProduct
(
p
,
A
->
True
,
b
),
r
=
Abc_ZddUniqueCreate
(
p
,
A
->
Var
,
r1
,
r0
);
else
r0
=
Abc_ZddPermProduct
(
p
,
a
,
B
->
False
),
r1
=
Abc_ZddPermProduct
(
p
,
a
,
B
->
True
),
r1
=
Abc_ZddPerm
(
p
,
r1
,
B
->
Var
),
r
=
Abc_ZddUnion
(
p
,
r0
,
r1
);
r
=
Abc_ZddUnion
(
p
,
r0
,
r1
);
return
Abc_ZddCacheInsert
(
p
,
a
,
b
,
ABC_ZDD_OPER_PERM_PROD
,
r
);
return
Abc_ZddCacheInsert
(
p
,
a
,
b
,
ABC_ZDD_OPER_PERM_PROD
,
r
);
}
}
...
@@ -849,12 +855,17 @@ void Abc_EnumerateCubeStatesZdd()
...
@@ -849,12 +855,17 @@ void Abc_EnumerateCubeStatesZdd()
{
{
3
,
5
},
{
3
,
17
},
{
3
,
15
},
{
1
,
6
},
{
1
,
16
},
{
1
,
14
},
{
2
,
4
},
{
2
,
18
},
{
2
,
13
}
},
{
{
3
,
5
},
{
3
,
17
},
{
3
,
15
},
{
1
,
6
},
{
1
,
16
},
{
1
,
14
},
{
2
,
4
},
{
2
,
18
},
{
2
,
13
}
},
{
{
2
,
14
},
{
2
,
24
},
{
2
,
12
},
{
3
,
13
},
{
3
,
23
},
{
3
,
10
},
{
1
,
15
},
{
1
,
22
},
{
1
,
11
}
},
{
{
2
,
14
},
{
2
,
24
},
{
2
,
12
},
{
3
,
13
},
{
3
,
23
},
{
3
,
10
},
{
1
,
15
},
{
1
,
22
},
{
1
,
11
}
},
{
{
1
,
10
},
{
1
,
7
},
{
1
,
4
},
{
3
,
12
},
{
3
,
9
},
{
3
,
6
},
{
2
,
11
},
{
2
,
8
},
{
2
,
5
}
}
};
{
{
1
,
10
},
{
1
,
7
},
{
1
,
4
},
{
3
,
12
},
{
3
,
9
},
{
3
,
6
},
{
2
,
11
},
{
2
,
8
},
{
2
,
5
}
}
};
#ifdef WIN32
int
LogObj
=
24
;
#else
int
LogObj
=
27
;
#endif
Abc_ZddMan
*
p
;
Abc_ZddMan
*
p
;
int
i
,
k
,
pComb
[
9
],
pPerm
[
24
],
nSize
;
int
i
,
k
,
pComb
[
9
],
pPerm
[
24
],
nSize
;
int
ZddTurn1
,
ZddTurn2
,
ZddTurn3
,
ZddTurns
,
ZddAll
;
int
ZddTurn1
,
ZddTurn2
,
ZddTurn3
,
ZddTurns
,
ZddAll
;
abctime
clk
=
Abc_Clock
();
abctime
clk
=
Abc_Clock
();
printf
(
"Enumerating states of 2x2x2 cube.
\n
"
);
printf
(
"Enumerating states of 2x2x2 cube.
\n
"
);
p
=
Abc_ZddManAlloc
(
24
*
23
/
2
,
1
<<
27
);
// finished with 2^27 (4 GB)
p
=
Abc_ZddManAlloc
(
24
*
23
/
2
,
1
<<
LogObj
);
// finished with 2^27 (4 GB)
Abc_ZddManCreatePerms
(
p
,
24
);
Abc_ZddManCreatePerms
(
p
,
24
);
// init state
// init state
printf
(
"Iter %2d -> %8d Nodes = %7d Used = %10d "
,
0
,
1
,
0
,
2
);
printf
(
"Iter %2d -> %8d Nodes = %7d Used = %10d "
,
0
,
1
,
0
,
2
);
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment