Top page of CDROM

Catalogue of educational CDs from Prof. Parthasarathy

Links will work, only from the CDROM


Graph theory -- using Metanet/Scilab

(Learn Metanet/Scilab using graph theory)

Version details
 
   algo-logo   
  Credibility   
  Competence   
  Commitment   
Misc.
An important social message

Why is Linux good for me ?

Teach yourself graph theory

Teach yourself graph theory. Experiment with and explore graph theory, using Metanet. The Metanet toolbox for graph theory, is included with Scilab. Scilab itself is included with this CDROM, along with a whole lot of documentation. You also get some good e-books on graph theory, in this CDROM. This CDROM is organised as a series of exercises on Graph theory. For each exercise, you will get :

  1. The problem statement
  2. The Metanet/Scilab code for solving the problem
  3. The solution
  4. Annotations and commentaries
The exercises are also grouped together in convenient groups, according to their focus. You can reach each exercise, by just clicking on the title of the exercise.

Vous parlez français ? Nous aussi....
 

Teach yourself graph theory

Teach yourself Metanet/Scilab

Warning, alert : The graph terminology used in this tutorial is, at times, different from those used by Scilab/Metanet (e.g. arc, edges of a graph). The terminology used in this tutorial is very precisely defined in the terminology pages. For the terminology used by Scilab/Metanet, you will have to refer to the Scilab/Metanet documentation.

Graph operations | Graph properties | Trees | Paths
 

A -- Graph operations

  1. Create a undirected graph G , with v vertices and e edges
  2. Create a directed graph G , with v vertices and e edges
  3. Add a vertex x, to G. Add edges to x
  4. Add an edge to G between two given vertices x and y
  5. Remove a vertex of G. Detect and remove all edges incident on that vertex
  6. Remove an edge from G
Back to top  

B -- Graph properties

  1. Is G connected ? How many components does G have ?
  2. Are there any isolated nodes in G ? What are they ?
  3. Compute the incidence matrix of G
  4. Compute the adjacency matrix of G
  5. Is G a planar graph ?
  6. Is G a complete graph ?
  7. Is G a regular graph ?
Back to top  

C -- Trees

  1. Compute all the spanning trees of G -- use a depth-first-search
  2. Compute all the spanning trees of G -- use a breadth-first-search
  3. Is G a tree ?
Back to top  

D -- Paths

  1. Is G an Euler graph ?
  2. Compute all Euler paths in G
  3. Compute all Euler circuits in G
  4. Compute all hamiltonian paths in G
  5. Compute all Hamiltonian circuits in G
  6. Given vertices x and y of G. Is there a pateh from x to y ?
  7. How many paths are there from x to y ?
  8. Compute all paths from x to y
  9. Compute the length of each path
  10. Model the Koeningsburg Bridges (KBP) problem, and answer the above questions about Koenigsburg bridges
  11. Would deleting any bridges, solve teh KBP ? Which ones ?
  12. Would adding any bridges, solve the KBP ? Where should they be added (between which landmassess) ?
Back to top

  
Get in touch .....
Street address:
Algologic Research & Solutions©
78 Sancharpuri Colony
Bowenpally P.O.
Secunderabad 500 011 -- INDIA
Maps, and driving instructions.

For secure (encrypted) communications, please use our PGP Public key.
e mail: drpartha@gmail.com
Phone (from overseas / from India ): + 91 - 40 - 2775 1650 / (040) 2775 1650
Our home on the w-w-web: http://algolog.tripod.com/index.htm
 
Vous parlez français ? Nous aussi ....
 
Bonjour. Pour de plus amples renseignements sur nos services et nos tarifs, il vous suffira de nous envoyer un courrier électronique (en français).
N'hésitez pas à nous préciser vos besoins et vos attentes (en français).

Nous esperons vous lire bientôt.


  
no-gimmicks