From 3e9b5343f05ff12ac2c30e09a816164b23e48346 Mon Sep 17 00:00:00 2001 From: veniti Date: Mon, 9 Sep 2019 19:17:29 +0200 Subject: [PATCH] working on city roads IP --- Assets/Scripts/CityGenerator.cs | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/Assets/Scripts/CityGenerator.cs b/Assets/Scripts/CityGenerator.cs index ee444d5..047225e 100644 --- a/Assets/Scripts/CityGenerator.cs +++ b/Assets/Scripts/CityGenerator.cs @@ -26,7 +26,7 @@ namespace Assets.Scripts public int GetHashCode(Point obj) { - return obj.GetHashCode(); + return 0; } } @@ -66,7 +66,7 @@ namespace Assets.Scripts public void CreateRoadGraph(IList points) { - VoronoiGenerator generator = new VoronoiGenerator(sitesList.SelectMany(site => site.Vertices.Select(i => points[i]).Append(site.Point)).Distinct(new PointProximityComparer(4)).ToList()); + VoronoiGenerator generator = new VoronoiGenerator(sitesList.SelectMany(site => site.Vertices.Select(i => points[i]).Append(site.Point)).Distinct(new PointProximityComparer(2)).ToList()); generator.Generate(); roads = generator.Delaunay.Morph(s => s.Point, e => Point.Dist(generator.Delaunay.Vertices[e.Item1].Point, generator.Delaunay.Vertices[e.Item2].Point)); @@ -162,7 +162,7 @@ namespace Assets.Scripts //3.Repeat step#2 until there are (V-1) edges in the spanning tree. graph.Edges = graph.Edges.OrderBy(e => graph.GetEdgeData(e)); - graph._edgeData = graph._edgeData.OrderBy(e => e.Value).ToDictionary(e => e.Key, k => k.Value); + graph._edgeData = graph._edgeData.OrderByDescending(e => e.Value).ToDictionary(e => e.Key, k => k.Value); Graph spanningTree = new Graph(); spanningTree.Vertices = graph.Vertices; @@ -320,8 +320,8 @@ namespace Assets.Scripts if (debug.displayCityMainRoads) { - Gizmos.color = new Color(2.54f, 0.127f, 1.56f); - //Gizmos.color = Color.green; + //Gizmos.color = new Color(2.54f, 0.127f, 1.56f); + Gizmos.color = Color.green; foreach (var city in cities) { DisplayGraphEdges(city.mainRoad);