Leetcode: Graph Valid Tree

June 17, 2017

Introduction

Julia has to work hard on expert level algorithm, she plans to work on the algorithm called "Path Matching" in the week of code 33. Julia needs to find some topics to study in order to come out a working idea to solve partial the algorithm.

One of her studies is about network, n nodes with n - 1 edges, what implies to this graph? Julia likes to find path for any two nodes. What should be included for a good consideration before she comes out the idea to search a pattern.

Algorithm study 

One blog written in Chinese called grandyang is here.  It is now 9:15pm, Julia likes to go over the algorithm 15 minutes before she moves on to the Leetcode discussion session for broad discussion. 

Plan to study the code in the blog, and write a C# version. UnionFind using array is very good practice.