No self-introduction
Loading
Profile
Follow
codes (2)
walksat find a satisfying model of a cnf formula
no vote
Walksat specifications
Walksat attempts to find a satisfying model of a cnf formula.
Format is .cnf format:
c Optional comments at start of file.
c The "p" line specifies cnf format, number vars, number clauses
c Variables are numbered starting at 1
c Each clause ends with 0
p cnf 3 2
1 -3 0
2 3 -1 0
Walksat reads from standard in (or from a file specified as a command
line argument) and writes to standard out (and standard error). To
get a list of command line options, type
walksat -help
(or any other illegal option).
hamido22 1 0
1
Minimum spanning tree in pascal
no vote
This code resolves the problem of finding a minimum spanning tree in a graph.
The file 'edges ' describes an undirected graph with integer edge costs. It has the format
[number_of_nodes] [number_of_edges]
[one_node_of_edge_1] [other_node_of_edge_1] [edge_1_cost]
hamido22 1 0
1
No more~
Follows0
Fans0