Question

In Java code, for a topological sort assignment:

How I load a .txt file and use its information to populate a hashtable that maps IDs to characters, and add the IDs as nodes in the graph.

Answer 1

Solution:-

/* I WRITE A CODE /*

public static void main(string[ ] args) throws I O Exception

{

String file Path= "test ,t x t";

hash Map<string ,String > map = new (Hash Map<String,String>( );

String line;

Buffered Reader reader = new Buffered Reader(new File Reader(file path));

while ((line = reader .read Line( ) ) !=NULL)

{

String[ ] parts = line .split(" : " ,2);

if ( parts. length >=2)

{

String Key = Parts[0];

String value = parts[1];

map.put(key , value);

} else{

System . out . print l n("ignoring line :" +line);

}

}

for( String Key :map .key Set ( ) )

{

System.out.print l n( key + ":" +map.get(key));

}

reader.close( );

}