파이썬 – 페이지 7

14장. 메뉴, 파일열기

메뉴 작성

# -*- coding:utf-8 -*-
from tkinter import *
from tkinter import messagebox


def myFunc():
    messagebox.showinfo("메뉴", "열기 메뉴 선택")


window = Tk()

mainMenu = Menu(window)
window.configure(menu=mainMenu)

fileMenu = Menu(mainMenu)
mainMenu.add_cascade(label="파일", menu=fileMenu)
fileMenu.add_command(label="열기", command = myFunc)
fileMenu.add_separator()
fileMenu.add_command(label="종료", command = quit)

window.mainloop()

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

# -*- coding:utf-8 -*-

from tkinter import *

from tkinter import messagebox

def myFunc():

messagebox.showinfo("메뉴", "열기 메뉴 선택")

window = Tk()

mainMenu = Menu(window)

window.configure(menu=mainMenu)

fileMenu = Menu(mainMenu)

mainMenu.add_cascade(label="파일", menu=fileMenu)

fileMenu.add_command(label="열기", command = myFunc)

fileMenu.add_separator()

fileMenu.add_command(label="종료", command = quit)

window.mainloop()

파일 열기

# -*- coding:utf-8 -*-
from tkinter import *
from tkinter import filedialog


def file_open():
    filename = filedialog.askopenfilename(parent=window, filetypes=(("GIF 파일", "*.gif"), ("모든 파일", "*.*")))
    photo2 = PhotoImage(file=filename)
    pLabel.configure(image=photo2)
    pLabel.image = photo2


window = Tk()
window.geometry("400x400")
window.title("영화감상")

photo = PhotoImage()
pLabel = Label(window, image=photo)
pLabel.pack(expand=1, anchor=CENTER)

mainMenu = Menu(window)
window.configure(menu=mainMenu)

fileMenu = Menu(mainMenu)
mainMenu.add_cascade(label="파일", menu=fileMenu)
fileMenu.add_command(label="열기", command = file_open)
fileMenu.add_separator()
fileMenu.add_command(label="종료", command = quit)

window.mainloop()

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

# -*- coding:utf-8 -*-

from tkinter import *

from tkinter import filedialog

def file_open():

filename = filedialog.askopenfilename(parent=window, filetypes=(("GIF 파일", "*.gif"), ("모든 파일", "*.*")))

photo2 = PhotoImage(file=filename)

pLabel.configure(image=photo2)

pLabel.image = photo2

window = Tk()

window.geometry("400x400")

window.title("영화감상")

photo = PhotoImage()

pLabel = Label(window, image=photo)

pLabel.pack(expand=1, anchor=CENTER)

mainMenu = Menu(window)

window.configure(menu=mainMenu)

fileMenu = Menu(mainMenu)

mainMenu.add_cascade(label="파일", menu=fileMenu)

fileMenu.add_command(label="열기", command = file_open)

fileMenu.add_separator()

fileMenu.add_command(label="종료", command = quit)

window.mainloop()

13장. 파이썬에서 sqlite 활용

DB Browser for Sqlite 다운로드 : http://sqlitebrowser.org/ sqlite db 파일 : addr.zip 테이블에 레코드 추가 후 목록 출력 : 13_01_Sqlite.py

# -*- coding:utf-8 -*-
import sqlite3

con = sqlite3.connect("addr.db")
cur = con.cursor()

# Insert
sql = "insert into contact(name, phone, addr, post) values ('python', '010-9876-5432', '전주시 완산구', '54123');"
cur.execute(sql)
con.commit()

# Select
sql = "select * from contact;"
cur.execute(sql)
print("no    name   phone   addr   post")
print("--------------------------------")
while(True):
    row = cur.fetchone()
    if row == None:
        break;
    print(row[0], row[1], row[2], row[3], row[4])

con.close()

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

# -*- coding:utf-8 -*-

import sqlite3

con = sqlite3.connect("addr.db")

cur = con.cursor()

# Insert

sql = "insert into contact(name, phone, addr, post) values ('python', '010-9876-5432', '전주시 완산구', '54123');"

cur.execute(sql)

con.commit()

# Select

sql = "select * from contact;"

cur.execute(sql)

print("no name phone addr post")

print("--------------------------------")

while(True):

row = cur.fetchone()

if row == None:

break;

print(row[0], row[1], row[2], row[3], row[4])

con.close()

Sqlite 입력 부분1 : INSERT

import sqlite3

sql = "insert into contact(name, phone) values ('python', '010-9876-5432');"

con = sqlite3.connect("addr.db")
cur = con.cursor()
cur.execute(sql)
con.commit()
con.close()

1

2

3

4

5

6

7

8

9

import sqlite3

sql = "insert into contact(name, phone) values ('python', '010-9876-5432');"

con = sqlite3.connect("addr.db")

cur = con.cursor()

cur.execute(sql)

con.commit()

con.close()

Sqlite 입력 부분2 : INSERT

import sqlite3

name = input("이름 : ")
engname = input("영어이름 : ")
phone = input("전화번호 : ")
addr = input("주소 : ")
post = input("우편번호 : ")

sql = "insert into contact(name, engname, phone, addr, post) values ('%s', '%s', '%s', '%s', '%s');" % (name, engname, phone, addr, post)
con = sqlite3.connect("addr.db")

cur = con.cursor()
cur.execute(sql)
con.commit()
con.close()

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

import sqlite3

name = input("이름 : ")

engname = input("영어이름 : ")

phone = input("전화번호 : ")

addr = input("주소 : ")

post = input("우편번호 : ")

sql = "insert into contact(name, engname, phone, addr, post) values ('%s', '%s', '%s', '%s', '%s');" % (name, engname, phone, addr, post)

con = sqlite3.connect("addr.db")

cur = con.cursor()

cur.execute(sql)

con.commit()

con.close()

Sqlite 목록 출력 부분1 : SELECT

import sqlite3

sql = "select * from contact;"

con = sqlite3.connect("addr.db")
cur = con.cursor()
cur.execute(sql)
row = cur.fetchone()     #row = cur.fetchall()
if row != None:
  print(row)       #print(row[0], row[1], row[2], row[3], row[4], row[5])
con.close()

1

2

3

4

5

6

7

8

9

10

11

import sqlite3

sql = "select * from contact;"

con = sqlite3.connect("addr.db")

cur = con.cursor()

cur.execute(sql)

row = cur.fetchone() #row = cur.fetchall()

if row != None:

print(row) #print(row[0], row[1], row[2], row[3], row[4], row[5])

con.close()

Sqlite 목록 출력 부분2 : SELECT

import sqlite3

sql = "select * from contact;"

con = sqlite3.connect("addr.db")
cur = con.cursor()
cur.execute(sql)
print("no    name   engname phone   addr   post")
print("----------------------------------------")
while(True):
  row = cur.fetchone()
  if row == None:
      break;
  print(row[0], row[1], row[2], row[3], row[4], row[5])
con.close()

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

import sqlite3

sql = "select * from contact;"

con = sqlite3.connect("addr.db")

cur = con.cursor()

cur.execute(sql)

print("no name engname phone addr post")

print("----------------------------------------")

while(True):

row = cur.fetchone()

if row == None:

break;

print(row[0], row[1], row[2], row[3], row[4], row[5])

con.close()

Sqlite 목록 출력 부분3… Continue Reading 13장. 파이썬에서 sqlite 활용

12장. 윈도우 창이 나오는 윈도우 프로그래밍

윈도우 창의 기본 구성

# -*- coding:utf-8 -*-
from tkinter import *

window = Tk()

window.mainloop()

1

2

3

4

5

6

# -*- coding:utf-8 -*-

from tkinter import *

window = Tk()

window.mainloop()

제목, 크기, 크기조절 설정

# -*- coding:utf-8 -*-
from tkinter import *

window = Tk()
window.title("윈도우 창 연습")
window.geometry("400x300")
window.resizable(width=FALSE, height=False)

window.mainloop()

1

2

3

4

5

6

7

8

9

# -*- coding:utf-8 -*-

from tkinter import *

window = Tk()

window.title("윈도우 창 연습")

window.geometry("400x300")

window.resizable(width=FALSE, height=False)

window.mainloop()

Label : 12_01_Label.py

# -*- coding:utf-8 -*-
from tkinter import *

window = Tk()
window.title("윈도우 창 연습")
window.geometry("400x400")
window.resizable(width=FALSE, height=False)

label1 = Label(window, text="파이썬")
label2 = Label(window, text="열심히", font=("궁서체", 30), fg="blue")
label3 = Label(window, text="공부합시다", bg="magenta", width=20, height=5, anchor=SE)
photo = PhotoImage(file="img/jj.gif")
label4 = Label(window, image=photo)
#label4 = Label(window)
#label4.configure(image=photo)

label1.pack()
label2.pack()
label3.pack()
label4.pack()

window.mainloop()

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

# -*- coding:utf-8 -*-

from tkinter import *

window = Tk()

window.title("윈도우 창 연습")

window.geometry("400x400")

window.resizable(width=FALSE, height=False)

label1 = Label(window, text="파이썬")

label2 = Label(window, text="열심히", font=("궁서체", 30), fg="blue")

label3 = Label(window, text="공부합시다", bg="magenta", width=20, height=5, anchor=SE)

photo = PhotoImage(file="img/jj.gif")

label4 = Label(window, image=photo)

#label4 = Label(window)

#label4.configure(image=photo)

label1.pack()

label2.pack()

label3.pack()

label4.pack()

window.mainloop()

text : 문자열 fg : 전경색 bg : 배경색 width : 너비 height : 높이 anchor : 위치(E, W, S, N, NE, SE, SW, NW, CENTER) PhotoImage() : GIF 형식만 지원함 Button : 12_06_Button.py

# -*- coding:utf-8 -*-
from tkinter import *
import tkinter.messagebox


def myFunc():
    tkinter.messagebox.showinfo("버튼", "버튼이 눌렸어요")


window = Tk()

btn1 = Button(window, text="종료", fg="red", command=quit)
btn1.pack()

photo = PhotoImage(file="img/jj.gif")
btn2 = Button(window, image=photo, command=myFunc)
btn2.pack()

window.mainloop()

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

# -*- coding:utf-8 -*-

from tkinter import *

import tkinter.messagebox

def myFunc():

tkinter.messagebox.showinfo("버튼", "버튼이 눌렸어요")

window = Tk()

btn1 = Button(window, text="종료", fg="red", command=quit)

btn1.pack()

photo = PhotoImage(file="img/jj.gif")

btn2 = Button(window, image=photo, command=myFunc)

btn2.pack()

window.mainloop()

CheckButton… Continue Reading 12장. 윈도우 창이 나오는 윈도우 프로그래밍

파이썬 설치하기 : URL 네이버 영화 목록 URL : https://movie.naver.com/movie/sdb/browsing/bmovie.nhn?open=2019 소스보기 크롤링(Crawling) : 무수히 많은 컴퓨터에 분산 저장되어 있는 문서를 수집하여 검색 대상의 색인으로 포함시키는 기술(네이버 지식백과) 파이썬에서 사용할 라이브러리 requests bs4 라이브러리 설치 CMD에서 pip.exe가 있는 폴더로 이동 pip install requests pip install bs4 영화코드, 제목, URL을 가져오는 소스 코드

# -*- coding:utf-8 -*-
# https://movie.naver.com/movie/sdb/browsing/bmovie.nhn?open=2018&page=1

import requests
import bs4


def get_html(movie_url):
    resp = requests.get(movie_url)
    html = resp.content
    bs = bs4.BeautifulSoup(html, 'html.parser')

    ul_dir = bs.find('ul', {'class': 'directory_list'})  # <ul class='directory_list'>를 찾아라
    items = ul_dir.find_all('li')

    lst_movie = []
    for item in items:
        f_code = 0
        f_title = ''
        f_url = ''

        if item.find('ul'):
            a_tags = item.find_all('a')
            for a_tag in a_tags:
                # 코드
                if a_tag['href'].find('?code=') > 0:
                    idx = a_tag['href'].find('?code=')
                    f_code = int(a_tag['href'][idx + 6:])
                    f_title = a_tag.get_text()
                    f_url = a_tag['href']

            lst_movie.append([f_code,
                              f_title,
                              f_url])
    return lst_movie


url = 'https://movie.naver.com/movie/sdb/browsing/bmovie.nhn?open=2019&page=1'
lst = get_html(url)
for rss in lst:
    print(rss)

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

# -*- coding:utf-8 -*-

# https://movie.naver.com/movie/sdb/browsing/bmovie.nhn?open=2018&page=1

import requests

import bs4

def get_html(movie_url):

resp = requests.get(movie_url)

html = resp.content

bs = bs4.BeautifulSoup(html, 'html.parser')

ul_dir = bs.find('ul', {'class': 'directory_list'}) # <ul class='directory_list'>를 찾아라

items = ul_dir.find_all('li')

lst_movie = []

for item in items:

f_code = 0

f_title = ''

f_url = ''

if item.find('ul'):

a_tags = item.find_all('a')

for a_tag in a_tags:

# 코드

if a_tag['href'].find('?code=') > 0:

idx = a_tag['href'].find('?code=')

f_code = int(a_tag['href'][idx + 6:])

f_title = a_tag.get_text()

f_url = a_tag['href']

lst_movie.append([f_code,

f_title,

f_url])

return lst_movie

url = 'https://movie.naver.com/movie/sdb/browsing/bmovie.nhn?open=2019&page=1'

lst = get_html(url)

for rss in lst:

print(rss)

… Continue Reading 파이썬 특강(Naver 영화목록 크롤링)

프로그래밍(파이썬) 강의계획서

교재 교 재 : 컴퓨텅 사고력을 키우는 SW 교육 파이썬 저 자 : 우재남 출판사 : 한빛아카데미 가 격 : 원 평가 중간고사 : 시험 100점 만점(비율:30%) 기말고사 : 시험 100점 만점(비율:40%) 과 제 : 20점 만점(비율:20%) 출 석 : 30점 만점(비율:10%) 결석1회당 2점 감점 지각1회당 1점 감점 6회이상 결석은… Continue Reading 프로그래밍(파이썬) 강의계획서

최소비용신장트리, Prim/Kruskal 파이썬(Python) 소스 코드

Prim 알고리즘

# 출처 : https://coderbyte.com/algorithm/find-minimum-spanning-tree-using-prims-algorithm
# create adjacency matrix for use in prims algorithm
# note: we could improve the running time of prims algorithm by
# implementing a priority queue data structure instead of a matrix
def createAdjMatrix(V, G):
    adjMatrix = []

    # create N x N matrix filled with 0 edge weights between all vertices
    for i in range(0, V):
        adjMatrix.append([])
        for j in range(0, V):
            adjMatrix[i].append(0)

    # populate adjacency matrix with correct edge weights
    for i in range(0, len(G)):
        adjMatrix[G[i][0]][G[i][1]] = G[i][2]
        adjMatrix[G[i][1]][G[i][0]] = G[i][2]

    return adjMatrix


def prims(V, G):
    # create adj matrix from graph
    adjMatrix = createAdjMatrix(V, G)

    # arbitrarily choose initial vertex from graph
    vertex = 0

    # initialize empty edges array and empty MST
    MST = []
    edges = []
    visited = []
    minEdge = [None, None, float('inf')]

    # run prims algorithm until we create an MST
    # that contains every vertex from the graph
    while len(MST) != V - 1:

        # mark this vertex as visited
        visited.append(vertex)

        # add each edge to list of potential edges
        for r in range(0, V):
            if adjMatrix[vertex][r] != 0:
                edges.append([vertex, r, adjMatrix[vertex][r]])

        # find edge with the smallest weight to a vertex
        # that has not yet been visited
        for e in range(0, len(edges)):
            if edges[e][2] < minEdge[2] and edges[e][1] not in visited:
                minEdge = edges[e]

        # remove min weight edge from list of edges
        edges.remove(minEdge)

        # push min edge to MST
        MST.append(minEdge)

        # start at new vertex and reset min edge
        vertex = minEdge[1]
        minEdge = [None, None, float('inf')]

    return MST


# graph vertices are actually represented as numbers
# like so: 0, 1, 2, ... V-1
a, b, c, d, e, f = 0, 1, 2, 3, 4, 5

# graph edges with weights
# diagram of graph is shown above
graph = [
    [a, b, 2],
    [a, c, 3],
    [b, d, 3],
    [b, c, 5],
    [b, e, 4],
    [c, e, 4],
    [d, e, 2],
    [d, f, 3],
    [e, f, 5]
]


# pass the # of vertices and the graph to run prims algorithm
print(prims(6, graph))

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

# 출처 : https://coderbyte.com/algorithm/find-minimum-spanning-tree-using-prims-algorithm

# create adjacency matrix for use in prims algorithm

# note: we could improve the running time of prims algorithm by

# implementing a priority queue data structure instead of a matrix

def createAdjMatrix(V, G):

adjMatrix = []

# create N x N matrix filled with 0 edge weights between all vertices

for i in range(0, V):

adjMatrix.append([])

for j in range(0, V):

adjMatrix[i].append(0)

# populate adjacency matrix with correct edge weights

for i in range(0, len(G)):

adjMatrix[G[i][0]][G[i][1]] = G[i][2]

adjMatrix[G[i][1]][G[i][0]] = G[i][2]

return adjMatrix

def prims(V, G):

# create adj matrix from graph

adjMatrix = createAdjMatrix(V, G)

# arbitrarily choose initial vertex from graph

vertex = 0

# initialize empty edges array and empty MST

MST = []

edges = []

visited = []

minEdge = [None, None, float('inf')]

# run prims algorithm until we create an MST

# that contains every vertex from the graph

while len(MST) != V - 1:

# mark this vertex as visited

visited.append(vertex)

# add each edge to list of potential edges

for r in range(0, V):

if adjMatrix[vertex][r] != 0:

edges.append([vertex, r, adjMatrix[vertex][r]])

# find edge with the smallest weight to a vertex

# that has not yet been visited

for e in range(0, len(edges)):

if edges[e][2] < minEdge[2] and edges[e][1] not in visited:

minEdge = edges[e]

# remove min weight edge from list of edges

edges.remove(minEdge)

# push min edge to MST

MST.append(minEdge)

# start at new vertex and reset min edge

vertex = minEdge[1]

minEdge = [None, None, float('inf')]

return MST

# graph vertices are actually represented as numbers

# like so: 0, 1, 2, ... V-1

a, b, c, d, e, f = 0, 1, 2, 3, 4, 5

# graph edges with weights

# diagram of graph is shown above

graph = [

[a, b, 2],

[a, c, 3],

[b, d, 3],

[b, c, 5],

[b, e, 4],

[c, e, 4],

[d, e, 2],

[d, f, 3],

[e, f, 5]

]

# pass the # of vertices and the graph to run prims algorithm

print(prims(6, graph))

Kruskal, Prim 알고리즘(출처 : github)

import re


# Class WeightedGraph
class WeightedGraph:
    def __init__(self, path):
        # open file to initialize the graph
        file = open(path, "r")
        p = re.compile("\d+")

        # initialize the graph
        self.vertices, self.edges = map(int, p.findall(file.readline()))
        # use adjacent matrix to represent the graph
        self.graph = [[0]*self.vertices for _ in range(self.vertices)]

        # populate the graph
        for i in range(self.edges):
            u, v, weight = map(int, p.findall(file.readline()))
            self.graph[u][v] = weight
            self.graph[v][u] = weight


# Union find data structure for quick kruskal algorithm
class UF:
    def __init__(self, N):
        self._id = [i for i in range(N)]

    # judge two node connected or not
    def connected(self, p, q):
        return self._find(p) == self._find(q)

    # quick union two component
    def union(self, p, q):
        p_root = self._find(p)
        q_root = self._find(q)
        if p_root == q_root:
            return
        self._id[p_root] = q_root

    # find the root of p
    def _find(self, p):
        while p != self._id[p]:
            p = self._id[p]
        return p



# prim algorithm
def prim(G):
    # initialize the MST and the set X
    MST = set()
    X = set()

    # select an arbitrary vertex to begin with
    X.add(0)
    while len(X) != G.vertices:
        crossing = set()
        # for each element x in X, add the edge (x, k) to crossing if
        # k is not in X
        for x in X:
            for k in range(G.vertices):
                if k not in X and G.graph[x][k] != 0:
                    crossing.add((x, k))
        # find the edge with the smallest weight in crossing
        edge = sorted(crossing, key=lambda e:G.graph[e[0]][e[1]])[0]
        # add this edge to MST
        MST.add(edge)
        # add the new vertex to X
        X.add(edge[1])
    return MST


# kruskal algorithm
def kruskal(G):
    # initialize MST
    MST = set()
    edges = set()
    # collect all edges from graph G
    for j in range(G.vertices):
        for k in range(G.vertices):
            if G.graph[j][k] != 0 and (k, j) not in edges:
                edges.add((j, k))
    # sort all edges in graph G by weights from smallest to largest
    sorted_edges = sorted(edges, key=lambda e:G.graph[e[0]][e[1]])
    uf = UF(G.vertices)
    for e in sorted_edges:
        u, v = e
        # if u, v already connected, abort this edge
        if uf.connected(u, v):
            continue
        # if not, connect them and add this edge to the MST
        uf.union(u, v)
        MST.add(e)
    return MST


if __name__ == '__main__':
    WG = WeightedGraph("Graph")
    print("================USING PRIM ALGORITHM================")
    MST = prim(WG)
    # print the edges of the MST
    for edge in MST:
        print(edge)
    print("================END PRIM ALGORITHM================")
    print("================USING KRUSKAL ALGORITHM================")
    MST = kruskal(WG)
    # print the edges of the MST
    for edge in MST:
        print(edge)
    print("================END KRUSKAL ALGORITHM================")

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

51

52

53

54

55

56

57

58

59

60

61

62

63

64

65

66

67

68

69

70

71

72

73

74

75

76

77

78

79

80

81

82

83

84

85

86

87

88

89

90

91

92

93

94

95

96

97

98

99

100

101

102

103

104

105

106

107

108

109

110

import re

# Class WeightedGraph

class WeightedGraph:

def __init__(self, path):

# open file to initialize the graph

file = open(path, "r")

p = re.compile("\d+")

# initialize the graph

self.vertices, self.edges = map(int, p.findall(file.readline()))

# use adjacent matrix to represent the graph

self.graph = [[0]*self.vertices for _ in range(self.vertices)]

# populate the graph

for i in range(self.edges):

u, v, weight = map(int, p.findall(file.readline()))

self.graph[u][v] = weight

self.graph[v][u] = weight

# Union find data structure for quick kruskal algorithm

class UF:

def __init__(self, N):

self._id = [i for i in range(N)]

# judge two node connected or not

def connected(self, p, q):

return self._find(p) == self._find(q)

# quick union two component

def union(self, p, q):

p_root = self._find(p)

q_root = self._find(q)

if p_root == q_root:

return

self._id[p_root] = q_root

# find the root of p

def _find(self, p):

while p != self._id[p]:

p = self._id[p]

return p

# prim algorithm

def prim(G):

# initialize the MST and the set X

MST = set()

X = set()

# select an arbitrary vertex to begin with

X.add(0)

while len(X) != G.vertices:

crossing = set()

# for each element x in X, add the edge (x, k) to crossing if

# k is not in X

for x in X:

for k in range(G.vertices):

if k not in X and G.graph[x][k] != 0:

crossing.add((x, k))

# find the edge with the smallest weight in crossing

edge = sorted(crossing, key=lambda e:G.graph[e[0]][e[1]])[0]

# add this edge to MST

MST.add(edge)

# add the new vertex to X

X.add(edge[1])

return MST

# kruskal algorithm

def kruskal(G):

# initialize MST

MST = set()

edges = set()

# collect all edges from graph G

for j in range(G.vertices):

for k in range(G.vertices):

if G.graph[j][k] != 0 and (k, j) not in edges:

edges.add((j, k))

# sort all edges in graph G by weights from smallest to largest

sorted_edges = sorted(edges, key=lambda e:G.graph[e[0]][e[1]])

uf = UF(G.vertices)

for e in sorted_edges:

u, v = e

# if u, v already connected, abort this edge

if uf.connected(u, v):

continue

# if not, connect them and add this edge to the MST

uf.union(u, v)

MST.add(e)

return MST

if __name__ == '__main__':

WG = WeightedGraph("Graph")

print("================USING PRIM ALGORITHM================")

MST = prim(WG)

# print the edges of the MST

for edge in MST:

print(edge)

print("================END PRIM ALGORITHM================")

print("================USING KRUSKAL ALGORITHM================")

MST = kruskal(WG)

# print the edges of the MST

for edge in MST:

print(edge)

print("================END KRUSKAL ALGORITHM================")

파이썬으로 네이버 날씨 Json 읽어오기

request 설치(json은 기본으로 설치되어 있음 CMD에서 cd \파이썬폴더\Scripts pip install requests 파이참 terminal에서 pip install requests 역할 request : 데이터를 요청하는 라이브러리 모듈 json : JSON 형태의 데이터를 파싱(parsing)하는 라이브러리 모듈 네이버 날씨 Json https://weather.naver.com/json/crntWetr.nhn 전송 데이터 소스 코드

import requests
import json


def getJson(url):
    resp = requests.get(url)
    html = json.loads(resp.text)

    lst = []
    html = html['wetrMap']
    for data in html:
        if type(data[1]) == dict:
            lst.append(data[1])
    return lst


url = 'https://weather.naver.com/json/crntWetr.nhn'
rss_list = getJson(url)

for rss in rss_list:
    print(rss)

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

import requests

import json

def getJson(url):

resp = requests.get(url)

html = json.loads(resp.text)

lst = []

html = html['wetrMap']

for data in html:

if type(data[1]) == dict:

lst.append(data[1])

return lst

url = 'https://weather.naver.com/json/crntWetr.nhn'

rss_list = getJson(url)

for rss in rss_list:

print(rss)

파이썬으로 기상청 RSS 읽어오기

request, beautifulsoup4 설치 CMD에서 cd \파이썬폴더\Scripts pip install requests pip install beautifulsoup4 파이참 terminal에서 pip install requests pip install beautifulsoup4 역할 request : 데이터를 요청하는 라이브러리 모듈 Beautifulsoup : HTML을 가져와서 파싱(parsing)하는 라이브러리 모듈 기상청 rss 정보 보기 http://www.weather.go.kr/weather/lifenindustry/sevice_rss.jsp http://www.weather.go.kr/weather/forecast/mid-term-rss3.jsp?stnId=108 전송데이터 소스 코드

import requests
import bs4


def getRss(url):
    resp = requests.get(url)
    html = resp.content
    bs = bs4.BeautifulSoup(html, 'html.parser')
    items = bs.select('data')

    lst = []
    for item in items:
        mode = ''
        tmef = ''
        try:
            mode = item.find('mode').get_text()
            tmef = item.find('tmef').get_text()
        except:
            print("None Error")

        lst.append(dict(mode=mode, tmef=tmef))

    return lst


url = 'http://www.weather.go.kr/weather/forecast/mid-term-rss3.jsp?stnId=108'
lst = getRss(url)

for rss in lst:
    print(rss)

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

import requests

import bs4

def getRss(url):

resp = requests.get(url)

html = resp.content

bs = bs4.BeautifulSoup(html, 'html.parser')

items = bs.select('data')

lst = []

for item in items:

mode = ''

tmef = ''

try:

mode = item.find('mode').get_text()

tmef = item.find('tmef').get_text()

except:

print("None Error")

lst.append(dict(mode=mode, tmef=tmef))

return lst

url = 'http://www.weather.go.kr/weather/forecast/mid-term-rss3.jsp?stnId=108'

lst = getRss(url)

for rss in lst:

print(rss)

참조 : https://blog.naver.com/luckperson7/221200031639

파이참(PyCharm) 설치

다음 URL에 접속 https://www.jetbrains.com/pycharm/ Download 클릭 Community 버전 다운로드 설치 참조 : http://itgroovy.tistory.com/702

파이썬 Request와 json으로 영화 목록 웹스크롤링

알고리즘 Requst 모듈을 이용하여 영화 목록을 다운로드 Movie 클래스 생성 json을 이용하여 Movie클래스에 영화목록 저장 Movie 클래스의 목록을 출력 소스 코드

#참조 : https://github.com/codingspecialist/flask-movie
import requests
import json

class Movie:
    def __init__(self, id, rating, title, synopsis, medium_cover_image):
        self.id = id
        self.rating = rating
        self.title = title
        self.synopsis = synopsis
        self.medium_cover_image = medium_cover_image

    def __str__(self):
        return f"rating : '{self.rating}' title :'{self.title}'"

    def print(self):
        print(self.id, self.rating, self.title)


def getMovie(page):
    url = f"https://yts.am/api/v2/list_movies.json?sort_by=rating&limit=6&page={page}"
    response = requests.get(url=url)

    html = json.loads(response.text)
    data = html['data']
    movies = data['movies']

    #for m in movies:
    #    print(m)

    #for m in movies:
    #    print(m['id'], m['title'])

    lstMovie = []
    for m in movies:
        movie = Movie(
                m['id'],
                m['rating'],
                m['title'],
                m['synopsis'][0:230],
                m['medium_cover_image']
            )
        lstMovie.append(movie)

    return lstMovie


lstMovie = getMovie(1)
for m in lstMovie:
    m.print()

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

29

30

31

32

33

34

35

36

37

38

39

40

41

42

43

44

45

46

47

48

49

50

#참조 : https://github.com/codingspecialist/flask-movie

import requests

import json

class Movie:

def __init__(self, id, rating, title, synopsis, medium_cover_image):

self.id = id

self.rating = rating

self.title = title

self.synopsis = synopsis

self.medium_cover_image = medium_cover_image

def __str__(self):

return f"rating : '{self.rating}' title :'{self.title}'"

def print(self):

print(self.id, self.rating, self.title)

def getMovie(page):

url = f"https://yts.am/api/v2/list_movies.json?sort_by=rating&limit=6&page={page}"

response = requests.get(url=url)

html = json.loads(response.text)

data = html['data']

movies = data['movies']

#for m in movies:

# print(m)

#for m in movies:

# print(m['id'], m['title'])

lstMovie = []

for m in movies:

movie = Movie(

m['id'],

m['rating'],

m['title'],

m['synopsis'][0:230],

m['medium_cover_image']

)

lstMovie.append(movie)

return lstMovie

lstMovie = getMovie(1)

for m in lstMovie:

m.print()