1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61
| public static Graph loadSingleFile(Path path)
{
Graph graph = new Graph();
BufferedReader bufferedReader;
try
{
bufferedReader = new BufferedReader(new FileReader(path.toFile()));
String line = null;
String[] vertices;
while ((line = bufferedReader.readLine()) != null)
{
vertices = line.split(" ");
if (vertices.length < 2)
{
continue;
}
graph.addEdge(Integer.parseInt(vertices[0]),Integer.parseInt(vertices[1]));
}
bufferedReader.close();
return graph;
static Graph loadMultipleFiles(Path[] paths, PropertyType propertyType)
{
Graph graph =
propertyType == PropertyType.DOUBLE ? new Graph<Double>(propertyType) : new Graph<Long>(propertyType);
for (Path path : paths)
{
BufferedReader bufferedReader;
try
{
bufferedReader = new BufferedReader(new FileReader(path.toFile()));
String line = null;
String[] vertices;
while ((line = bufferedReader.readLine()) != null)
{
vertices = line.split(" ");
if (vertices.length < 3)
{
continue;
}
switch (propertyType)
{
case DOUBLE:
graph.addEdge(Integer.parseInt(vertices[0]),Integer.parseInt(vertices[1]),
Double.parseDouble(vertices[2]));
break;
case LONG:
graph.addEdge(Integer.parseInt(vertices[0]),Integer.parseInt(vertices[1]),
Long.parseLong(vertices[2]));
break;
default:
break;
}
bufferedReader.close();
}
catch (IOException e)
{
e.printStackTrace();
}
}
return graph;
} |
Partager