Comments by Member 12160712 (Top 16 by date)

Thank you! I know it's really bad and I'm trying to abstract it a bit because it is really hard to work with, I'm trying to construct a graph that's read from a text file and this is how I was asked to visualize it but yeah I'm working on abstracting it, Thanks!

I'm sorry but I have a question, what do you mean by the gethashkey function? I am not familiar with it in the c# language.

Sorry, I think I might have expressed myself wrongly... I am not actually reading the database via Linq, the database is stored in a text file. Its simplest format is:
movie 0/Z/A movie 1/A/B/C movie 2/D/E/A/B .....etc My problem is I don't know how to represent it in a way where I include the movies in the scenario. So far I was able to represent the actors and their neighbors or example A its neighbors are Z B C. Now I want to represent it that A and B are neighbors not only because there is an edge between them but because there are 3 different edges between them (i.e movie 1, movie 2, movie 7). page 22 in this link http://www.cs.princeton.edu/courses/archive/spring07/cos126/lectures/18.pdf kind of visualize how to draw it on paper but I don't know how to translate this in the form of a data structure, like from what I gathered it made the movies and the performers as nodes, which I can't fully understand.

Yes, thank you that would be great to see an example for it. And to answer your question if it's necessary I am not sure to be honest like at first I only made my graph as a standard adjacency list by using standard .Net Generic data-structures too with only nodes of actors and if 2 actors appeared in the same movie then there would be en edge between them, but now the problem is what if they appeared in more than one movie how to represent that in order to apply BFS on them that will show that there are 3 shortest paths movie1, movie 2, movie 7?

Yeah, you did understand it! I will try to think again of how to represent my graph, Thank you!

I'm sorry if I was a bit vague... No, what I meant is that I applied the Breadth first search algorithm to calculate the shortest path between each 2 actors, but now my problem is another 2 functions first a function called Relation Strength: If Actor A and actor B are directly linked with a degree of separation equal 1. The relation strength between them is three movies since they are directly appeared together in the three movies.
If Actor C and actor E are linked with a degree of separation equal 2 through either actor A, actor B or actor D. The relation strength should equal the max of the three options. The second function is to show this path, so in the situation for ActorA and Actor B, the path should be either movie0, movie1, movie7. So, now I would like to represent the graph while including the movies but I don't know how, so that's why I thought of the bipartite graph.

Check the edit :)

Yeah, you're right, it didn't work on my code as much as I wanted to and it could get confusing and messy on a bigger scale, hence I think hashset is the easiest and most reasonable answer to my question, like I have been trying for days and making lots of function to check but I never really thought of changing the type list to a Hashset so thank you, it worked perfectly!

I am not sure I understand your question, have you misspelled any of the values of the array or the string value, there is no match in the array with the value!

No, I meant what you said second is that for anytime I add a new string to a certain key for eg "A" its values mustn't have duplicates i.e(B,C,C,D) I need it to be (B,C,D) And I think that the hashset was the answer to it as suggested by PIEBaldconsult. Thank you!

Thank you so much!