import java.util.*; public class Program { public static void main(String[] args) { var network = new Network(10, 2, 3); for (var station: network.getStations()) { System.out.print(station.getID()); System.out.print(" > "); for (var path: station.getPaths()) { System.out.print(path.station.getID()); System.out.print(" ("); if (path.weight < 10) { System.out.print(" "); } System.out.print(path.weight); System.out.print(") "); } System.out.println(); } System.out.println(); } } class Network { Station[] stations; public Station[] getStations() { return this.stations; } public Network(int stations, int minPaths, int maxPaths) { this.stations = new Station[stations]; for (var i = 0; i < stations; i++) { this.stations[i] = new Station((char)((int)'A' + i)); } this.generateRelations(minPaths, maxPaths); } private void generateRelations(int minPaths, int maxPaths) { var length = this.stations.length; ArrayList[] relations = new ArrayList[length]; ArrayList[] available = new ArrayList[length]; var notReady = new ArrayList(length); var notIntegrated = new ArrayList(length); for (var i = 0; i < length; i++) { notReady.add(i); notIntegrated.add(i); relations[i] = new ArrayList(); available[i] = new ArrayList(); for (var j = 0; j < length; j++) { if (i != j) { available[i].add(j); } } } var network = this; var relator = new Relator() { public void addPath(int a, int b, int weight) { relations[a].add(b); network.stations[a].addPath(network.stations[b], weight); if (relations[a].size() == 3) { for (var i = 0; i < length; i++) { available[i].removeIf(x -> x == a); } } else { available[a].removeIf(x -> x == b); if (relations[a].size() == 2) { notReady.removeIf(x -> x == a); } } } }; var random = new Random(); do { var listA = notIntegrated.size() > 0 ? notIntegrated : notReady; var a = listA.get(random.nextInt(listA.size())); var listB = available[a]; if (listA == notIntegrated && listA.size() < length) { listB = new ArrayList(listB); listB.removeIf(x -> listA.contains(x)); } var b = listB.get(random.nextInt(listB.size())); if (listA == notIntegrated) { listA.removeIf(x -> x == a); listA.removeIf(x -> x == b); } var weight = 1 + random.nextInt(10); relator.addPath(a, b, weight); relator.addPath(b, a, weight); } while (notReady.size() > 0); } } abstract class Relator { public void addPath(int a, int b, int weight) { } } class Station { private ArrayList paths = new ArrayList(); char id; public char getID() { return this.id; } public Station(char id) { this.id = id; } public List getPaths() { return this.paths; } public void addPath(Station other, int weight) { this.paths.add(new Edge(other, weight)); } } class Edge { Station station; int weight; public Edge(Station station, int weight) { this.station = station; this.weight = weight; } public Station getStation() { return this.station; } public int getWeight() { return this.weight; } }

Bus Network - Java