• Save
Data structure
Upcoming SlideShare
Loading in...5
×
 

Data structure

on

  • 199 views

 

Statistics

Views

Total Views
199
Views on SlideShare
199
Embed Views
0

Actions

Likes
0
Downloads
0
Comments
0

0 Embeds 0

No embeds

Accessibility

Categories

Upload Details

Uploaded via as Microsoft PowerPoint

Usage Rights

© All Rights Reserved

Report content

Flagged as inappropriate Flag as inappropriate
Flag as inappropriate

Select your reason for flagging this presentation as inappropriate.

Cancel
  • Full Name Full Name Comment goes here.
    Are you sure you want to
    Your message goes here
    Processing…
Post Comment
Edit your comment

Data structure Data structure Presentation Transcript

  • Topological Sort ?-it is ordering of vertices in a directed acyclic group .If its path vi to vj then vj appears after vi in the ordering Topological ordering is not possible if the graph has acyclic ?. E.g: v1 v2 v3 v4 v5 v6 v7
  • Algorithm for topologies : • Create an array of length equal to the number of vertices.• While the number of vertices is greater than 0, repeat:. :• Find a vertex with no incoming edges (“no prerequisites”). . • Put this vertex in the array. .•Note that this destructively updates a graph; often this is a bad idea, so make a copy of the graph first and do topological sort on the copy.
  • Topological Sort Algorithm The Topological sort algorithm is:int topologicalOrderTraversal( ){ int numVisitedVertices = 0; while(there are more vertices to be visited){ if(there is no vertex with in-degree 0) break; else{ select a vertex v that has in-degree 0; visit v; numVisitedVertices++; delete v and all its emanating edges; } } return numVisitedVertices;}
  • Just we take this example 4 solve topological graph Here a=0 because in degree is 4 ‘a’
  • Graph 1vertex A B C D E F G HA 0 1 1 0 1 0 0 0B 0 0 0 0 0 1 0 0C 0 0 0 1 0 1 1 0D 0 1 0 0 1 0 0 1E 0 0 0 0 0 1 0 0F 0 0 0 0 0 0 0 1G 0 0 0 0 1 0 0 1h 0 0 0 0 0 0 0 0Sum 0 2 1 1 3 3 1 3ofcolum
  • • Overview– Terms• Topics– Ethernet-Standard– Network topologies• Bus topology• Ring topology• Star topology• Fully connected topology• Mesh topology– IPv4 & IPv6
  • • Prototype of the Ethernet Standard• Characteristics:– A central cable (coaxial cable)– Lines to the attached stations– Decentralized structure (stations with equal standing)– All attached stations are affected by disturbance at the centralcable
  • RING Topology• One token "moves" in the circle (Ringstructure of the network)• If the token is "free", then the stationcan attach a network package RING TYPE