Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Allow users to define functions that shuffle vertex and edge sets #130

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
weilycoder wants to merge 8 commits into luogu-dev:master
base: master
Choose a base branch
Loading
from weilycoder:dev
Open
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
40 changes: 26 additions & 14 deletions cyaron/graph.py
View file Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -256,6 +256,12 @@ def __init__(self, point_count, directed=False):
self.directed = directed
self.edges = [[] for i in range(point_count + 1)]

def vertex_count(self):
"""vertex_count(self) -> int
Return the count of the vertexes in the graph.
"""
return len(self.edges) - 1

def edge_count(self):
"""edge_count(self) -> int
Return the count of the edges in the graph.
Expand All @@ -279,27 +285,33 @@ def to_str(self, **kwargs):
**kwargs(Keyword args):
bool shuffle = False -> whether shuffle the output or not
str output(Edge) = str -> the convert function which converts object Edge to str. the default way is to use str()
"""
list[int] node_shuffler(int)
= lambda n: random.sample(range(1, n + 1), k=n)
-> the random function which shuffles the vertex sequence.
list[Edge] edge_shuffler(list[Edge])
-> a random function. the default is to shuffle the edge sequence,
also, if the graph is undirected, it will swap `u` and `v` randomly.
"""
def _edge_shuffler_default(table):
edge_buf = random.sample(table, k=len(table))
for edge in edge_buf:
if not self.directed and random.randint(0, 1) == 0:
(edge.start, edge.end) = (edge.end, edge.start)
return edge_buf

shuffle = kwargs.get("shuffle", False)
output = kwargs.get("output", str)
buf = []
node_shuffler = kwargs.get("node_shuffler", lambda n: random.sample(range(1, n + 1), k=n))
edge_shuffler = kwargs.get("edge_shuffler", _edge_shuffler_default)
if shuffle:
new_node_id = [i for i in range(1, len(self.edges))]
random.shuffle(new_node_id)
new_node_id = [0] + new_node_id
new_node_id = [0] + node_shuffler(self.vertex_count())
edge_buf = []
for edge in self.iterate_edges():
edge_buf.append(
Edge(new_node_id[edge.start], new_node_id[edge.end],
edge.weight))
random.shuffle(edge_buf)
for edge in edge_buf:
if not self.directed and random.randint(0, 1) == 0:
(edge.start, edge.end) = (edge.end, edge.start)
buf.append(output(edge))
Edge(new_node_id[edge.start], new_node_id[edge.end], edge.weight))
buf = map(output, edge_shuffler(edge_buf))
else:
for edge in self.iterate_edges():
buf.append(output(edge))
buf = map(output, self.iterate_edges())
return "\n".join(buf)

def __str__(self):
Expand Down
73 changes: 60 additions & 13 deletions cyaron/tests/graph_test.py
View file Open in desktop
Original file line number Diff line number Diff line change
@@ -1,6 +1,7 @@
import itertools
import unittest
from cyaron import Graph
from random import randint
from random import randint, sample


class UnionFindSet:
Expand Down Expand Up @@ -198,18 +199,12 @@ def test_GraphMatrix(self):
merge2 = lambda val, edge: max(edge.weight, val)
merge3 = lambda val, edge: min(edge.weight, val)
merge4 = lambda val, edge: gcd(val, edge.weight)
merge5 = lambda val, edge: lcm(val, edge.weight
) if val else edge.weight
self.assertEqual(str(g.to_matrix(merge=merge1)),
"-1 -1 3\n-1 -1 3\n-1 1 1")
self.assertEqual(str(g.to_matrix(merge=merge2)),
"-1 -1 3\n-1 -1 7\n-1 1 1")
self.assertEqual(str(g.to_matrix(default=9, merge=merge3)),
"9 9 3\n9 9 3\n9 1 1")
self.assertEqual(str(g.to_matrix(default=0, merge=merge4)),
"0 0 3\n0 0 1\n0 1 1")
self.assertEqual(str(g.to_matrix(default=0, merge=merge5)),
"0 0 3\n0 0 84\n0 1 1")
merge5 = lambda val, edge: lcm(val, edge.weight) if val else edge.weight
self.assertEqual(str(g.to_matrix(merge=merge1)), "-1 -1 3\n-1 -1 3\n-1 1 1")
self.assertEqual(str(g.to_matrix(merge=merge2)), "-1 -1 3\n-1 -1 7\n-1 1 1")
self.assertEqual(str(g.to_matrix(default=9, merge=merge3)), "9 9 3\n9 9 3\n9 1 1")
self.assertEqual(str(g.to_matrix(default=0, merge=merge4)), "0 0 3\n0 0 1\n0 1 1")
self.assertEqual(str(g.to_matrix(default=0, merge=merge5)), "0 0 3\n0 0 84\n0 1 1")

def test_forest(self):
for i in range(10):
Expand Down Expand Up @@ -264,3 +259,55 @@ def get_deg_seq(g: Graph):

with self.assertRaises(ValueError):
Graph.from_degree_sequence(((2, 1), (0, 1)))

def test_shuffle(self):
def read_graph(n, data, directed = False):
g = Graph(n, directed)
for l in data.split('\n'):
u, v, w = map(int, l.split())
g.add_edge(u, v, weight=w)
return g

def isomorphic(graph1, graph2, mapping = None, directed = False):
n = graph1.vertex_count()
if n != graph2.vertex_count():
return False
if graph1.edge_count() != graph2.edge_count():
return False
if mapping is None:
for per in itertools.permutations(range(1, n + 1)):
if isomorphic(graph1, graph2, (0, ) + per):
return True
return False
edges = {}
for e in graph2.iterate_edges():
key, val = (e.start, e.end), e.weight
if key in edges:
edges[key].append(val)
else:
edges[key] = [val]
for e in graph1.iterate_edges():
key, val = (mapping[e.start], mapping[e.end]), e.weight
if not directed and key[0] > key[1]:
key = key[1], key[0]
if key not in edges:
return False
if val not in edges[key]:
return False
edges[key].remove(val)
return True

def unit_test(n, m, shuffle_kwargs = {}, check_kwargs = {}):
g = Graph.graph(n, m)
data = g.to_str(**shuffle_kwargs)
h = read_graph(n, data)
self.assertTrue(isomorphic(g, h, **check_kwargs))

unit_test(8, 20)
unit_test(8, 20, {"shuffle": True})
mapping = [0] + sample(range(1, 8), k = 7)
shuffer = lambda n: list(map(lambda i: mapping[i], range(1, n + 1)))
unit_test(7, 10, {"shuffle": True, "node_shuffler": shuffer})
unit_test(7, 14, {"shuffle": True, "node_shuffler": shuffer}, {"mapping": mapping})
shuffer_without_swap = lambda table: sample(table, k=len(table))
unit_test(7, 12, {"shuffle": True, "edge_shuffler": shuffer_without_swap}, {"directed": True})
Loading

AltStyle によって変換されたページ (->オリジナル) /