HOME > RSS Feeds > Code Examples Add To:
Bipartite Graphs The economic crisis is upon us. You hear from radio, newspaper and television that we need to hold the line. You can no longer waste any of your time and money, because otherwise, the bankruptcy of your company is almost certain. In these harsh times, every little cent you can save is worth a fortune. If you have a company with various employees that can work in multiple places, but their production depends on what they are doing, and you want to maximize the company's productivity, you've come to the right place. This is the conclusion of a thirteen-part series that shows you how to use graphs and algorithms to solve everyday problems. Connectivity in Graphs Think outside the box. This is the motto for today. Today, using graphs, we will find out how much of a threat just the elimination of a military base poses to us. For a precise calculation of this, we will use the Ford-Fulkerson algorithm and modify it for our needs by using the motto of the day. This article is the twelfth part of a thirteen-part series that shows how to use graphs and algorithms to solve everyday problems. The Ford-Fulkerson Algorithm The world is full of problems. Everything around us works to cause or solve some problems for us. Solving problems is a daily necessity. Of course, we deal with problems that directly relate to us. An issue like this is the flow problem inside a flow network, so how do we solve it? The answer is “The Ford-Fulkerson algorithm,” and finding out just how it works will be our goal today. Critical Paths Keep it simple, as long as it still works. This should be the main guiding motto of everyone in the world. If you need to solve a problem that looks complicated, think of a method to simplify it, and resolve it with some simple and easy algorithm that everyone may comprehend if necessary. Thankfully, the critical path determination technique is based on this simple idea. The Bellman-Ford and Roy-Floyd Algorithms Everyone wants to get the most out of their investments. When you make a sacrifice and get yourself involved in something, then most of the time, you want in return every little drop you can stroke out of the situation. When you cannot influence this, it is time to find a way to invest/sacrifice only as much you absolutely need to. If your problem can be summed up as a graph, and the shortest path is your solution, then you came to the right place. This is the ninth article in a 13-part series on graphs and how they can be used for problem solving. Shortest Path Algorithms in Graphs I need more time. I do not have time for this. These are probably the two sentences that we use the most these days. It has often been observed that time is money -- and accomplishing a task in fewer steps can save time (and thus money). With graphs, this can be expressed as finding the shortest path, and has a number of practical applications. This eighth part of a 13-part article series on graphs takes a close look at ways to solve this common problem. Minimum Spanning Tree At some portions in our life we arrive at a situation where it is no longer enough to be average, or to perform at an average rate. In order to succeed we need to bring forth the best solution possible from the circumstances. If this means finding the shortest spanning tree inside something that may be represented as a graph, then you've come to the right place. Today, we are going to examine two techniques to achieve this: Kruskall’s and Prim’s. Articulation Edges and Vertexes In the lives of each of us there exist some key moments that uniquely define us and become symbolic. These are the critical points; without these, all that we know now would drastically change. Articulation edges and vertexes are something like this to graphs; however, finding them is a lot more complicated than it may seem at first. Circles and Connectivity in Graphs Search and you will find. At least this is what everybody says whenever you are lost and you do not know what to do. This is as true in life as it is in graph theory. Today we're going to search for some answers concerning strong connectivity and circles inside graphs. When all is said and done, we'll find another way to use graphs to solve some complex algorithm-related problems. This is the fifth part of a multi-part series. Depth-First Search in Graphs Anyone or anything that can search effectively will eventually make a major impact on its environment. For a prime example just look at Google -- from a simple search engine came one of the largest companies in the world of IT. So here, in this article, we will discuss a good search algorithm for graphs. What importance may it yield in the future? Breadth-First Search in Graphs Me, you and everyone is constantly searching for something: a new relationship, knowledge, music, food or just for a new experience. If we start to think about it, searching slowly becomes our second nature and takes up a good portion of our life, becoming a central motive for us. In the world of graphs, searching is just as important. Today we are going to examine the breadth-first search algorithm (BFS). The Prufer Code and the Floyd-Warshall Algorithm Graphs help solve many computer-related problems. They can show us the simplest way to present something, so that it takes up as little memory as possible. In this article, the second part of a multi-part series that covers graphs in detail, you will learn a very clever way to code and decode a tree. An Insight into Graphs An understanding of graphs can actually help simplify apparently difficult problems. They're a useful tool that belongs in every programmer's toolkit. In this introductory article, you will learn how graphs and programming relate to each other. Coding a Custom Object with WSC In the previous tutorial of this series we used the Windows Component Wizard to create our own custom COM object file. We told the wizard how we wanted it configured and it output the basic XML file for us. Now it’s time to put some code into that file. Creating a Custom Object with WSC In my last article I introduced the Windows Script Components technology as a means of creating your own custom COM objects without the need for high level programming or expensive development software. I also showed you how to build a basic object shell using nothing but a text editor and the scripting knowledge you already possess. Today, we’ll take all of that a step further and get our hands dirty creating a real, working object with all of the bells and whistles. Creating Useful Array Functions Visual Basic Scripting Edition doesn’t provide very good support for working with arrays. It has a very limited number of array functions, especially when compared to similar languages like JavaScript. In this article, I’m going to show you some custom functions you can add to your scripts that will give you the flexibility you might find in other languages. Binary File, Array Scripting Secrets It’s time for another installment of Nilpo’s Scripting Secrets. In the third edition of my series featuring insider scripting tips, you’ll learn how to write binary files in two different ways, a useful trick when working with arrays, and how to bring your scripts to life with sounds and spoken text. Today’s article is mostly about having fun! Writing Binary Data in WSH It’s been said over and over again that VBScript does not support the creation of binary files. There also aren’t any objects available to WSH that provide that support. In fact, Microsoft will swear that it’s true. If you don’t believe me, just read their documentation. In light of that defining argument, today I’ll be showing you not one, but two ways to do the impossible. Introducing Custom Objects with WSC If you’ve been scripting for more than a few minutes, you’ve undoubtedly used some form of COM object in your scripts. These are objects provided by the operating system and other applications that allow you to perform tasks that aren’t provided by the scripting environment. Most of these objects are compile code that resides in a DLL or OCX file somewhere. Most people believe that you have to have some level of advanced programming ability to create these objects for yourself. That’s not the case. Today I’m going to show you how to create custom COM objects using nothing more than the scripting knowledge you already possess. Implementing the CompressedFolder Class In today’s article I’ll be continuing my explanation of the custom CompressedFolder class that we created. We’ve already discussed all of the properties and methods that have been publicly exposed through the class’s object. Now we’ll look at the rest of the methods involved, as well as how to implement the class in your own scripts.