repo stringlengths 2 99 | file stringlengths 13 225 | code stringlengths 0 18.3M | file_length int64 0 18.3M | avg_line_length float64 0 1.36M | max_line_length int64 0 4.26M | extension_type stringclasses 1
value |
|---|---|---|---|---|---|---|
houghnet | houghnet-master/src/lib/utils/ddd_utils.py | from __future__ import absolute_import
from __future__ import division
from __future__ import print_function
import numpy as np
import cv2
def compute_box_3d(dim, location, rotation_y):
# dim: 3
# location: 3
# rotation_y: 1
# return: 8 x 3
c, s = np.cos(rotation_y), np.sin(rotation_y)
R = np.array([[c, 0... | 4,548 | 33.725191 | 92 | py |
mlgd | mlgd-master/layout_quality_measurement/neigh_pres_test.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import sys
import os
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import math
import neighbors_preservation as np
s_path = sys.argv[1]
g_path = sys.argv[2]
outputTxtFile... | 1,265 | 20.827586 | 95 | py |
mlgd | mlgd-master/layout_quality_measurement/crossings.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
# import math
import networkx as nx
label_factor_magnifier = 72
# Given three colinear points p, q, r, the function checks if
# point q lies on line segment 'pr'
def onSegment(px, py, qx, qy, rx, ry):
if (qx <= max(px, rx) and qx >= min(px, rx) and qy <= m... | 14,737 | 32.495455 | 130 | py |
mlgd | mlgd-master/layout_quality_measurement/stress_test.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import sys
import os
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import math
import stress as st
s_path = sys.argv[1]
g_path = sys.argv[2]
outputTxtFile = sys.argv[3]
... | 1,252 | 20.603448 | 107 | py |
mlgd | mlgd-master/layout_quality_measurement/labelsmeas.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import networkx as nx
import math
import decimal
global_labels_scaling_factor = 1
def boundingBox(G):
all_pos = nx.get_node_attributes(G, "pos").values()
coo_x = sorted([float(p.split(",")[0]) for p in all_pos])
coo_y = sorted([float(p.split(",... | 4,268 | 26.191083 | 106 | py |
mlgd | mlgd-master/layout_quality_measurement/crossings_old.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import math
import networkx as nx
# Given three colinear points p, q, r, the function checks if
# point q lies on line segment 'pr'
def onSegment(px, py, qx, qy, rx, ry):
if (qx <= max(px, rx) and qx >= min(px, rx) and qy <= max(py, ry) and qy >= min(py, ry)):
... | 7,239 | 29.420168 | 207 | py |
mlgd | mlgd-master/layout_quality_measurement/neighbors_preservation.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import pygraphviz as pgv
import networkx as nx
import math
# import numpy as np
# from numpy import random
# from scipy.spatial import distance
# import time
#
# def euclidean_closest_nodes(node, nodes, k_i):
# '''
# Computes the distance matrix between... | 3,765 | 24.972414 | 109 | py |
mlgd | mlgd-master/layout_quality_measurement/upwardflow.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import sys
import os
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import math
import numpy as np # to compute inner product
def compute_edges_vects(G):
'''
Comp... | 2,556 | 26.494624 | 275 | py |
mlgd | mlgd-master/layout_quality_measurement/stress.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import networkx as nx
import math
def euclidean_distance(source, target):
x_source1 = float(source['pos'].split(",")[0])
x_target1 = float(target['pos'].split(",")[0])
y_source1 = float(source['pos'].split(",")[1])
y_target1 = float(target['p... | 4,194 | 26.24026 | 85 | py |
mlgd | mlgd-master/layout_quality_measurement/other_measures.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import pygraphviz as pgv
import networkx as nx
import math
def vertex_degree(G):
degree = sorted(dict(nx.degree(G)).values())[-1]
return degree
def boundingBox(G):
all_pos = nx.get_node_attributes(G, "pos").values()
coo_x = sorted([float(... | 774 | 15.145833 | 61 | py |
mlgd | mlgd-master/layout_quality_measurement/highwayness.py | import sys
import networkx as nx
import pygraphviz as pgv
import math
from networkx.readwrite import json_graph
from networkx.readwrite.graphml import read_graphml
if len(sys.argv)<2:
print ("Enter dot file with positions ")
quit()
filepath=sys.argv[1]
x=filepath.split(".")
inputtype=x[len(x)-1]
print ("filetype:",... | 1,855 | 22.493671 | 96 | py |
mlgd | mlgd-master/layout_quality_measurement/uniformity_edge_length.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
##
# EU corresponds to the normalized standard deviation of the edge length.
##
import networkx as nx
import math
def avg_edge_length(G):
'''
Computes the average edge length of the given graph layout <tt>G</tt>
'''
sum_edge_length = 0.0
... | 1,764 | 21.341772 | 99 | py |
mlgd | mlgd-master/layout_quality_measurement/metricscomputer.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import sys
import os
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import math
import stress
import neighbors_preservation as neigpres
import crossings
import uniformity_e... | 4,608 | 26.434524 | 96 | py |
mlgd | mlgd-master/layout_quality_measurement/graphconverter/dot2txt.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import networkx as nx
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import vertexmanager
def dot_to_txt(input_file, output_file):
G = nx_read_dot(input_file)
print(nx.info(G))
f = open(output_file, 'w')
f.write(str(len(G.nodes(... | 848 | 22.583333 | 79 | py |
mlgd | mlgd-master/layout_quality_measurement/graphconverter/gml2dot.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import sys
import os
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
def set_graph_properties(G):
''' Extracts the attributes of the vertices and... | 1,408 | 25.092593 | 71 | py |
mlgd | mlgd-master/layout_quality_measurement/betametrics/smoothness.py | #zigzagness
import networkx as nx
import math
import numpy as np
def extract_leaves(G):
"""Extracts from <tt>G</tt> the vertices with degree 1, i.e. the leaves."""
leaves=[]
for n in nx.nodes(G):
if len(list(G.neighbors(n)))<=1:
leaves.append(n)
return leaves
def compute_eucli... | 2,471 | 24.484536 | 102 | py |
mlgd | mlgd-master/layout_quality_measurement/betametrics/vertexangularresolution.py | import sys
import os
import pygraphviz as pgv
import networkx as nx
import math
import random
def getCoordinate(vertex):
x = float(vertex['pos'].split(",")[0])
y = float(vertex['pos'].split(",")[1])
return x, y
def setCoordinate(vertex, x, y):
vertex['pos'] = str(x)+","+str(y)
return x, y
def ... | 3,364 | 24.11194 | 87 | py |
mlgd | mlgd-master/layout_quality_measurement/betametrics/continuity.py | #continuity property
#Evaluates the quality of an highway
import networkx as nx
import math
import re
def continuity(G):
avg_sp = nx.average_shortest_path_length(G)
total_sp = len(nx.nodes(G))*(len(nx.nodes(G))-1)
long_sp = total_sp
global_max_jumps = 0
global_min_jumps = float('inf')
zero_ju... | 3,330 | 30.130841 | 111 | py |
mlgd | mlgd-master/layout_quality_measurement/betametrics/speed_on_network.py | import networkx as nx
import math
import re
alpha = 0.5 #Speed on Highway
beta = 1 #Speed on non Highway
def highwayness(GD):
# Set the speed attribute on each edge based on the edge type
add_speed_attribute(GD)
# computes the average edge length and average shortest path length
edge_lengths = sorted([float(... | 3,128 | 21.191489 | 89 | py |
mlgd | mlgd-master/layout_quality_measurement/betametrics/drawing_highwayness.py | import networkx as nx
import math
import re
def boundingBox(G, vertices=[]):
all_pos = nx.get_node_attributes(G, "pos")
if(len(vertices)>1):
all_pos = dict((k, all_pos[k]) for k in vertices if k in all_pos)
all_pos = all_pos.values()
coo_x = sorted([float(p.split(",")[0]) for p in all_pos]... | 1,121 | 22.87234 | 109 | py |
mlgd | mlgd-master/layout_quality_measurement/betametrics/zigzagness.py | #zigzagness
import networkx as nx
import math
import numpy as np
def angleBetweenTwoPointsWithFixedPoint(point1X, point1Y, point2X, point2Y, fixedX, fixedY):
"""Computes the angle between two lines defined by three points."""
angle1 = math.atan2(point1Y - fixedY, point1X - fixedX)
angle2 = math.atan2(poi... | 5,545 | 21.917355 | 134 | py |
mlgd | mlgd-master/ml_tree_extractor/fix_node_att_add_font_box.py | import sys
import networkx as nx
import pygraphviz as pgv
from networkx.readwrite import json_graph
import tkinter
from tqdm import tqdm
from tkinter import *
fontsize=[30,25,20,15,12,10,9,8]
fontname='Arial'
def getBoxSize(txt,l):
Window = Tk()
Window.geometry("500x500+80+80")
frame = Frame(Window) # this ... | 2,965 | 28.366337 | 139 | py |
mlgd | mlgd-master/ml_tree_extractor/mltree_generator_weighted.py | import sys
import networkx as nx
import pygraphviz as pgv
import math
from networkx.readwrite import json_graph
from networkx.drawing.nx_agraph import write_dot
#EU-core nodecountinlevels=[0.10,0.25,0.30,0.40,0.70,0.80,0.95,1.0]
nodecountinlevels=[0.005,0.05,0.10,0.20,0.30,0.50,0.85,1.0]
filepath=sys.argv[1]
output_dir... | 2,892 | 25.3 | 101 | py |
mlgd | mlgd-master/ml_tree_extractor/degree_reducer.py | #idea of degree reduce comes from Faryad Darabi Sahneh
#written by Iqbal Hossain
import networkx as nx
import pygraphviz as pgv
import argparse
from networkx.drawing.nx_agraph import write_dot
def graph_reducer(G, cuttoff=50):
"""Reduce degree by using ZTest with cuttoff 50
Parameters
----------
G ... | 1,716 | 29.660714 | 70 | py |
mlgd | mlgd-master/ml_tree_extractor/old_files/json_write.py | from networkx.drawing.nx_agraph import write_dot
import networkx as nx
import pygraphviz as pgv
dotpath='/Users/iqbal/MLGD/mlgd/datasets/topics/set2/input/Topics_Layer_8.dot'
G=nx.Graph(pgv.AGraph(dotpath))
weightededgedot= open('Layer8.js', 'w') # as csv_file:
e = "\"source\":\"{}\", \"target\":\"{}\", \"weight\":{... | 1,091 | 36.655172 | 185 | py |
mlgd | mlgd-master/ml_tree_extractor/old_files/MLST_cost.py | import sys, os
import networkx as nx
import pygraphviz as pgv
import numpy as np
import matplotlib.pyplot as plt
def edges_sum(T):
"""
takes a tree and find cost of edges
:param T: tree
:return cost: sum of cost of edges
"""
s=0
for x in T.edges():
s=s+1/(float(T[x[0]][x[1]]['weight... | 1,834 | 27.230769 | 103 | py |
mlgd | mlgd-master/ml_tree_extractor/old_files/mltree_generator_non_weighted.py |
import sys
import networkx as nx
import pygraphviz as pgv
import math
from networkx.readwrite import json_graph
from networkx.drawing.nx_agraph import write_dot
#EU-core nodecountinlevels=[0.10,0.25,0.30,0.40,0.70,0.80,0.95,1.0]
nodecountinlevels=[0.10,0.25,0.30,0.40,0.70,0.80,0.95,1.0]
def getnodes(s,n):
selecte... | 1,671 | 24.723077 | 95 | py |
mlgd | mlgd-master/ml_tree_extractor/old_files/text_to_id_converter_single_graph.py | import sys
import networkx as nx
import pygraphviz as pgv
from networkx.readwrite import json_graph
from networkx.drawing.nx_agraph import write_dot
G_file_name="/Users/iqbal/MLGD/mlgd/datasets/topics/orginal/Topics_Graph.dot"
G_out="/Users/iqbal/MLGD/mlgd/datasets/topics/orginal/Topics_Graph_Connected.dot"
G=nx.Gra... | 1,228 | 25.148936 | 135 | py |
mlgd | mlgd-master/ml_tree_extractor/old_files/MLST_cost_inverse_weight.py | import sys, os
import networkx as nx
import pygraphviz as pgv
import matplotlib.pyplot as plt
import numpy as np
def edges_sum(T,G):
"""
takes a tree and find cost of edges
:param T: tree
:return cost: sum of cost of edges
"""
s=0
for x in T.edges():
s=s+1/float( G[x[0]][x[1]]['weig... | 2,035 | 26.890411 | 113 | py |
mlgd | mlgd-master/layout_generator/raw_data/modules/backbonnessimprovement/vertexmanager.py | import networkx as nx
def getCoordinate(vertex):
x = float(vertex['pos'].split(",")[0])
y = float(vertex['pos'].split(",")[1])
return x, y
def setCoordinate(vertex, x, y):
vertex['pos'] = str(x)+","+str(y)
return x, y
def shiftVertex(vertex, dx, dy):
x, y = getCoordinate(vertex)
... | 388 | 13.961538 | 42 | py |
mlgd | mlgd-master/layout_generator/raw_data/modules/backbonnessimprovement/path_straighter.py | import sys
import os
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import math
import random
import treestraightner
# Main Flow
graphpath = sys.argv[1]
outputpath = sys.argv[2]
# Main Graph
input_graph... | 576 | 16.484848 | 62 | py |
mlgd | mlgd-master/layout_generator/raw_data/modules/backbonnessimprovement/treestraightner.py | import sys
import os
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import math
import random
import vertexmanager
def translateGraph(G, translation_dx, translation_dy):
for currVertex in nx.nodes(G):... | 2,031 | 23.780488 | 88 | py |
mlgd | mlgd-master/layout_generator/raw_data/modules/label_positioning/label_positioning.py | 0 | 0 | 0 | py | |
mlgd | mlgd-master/layout_generator/raw_data/modules/uniform_leaves_edges/uniform_leaves_edges.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import sys
import os
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import math
import random
def getCoordinate(vertex):
"""Returns the coordin... | 3,353 | 23.481752 | 84 | py |
mlgd | mlgd-master/layout_generator/raw_data/modules/uniform_leaves_edges/uniform_leaves_edges_main.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import sys
import os
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import math
import random
import uniform_leaves_edges as uniformer
tree_path = ... | 551 | 16.25 | 62 | py |
mlgd | mlgd-master/layout_generator/raw_data/modules/planar_augmentation/crossings.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import math
import networkx as nx
# Given three colinear points p, q, r, the function checks if
# point q lies on line segment 'pr'
def onSegment(px, py, qx, qy, rx, ry):
if (qx <= max(px, rx) and qx >= min(px, rx) and qy <= max(py, ry) and qy >= min(py, ry)):... | 8,115 | 30.215385 | 207 | py |
mlgd | mlgd-master/layout_generator/raw_data/modules/planar_augmentation/planar_augmentation.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import sys
import os
import math
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import crossings
# Main Flow
subgraph_path = sys.argv[1]
graph_p... | 2,169 | 20.27451 | 100 | py |
mlgd | mlgd-master/layout_generator/raw_data/modules/planar_augmentation/planartriangulationheuristic.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import sys
import os
import math
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import edge_crossing
# Main Flow
graph_path = sys.argv[1]
output_path = sys.argv[2]
G = n... | 924 | 15.517857 | 69 | py |
mlgd | mlgd-master/layout_generator/raw_data/modules/planar_augmentation/subgraph_extractor.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import sys
import os
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
# Main Flow
graph_path = sys.argv[1]
subgraph_path = sys.argv[2]
outputpath = sy... | 913 | 20.255814 | 62 | py |
mlgd | mlgd-master/layout_generator/raw_data/modules/planar_augmentation/edge_crossing.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
# import math
import networkx as nx
# Given three colinear points p, q, r, the function checks if
# point q lies on line segment 'pr'
def onSegment(px, py, qx, qy, rx, ry):
if (qx <= max(px, rx) and qx >= min(px, rx) and qy <= max(py, ry) and qy >= min(py, ry)... | 8,633 | 28.267797 | 207 | py |
mlgd | mlgd-master/layout_generator/raw_data/modules/mltreedrawer/ml_tree_drawer.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import sys
import os
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import math
import random
desired_edge_length = 100;
def extract_leaves(G):
... | 5,115 | 26.505376 | 106 | py |
mlgd | mlgd-master/layout_generator/raw_data/modules/labelsoverlapremoval/box.py | 0 | 0 | 0 | py | |
mlgd | mlgd-master/layout_generator/raw_data/modules/labelsoverlapremoval/leavesoverlapremoval.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import sys
import os
import math
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import edge_crossing as crossings
import boxoverlap
def remove_lea... | 8,335 | 27.744828 | 187 | py |
mlgd | mlgd-master/layout_generator/raw_data/modules/labelsoverlapremoval/boxoverlap.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import math
def do_overlap(x1, y1, w1, h1, x2, y2, w2, h2):
x_min_1=x1-(w1/2)
y_min_1=y1-(h1/2)
x_max_1=x1+(w1/2)
y_max_1=y1+(h1/2)
x_min_2=x2-(w2/2)
y_min_2=y2-(h2/2)
x_max_2=x2+(w2/2)
y_max_2=y2+(h2/2)
if(x_max_1 <= x_m... | 1,043 | 19.470588 | 66 | py |
mlgd | mlgd-master/layout_generator/raw_data/modules/labelsoverlapremoval/overlapremovalmain.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import sys
import os
import math
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import leavesoverlapremoval
# Main Flow
graph_path = sys.argv[1]
ou... | 459 | 16.692308 | 62 | py |
mlgd | mlgd-master/layout_generator/raw_data/modules/labelsoverlapremoval/labelsoverlapremoval.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import sys
import os
import math
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import boxoverlap
def scale(G, scaling_factor):
all_pos = nx.g... | 3,212 | 27.184211 | 148 | py |
mlgd | mlgd-master/layout_generator/raw_data/modules/labelsoverlapremoval/edge_crossing.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
# import math
import networkx as nx
# Given three colinear points p, q, r, the function checks if
# point q lies on line segment 'pr'
def onSegment(px, py, qx, qy, rx, ry):
if (qx <= max(px, rx) and qx >= min(px, rx) and qy <= max(py, ry) and qy >= min(py, ry)... | 8,633 | 28.267797 | 207 | py |
mlgd | mlgd-master/layout_generator/raw_data/modules/sublevel_extractor/sublevel_extractor.py | import sys
import os
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import math
import random
def save_graph(G, outputpath):
G = nx.Graph(G)
write_dot(G, outputpath)
def extract_level(G, level):
... | 948 | 22.725 | 84 | py |
mlgd | mlgd-master/layout_generator/raw_data/modules/utils/vertexmanager.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import networkx as nx
def getCoordinate(vertex):
x = float(vertex['pos'].split(",")[0])
y = float(vertex['pos'].split(",")[1])
return x, y
def setCoordinate(vertex, x, y):
vertex['pos'] = str(x)+","+str(y)
return x, y
def shiftVerte... | 446 | 13.9 | 42 | py |
mlgd | mlgd-master/layout_generator/raw_data/modules/drawing_improvement/impred.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import sys
import os
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import math
import random
import vertexmanager
def get_bounding_box(G):
xm... | 2,408 | 22.851485 | 88 | py |
mlgd | mlgd-master/layout_generator/raw_data/modules/drawing_improvement/vertexmanager.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import networkx as nx
def getCoordinate(vertex):
x = float(vertex['pos'].split(",")[0])
y = float(vertex['pos'].split(",")[1])
return x, y
def setCoordinate(vertex, x, y):
vertex['pos'] = str(x)+","+str(y)
return x, y
def shiftVerte... | 446 | 13.9 | 42 | py |
mlgd | mlgd-master/layout_generator/raw_data/modules/add_forest/tree_crossings_remover.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
# This script removes the crossings from the given tree
# it searches for a crossing, splits the graph in 3 components removing
# the crossing edges and then scales the smaller component till there is no more
# crossing.
import sys
import os
import pygraphviz... | 3,499 | 27.92562 | 122 | py |
mlgd | mlgd-master/layout_generator/raw_data/modules/add_forest/addsubcomponentmodule_slow.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import sys
import os
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import monotone_drawing
import math
import random
import edge_crossing as crossi... | 8,154 | 26.550676 | 107 | py |
mlgd | mlgd-master/layout_generator/raw_data/modules/add_forest/propertyfetcher.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import sys
import os
import math
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
# Main Flow
graph_path = sys.argv[1]
tree_path = sys.argv[2]
output... | 1,359 | 25.666667 | 62 | py |
mlgd | mlgd-master/layout_generator/raw_data/modules/add_forest/addsubcomponentmodule.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import sys
import os
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import monotone_drawing
import math
import random
import edge_crossing as crossi... | 8,755 | 26.708861 | 107 | py |
mlgd | mlgd-master/layout_generator/raw_data/modules/add_forest/monotone_drawing.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import networkx as nx
import math
import vertexmanager
def monotone_draw(G, root, edge_length):
""" take tree
assign unique slope
use tan-1 for slopes
if path, may consider same slop
run DFS
"""
i = 1
vertexmanager.setCoordinate(G.node[root],... | 622 | 16.305556 | 76 | py |
mlgd | mlgd-master/layout_generator/raw_data/modules/add_forest/vertexmanager.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import networkx as nx
def getCoordinate(vertex):
x = float(vertex['pos'].split(",")[0])
y = float(vertex['pos'].split(",")[1])
return x, y
def setCoordinate(vertex, x, y):
vertex['pos'] = str(x)+","+str(y)
return x, y
def shiftVerte... | 446 | 13.9 | 42 | py |
mlgd | mlgd-master/layout_generator/raw_data/modules/add_forest/edge_crossing.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
# import math
import networkx as nx
# Given three colinear points p, q, r, the function checks if
# point q lies on line segment 'pr'
def onSegment(px, py, qx, qy, rx, ry):
if (qx <= max(px, rx) and qx >= min(px, rx) and qy <= max(py, ry) and qy >= min(py, ry)... | 8,633 | 28.267797 | 207 | py |
mlgd | mlgd-master/layout_generator/raw_data/data_manager/graphfile_converter/dot2txt.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import networkx as nx
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import vertexmanager
def dot_to_txt(input_file, output_file):
G = nx_read_dot(input_file)
print(nx.info(G))
f = open(output_file, 'w')
f.write(str(len(G.nodes... | 849 | 21.972973 | 79 | py |
mlgd | mlgd-master/layout_generator/raw_data/data_manager/graphfile_converter/vertexmanager.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import networkx as nx
def getCoordinate(vertex):
x = float(vertex['pos'].split(",")[0])
y = float(vertex['pos'].split(",")[1])
return x, y
def setCoordinate(vertex, x, y):
vertex['pos'] = str(x)+","+str(y)
return x, y
def shiftVerte... | 446 | 13.9 | 42 | py |
mlgd | mlgd-master/layout_generator/raw_data/data_manager/graphfile_converter/ericscsvconverter.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import sys
import os
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import math
graphpath = sys.argv[1]
path_folder = os.path.dirname(graphpath)
i... | 1,311 | 22.428571 | 118 | py |
mlgd | mlgd-master/layout_generator/raw_data/data_manager/graphfile_converter/gml2dot.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import sys
import os
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
g_path = sys.argv[1]
outputpath = sys.argv[2]
g_name = os.path.basename(g_path)... | 748 | 20.4 | 62 | py |
mlgd | mlgd-master/layout_generator/raw_data/data_manager/graphfile_converter/levelsfetcher.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import sys
import os
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
g_path = sys.argv[1]
h_path = sys.argv[2]
outputpath = sys.argv[3]
g_name = os.p... | 1,488 | 22.265625 | 62 | py |
mlgd | mlgd-master/layout_generator/raw_data/data_manager/levels_manager/forest_extractor.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import sys
import os
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import math
import random
# Main Flow
t1path = sys.argv[1]
t2path = sys.argv[2]
... | 1,727 | 22.04 | 66 | py |
mlgd | mlgd-master/layout_generator/raw_data/data_manager/levels_manager/forest_extractor_new.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import sys
import os
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import math
import random
# Main Flow
t1path = sys.argv[1]
t2path = sys.argv[2]
... | 1,735 | 22.146667 | 66 | py |
mlgd | mlgd-master/layout_generator/raw_data/framework/modules/propertyfetcher.py |
import sys
import os
import math
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
# Main Flow
graph_path = sys.argv[1]
tree_path = sys.argv[2]
outputpath = tree_path #sys.argv[3]
input_graph_name = os.path... | 1,342 | 25.86 | 62 | py |
mlgd | mlgd-master/layout_generator/raw_data/framework/modules/augment/tree_crossings_remover.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
# This script removes the crossings from the given tree
# it searches for a crossing, splits the graph in 3 components removing
# the crossing edges and then scales the smaller component till there is no more
# crossing.
import sys
import os
import pygraphviz... | 3,499 | 27.92562 | 122 | py |
mlgd | mlgd-master/layout_generator/raw_data/framework/modules/augment/addsubcomponentmodule.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import sys
import os
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import monotone_drawing
import math
import random
import edge_crossing as crossi... | 8,758 | 26.718354 | 107 | py |
mlgd | mlgd-master/layout_generator/raw_data/framework/modules/augment/monotone_drawing.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import networkx as nx
import math
import vertexmanager
def monotone_draw(G, root, edge_length):
""" take tree
assign unique slope
use tan-1 for slopes
if path, may consider same slop
run DFS
"""
i = 1
vertexmanager.setCoordinate(G.node[root],... | 622 | 16.305556 | 76 | py |
mlgd | mlgd-master/layout_generator/raw_data/framework/modules/augment/vertexmanager.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
import networkx as nx
def getCoordinate(vertex):
x = float(vertex['pos'].split(",")[0])
y = float(vertex['pos'].split(",")[1])
return x, y
def setCoordinate(vertex, x, y):
vertex['pos'] = str(x)+","+str(y)
return x, y
def shiftVerte... | 446 | 13.9 | 42 | py |
mlgd | mlgd-master/layout_generator/raw_data/framework/modules/augment/edge_crossing.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
# import math
import networkx as nx
# Given three colinear points p, q, r, the function checks if
# point q lies on line segment 'pr'
def onSegment(px, py, qx, qy, rx, ry):
if (qx <= max(px, rx) and qx >= min(px, rx) and qy <= max(py, ry) and qy >= min(py, ry)... | 8,633 | 28.267797 | 207 | py |
mlgd | mlgd-master/layout_generator/ZMLTpipeline/modules/propertyfetcher.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
"""
Fetch from a given graph the attributes of the vertices and
copies them to the new graph.
Fetched properties are given as input.
The graph with the fetched properties overrides the old one.
standard parameters:
pos width height pos label weigth
#Author
#F... | 1,375 | 21.557377 | 88 | py |
mlgd | mlgd-master/layout_generator/ZMLTpipeline/modules/removelabelsize.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
"""
Fetch from a given graph the attributes of the vertices and
copies them to the new graph.
Fetched properties are given as input.
The graph with the fetched properties overrides the old one.
standard parameters:
pos width height pos label weigth
#Author
#F... | 851 | 19.780488 | 62 | py |
mlgd | mlgd-master/layout_generator/ZMLTpipeline/modules/vertexmanager.py | # Author
# Felice De Luca
# https://www.github.com/felicedeluca
import networkx as nx
def getCoordinate(vertex):
x = float(vertex['pos'].split(",")[0])
y = float(vertex['pos'].split(",")[1])
return x, y
def setCoordinate(vertex, x, y):
vertex['pos'] = str(x)+","+str(y)
return x, y
def shi... | 453 | 14.133333 | 42 | py |
mlgd | mlgd-master/layout_generator/ZMLTpipeline/modules/resizegraph.py | # Author
# Felice De Luca
# https://www.github.com/felicedeluca
import sys
import os
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import math
import random
def getCoordinate(vertex):
x = float(vert... | 2,093 | 18.570093 | 71 | py |
mlgd | mlgd-master/layout_generator/ZMLTpipeline/modules/refinement/uniform_leaves_edges/uniform_leaves_edges.py | import sys
import os
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import math
import random
import leavesoverlapremoval
def getCoordinate(vertex):
"""Returns the coordinate of the given vertex."""
... | 3,599 | 24.352113 | 107 | py |
mlgd | mlgd-master/layout_generator/ZMLTpipeline/modules/refinement/uniform_leaves_edges/leavesoverlapremoval.py | import sys
import os
import math
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
# import edge_crossing as crossings
import boxoverlap
def remove_leaves_overlap(G):
# print("computing overlap")
ov... | 8,414 | 27.818493 | 187 | py |
mlgd | mlgd-master/layout_generator/ZMLTpipeline/modules/refinement/uniform_leaves_edges/uniform_leaves_edges_main.py | import sys
import os
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import math
import random
import uniform_leaves_edges as uniformer
tree_path = sys.argv[1]
# Main Graph
tree_path_name = os.path.basenam... | 493 | 16.642857 | 62 | py |
mlgd | mlgd-master/layout_generator/ZMLTpipeline/modules/refinement/uniform_leaves_edges/boxoverlap.py | import math
def do_overlap(x1, y1, w1, h1, x2, y2, w2, h2):
x_min_1=x1-(w1/2)
y_min_1=y1-(h1/2)
x_max_1=x1+(w1/2)
y_max_1=y1+(h1/2)
x_min_2=x2-(w2/2)
y_min_2=y2-(h2/2)
x_max_2=x2+(w2/2)
y_max_2=y2+(h2/2)
if(x_max_1 <= x_min_2 or x_max_2 <= x_min_1 or
y_max_1 <= y_min_2 or... | 985 | 19.978723 | 66 | py |
mlgd | mlgd-master/layout_generator/ZMLTpipeline/modules/sublevel_extractor/sublevel_extractor.py | # Author
# Felice De Luca
# https://www.github.com/felicedeluca
import sys
import os
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import math
import random
def save_graph(G, outputpath):
G = nx.Graph... | 1,013 | 22.045455 | 84 | py |
mlgd | mlgd-master/layout_generator/ZMLTpipeline/modules/utils/vertexmanager.py | import networkx as nx
def getCoordinate(vertex):
x = float(vertex['pos'].split(",")[0])
y = float(vertex['pos'].split(",")[1])
return x, y
def setCoordinate(vertex, x, y):
vertex['pos'] = str(x)+","+str(y)
return x, y
def shiftVertex(vertex, dx, dy):
x, y = getCoordinate(vertex)
... | 388 | 13.961538 | 42 | py |
mlgd | mlgd-master/layout_generator/ZMLTpipeline/modules/preprocessing/forest_extractor.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
"""
This script extracts the forest for given two graphs with 'level' attribute on nodes
#Author
#Felice De Luca
#https://github.com/felicedeluca
"""
import sys
import os
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import wr... | 1,879 | 21.650602 | 84 | py |
mlgd | mlgd-master/layout_generator/ZMLTpipeline/modules/preprocessing/labelproperties.py | import sys
import os
import math
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import tkinter
from tkinter import *
# def getBoxSize(txt, fs):
#
# Window = Tk()
# Window.geometry("500x500+80+80")
... | 2,752 | 25.471154 | 94 | py |
mlgd | mlgd-master/layout_generator/ZMLTpipeline/modules/preprocessing/preparegraph.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
"""
This script is to clean and prepare the graph for the next steps.
First it changes the id of the vertices to integers, and sets
the string of the id as label_attribute
Then it extracts the levels if the 'level' info is present
Finally it extracts the forests... | 2,847 | 24.428571 | 84 | py |
mlgd | mlgd-master/layout_generator/ZMLTpipeline/modules/add_forest/tree_crossings_remover.py | # Author
# Felice De Luca
# https://www.github.com/felicedeluca
# This script removes the crossings from the given tree
# it searches for a crossing, splits the graph in 3 components removing
# the crossing edges and then scales the smaller component till there is no more
# crossing.
import sys
import os
import pyg... | 3,506 | 27.983471 | 122 | py |
mlgd | mlgd-master/layout_generator/ZMLTpipeline/modules/add_forest/propertyfetcher.py | #Author
#Felice De Luca
#https://github.com/felicedeluca
"""
Fetch from a given graph the attributes of the vertices and
copies them to the new graph.
Fetched properties are given as input.
The graph with the fetched properties overrides the old one.
standard parameters:
pos width height pos label weigth
#Author
#F... | 1,474 | 22.790323 | 102 | py |
mlgd | mlgd-master/layout_generator/ZMLTpipeline/modules/add_forest/addsubcomponentmodule.py | # Author
# Felice De Luca
# https://www.github.com/felicedeluca
import sys
import os
import pygraphviz as pgv
import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import monotone_drawing
import math
import random
import edge_crossing as... | 9,127 | 26.914373 | 107 | py |
mlgd | mlgd-master/layout_generator/ZMLTpipeline/modules/add_forest/remove_crossings_main.py | # Author
# Felice De Luca
# https://www.github.com/felicedeluca
# This script removes the crossings from the given tree
# it searches for a crossing, splits the graph in 3 components removing
# the crossing edges and then scales the smaller component till there is no more
# crossing.
import sys
import os
import pyg... | 688 | 18.138889 | 80 | py |
mlgd | mlgd-master/layout_generator/ZMLTpipeline/modules/add_forest/monotone_drawing.py | # Author
# Felice De Luca
# https://www.github.com/felicedeluca
import networkx as nx
import math
import vertexmanager
def monotone_draw(G, root, edge_length):
""" take tree
assign unique slope
use tan-1 for slopes
if path, may consider same slop
run DFS
"""
i = 0 # starting with zero angle
vertex... | 657 | 16.783784 | 76 | py |
mlgd | mlgd-master/layout_generator/ZMLTpipeline/modules/add_forest/vertexmanager.py | # Author
# Felice De Luca
# https://www.github.com/felicedeluca
import networkx as nx
def getCoordinate(vertex):
x = float(vertex['pos'].split(",")[0])
y = float(vertex['pos'].split(",")[1])
return x, y
def setCoordinate(vertex, x, y):
vertex['pos'] = str(x)+","+str(y)
return x, y
def shi... | 453 | 14.133333 | 42 | py |
mlgd | mlgd-master/layout_generator/ZMLTpipeline/modules/add_forest/edge_crossing.py | # Author
# Felice De Luca
# https://www.github.com/felicedeluca
import networkx as nx
# Given three colinear points p, q, r, the function checks if
# point q lies on line segment 'pr'
def onSegment(px, py, qx, qy, rx, ry):
if (qx <= max(px, rx) and qx >= min(px, rx) and qy <= max(py, ry) and qy >= min(py, ry)):
re... | 8,626 | 28.343537 | 207 | py |
mlgd | mlgd-master/geojson_generator/svg_to_geojson-mw.py | #see license.txt
import xml.etree.ElementTree as ET
import numpy as np
import json
import networkx as nx
import pygraphviz as pgv
from natsort import natsorted
from glob import glob
import sys
def getLayer0(t1):
numberofnodes= min(30, len(t1))
paths=nx.shortest_path(t1)
c=nx.get_node_attributes(t1,'weigh... | 10,490 | 29.146552 | 147 | py |
mlgd | mlgd-master/geojson_generator/svg_to_geojson.py | #see license.txt
import xml.etree.ElementTree as ET
import numpy as np
import json
import networkx as nx
import pygraphviz as pgv
#direct_topics/impred_topics/impred_lastfm
#layout_name="direct_topics"
#layout_name="impred_topics"
layout_name="impred_topics"
layout_output_dir="impred_topics2"
nodecoordinate={}
def ge... | 9,763 | 28.409639 | 147 | py |
mlgd | mlgd-master/geojson_generator/dot_to_geojson.py | #see license.txt
import networkx as nx
import pygraphviz as pgv
import json
f="../T8.dot"
output="/Users/iqbal/openlayerapp/T8.geojson"
#/Users/iqbal/openlayerapp/map.geojson
G=nx.Graph(pgv.AGraph(f))
layerinput="/Users/iqbal/MLGD/mlgd/datasets/topics/set2/input/Topics_Graph.dot"
GL=nx.Graph(pgv.AGraph(layerinput))
... | 1,065 | 20.32 | 79 | py |
mlgd | mlgd-master/data/direct_approach_output/old/levelextrator.py | import sys, os
import networkx as nx
import pygraphviz as pgv
import math
from networkx.readwrite import json_graph
from networkx.drawing.nx_agraph import write_dot
#G=nx.read_graphml('g.graphml')
#write_dot(G, 'g.dot')
G=nx.Graph(pgv.AGraph("g.dot"))
nx.write_graphml()
L=8
folderpath="../../../datasets/topics/set2/i... | 2,096 | 30.772727 | 155 | py |
mlgd | mlgd-master/data/direct_approach_output/old/dot_to_svg.py | #dot_to_svg.py g_path , outputpath , scalefactor , vertexsize
import os
import sys
import networkx as nx
import pygraphviz as pgv
import math
from networkx.readwrite import json_graph
vertexsize='5'
def scale(G,times):
for x in G.nodes():
x1=float( G.node[x]['pos'].split(",")[0]) * times
y1=float(G.node[x]['po... | 3,358 | 33.989583 | 229 | py |
mlgd | mlgd-master/data/datasets/small(Ryn)/print_javascript_data.py | import networkx as nx
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import sys
levels = int(sys.argv[1])
folder_name = "lastfm"
file_name = ["lastfm_12nodes.dot", "lastfm_20nodes.dot", "lastfm_43nodes.dot", "lastfm_86nodes.dot", "lastfm_155nodes.dot"]
#folder_name = "topics_layer"
#file_name = ["Topic... | 3,041 | 25 | 189 | py |
mlgd | mlgd-master/data/datasets/refined/tree_size_reducer.py | import networkx as nx
from networkx.drawing.nx_agraph import write_dot
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import copy
def read_txt_file(fname):
G = nx.Graph()
f = open(fname, "r")
while True:
l = f.readline()
if len(l)==0:
break
l = l.split('"')
u = l[1]
v = ... | 4,259 | 30.323529 | 112 | py |
mlgd | mlgd-master/data/datasets/lastfm/preprocess/preprocess.py | import networkx as nx
import pygraphviz as pgv
from networkx.drawing.nx_agraph import write_dot
def containsNonAscii(s):
return any(ord(i)>127 for i in s)
G=nx.Graph(pgv.AGraph("lastfm.dot"))
G2=nx.Graph(pgv.AGraph("lastfm.dot"))
for n in G.nodes():
lbl=G.node[n]["label"]
lbl=lbl.replace("\\n"," ")
lb... | 611 | 21.666667 | 48 | py |
mlgd | mlgd-master/data/datasets/topics/low_degree(Faryad)/print_javascript_data_topics.py | import networkx as nx
from networkx.drawing.nx_agraph import read_dot as nx_read_dot
import sys
levels = int(sys.argv[1])
#folder_name = "lastfm"
#file_name = ["lastfm_12nodes.dot", "lastfm_20nodes.dot", "lastfm_43nodes.dot", "lastfm_86nodes.dot", "lastfm_155nodes.dot"]
#folder_name = "."
#file_name = ["Layer1.dot", "... | 4,920 | 25.744565 | 124 | py |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.