Generated by Rank Math SEO, this is an llms.txt file designed to help LLMs better understand and index this website. # La Vivien Post: Ai and Coding animations ## Sitemaps [XML Sitemap](https://www.lavivienpost.net/sitemap_index.xml): Includes all crawlable and indexable pages. ## Posts - [Sketch to animation using sketch metademolab](https://www.lavivienpost.net/sketch-to-animation-using-sketch-metademolab/): How to animate drawings using sketch metademolab?1. Prepare a drawing of a character in a natural standing pose. A photo or a painting of a person probably would not work.2. Go to https://sketch.metademolab.com/, click "Get Started " button.3. Click "Upload Photo" button. Select the prepared character image from your local machine. Click "Next".4. Click "Agree" button at "Term of Service" page. 5. Adjust the area of your character. Click "Next".6. Click "Next" to use default in pages.7. You can see your character is running.8. Select other animation to apply to your character. Download the animation. - [Merge sort gif | code and visuals](https://www.lavivienpost.net/merge-sort-gif/): Merge sort uses the divide and conquer technique to provide fast and stable sorting. Divide-and-conquer is a technique that works by recursively breaking down a problem into two or more sub-problems of the same or related type until these become simple enough to be solved directly. This merge sort gif uses animation to demonstrate how merge sort works. - [Lip Sync using Wav2lip](https://www.lavivienpost.net/lip-sync-using-wav2lip/): Face animation using Ai model - [Install ControlNet ComfyUI](https://www.lavivienpost.net/install-controlnet-comfyui/): Click to enlarge - [Quick sort gif | Code and visuals](https://www.lavivienpost.net/quick-sort-gif/): Quicksort uses the divide and conquer technique to provide fast sorting. Divide-and-conquer is a technique works by recursively breaking down a problem into two or more sub-problems of the same or related type, until these become simple enough to be solved directly. The quick sort gif uses animation to explain how quicksort works. - [Max heap implementation](https://www.lavivienpost.net/max-heap-implementation/): A max-heap is a complete binary tree, where all levels, except the last level, are completely filled. There is no "hole" in the tree. A max-heap should also meet these criteria: the parent’s value is larger than both children’s values in a sub-tree. The largest value of the heap is at the root. The heap is usually related to the priority queue and heapsort. - [Weighted graph as adjacency list](https://www.lavivienpost.net/weighted-graph-as-adjacency-list/): A graph is a data structure that consists of a set of nodes connected by edges. Graphs are used to simulate many real-world problems, such as routes in cities, circuit networks, and social networks. This is graph implementation part 2 - weighted graph as an adjacency list. - [Fix Faces using Inpaint of Stable Diffusion Webui](https://www.lavivienpost.net/fix-faces-using-inpaint-of-stable-diffusion-webui/): Click to enlarge - [Insertion sort gif | code and visuals](https://www.lavivienpost.net/insertion-sort-gif/): Insertion Sort gif uses animation to explain insertion sort, which repeatedly removes an element from the input data and inserts it into the position so that its value is between the previous and the next element. It works the way we sort when playing cards. - [Bubble sort gif](https://www.lavivienpost.net/bubble-sort-gif/): Bubble sort compares adjacent elements and swaps them if they are in the wrong order. The implementation uses two nested for loop to check two numbers in an array. The optimized solution uses a flag to skip the remaining passes. The bubble sort gif uses animations to explains the process. - [Selection sort gif | code and visuals](https://www.lavivienpost.net/selection-sort-gif/): Selection sort gif uses animations to explain selection sort, which repeatedly finds the minimum element from the unsorted part and puts it at the beginning. - [Install ComfyUI on Windows](https://www.lavivienpost.net/install-comfyui-on-windows/): Click to enlarge - [Replace Faces with Roop Stable Diffusion Webui](https://www.lavivienpost.net/replace-faces-with-roop-stable-diffusion-webui/): What is Roop stable diffusion?Roop is an Ai software to replace faces in your images or videos with another face. Here are the links of the original software in github and installation guide for Stable Diffusion webui. How to replace faces with Roop Stable Diffusion Webui?1. If you don't have Stable Diffusion Webui installed, go to Install stable diffusion webui on Windows.2. Go to Visual studio download page. Select community and click Free download. Run the installer. Select three elements to install: Python development, desktop c++, and visual studio extension development.3. Go to directory "stable-diffusion-webui\venv." If you don't see "insightface" folder, open dos command and run $pip install insightface==0.7.3.4. Open Stable Diffusion Webui, click Extension tab and click Load From. Search for roop and click Install. 5. If you see "401: Unauthorized" error, download inswapper_128.onnx from huggingface or Google drive. Copy inswapper_128.onnx  to /models/roop/.6. Restart Stable Diffusion Webui. Select a checkpoint, such as "realisticVisionV30_v30VAE" (Note some checkpoints such as "sd_xl_base_1.0" may not work.)7. In img2img tab, enter your prompt. Load a picture with a face. Decrease denoising strength to 0.1. 8. Expand Roop v0.02 underneath, load an image with another face. Check "Enable". 9. Click Generate button. - [Heapsort gif – how heapify works](https://www.lavivienpost.net/heapsort-gif/): Heapsort is a fast sorting method based on heap data structure. - [Image to video using AnimateLCM in ComfyUI](https://www.lavivienpost.net/image-to-video-using-animatelcm-in-comfyui/): How to turn image to video using AnimateDiff in ComfyUI?1. If you haven’t installed ComfyUI, go to Install ComfyUI on Windows.2. If you haven’t installed IPAdapter for ComfyUI, go to install IPAdapter in ComfyUI.3. If you haven't installed AnimateDiff for ComfyUI, go to install AnimateDiff-Evolved in ComfyUI.4. Go to huggingface AnimateLCM to download "AnimateLCM_sd15_t2v.ckpt" and put it at "ComfyUI\custom_nodes\ComfyUI-AnimateDiff-Evolved\models." Also download "AnimateLCM_sd15_t2v_lora.safetensors" and put at "ComfyUI\models\loras."5. Go to huggingface animatediff to download motion modules such as "v3_sd15_dapater.ckpt" and put it at "ComfyUI\models\loras."6. Run “run_nvidia_gpu.bat” or “run_cpu.bat” to open ComfyUI in a browser at http://127.0.0.1:8188/.7. Download comfyui_animatelcm.json This is the the script to run the workflow. Drag the json file to your ComfyUI in the browser.8. In the Load Checkpoint node, select a checkpoint which compatible with sd1.5 in your “ComfyUI\models\checkpoints” directory.9. In the Load Image  node, upload a photo with trees, lakes or ocean, fire, woman's long hair. Write a prompt to describe the image.10. Click Queue Prompt button to run the workflow. Monitor the progress in the ComfyUI console.11. When it finishes, the output videos are showing at Video Combine nodes. - [Install AnimateDiff-Evolved in ComfyUI](https://www.lavivienpost.net/install-animatediff-evolved-in-comfyui/): Click to enlarge - [Install AnimateDiff in ComfyUI](https://www.lavivienpost.net/install-animatediff-in-comfyui/): Click to enlarge - [Install IPAdapter in ComfyUI](https://www.lavivienpost.net/install-ipadapter-in-comfyui/): Click to enlarge - [Priority queue implementation using an unordered array – Priority queue 1](https://www.lavivienpost.net/priority-queue-implementation-using-array/): A priority queue is a queue in which we insert an element at the back (enqueue) and remove an element from the front (dequeue). The element with the highest priority shall be dequeued first. This priority queue implementation provides code to implement a priority queue using an unordered array, in which the time complexity of enqueue is O(1), and that of dequeue is O(n).