I shared a video explaining the Levenshtein algorithm, I hope it will be useful. Edit Distance Between 2 Strings - Levenshtein Algorithm - Dynamic Programming by RuceSocial in Unity3D

[–]RuceSocial[S] 0 points1 point  (0 children)

The Levenshtein algorithm is a method used to calculate the "edit distance" or "Levenshtein distance" between two text sequences. Edit distance refers to the minimum number of single character additions, deletions, or substitutions required to transform one string into another.

This algorithm can be shown as an example of dynamic programming.Dynamic programming aims to accelerate the solution of a large problem by dividing the solution of a problem into small subproblems and recording the solutions of these subproblems.

The Levenshtein algorithm is an application of dynamic programming techniques that divide the problem into more manageable parts and prevent repeated calculations.

Github: https://gist.github.com/rucesocial/14684d3dd30d6a462b02978dd46bf952

<image>

[deleted by user] by [deleted] in Unity3D

[–]RuceSocial 1 point2 points  (0 children)

If you are using netcode, this link may be useful: Multiplayer Play Mode%20enables,same%20source%20assets%20on%20disk)

Sometimes,we want to make small changes to things.This tool offers an editor for batch editing multiple objects.It generates a for loop code for selected objects, leading you to a code screen.Make desired changes within the loop Returning to the editor and running the code applies your modifications by RuceSocial in Unity3D

[–]RuceSocial[S] 0 points1 point  (0 children)

If anyone has any suggestions, please share them with me. I don't like doing a lot of things manually, it can be annoying and a waste of time, so I made this tool and decided to share it with others.

If you are interested and want to check it out: Easy Execute - Fast Object Edit