{"componentChunkName":"component---src-templates-blog-list-js","path":"/blog","result":{"data":{"allMarkdownRemark":{"edges":[{"node":{"id":"fb8b1bd2-7b11-5867-80c9-659e4cce06f6","frontmatter":{"title":"[React] React Project 2 - Movie App ","date":"2020-04-13T00:00:00.000Z","categories":["web","react"],"image":{"publicURL":"/static/react-2d7a464f2cd7672fcfe40db9b684392c.jpg","childImageSharp":{"fluid":{"srcSet":"/static/2d7a464f2cd7672fcfe40db9b684392c/9104c/react.jpg 480w,\n/static/2d7a464f2cd7672fcfe40db9b684392c/a6352/react.jpg 960w,\n/static/2d7a464f2cd7672fcfe40db9b684392c/d8255/react.jpg 1920w","base64":"data:image/jpeg;base64,/9j/2wBDABALDA4MChAODQ4SERATGCgaGBYWGDEjJR0oOjM9PDkzODdASFxOQERXRTc4UG1RV19iZ2hnPk1xeXBkeFxlZ2P/2wBDARESEhgVGC8aGi9jQjhCY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2P/wgARCAAHABQDASIAAhEBAxEB/8QAFgABAQEAAAAAAAAAAAAAAAAAAAEF/8QAFQEBAQAAAAAAAAAAAAAAAAAAAAH/2gAMAwEAAhADEAAAAd2iUL//xAAUEAEAAAAAAAAAAAAAAAAAAAAQ/9oACAEBAAEFAn//xAAUEQEAAAAAAAAAAAAAAAAAAAAQ/9oACAEDAQE/AT//xAAUEQEAAAAAAAAAAAAAAAAAAAAQ/9oACAECAQE/AT//xAAUEAEAAAAAAAAAAAAAAAAAAAAQ/9oACAEBAAY/An//xAAZEAACAwEAAAAAAAAAAAAAAAABEQAQITH/2gAIAQEAAT8hLYXJtf/aAAwDAQACAAMAAAAQjA//xAAVEQEBAAAAAAAAAAAAAAAAAAAQEf/aAAgBAwEBPxCH/8QAFREBAQAAAAAAAAAAAAAAAAAAEBH/2gAIAQIBAT8Qp//EABgQAQADAQAAAAAAAAAAAAAAAAEAEEGR/9oACAEBAAE/EA2QaIGk5X//2Q==","aspectRatio":2.931297709923664,"src":"/static/2d7a464f2cd7672fcfe40db9b684392c/d8255/react.jpg","sizes":"(max-width: 1920px) 100vw, 1920px"},"id":"6fe7b4ca-c8c0-5a21-90a3-21fc513f087b"}}},"fields":{"slug":"/blog/react/react_20200413/"},"timeToRead":7,"excerpt":"React Project 2 - Movie App React를 이용하여 API에서 받아온 영화 데이터를 보여주고, React Router를 이용하여 다른 페이지로 이동할 수 있는 웹사이트를 만들어 보았다. Github Pages…"}},{"node":{"id":"63724fce-f9bf-506a-8351-db7bc5eb9bb2","frontmatter":{"title":"[React] React Basic - (8) 정리","date":"2020-04-12T00:00:00.000Z","categories":["web","react"],"image":{"publicURL":"/static/react-2d7a464f2cd7672fcfe40db9b684392c.jpg","childImageSharp":{"fluid":{"srcSet":"/static/2d7a464f2cd7672fcfe40db9b684392c/9104c/react.jpg 480w,\n/static/2d7a464f2cd7672fcfe40db9b684392c/a6352/react.jpg 960w,\n/static/2d7a464f2cd7672fcfe40db9b684392c/d8255/react.jpg 1920w","base64":"data:image/jpeg;base64,/9j/2wBDABALDA4MChAODQ4SERATGCgaGBYWGDEjJR0oOjM9PDkzODdASFxOQERXRTc4UG1RV19iZ2hnPk1xeXBkeFxlZ2P/2wBDARESEhgVGC8aGi9jQjhCY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2P/wgARCAAHABQDASIAAhEBAxEB/8QAFgABAQEAAAAAAAAAAAAAAAAAAAEF/8QAFQEBAQAAAAAAAAAAAAAAAAAAAAH/2gAMAwEAAhADEAAAAd2iUL//xAAUEAEAAAAAAAAAAAAAAAAAAAAQ/9oACAEBAAEFAn//xAAUEQEAAAAAAAAAAAAAAAAAAAAQ/9oACAEDAQE/AT//xAAUEQEAAAAAAAAAAAAAAAAAAAAQ/9oACAECAQE/AT//xAAUEAEAAAAAAAAAAAAAAAAAAAAQ/9oACAEBAAY/An//xAAZEAACAwEAAAAAAAAAAAAAAAABEQAQITH/2gAIAQEAAT8hLYXJtf/aAAwDAQACAAMAAAAQjA//xAAVEQEBAAAAAAAAAAAAAAAAAAAQEf/aAAgBAwEBPxCH/8QAFREBAQAAAAAAAAAAAAAAAAAAEBH/2gAIAQIBAT8Qp//EABgQAQADAQAAAAAAAAAAAAAAAAEAEEGR/9oACAEBAAE/EA2QaIGk5X//2Q==","aspectRatio":2.931297709923664,"src":"/static/2d7a464f2cd7672fcfe40db9b684392c/d8255/react.jpg","sizes":"(max-width: 1920px) 100vw, 1920px"},"id":"6fe7b4ca-c8c0-5a21-90a3-21fc513f087b"}}},"fields":{"slug":"/blog/react/react_20200412/"},"timeToRead":6,"excerpt":"React Basic - (8) 정리 Food 예제 다양한 객체 선언 방식 map() 함수를 통해 배열을 다른 형태로 바꾸는 다양한 방식 새로운 배열 생성 => map 내부에 arrow function 선언 새로운 배열 생성 => map…"}},{"node":{"id":"e119e6ad-e5f0-5477-bfba-fbdced635ddb","frontmatter":{"title":"[React] React Project 1 - ToDo List ","date":"2020-04-10T00:00:00.000Z","categories":["web","react"],"image":{"publicURL":"/static/react-2d7a464f2cd7672fcfe40db9b684392c.jpg","childImageSharp":{"fluid":{"srcSet":"/static/2d7a464f2cd7672fcfe40db9b684392c/9104c/react.jpg 480w,\n/static/2d7a464f2cd7672fcfe40db9b684392c/a6352/react.jpg 960w,\n/static/2d7a464f2cd7672fcfe40db9b684392c/d8255/react.jpg 1920w","base64":"data:image/jpeg;base64,/9j/2wBDABALDA4MChAODQ4SERATGCgaGBYWGDEjJR0oOjM9PDkzODdASFxOQERXRTc4UG1RV19iZ2hnPk1xeXBkeFxlZ2P/2wBDARESEhgVGC8aGi9jQjhCY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2P/wgARCAAHABQDASIAAhEBAxEB/8QAFgABAQEAAAAAAAAAAAAAAAAAAAEF/8QAFQEBAQAAAAAAAAAAAAAAAAAAAAH/2gAMAwEAAhADEAAAAd2iUL//xAAUEAEAAAAAAAAAAAAAAAAAAAAQ/9oACAEBAAEFAn//xAAUEQEAAAAAAAAAAAAAAAAAAAAQ/9oACAEDAQE/AT//xAAUEQEAAAAAAAAAAAAAAAAAAAAQ/9oACAECAQE/AT//xAAUEAEAAAAAAAAAAAAAAAAAAAAQ/9oACAEBAAY/An//xAAZEAACAwEAAAAAAAAAAAAAAAABEQAQITH/2gAIAQEAAT8hLYXJtf/aAAwDAQACAAMAAAAQjA//xAAVEQEBAAAAAAAAAAAAAAAAAAAQEf/aAAgBAwEBPxCH/8QAFREBAQAAAAAAAAAAAAAAAAAAEBH/2gAIAQIBAT8Qp//EABgQAQADAQAAAAAAAAAAAAAAAAEAEEGR/9oACAEBAAE/EA2QaIGk5X//2Q==","aspectRatio":2.931297709923664,"src":"/static/2d7a464f2cd7672fcfe40db9b684392c/d8255/react.jpg","sizes":"(max-width: 1920px) 100vw, 1920px"},"id":"6fe7b4ca-c8c0-5a21-90a3-21fc513f087b"}}},"fields":{"slug":"/blog/react/react_20200410/"},"timeToRead":5,"excerpt":"React Project 1 - ToDo List Intro React를 이용해 간단한 Todo-List 페이지를 만들어 보았다. 결과 화면은 다음과 같다. 1 참고 : Velopert님의 React…"}},{"node":{"id":"a47f9e99-4d32-5494-9ce6-adcebe3e5839","frontmatter":{"title":"[BlockChain] 돈은 빚이다 ","date":"2020-04-03T00:00:00.000Z","categories":["blockchain"],"image":{"publicURL":"/static/block-9aadf731fdd290bca8d4b31647da8120.jpg","childImageSharp":{"fluid":{"srcSet":"/static/9aadf731fdd290bca8d4b31647da8120/9104c/block.jpg 480w,\n/static/9aadf731fdd290bca8d4b31647da8120/a6352/block.jpg 960w,\n/static/9aadf731fdd290bca8d4b31647da8120/8f6c5/block.jpg 1198w","base64":"data:image/jpeg;base64,/9j/2wBDABALDA4MChAODQ4SERATGCgaGBYWGDEjJR0oOjM9PDkzODdASFxOQERXRTc4UG1RV19iZ2hnPk1xeXBkeFxlZ2P/2wBDARESEhgVGC8aGi9jQjhCY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2P/wgARCAAIABQDASIAAhEBAxEB/8QAFwABAAMAAAAAAAAAAAAAAAAAAAECBf/EABUBAQEAAAAAAAAAAAAAAAAAAAAB/9oADAMBAAIQAxAAAAHcgS4X/8QAFxAAAwEAAAAAAAAAAAAAAAAAAQIQMf/aAAgBAQABBQJoM//EABQRAQAAAAAAAAAAAAAAAAAAABD/2gAIAQMBAT8BP//EABQRAQAAAAAAAAAAAAAAAAAAABD/2gAIAQIBAT8BP//EABYQAAMAAAAAAAAAAAAAAAAAAAAQIf/aAAgBAQAGPwJU/8QAGRAAAgMBAAAAAAAAAAAAAAAAAREAIUFR/9oACAEBAAE/IWRZQ6IHl1sZNT//2gAMAwEAAgADAAAAEAvP/8QAFREBAQAAAAAAAAAAAAAAAAAAEEH/2gAIAQMBAT8Qp//EABURAQEAAAAAAAAAAAAAAAAAABBB/9oACAECAQE/EIf/xAAZEAEAAwEBAAAAAAAAAAAAAAABABEhQbH/2gAIAQEAAT8QYxMwFRioqTVFZfs5jO1P/9k=","aspectRatio":2.396,"src":"/static/9aadf731fdd290bca8d4b31647da8120/8f6c5/block.jpg","sizes":"(max-width: 1198px) 100vw, 1198px"},"id":"0248a7eb-8ca9-5627-921a-2d08f2a6546d"}}},"fields":{"slug":"/blog/blockchain/bc_20200403/"},"timeToRead":2,"excerpt":"EBS 다큐프라임 자본주의 : 돈은 빚이다 자본주의는 자유 시장 체제이다 (Free Market System) 용어 정리 지급준비율(payment reserve ratio) : 은행이 예금 고객에게 줄 돈으로 쌓아 둬야 하는 비율 뱅크런(bank…"}},{"node":{"id":"1acd927f-c338-58af-9890-ce8cc23ed28c","frontmatter":{"title":"[BlockChain] 돈의 개념 ","date":"2020-03-27T00:00:00.000Z","categories":["blockchain"],"image":{"publicURL":"/static/block-9aadf731fdd290bca8d4b31647da8120.jpg","childImageSharp":{"fluid":{"srcSet":"/static/9aadf731fdd290bca8d4b31647da8120/9104c/block.jpg 480w,\n/static/9aadf731fdd290bca8d4b31647da8120/a6352/block.jpg 960w,\n/static/9aadf731fdd290bca8d4b31647da8120/8f6c5/block.jpg 1198w","base64":"data:image/jpeg;base64,/9j/2wBDABALDA4MChAODQ4SERATGCgaGBYWGDEjJR0oOjM9PDkzODdASFxOQERXRTc4UG1RV19iZ2hnPk1xeXBkeFxlZ2P/2wBDARESEhgVGC8aGi9jQjhCY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2P/wgARCAAIABQDASIAAhEBAxEB/8QAFwABAAMAAAAAAAAAAAAAAAAAAAECBf/EABUBAQEAAAAAAAAAAAAAAAAAAAAB/9oADAMBAAIQAxAAAAHcgS4X/8QAFxAAAwEAAAAAAAAAAAAAAAAAAQIQMf/aAAgBAQABBQJoM//EABQRAQAAAAAAAAAAAAAAAAAAABD/2gAIAQMBAT8BP//EABQRAQAAAAAAAAAAAAAAAAAAABD/2gAIAQIBAT8BP//EABYQAAMAAAAAAAAAAAAAAAAAAAAQIf/aAAgBAQAGPwJU/8QAGRAAAgMBAAAAAAAAAAAAAAAAAREAIUFR/9oACAEBAAE/IWRZQ6IHl1sZNT//2gAMAwEAAgADAAAAEAvP/8QAFREBAQAAAAAAAAAAAAAAAAAAEEH/2gAIAQMBAT8Qp//EABURAQEAAAAAAAAAAAAAAAAAABBB/9oACAECAQE/EIf/xAAZEAEAAwEBAAAAAAAAAAAAAAABABEhQbH/2gAIAQEAAT8QYxMwFRioqTVFZfs5jO1P/9k=","aspectRatio":2.396,"src":"/static/9aadf731fdd290bca8d4b31647da8120/8f6c5/block.jpg","sizes":"(max-width: 1198px) 100vw, 1198px"},"id":"0248a7eb-8ca9-5627-921a-2d08f2a6546d"}}},"fields":{"slug":"/blog/blockchain/bc_20200327/"},"timeToRead":3,"excerpt":"돈의 개념 돈은 신용이다. 돈은 실물화폐가 아니라 신용화폐에 가깝다. A가 돈을 B에게 보내면, 그 돈이 실제로 B에게 보내지는 것이 아니다. 단지 돈이 B…"}},{"node":{"id":"93386ab9-39de-51e3-a4f8-caebf0494d30","frontmatter":{"title":"React Basic - (7) 데이터 필터링 ","date":"2020-03-21T00:00:00.000Z","categories":["web","react"],"image":{"publicURL":"/static/react-2d7a464f2cd7672fcfe40db9b684392c.jpg","childImageSharp":{"fluid":{"srcSet":"/static/2d7a464f2cd7672fcfe40db9b684392c/9104c/react.jpg 480w,\n/static/2d7a464f2cd7672fcfe40db9b684392c/a6352/react.jpg 960w,\n/static/2d7a464f2cd7672fcfe40db9b684392c/d8255/react.jpg 1920w","base64":"data:image/jpeg;base64,/9j/2wBDABALDA4MChAODQ4SERATGCgaGBYWGDEjJR0oOjM9PDkzODdASFxOQERXRTc4UG1RV19iZ2hnPk1xeXBkeFxlZ2P/2wBDARESEhgVGC8aGi9jQjhCY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2P/wgARCAAHABQDASIAAhEBAxEB/8QAFgABAQEAAAAAAAAAAAAAAAAAAAEF/8QAFQEBAQAAAAAAAAAAAAAAAAAAAAH/2gAMAwEAAhADEAAAAd2iUL//xAAUEAEAAAAAAAAAAAAAAAAAAAAQ/9oACAEBAAEFAn//xAAUEQEAAAAAAAAAAAAAAAAAAAAQ/9oACAEDAQE/AT//xAAUEQEAAAAAAAAAAAAAAAAAAAAQ/9oACAECAQE/AT//xAAUEAEAAAAAAAAAAAAAAAAAAAAQ/9oACAEBAAY/An//xAAZEAACAwEAAAAAAAAAAAAAAAABEQAQITH/2gAIAQEAAT8hLYXJtf/aAAwDAQACAAMAAAAQjA//xAAVEQEBAAAAAAAAAAAAAAAAAAAQEf/aAAgBAwEBPxCH/8QAFREBAQAAAAAAAAAAAAAAAAAAEBH/2gAIAQIBAT8Qp//EABgQAQADAQAAAAAAAAAAAAAAAAEAEEGR/9oACAEBAAE/EA2QaIGk5X//2Q==","aspectRatio":2.931297709923664,"src":"/static/2d7a464f2cd7672fcfe40db9b684392c/d8255/react.jpg","sizes":"(max-width: 1920px) 100vw, 1920px"},"id":"6fe7b4ca-c8c0-5a21-90a3-21fc513f087b"}}},"fields":{"slug":"/blog/react/react_20200321/"},"timeToRead":6,"excerpt":"React Basic - (7) 데이터 필터링 데이터 필터링 구현하기 App.js에 input을 할당하고, input값에 따라 데이터를 필터링하는 예제 App.js onChange 이벤트로 인한 자식 컴포넌트의 불필요한 rendering 이슈 App…"}},{"node":{"id":"29019e9c-9bfc-571c-b753-236a2afeb4d3","frontmatter":{"title":"[Algorithm] 백준 1753 : 최단 경로 ","date":"2020-03-20T00:00:00.000Z","categories":["algorithm"],"image":{"publicURL":"/static/algorithm-0fe6e5b78f08d815169fa54b25acc5a6.jpg","childImageSharp":{"fluid":{"srcSet":"/static/0fe6e5b78f08d815169fa54b25acc5a6/9104c/algorithm.jpg 480w,\n/static/0fe6e5b78f08d815169fa54b25acc5a6/a6352/algorithm.jpg 960w,\n/static/0fe6e5b78f08d815169fa54b25acc5a6/37d86/algorithm.jpg 1500w","base64":"data:image/jpeg;base64,/9j/2wBDABALDA4MChAODQ4SERATGCgaGBYWGDEjJR0oOjM9PDkzODdASFxOQERXRTc4UG1RV19iZ2hnPk1xeXBkeFxlZ2P/2wBDARESEhgVGC8aGi9jQjhCY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2P/wgARCAAMABQDASIAAhEBAxEB/8QAGAAAAgMAAAAAAAAAAAAAAAAAAAECAwX/xAAUAQEAAAAAAAAAAAAAAAAAAAAA/9oADAMBAAIQAxAAAAHehYhgH//EABcQAAMBAAAAAAAAAAAAAAAAAAABESD/2gAIAQEAAQUCFc//xAAUEQEAAAAAAAAAAAAAAAAAAAAQ/9oACAEDAQE/AT//xAAUEQEAAAAAAAAAAAAAAAAAAAAQ/9oACAECAQE/AT//xAAUEAEAAAAAAAAAAAAAAAAAAAAg/9oACAEBAAY/Al//xAAXEAEBAQEAAAAAAAAAAAAAAAABEQAQ/9oACAEBAAE/IVc6a2ccE5//2gAMAwEAAgADAAAAEATP/8QAFBEBAAAAAAAAAAAAAAAAAAAAEP/aAAgBAwEBPxA//8QAFBEBAAAAAAAAAAAAAAAAAAAAEP/aAAgBAgEBPxA//8QAGxABAAMBAAMAAAAAAAAAAAAAAQARIVFBkbH/2gAIAQEAAT8QJdcwlIoAtCt8nyDmwCQUh2/cMJ//2Q==","aspectRatio":1.6910935738444195,"src":"/static/0fe6e5b78f08d815169fa54b25acc5a6/37d86/algorithm.jpg","sizes":"(max-width: 1500px) 100vw, 1500px"},"id":"31a583cd-3eb7-530d-a804-27574b652e6b"}}},"fields":{"slug":"/blog/algorithm/algo_20200320_1/"},"timeToRead":2,"excerpt":"방향 그래프에서, 시작 노드에서 다른 모든 노드로 가는 Shortest Path 구하기. (Dijkstra) image…"}},{"node":{"id":"59cbba13-c697-54d3-9d99-aed6640768f0","frontmatter":{"title":"[Algorithm] 백준 1238 : 파티 ","date":"2020-03-20T00:00:00.000Z","categories":["algorithm"],"image":{"publicURL":"/static/algorithm-0fe6e5b78f08d815169fa54b25acc5a6.jpg","childImageSharp":{"fluid":{"srcSet":"/static/0fe6e5b78f08d815169fa54b25acc5a6/9104c/algorithm.jpg 480w,\n/static/0fe6e5b78f08d815169fa54b25acc5a6/a6352/algorithm.jpg 960w,\n/static/0fe6e5b78f08d815169fa54b25acc5a6/37d86/algorithm.jpg 1500w","base64":"data:image/jpeg;base64,/9j/2wBDABALDA4MChAODQ4SERATGCgaGBYWGDEjJR0oOjM9PDkzODdASFxOQERXRTc4UG1RV19iZ2hnPk1xeXBkeFxlZ2P/2wBDARESEhgVGC8aGi9jQjhCY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2P/wgARCAAMABQDASIAAhEBAxEB/8QAGAAAAgMAAAAAAAAAAAAAAAAAAAECAwX/xAAUAQEAAAAAAAAAAAAAAAAAAAAA/9oADAMBAAIQAxAAAAHehYhgH//EABcQAAMBAAAAAAAAAAAAAAAAAAABESD/2gAIAQEAAQUCFc//xAAUEQEAAAAAAAAAAAAAAAAAAAAQ/9oACAEDAQE/AT//xAAUEQEAAAAAAAAAAAAAAAAAAAAQ/9oACAECAQE/AT//xAAUEAEAAAAAAAAAAAAAAAAAAAAg/9oACAEBAAY/Al//xAAXEAEBAQEAAAAAAAAAAAAAAAABEQAQ/9oACAEBAAE/IVc6a2ccE5//2gAMAwEAAgADAAAAEATP/8QAFBEBAAAAAAAAAAAAAAAAAAAAEP/aAAgBAwEBPxA//8QAFBEBAAAAAAAAAAAAAAAAAAAAEP/aAAgBAgEBPxA//8QAGxABAAMBAAMAAAAAAAAAAAAAAQARIVFBkbH/2gAIAQEAAT8QJdcwlIoAtCt8nyDmwCQUh2/cMJ//2Q==","aspectRatio":1.6910935738444195,"src":"/static/0fe6e5b78f08d815169fa54b25acc5a6/37d86/algorithm.jpg","sizes":"(max-width: 1500px) 100vw, 1500px"},"id":"31a583cd-3eb7-530d-a804-27574b652e6b"}}},"fields":{"slug":"/blog/algorithm/algo_20200320_2/"},"timeToRead":2,"excerpt":"image 백준 1238 파티 문제 정의 : Directed Graph에서, 모든 노드에 대해 X에 방문했다가 다시 돌아오는 경로의 최소 비용을 구하라. (1) 모든 노드에서 X로 가는 최소 비용 +\n(2) X…"}},{"node":{"id":"ee34d353-7314-5f9c-861f-eaffdf8c0fa7","frontmatter":{"title":"[Algorithm] 백준 4485 : 녹색 옷 입은 애가 젤다지?  ","date":"2020-03-20T00:00:00.000Z","categories":["algorithm"],"image":{"publicURL":"/static/algorithm-0fe6e5b78f08d815169fa54b25acc5a6.jpg","childImageSharp":{"fluid":{"srcSet":"/static/0fe6e5b78f08d815169fa54b25acc5a6/9104c/algorithm.jpg 480w,\n/static/0fe6e5b78f08d815169fa54b25acc5a6/a6352/algorithm.jpg 960w,\n/static/0fe6e5b78f08d815169fa54b25acc5a6/37d86/algorithm.jpg 1500w","base64":"data:image/jpeg;base64,/9j/2wBDABALDA4MChAODQ4SERATGCgaGBYWGDEjJR0oOjM9PDkzODdASFxOQERXRTc4UG1RV19iZ2hnPk1xeXBkeFxlZ2P/2wBDARESEhgVGC8aGi9jQjhCY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2P/wgARCAAMABQDASIAAhEBAxEB/8QAGAAAAgMAAAAAAAAAAAAAAAAAAAECAwX/xAAUAQEAAAAAAAAAAAAAAAAAAAAA/9oADAMBAAIQAxAAAAHehYhgH//EABcQAAMBAAAAAAAAAAAAAAAAAAABESD/2gAIAQEAAQUCFc//xAAUEQEAAAAAAAAAAAAAAAAAAAAQ/9oACAEDAQE/AT//xAAUEQEAAAAAAAAAAAAAAAAAAAAQ/9oACAECAQE/AT//xAAUEAEAAAAAAAAAAAAAAAAAAAAg/9oACAEBAAY/Al//xAAXEAEBAQEAAAAAAAAAAAAAAAABEQAQ/9oACAEBAAE/IVc6a2ccE5//2gAMAwEAAgADAAAAEATP/8QAFBEBAAAAAAAAAAAAAAAAAAAAEP/aAAgBAwEBPxA//8QAFBEBAAAAAAAAAAAAAAAAAAAAEP/aAAgBAgEBPxA//8QAGxABAAMBAAMAAAAAAAAAAAAAAQARIVFBkbH/2gAIAQEAAT8QJdcwlIoAtCt8nyDmwCQUh2/cMJ//2Q==","aspectRatio":1.6910935738444195,"src":"/static/0fe6e5b78f08d815169fa54b25acc5a6/37d86/algorithm.jpg","sizes":"(max-width: 1500px) 100vw, 1500px"},"id":"31a583cd-3eb7-530d-a804-27574b652e6b"}}},"fields":{"slug":"/blog/algorithm/algo_20200320_3/"},"timeToRead":2,"excerpt":"image 문제 정의 : (N*N)크기의 행렬에서, (0,0)->(N-1,N-1)로 이동하는 데 드는 최소 비용 구하기. 한 정점에서 인접한 다른 정점으로 가는 최소 비용을 구한 후, d값이 갱신될 때에만 Priority Queue에 추가한다. d…"}},{"node":{"id":"55ef446d-2e09-54c8-bdfd-35a0a9f61bc7","frontmatter":{"title":"[Algorithm] 백준 1719 : 택배 ","date":"2020-03-20T00:00:00.000Z","categories":["algorithm"],"image":{"publicURL":"/static/algorithm-0fe6e5b78f08d815169fa54b25acc5a6.jpg","childImageSharp":{"fluid":{"srcSet":"/static/0fe6e5b78f08d815169fa54b25acc5a6/9104c/algorithm.jpg 480w,\n/static/0fe6e5b78f08d815169fa54b25acc5a6/a6352/algorithm.jpg 960w,\n/static/0fe6e5b78f08d815169fa54b25acc5a6/37d86/algorithm.jpg 1500w","base64":"data:image/jpeg;base64,/9j/2wBDABALDA4MChAODQ4SERATGCgaGBYWGDEjJR0oOjM9PDkzODdASFxOQERXRTc4UG1RV19iZ2hnPk1xeXBkeFxlZ2P/2wBDARESEhgVGC8aGi9jQjhCY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2NjY2P/wgARCAAMABQDASIAAhEBAxEB/8QAGAAAAgMAAAAAAAAAAAAAAAAAAAECAwX/xAAUAQEAAAAAAAAAAAAAAAAAAAAA/9oADAMBAAIQAxAAAAHehYhgH//EABcQAAMBAAAAAAAAAAAAAAAAAAABESD/2gAIAQEAAQUCFc//xAAUEQEAAAAAAAAAAAAAAAAAAAAQ/9oACAEDAQE/AT//xAAUEQEAAAAAAAAAAAAAAAAAAAAQ/9oACAECAQE/AT//xAAUEAEAAAAAAAAAAAAAAAAAAAAg/9oACAEBAAY/Al//xAAXEAEBAQEAAAAAAAAAAAAAAAABEQAQ/9oACAEBAAE/IVc6a2ccE5//2gAMAwEAAgADAAAAEATP/8QAFBEBAAAAAAAAAAAAAAAAAAAAEP/aAAgBAwEBPxA//8QAFBEBAAAAAAAAAAAAAAAAAAAAEP/aAAgBAgEBPxA//8QAGxABAAMBAAMAAAAAAAAAAAAAAQARIVFBkbH/2gAIAQEAAT8QJdcwlIoAtCt8nyDmwCQUh2/cMJ//2Q==","aspectRatio":1.6910935738444195,"src":"/static/0fe6e5b78f08d815169fa54b25acc5a6/37d86/algorithm.jpg","sizes":"(max-width: 1500px) 100vw, 1500px"},"id":"31a583cd-3eb7-530d-a804-27574b652e6b"}}},"fields":{"slug":"/blog/algorithm/algo_20200320_4/"},"timeToRead":2,"excerpt":"image 문제 정의 : 모든 노드에서 다른 모든 노드로 가는 Shortest Path를 구할 때, 가장 처음 거쳐야 하는 노드를 구하여라. Dijkstra는 한 노드 -> 다른 노드로 이동하는 최소 비용이므로, 이를 전체 노드로 확장시켜서 d…"}}]}},"pageContext":{"limit":10,"skip":0,"numPages":3,"currentPage":1}}}