Merge pull request #16 from AceSrc/master

visual & merger

Author: lin-toto

cyaron/__init__.py

@@ -15,4 +15,6 @@
 from .polygon import Polygon
 from .compare import Compare
 from .math import *
+from .merger import Merger
+from .visual import visualize
 from random import randint, randrange, uniform, choice, random

cyaron/merger.py

@@ -0,0 +1,62 @@
+from .graph import *
+
+class Merger:
+    def __init__(self, *graphs, **kwargs):
+        """__init__(self, *graphs, **kwargs) -> None
+            put several graphs into one
+            list graphs -> the graphs that will be merged
+            list kwargs:
+                None
+        """
+        self.graphs = graphs
+        self.G = Graph(sum([len(i.edges) - 1 for i in graphs]), graphs[0].directed)
+    
+        counter = 0 
+        for graph in self.graphs:
+            graph.offset = counter
+            for edge in graph.iterate_edges():
+                self.G.add_edge(edge.start + counter, 
+                                edge.end + counter, 
+                                weight=edge.weight)
+            counter += len(graph.edges) - 1
+
+    def __add_edge(self, u, v, **kwargs):
+        """__add_edge(self, u, v, **kwargs)
+            tuple u -> (graph_index, vertex) indicating the start point
+            tuple v -> (graph_index, vertex) indicating the end point
+            **kwargs:
+                int weight -> edge weight
+        """
+        self.G.add_edge(self.graphs[ u[0] ].offset + u[1],
+                        self.graphs[ v[0] ].offset + v[1], 
+                        weight=kwargs.get("weight", 1)) 
+    
+    def add_edge(self, u, v, **kwargs):
+        """add_edge(self, u, v, **kwargs) -> None
+        """
+        self.__add_edge(u, v, **kwargs)
+
+    def to_str(self, **kwargs):
+        return self.G.to_str(**kwargs)
+    
+    def __str__(self):
+        return self.to_str()
+
+    @staticmethod
+    def component(point_count, edge_count, **kwargs):
+        """component(point_count, edge_count, **kwargs)
+            generate a graph with certain components
+            int point_count -> the number of vertices of each component
+            int edge_count -> the number of edges of each component
+            **kwargs:
+                int component_count -> indicating how many components there are
+        """
+        component_count = kwargs.get("component_count", (2, 2))
+        if not list_like(component_count):
+            component_count = (component_count, component_count)
+        real_count = random.randint(*component_count)
+        graphs = [None] * real_count
+        for i in xrange(real_count):
+            graphs[i] = Graph.graph(point_count, edge_count, **kwargs)
+        G = Merger(*graphs)
+        return G.G

cyaron/visual.py

@@ -0,0 +1,26 @@
+from .graph import * 
+from .merger import Merger
+import pygraphviz as pgv
+
+def visualize(graph, output_path="a.png"):
+    """visualize(graph, **kwargs) -> None
+        Graph/Merger graph -> the graph/Merger that will be visualized
+        string output_path-> the output path of the image
+    """
+
+    if isinstance(graph, Merger): graph = Merger.G
+    G = pgv.AGraph(directed=graph.directed)
+
+    G.add_nodes_from([i for i in xrange(1, len(graph.edges))])
+    for edge in graph.iterate_edges():
+        G.add_edge(edge.start, edge.end, label=edge.weight)
+        
+    G.node_attr['shape'] = 'egg'
+    G.node_attr['width'] = '0.25'
+    G.node_attr['height'] = '0.25'
+    G.edge_attr['arrowhead'] = 'open'
+
+    G.layout(prog='dot')
+    G.draw(output_path)
+    
+