joris
/
maximum-weight-matching
1
0
Fork 0
Code Pull Requests Activity

Add missing import statements

This commit is contained in:
Joris van Rantwijk 2023-03-11 22:00:38 +01:00
parent ba28bbf7ca
commit dd24776149
2 changed files with 4 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

3
tests/generate/hardcard.py
View File

@ -25,10 +25,12 @@ The graph is constructed so that vertices 1 - 4*K form a complete subgraph.
For 1 <= I <= 2*K, vertex (2*I-1) is joined to vertex (4*K+I). For 1 <= I <= 2*K, vertex (2*I-1) is joined to vertex (4*K+I).
""" """
import sys
import argparse import argparse
def main(): def main():
"""Main program."""
parser = argparse.ArgumentParser() parser = argparse.ArgumentParser()
parser.description = "Generate a difficult graph" parser.description = "Generate a difficult graph"
@ -59,4 +61,3 @@ def main():
if __name__ == "__main__": if __name__ == "__main__":
main() main()

2
tests/generate/triangles.py
View File

@ -41,10 +41,12 @@ Number of vertices: N = 3*K
Number of edges: M = 3*K + C*(K-1) Number of edges: M = 3*K + C*(K-1)
""" """
import sys
import argparse import argparse
def main(): def main():
"""Main program."""
parser = argparse.ArgumentParser() parser = argparse.ArgumentParser()
parser.description = ( parser.description = (