Hello Daniweb, As my title, I have a problem in my gnuplot. I can set the minimum range based on my file.. but doing the maximum range it give a wrong output for min and max yrange. I been searching for net and tried there solutions but it won't work for me. This is my script line for me yrange: `set yrange [*:35] noreverse nowriteback` `#set yrange [*:*] noreverse nowriteback` The first line is working, but to get the best graphical image is getting the min max of the data. The second line is not working, as I see that … +0 what are the rules of graph construction and using the example: S::= A/B A::=XA/Y B::=XB/Z +0 I need to write an algorithm for finding the maximum weighted independent set of a graph, G. Any idea of where I should start? +0 I have an assignment on the data structures directed graph and I have got this question but I did not understood what exactly it needs Here's the question : There is a list of nodes and edges like A B B C D E F B The first line says that there is a link from a node called "A" to a node called 'B". This means for a A to be a useable, it relies on the resource B. Write a program that should work with any amount of nodes and any amount of links between them. Where you … +0 So I need help asap. I can't figure out how to modify code from my book to work with my problem. I'm givin an input file, the first value is the dimension of an n x n matrix. every value after is a weight for each vertice for the matrix. I'm unable to insert edges into an adjacency list properly. input is as follows: 4 1 -2 3 2 2 2 2 1 2 1 2 1 -3 3 2 0 Initially moves are vertical and horizontal. when you land on negative moves turn to diagonal. goal is to reach … +0 I get an infinite loop when i input 1 and 5 in this program. Please help me detect the error. using System; using System.Collections.Generic; using System.Linq; using System.Text; namespace Graphs { class Program { static void Main(string[] args) { string[] cities = new string[10] { "Makati City", "Taguig City", "Imus City", "DasmariĆ±as City", "Tagaytay City", "ParaĆ±aque City", "Muntinlupa City", "Sta. Rosa City", "Calamba City", "Tanauan City" }; int[,] mapGraph = new int[10, 10] { {0,1,0,0,0,0,0,0,0,0 }, {1,0,1,0,0,1,0,0,0,0 }, {0,1,0,1,0,0,0,0,0,0 }, {0,0,1,0,0,0,0,0,0,0 }, {0,0,0,1,0,0,0,1,0,0 }, {0,1,0,0,0,0,1,0,0,0 }, {0,0,0,0,0,1,0,1,0,0 }, {0,0,0,0,1,0,1,0,1,0 }, {0,0,0,0,0,0,0,1,0,1 }, {0,0,0,0,0,0,0,0,1,0 } }; int source = 0, destinaton … +0

The End.