// experimental
// ====================================================================
// ====================================================================
// ====================================================================
private void readAndDrawBIGGraph(String file) {
// behövs inte än
// @TODO
// hur rita flera linjer mellan 2 noder? (för flera linjer)
// reading of the graph should be done in the graph itself
// it should be possible to get an iterator over nodes and one over edges
// read in all the stops and lines and draw the lmap
Scanner indata = null;
// insert into p-queue to get them sorted
names = new PriorityQueue<String>();
try {
// Read stops and put them in the node-table
// in order to give the user a list of possible stops
// assume input file is correct
indata = new Scanner(new File(file + "-stops.txt"), "ISO-8859"); //
while (indata.hasNext()) {
String hpl = indata.next().trim();
int xco = indata.nextInt();
int yco = indata.nextInt();
noderna.add(new BusStop(hpl, xco, yco));
names.add(hpl);
// Draw
// this is a fix: fixa att Kålltorp och Torp är samma hållplats
if (hpl.equals("Torp")) {
xco += 11;
hpl = " / Torp";
}
karta.drawString(hpl, xco, yco, DrawGraph.Layer.BASE);
}
indata.close();
// Read in the lines and add to the graph
indata = new Scanner(new File(file + "-lines.txt"), "ISO-8859");
grafen = new DirectedGraph<BusEdge>(noderna.noOfNodes());
Color color =
new Color((float) Math.random(), (float) Math.random(), (float) Math.random()); //
String lineNo = "1"; //
while (indata.hasNext()) { // assume lines are correct
int from = noderna.find(indata.next()).getNodeNo();
int to = noderna.find(indata.next()).getNodeNo();
grafen.addEdge(new BusEdge(from, to, indata.nextInt(), lineNo));
indata.nextLine(); // skip rest of line
// Draw
BusStop busFrom = noderna.find(from);
BusStop busTo = noderna.find(to);
karta.drawLine(
busFrom.xpos, busFrom.ypos, busTo.xpos, busTo.ypos, color, 2.0f, DrawGraph.Layer.BASE);
}
indata.close();
} catch (FileNotFoundException fnfe) {
throw new RuntimeException(" Indata till busshållplatserna saknas");
}
karta.repaint();
} // end readAndDrawBIGGraph
// ====================================================================
private void findShort() {
// svårt att behålla linjefärgerna?
int start, s**t;
try { // read from station
String str = from.getText();
str = Character.toUpperCase(str.charAt(0)) + str.substring(1);
start = noderna.find(str).getNodeNo();
} catch (NullPointerException npe) {
route.setText(felTextStart + "\n");
return;
}
try { // read to station
String str = to.getText();
str = Character.toUpperCase(str.charAt(0)) + str.substring(1);
s**t = noderna.find(str).getNodeNo();
} catch (NullPointerException npe) {
route.setText(felTextSlut + "\n");
return;
}
double totWeight = 0;
int totNodes = 0;
route.setText("");
karta.clearLayer(DrawGraph.Layer.OVERLAY);
Iterator<BusEdge> it = grafen.shortestPath(start, s**t);
while (it.hasNext()) {
BusEdge e = it.next();
route.append(makeText1(e) + "\n");
totNodes++;
totWeight += e.getWeight();
// draw the shortest path
BusStop from = noderna.find(e.from), to = noderna.find(e.to);
karta.drawLine(
from.xpos, from.ypos, to.xpos, to.ypos, Color.black, 4.0, DrawGraph.Layer.OVERLAY);
}
karta.repaint();
route.append("Antal: " + totNodes + " totalvikt: " + totWeight + "\n");
from.setText("");
to.setText("");
} // findShort
// ====================================================================
private void findMinSpan() {
route.setText("");
Iterator<BusEdge> it = grafen.minimumSpanningTree();
if (it != null && it.hasNext()) {
double totWeight = 0;
int totNodes = 0; // only for easier testing
karta.clearLayer(DrawGraph.Layer.OVERLAY);
while (it.hasNext()) {
BusEdge be = it.next();
totNodes++;
totWeight += be.getWeight();
route.append(makeText2(be) + "\n");
// draw the MST
BusStop from = noderna.find(be.from);
BusStop to = noderna.find(be.to);
karta.drawLine(
from.xpos, from.ypos, to.xpos, to.ypos, Color.red, 2.5, DrawGraph.Layer.OVERLAY);
}
karta.repaint();
route.append("Antal: " + totNodes + " totalvikt: " + totWeight + "\n");
} else from.setText("Det fanns ej någon lösning");
to.setText("");
from.setText("");
} // findMinSpan
/**
* The constructor creates the NodeTable and DirectedGraph taken the information from files
* lines-gbg.txt and stops-gbg.txt and makes itself visible.
*/
public ShortRoute(String file) {
// try to convert to UTF-8 across plattforms to make Swedish chars work
// System.out.println("charset = " + java.nio.charset.Charset.defaultCharset());
// MacRoman macintosh Windows-1252 ISO 8859-1 UTF-8
try {
// convert whatever this file is encoded in to UTF-8,
// kill the exception (can't happen)
introText =
new String(
introText.getBytes(java.nio.charset.Charset.defaultCharset().toString()), "UTF-8");
felTextStart =
new String(
felTextStart.getBytes(java.nio.charset.Charset.defaultCharset().toString()), "UTF-8");
felTextSlut =
new String(
felTextSlut.getBytes(java.nio.charset.Charset.defaultCharset().toString()), "UTF-8");
frome =
new String(frome.getBytes(java.nio.charset.Charset.defaultCharset().toString()), "UTF-8");
} catch (UnsupportedEncodingException e) {
System.exit(0);
}
// read the graph and draw it in a separate window
// creates the graph and fills the p-queue "names"
karta.setLocation(50, 250);
if (file == null) {
readAndDrawGraph();
} else {
readAndDrawBIGGraph(file);
}
System.out.println("Version with sorting fixed"); // debug
// now to the graphics in the Frame
// Left part
// select is a panel for structuring the left part
// i.e label, textfield for "from", label, textfield for "to"
JPanel select = new JPanel(new GridLayout(4, 1));
select.setBackground(Color.yellow);
select.add(new JLabel("Ange startpunkt !", JLabel.CENTER));
select.add(from);
select.add(new JLabel("Ange slutpunkt !", JLabel.CENTER));
select.add(to);
from.setBackground(Color.white);
from.setForeground(Color.blue);
to.setBackground(Color.white);
to.setForeground(Color.blue);
from.addActionListener(this);
to.addActionListener(this);
// Middle part
// route is the middle text area part where messages are displayed
// give the middle text area a scrollbar to the right
route = new JTextArea(introText, 12, 40);
route.setEditable(false);
JScrollPane routeScrollPane = new JScrollPane(route);
routeScrollPane.setHorizontalScrollBarPolicy(ScrollPaneConstants.HORIZONTAL_SCROLLBAR_NEVER);
route.setBackground(Color.white);
route.setForeground(Color.blue);
// Rigth part
JLabel head = new JLabel(" **** Alternativ ***** ");
head.setForeground(Color.red);
// add all stations to the right scrollpane
// tanken är att dom skall vara valbara men det fungerar inte än
// En JList vill ha en ListModel som parameter
// En ListModel är ett interface som implementeras av klassen AbstractListModel
// DefaultListModel ärver AbstractListModel
DefaultListModel<String> valList = new DefaultListModel<String>();
JList<String> alternativ = new JList<String>(valList);
alternativ.setBackground(Color.white);
alternativ.setForeground(Color.blue);
// add a scroll pane to the station list in alternativ
stationList = new JScrollPane(alternativ);
// read names from p-queue and load them into the list
while (!names.isEmpty()) valList.addElement(names.poll());
// panel for structure
JPanel valPanel = new JPanel(new BorderLayout());
valPanel.setBackground(Color.white);
valPanel.add(head, "North");
valPanel.add(stationList, "Center");
// put it all together in the frame
add(select, "West");
add(routeScrollPane, "Center");
add(valPanel, "East");
setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE);
pack();
setVisible(true);
} // end ShortRoute
// ====================================================================
// ====================================================================
private void readAndDrawGraph() {
// @TODO
// hur rita flera linjer mellan 2 noder? (för flera linjer)
// reading of the graph should be done in the graph itself
// it should be possible to get an iterator over nodes and one over edges
// read in all the stops and lines and draw the lmap
Scanner indata = null;
// insert into p-queue to get them sorted
names = new PriorityQueue<String>();
try {
// Read stops and put them in the node-table
// in order to give the user a list of possible stops
// assume input file is correct
indata = new Scanner(new File("stops.noBOM.txt"), "UTF-8");
while (indata.hasNext()) {
String hpl = indata.next().trim();
int xco = indata.nextInt();
int yco = indata.nextInt();
noderna.add(new BusStop(hpl, xco, yco));
names.add(hpl);
// Draw
/*
// Denna fix som slår ihop Kålltorp och Torp är förvirrande eftersom de är olika noder i grafen.
// Tror man att det är samma nod blir resultatet förrvirrande.
// Till nästa gång: Gör till samma nod med namnet Virginsgatan. Så är det i verkligheten nu.
// this is a fix: fixa att Kålltorp och Torp är samma hållplats
if ( hpl.equals("Torp") ) {
xco += 11;
hpl = " / Torp";
}
*/
karta.drawString(hpl, xco, yco, DrawGraph.Layer.BASE);
}
indata.close();
// Read in the lines and add to the graph
indata = new Scanner(new File("lines.noBOM.txt"), "UTF-8");
grafen = new DirectedGraph<BusEdge>(noderna.noOfNodes());
while (indata.hasNext()) {
String lineNo = indata.next();
int antal = indata.nextInt() - 1;
int from = noderna.find(indata.next()).getNodeNo();
// hur rita flera linjer mellan 2 noder?
// enkel inc fungerar inte
// färgen kunde vara "äkta" dvs linjefärg
Color color =
new Color((float) Math.random(), (float) Math.random(), (float) Math.random());
for (int i = 0; i < antal; i++) {
int to = noderna.find(indata.next()).getNodeNo();
grafen.addEdge(new BusEdge(from, to, indata.nextInt(), lineNo));
// Draw
BusStop busFrom = noderna.find(from);
BusStop busTo = noderna.find(to);
karta.drawLine(
busFrom.xpos,
busFrom.ypos,
busTo.xpos,
busTo.ypos,
color,
2.0f,
DrawGraph.Layer.BASE);
from = to;
}
}
indata.close();
} catch (FileNotFoundException fnfe) {
throw new RuntimeException(" Indata till busshållplatserna saknas");
}
karta.repaint();
} // end readAndDrawGraph