public void ChangeEdge()
{
var source = new Graph <IGraphEntity, IGraphEdge> ();
var sink = new Graph <IGraphEntity, IGraphEdge> ();
var subGraph = new SubGraph <IGraphEntity, IGraphEdge> (source, sink);
var one = new GraphEntity <string> ("1");
var two = new GraphEntity <string> ("2");
var three = new GraphEntity <string> ("3");
var link = new GraphEdge(one, two);
subGraph.Add(one);
subGraph.Add(two);
subGraph.Add(three);
subGraph.Add(link);
Assert.IsTrue(source.Contains(link), "source has to contain link");
Assert.IsTrue(sink.Contains(link), "sink has to contain link");
subGraph.ChangeEdge(link, three, true);
Assert.IsFalse(sink.Edges(one).Contains(link), "sink.Edges (one) has not to contain link");
Assert.IsFalse(source.Edges(one).Contains(link), "source.Edges (one) has not to contain link");
Assert.IsFalse(subGraph.Edges(one).Contains(link), "subGraph.Edges (one) has not to contain link");
}
public void ReadDescriptionTest()
{
IThing root = GetRoot();
if (root == null)
{
WriteDescriptionTest();
}
root = GetRoot();
ReportDetail("Reading");
this.Tickers.Start();
var schemaGraph = this.Graph as SchemaThingGraph;
var view = new SubGraph <IThing, ILink>(this.Graph, new Graph <IThing, ILink>());
var facade = new SubGraphWorker <IThing, ILink>(view);
view.Add(root);
var iCount = 0;
for (var i = 0; i < ReadCount; i++)
{
foreach (var thing in facade.Expand(new IThing[] { root }, false))
{
if (!(thing is ILink))
{
var thingToDisplay = schemaGraph.ThingToDisplay(thing);
iCount++;
}
}
}
ReportSummary(string.Format("Reads \t{0}\t({1} repeats)", iCount, ReadCount));
}
public override void NodeCreation(Graph g, NodeCreationInfo info = NodeCreationInfo.Empty)
{
int NUM_PEOPLE = traits["Population"];
int NUM_FAMILIES = traits["Population"] / 5;
int NUM_WORK_GROUPS = traits["Population"] / 200;
int NUM_FRIEND_GROUPS = traits["Population"] / 4;
List <PersonGroup> familyGroups = new List <PersonGroup>();
List <PersonGroup> workGroups = new List <PersonGroup>();
List <PersonGroup> friendGroups = new List <PersonGroup>();
Dictionary <Person, PersonGroup> familyPairs = new Dictionary <Person, PersonGroup>();
Dictionary <Person, PersonGroup> workPairs = new Dictionary <Person, PersonGroup>();
Dictionary <Person, (PersonGroup, PersonGroup)> friendPairs = new Dictionary <Person, (PersonGroup, PersonGroup)>();
for (int i = 0; i < NUM_PEOPLE; i++)
{
Person p = new Person();
p.Name = i.ToString();
p.NodeCreation(SubGraph, NodeCreationInfo.SystemStart);
SubGraph.Add(p);
}
for (int i = 0; i < NUM_FAMILIES; i++)
{
PersonGroup tempGroup = new PersonGroup("FAMILY");
g.groups.Add(tempGroup);
familyGroups.Add(tempGroup);
}
for (int i = 0; i < NUM_FRIEND_GROUPS + 1; i++)
{
PersonGroup tempGroup = new PersonGroup("FRIENDS");
g.groups.Add(tempGroup);
friendGroups.Add(tempGroup);
}
for (int i = 0; i < NUM_WORK_GROUPS; i++)
{
PersonGroup tempGroup = new PersonGroup("WORK");
g.groups.Add(tempGroup);
workGroups.Add(tempGroup);
}
for (int j = 0; j < NUM_PEOPLE; j++)
{
PersonGroup tempGroup = familyGroups[rng.Next(0, familyGroups.Count)];
g.Nodes[j].groups.Add(tempGroup);
tempGroup.members.Add(g.Nodes[j]);
familyPairs[(Person)g.Nodes[j]] = tempGroup;
tempGroup = friendGroups[rng.Next(0, friendGroups.Count)];
g.Nodes[j].groups.Add(tempGroup);
tempGroup.members.Add(g.Nodes[j]);
friendPairs[(Person)g.Nodes[j]] = (tempGroup, null);
tempGroup = friendGroups[rng.Next(0, friendGroups.Count)];
g.Nodes[j].groups.Add(tempGroup);
tempGroup.members.Add(g.Nodes[j]);
friendPairs[(Person)g.Nodes[j]] = (friendPairs[(Person)g.Nodes[j]].Item1, tempGroup);
tempGroup = workGroups[rng.Next(0, workGroups.Count)];
g.Nodes[j].groups.Add(tempGroup);
tempGroup.members.Add(g.Nodes[j]);
workPairs[(Person)g.Nodes[j]] = tempGroup;
}
foreach (Person currentPerson in g.Nodes.Cast <Person>())
{
// TODO: fix this bandaid solution and figure out why this happens
if (!familyPairs[currentPerson].statuses.Contains("Initialized") &&
familyPairs[currentPerson].members.Count > 1)
{
PersonGroup family = familyPairs[currentPerson];
Person t1 = (Person)family.members[0];
Person t2 = (Person)family.members[1];
for (int k = 0; k < family.members.Count; k++)
{
if (family.members[k].traits["Age"] > t1.traits["Age"])
{
t2 = t1;
t1 = (Person)family.members[k];
}
}
t1.statuses.Add("Parent");
t2.statuses.Add("Parent");
for (int k = 0; k < family.members.Count; k++)
{
if (!family.members[k].statuses.Contains("Parent"))
{
family.members[k].statuses.Add("Child");
}
}
family.statuses.Add("Initialized");
}
foreach (var person in familyPairs[currentPerson].members)
{
if (person != currentPerson && g.GetDirectedConnection(person, currentPerson) == null)
{
g.AddConnection(person, currentPerson, new PersonConnection("Family"));
}
}
for (int j = 0; j < rng.Next(2, 8); j++)
{
int iTemp = rng.Next(0, workPairs[currentPerson].members.Count);
if (g.Nodes[iTemp] != currentPerson && g.GetDirectedConnection(workPairs[currentPerson].members[iTemp], currentPerson) != null)
{
g.AddConnection(currentPerson, workPairs[currentPerson].members[iTemp], new PersonConnection("Work"));
}
}
foreach (var person in friendPairs[currentPerson].Item1.members)
{
if (Node.rng.Next(0, 3) == 0)
{
g.AddConnection(person, currentPerson, new PersonConnection("Friend"));
}
}
foreach (var person in friendPairs[currentPerson].Item2.members)
{
if (Node.rng.Next(0, 3) == 0)
{
g.AddConnection(person, currentPerson, new PersonConnection("Friend"));
}
}
for (int j = 0; j < rng.Next(2, 6); j++)
{
int iTemp = rng.Next(0, NUM_PEOPLE);
if (g.Nodes[iTemp] != currentPerson && g.GetDirectedConnection(g.Nodes[iTemp], currentPerson) != null)
{
g.AddConnection(currentPerson, g.Nodes[iTemp], new PersonConnection("Acquiantance"));
}
}
}
}
public override void NodeCreation(Graph g, NodeCreationInfo creationInfo = NodeCreationInfo.Empty)
{
int tempPopulation = traits["Population"];
List <Task <District> > districtCreationTasks = new List <Task <District> >();
for (int i = 0; i < DISTRICT_AMOUNT; i++)
{
if (i < 2)
{
tempPopulation /= 2;
}
else
{
tempPopulation = (traits["Population"] - 262500) / 13;
}
int n = rng.Next(traits["Density"] - 10, traits["Density"] + 11);
int temp2Population = tempPopulation;
districtCreationTasks.Add(
Task.Run(() => { return(new District(temp2Population, n)); }));
}
Task.WaitAll(districtCreationTasks.ToArray());
foreach (Task <District> dt in districtCreationTasks)
{
SubGraph.Add(dt.Result);
}
for (int i = 0; i < DISTRICT_AMOUNT - 1; i++)
{
g.AddConnection(g.Nodes[i], g.Nodes[i + 1], new DistrictConnection());
g.AddConnection(g.Nodes[i + 1], g.Nodes[i], new DistrictConnection());
}
g.AddConnection(g.Nodes[0], g.Nodes[16], new DistrictConnection());
g.AddConnection(g.Nodes[16], g.Nodes[0], new DistrictConnection());
foreach (var district in g.Nodes)
{
for (int i = 0; i < Node.rng.Next(0, 3); i++)
{
int temp = rng.Next(0, DISTRICT_AMOUNT);
if (district != g.Nodes[temp])
{
g.AddConnection(district, g.Nodes[temp], new DistrictConnection());
g.AddConnection(g.Nodes[temp], district, new DistrictConnection());
}
}
}
for (int i = 0; i < INFECTED_START_AMOUNT; i++)
{
District tmp = (District)SubGraph.Nodes[rng.Next(SubGraph.Nodes.Count)];
var tmp2 = from node in tmp.SubGraph.Nodes
where node.statuses.Contains("Healthy")
select node;
var tmp3 = tmp2.ToList();
Person tmp4 = (Person)tmp3[rng.Next(tmp3.Count)];
tmp4.statuses.Remove("Healthy");
tmp4.statuses.Add("Infected");
tmp4.traits.Add("Infected Time", 0);
tmp4.traits.Add("Medicinal Support", 100);
tmp4.traits.Add("Viral Intensity", rng.NextGaussian(100, 10));
}
}
